{"$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":"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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXR1","name":"Runtime accessibility","shortDescription":{"text":"Runtime accessibility"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"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":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"rightAnglePath (cyclomatic 193): rightAnglePath has cyclomatic complexity 193 (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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee575053a42d268e7d1ee19cd38e57ead0c3c9bb4210ae76b1e1db7bbccc3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"breakText (cyclomatic 64): breakText has cyclomatic complexity 64 (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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4478bebeede1811cf0b945aaa766e652e15ca40a91865b852bb2d0c24b09bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::text (cyclomatic 55): (anonymous)::text 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b743849212ea226072ff07786665896697daf6fbd1c27a93cbe510b6fc825251"}},{"ruleId":"D1","level":"warning","message":{"text":"getConnectedLinks (cyclomatic 53): getConnectedLinks has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 9 of the 53 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 928, a function literal at line 948, addOutbounds, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e7b4e2b69e6e1c2bdafb615a3239125163280c023a0023e50d4ee5cda906b"}},{"ruleId":"D1","level":"warning","message":{"text":"number (cyclomatic 50): number has cyclomatic complexity 50 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e18149c5fda878e8abe15b6a09565ae908bfdc0750e9348ea098d82caa79fb4"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngleRouter (cyclomatic 47): rightAngleRouter has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"287ba3fe0a42a76609b9d31600fa1a07c5da3eb9307dc5eab1d1eaa883afc819"}},{"ruleId":"D1","level":"warning","message":{"text":"set (cyclomatic 41): set has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Collection.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a284024c137aa6c437cf449c00ec8adc98c6abd2e41099365988d57534824"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-projection.graphProjection (cyclomatic 36): graph-projection.graphProjection has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 80, 139). 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":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efc9a41561c39b17c9eaff48a62bd1205cc586d385462b4a12760d4235d8a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom.$.event.remove (cyclomatic 35): Dom.$.event.remove has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e08a0f675f13f8cfdbacdabeb27db2d3b16ad61ca2dfb27908cf88f10203787"}},{"ruleId":"D1","level":"warning","message":{"text":"intersection.exists (cyclomatic 33): intersection.exists has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f683197410ff9193f8ed745ddb4a959c9ce6b693320eac6c4e14af050ad35c5"}},{"ruleId":"D1","level":"warning","message":{"text":"processNodeAttributes (cyclomatic 33): processNodeAttributes has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7149f764668c2c7d4b7a5c52d20162058a2022ab73bc15d95847041fc96ffea"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.compareAscending (cyclomatic 32): utilHelpers.compareAscending has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c14fb63eea552d2e96d722c8b4d38e9cc4059be9b14fe9c005ddf4cba6e707d"}},{"ruleId":"D1","level":"warning","message":{"text":"import.importNode (cyclomatic 32): import.importNode has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 300). 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":"packages/joint-layout-elk/src/import.mts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a8322dc5183458aee40d25572cf0281eeb99dcd293ef27f07a810c51b5466a"}},{"ruleId":"D1","level":"warning","message":{"text":"manhattan.findRoute (cyclomatic 31): manhattan.findRoute 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":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89a2ad8f3e1d6be2ac8e34d8a4d1fb327c49da8da4de93357e0207447e52b25"}},{"ruleId":"D1","level":"warning","message":{"text":"getNeighbors (cyclomatic 31): getNeighbors has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 1001). 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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9ae847d1f396ea6c5eb982ad9024889406536d081fd468d19116d2ec953be4"}},{"ruleId":"D1","level":"warning","message":{"text":"onHandleChanging (cyclomatic 30): onHandleChanging has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/linkTools/Segments.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbad58b26024341679e79521a1691e08301cedb8467df1f47795d4f75963944"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.baseClone (cyclomatic 29): utilHelpers.baseClone has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"59adad32b264f919202ae2a66d1072a017dd1863d1a01e32451988686c4e4cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngle.resolveDirection (cyclomatic 28): rightAngle.resolveDirection has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5675dcb4ded961d3d7362416c2cde362322fd019cc59b6190ac0e9380a2bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"points.convexHull (cyclomatic 27): points.convexHull has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/points.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd870c4c83735b484679befab49bc9c503fbeb6b045415b58eab89844b826694"}},{"ruleId":"D1","level":"warning","message":{"text":"use-cells.useCells (cyclomatic 27): use-cells.useCells has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 375, 325, 361, \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":"packages/joint-react/src/hooks/use-cells.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299f9edaddbea06512d96a513d3cb713a9d48c078883f33054a17e3d061a225"}},{"ruleId":"D1","level":"warning","message":{"text":"use-create-features.useCreateFeature (cyclomatic 27): use-create-features.useCreateFeature has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 340, a function literal at line 395, a function literal at line 270, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-create-features.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"87efadb1eb2628b6b57e6804350009e901a85a6dfcf1c7ae11bf94dbe0b40d35"}},{"ruleId":"D1","level":"warning","message":{"text":"debounce (cyclomatic 27): debounce has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 12 function items inside it that branch (shouldInvoke, debounced, trailingEdge, \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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"113e04ab763119f0ae01b131718ba096c0d9aa218ad4e0da1a1bf23d61455cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::toGeometryShape (cyclomatic 25): (anonymous)::toGeometryShape has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f7c6e7663e2ae20c1313e8e07b80d2ca7fe26d0065515d9b744b63735bc61c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseTransformString (cyclomatic 25): (anonymous)::parseTransformString has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a433316adf1ad504ecb2f10ffb4c9077dde19ba88a87e119885fb42ec8fda1e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom.$.event.add (cyclomatic 24): Dom.$.event.add has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"47da59249c294daf4bd6935ea4ad5a3bc542a202b510a44df3499998f79f1df2"}},{"ruleId":"D1","level":"warning","message":{"text":"path.Path (cyclomatic 24): path.Path has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c2057d317df48583a7d71659f209daf7f0c27098d690b7fe6191c1558bc441"}},{"ruleId":"D1","level":"warning","message":{"text":"sanitizeGraph.sanitizePorts (cyclomatic 24): sanitizeGraph.sanitizePorts has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 5 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (getGroupProperty, getTargets, removeMergedLabelMarkup, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"555967bf4183ffef27d33170b5d59bd62ce7ec1f0536b4956873121cb3a4e0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"_snapArrowhead (cyclomatic 24): _snapArrowhead has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd6101dc8c6ac1c46277cfca110048a3fe84536adad4548ec555a85d808c8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"updateRelativeAttributes (cyclomatic 24): updateRelativeAttributes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"8743a7dcb99e01df2e498eb7309e863539dd2a1f8b0ba8abf496456c7ee16887"}},{"ruleId":"D1","level":"warning","message":{"text":"updateDOMSubtreeAttributes (cyclomatic 24): updateDOMSubtreeAttributes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d4f96bfcf230d44ac1617fdeed48697741bea1aa716aa8d8b409cfe5852fe0"}},{"ruleId":"D1","level":"warning","message":{"text":"_createPortElement (cyclomatic 24): _createPortElement has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/ports.mjs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cb9454028264c5da7937136d0fb854a588525c6e5ebf40d8c968ba168aaf40"}},{"ruleId":"D1","level":"warning","message":{"text":"index.boundaryIntersection (cyclomatic 23): index.boundaryIntersection has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectionPoints/index.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307da56180d81e9b8abcd59a0f2ed7ee760fe0f544a7266a36022cd79545ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"util.normalizeWheel (cyclomatic 22): util.normalizeWheel has cyclomatic complexity 22 (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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b34a79effd609909b5350334bb951e874af42b3cf213bfc7d948642cfb8e34"}},{"ruleId":"D1","level":"warning","message":{"text":"index.getMiddleSide (cyclomatic 22): index.getMiddleSide has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d9b0745f0d5a21bcf63b5d01af7917e2061defb2746dc324520dd0cc9e7f61"}},{"ruleId":"D1","level":"warning","message":{"text":"use-create-portal-paper.useCreatePortalPaper (cyclomatic 22): use-create-portal-paper.useCreatePortalPaper has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 382, 223, 369, \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":"packages/joint-react/src/hooks/use-create-portal-paper.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06b9816fed53a9897fed3dc5f14d9591f1c73e67f9a6d043da4cd296afded2"}},{"ruleId":"D1","level":"warning","message":{"text":"code-controlled-mode-peerjs.Main (cyclomatic 22): code-controlled-mode-peerjs.Main has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 404, a function literal at line 391, a function literal at line 341, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3886ef36079e8a89f4cd4652b1c1c0d249b804b9376816bc27b3db871cd8e234"}},{"ruleId":"D1","level":"warning","message":{"text":"updateViewsAsync (cyclomatic 22): updateViewsAsync has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ea916256d9c459393b40ee81c0f024a9437d21e9e0f80e662cb51428dcb501"}},{"ruleId":"D1","level":"warning","message":{"text":"getFitToContentArea (cyclomatic 22): getFitToContentArea 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87c4dd311c0feda17b6ac88d6e5a44ad5afe9fdb5f91d92a4c213937338226d"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.equalObjects (cyclomatic 21): utilHelpers.equalObjects has cyclomatic complexity 21 (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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"05548356e17169caacfa496b0852fef7af1fce6160f67019d60f47fefb5c7ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngle.resolveForTopSourceSide (cyclomatic 21): rightAngle.resolveForTopSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForBottomSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1e48314eae63c3917ff8e405928e600be1a50281b5507ddc2423235e2b88ff"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngle.resolveForBottomSourceSide (cyclomatic 21): rightAngle.resolveForBottomSourceSide 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. This shape REPEATS in the file: one other method here (rightAngle.resolveForTopSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e834d9f6c11afdee0b52c8efa5b2dd39cda847c0618694941ebfb9bfe600624"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::(anonymous)::pathToAbsolute (cyclomatic 21): (anonymous)::(anonymous)::pathToAbsolute has cyclomatic complexity 21 (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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a8904249d52fb93e718be178b237b5b98f9fb665a2f91fe5dad259b98a553f"}},{"ruleId":"D1","level":"warning","message":{"text":"updateViewsBatch (cyclomatic 20): updateViewsBatch 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22e20e1310f1b0dc4b0d4574682e5430c4cf7d00a5fff2665a82d68aec0f5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::(anonymous)::a2c (cyclomatic 20): (anonymous)::(anonymous)::a2c 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2810ad19cb7f1773ef73b1a234d08959fab10d7013525c2b52433cb45febb"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.baseIsEqualDeep (cyclomatic 19): utilHelpers.baseIsEqualDeep has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540b283393d57677b0661137dc2a56ee0bf3173ff8b6f0a8e2b6aa2a57e2326"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngle.resolveForLeftSourceSide (cyclomatic 19): rightAngle.resolveForLeftSourceSide has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (rightAngle.resolveForRightSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a293665c05ba3d5bfc081bfab7fc8d09cf20ab18ed9535d96a22c0bc7e34157"}},{"ruleId":"D1","level":"warning","message":{"text":"rightAngle.resolveForRightSourceSide (cyclomatic 19): rightAngle.resolveForRightSourceSide has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (rightAngle.resolveForLeftSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"308b3e6b772269573c27797d98331012e34c8a2df3a93584b45f9c9f8c4b49bf"}},{"ruleId":"D1","level":"warning","message":{"text":"pointerdown (cyclomatic 19): pointerdown has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"077fad514974a3c2fe438998763b4e924770f20065b1b90563dba7938a089127"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::annotateTextLine (cyclomatic 19): (anonymous)::annotateTextLine has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb590b0462ddc853193041e3923907854c49ee85a95fd08346e7b500113976a4"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::annotateString (cyclomatic 19): (anonymous)::annotateString has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ba302b12de3102ffb9ab59161f31e4f7d85bb6f5032df18dba3c5a57bda4a"}},{"ruleId":"D1","level":"warning","message":{"text":"confirmUpdate (cyclomatic 19): confirmUpdate has cyclomatic complexity 19 (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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b58807617ebc2a05dc26a2836281abf15cc5f8dcbe55d7a8a2ad436ec3da50d"}},{"ruleId":"D1","level":"warning","message":{"text":"divideAtLength (cyclomatic 19): divideAtLength has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5032750cdaec45a59b7a67420e0276e617623cd4b3bb692cbfe9e96aabc13183"}},{"ruleId":"D1","level":"warning","message":{"text":"closestPointT (cyclomatic 19): closestPointT has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a768fc1b957b66c3a293db8437a0550c54225a58a9871c64c8942f8b7001b291"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.equalArrays (cyclomatic 18): utilHelpers.equalArrays 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c704d36bd9661690275be2962d27ae1be5ef9ded98d86e42d43edae0fd16fb"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.equalByTag (cyclomatic 18): utilHelpers.equalByTag has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcebc5314e5a6e5ce63732477dfa10c5754baf47f85c1a0d163fbbb3d677642f"}},{"ruleId":"D1","level":"warning","message":{"text":"util.parseDOMJSON::parseNode (cyclomatic 18): util.parseDOMJSON::parseNode 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a285524fe766ee65c7e834eedbaedd40ebe63d3d52e4467a4164c1f9dbd51499"}},{"ruleId":"D1","level":"warning","message":{"text":"Events.offApi (cyclomatic 18): Events.offApi 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":"packages/joint-core/src/mvc/Events.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee334f9a0c2c10070fb25944f72417b78cb3f4a0940361ba9e36ddf129ad24a8"}},{"ruleId":"D1","level":"warning","message":{"text":"jumpover.jumpover (cyclomatic 18): jumpover.jumpover has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/jumpover.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee90856b76bbb2ffd4d912651058a459627c38c831af5e50f1d3fbed04679020"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduleViewUpdate (cyclomatic 18): scheduleViewUpdate has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1c5dbc0d33433a2cbed1a41d672e6d6c3cefa4164a839e0b909f1be00edd4"}},{"ruleId":"D1","level":"warning","message":{"text":"transformToFitContent (cyclomatic 18): transformToFitContent 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c9fa85a8cd01a05b305b665d5330665cb359a9c28d050ff8f75258c4519393"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::(anonymous)::normalize::processPath (cyclomatic 18): (anonymous)::(anonymous)::normalize::processPath 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"477b62a8b13318181d30ba12550b14a300b2788096e6c2a047247c619cf4cbed"}},{"ruleId":"D1","level":"warning","message":{"text":"tAtLength (cyclomatic 18): tAtLength 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaddba657daca1554a2f34dc1676ee1c2353a0a68966a208428c7838707ed42"}},{"ruleId":"D1","level":"warning","message":{"text":"set (cyclomatic 18): set 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":"packages/joint-core/src/mvc/Model.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60fa5ed413873e5a95a348a6ae4eee00e5536425cc08ceb8064e596291acfcd"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.baseMergeDeep (cyclomatic 17): utilHelpers.baseMergeDeep 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. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfad0195041fcff89fd0f2a82b3b29e63cc0d854abf2f55c4374248a85eb89db"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.sortedIndex (cyclomatic 17): utilHelpers.sortedIndex has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3858e421e525d228f021402deaa85cc12e35e6cbb5ae4c5d51fa4ce7f3e749"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.uniq (cyclomatic 17): utilHelpers.uniq has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef3a10813474c36fa19a0c62e9f4792028357a6cd4085f8b044662e062b9b59"}},{"ruleId":"D1","level":"warning","message":{"text":"path.Moveto (cyclomatic 17): path.Moveto 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"9679f39e1afc9b814696b750b8e74f791c9b178f8ce332eaa06faf82b036a42c"}},{"ruleId":"D1","level":"warning","message":{"text":"curve.curve (cyclomatic 17): curve.curve has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc9e1cc8c40285ea2d239336ed1ee35f9c1c05bad100ce3ec2e3875b49c185"}},{"ruleId":"D1","level":"warning","message":{"text":"processEmbedding (cyclomatic 17): processEmbedding has cyclomatic complexity 17 (threshold 15). Of this number, 15 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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"de422af4de21bb9c17bceef20a54e1461ff326d009e79f179cdb1dc4c2b65039"}},{"ruleId":"D1","level":"warning","message":{"text":"set (cyclomatic 17): set has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/attributes/text.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56a98bfcb3678564e6af06716e78853fac57b0c305517cafaeb50d374820445"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.arrayLikeKeys (cyclomatic 16): utilHelpers.arrayLikeKeys has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f4e7889d1762e3f357dd1e960581821eeb8e64011f8381b056fa3a7d84e371"}},{"ruleId":"D1","level":"warning","message":{"text":"utilHelpers.intersect (cyclomatic 16): utilHelpers.intersect has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: utilHelpers.initCloneByTag (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02616f42ae400f68c47b5a7d52f1a1d30281cc5a3102f6b3b808c62e6ac11df"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom.$.event.dispatch (cyclomatic 16): Dom.$.event.dispatch 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2832ae5edf6e0bdb726d6f6b6aa735cc9410173937b2d2c5d91898d64b2670e4"}},{"ruleId":"D1","level":"warning","message":{"text":"methods.position (cyclomatic 16): methods.position has cyclomatic complexity 16 (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":"packages/joint-core/src/mvc/Dom/methods.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e3d95ac42afc031efe238790bc45a37cde9f3d3902fc6bd8c09a4fba29967b"}},{"ruleId":"D1","level":"warning","message":{"text":"orthogonal.orthogonal (cyclomatic 16): orthogonal.orthogonal 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":"packages/joint-core/src/routers/orthogonal.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6347d743f6a37c2f499d20cd7c48d9f115d57f70f6b7cb3cb647e553971aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"dev-warnings.warnUnstableSelector (cyclomatic 16): dev-warnings.warnUnstableSelector has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/utils/dev-warnings.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6444cb4c3088d8d034edd390e467d21711bdf14cc0dbdee871d785fe0743b78"}},{"ruleId":"D1","level":"warning","message":{"text":"sanitizeGraph.sanitizeNodeAttribute (cyclomatic 16): sanitizeGraph.sanitizeNodeAttribute has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a726ce627118d8961cdbb498146df37402823583f1d1cd5a84ecddce63a804"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::findIntersection (cyclomatic 16): (anonymous)::findIntersection 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1134115de3f7466fc732b012cea05d66253affc754a0dae4883899bc0ca2b1"}},{"ruleId":"D1","level":"warning","message":{"text":"_getLabelTransformationMatrix (cyclomatic 16): _getLabelTransformationMatrix 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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e278833d3313eb056b11b81136c9945151b0123bee9e1ee3ca0aed14093ca5b"}},{"ruleId":"D1","level":"warning","message":{"text":"replaceSegment (cyclomatic 16): replaceSegment 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"01243e4d37d29593d95280b198ec6944e79a9aee898ddaab5aa561fb367a181a"}},{"ruleId":"D1","level":"warning","message":{"text":"getSubgraph (cyclomatic 16): getSubgraph has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1168, 1148, 1121, \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9af2f94eeb8cc28685f0a1a1f9110d563016bad5441e240b707f2b92fe72241"}},{"ruleId":"D1","level":"warning","message":{"text":"resize (cyclomatic 16): resize 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":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e315287ae0eca15bb86d446980a40686df2f619781cc35a5a1d1f7598190515"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAnglePath (cognitive 296): rightAnglePath has cognitive complexity 296 (threshold 15). Drivers by points: if/else 92 (200 pts), boolean chains 92, other 2, ternaries 2 (nesting depth added 108). 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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb44e73d1d938e8749b596d7c0414805160a2221a7771ba0a31b7812070a40e"}},{"ruleId":"D2","level":"warning","message":{"text":"breakText (cognitive 162): breakText has cognitive complexity 162 (threshold 15). Drivers by points: if/else 40 (115 pts), ternaries 7 (21 pts), boolean chains 19, loops 3 (7 pts) (nesting depth added 93). 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e72a6ca2c7ba2cd4fa4ea43fd77eb691819c50d4a814be37453e0b580a4a92"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::text (cognitive 110): (anonymous)::text has cognitive complexity 110 (threshold 15). Drivers by points: if/else 38 (81 pts), boolean chains 15, ternaries 3 (6 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 51). 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7e6f5a0eb249aad5cc5c8170379e81ef963122d468a313dda2f8bf489c8f48"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveDirection (cognitive 80): resolveDirection has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 16 (56 pts), if/else 14 (24 pts) (nesting depth added 50). 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf6aaa20a0765a5a45d0c3a539b43a6f1f2fee30f114c5c28cbc42bd403f24"}},{"ruleId":"D2","level":"warning","message":{"text":"manhattan.findRoute (cognitive 76): manhattan.findRoute has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 4 (11 pts), boolean chains 8, ternaries 1 (4 pts) (nesting depth added 41). 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":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6073d396af0bc4294d933d6ad531067302ebc024e42c2818bc42f8e1389e611e"}},{"ruleId":"D2","level":"warning","message":{"text":"processNodeAttributes (cognitive 76): processNodeAttributes has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (56 pts), boolean chains 12, loops 4 (8 pts) (nesting depth added 40). 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ebddea3dfdbd3c80ca9ed9fb0b04e893f16e19bb4cdee33b31b99a86d3abd4"}},{"ruleId":"D2","level":"warning","message":{"text":"getConnectedLinks (cognitive 73): getConnectedLinks has cognitive complexity 73 (threshold 15). Drivers by points: if/else 32 (59 pts), boolean chains 14 (nesting depth added 27). Most of this is not in the body itself: 8 of the 73 points are its own statements and the rest belongs to 10 function items inside it that branch (addOutbounds, addInbounds, a function literal at line 861, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62fb76f19818fc00557b0fd970b6b030e56490177338f8659fc3af278438854"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAngleRouter (cognitive 65): rightAngleRouter has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 23, ternaries 5 (9 pts), other 3, 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acd46da03a3476f9ffe12bf8dfa59fc37d2dcd0b48c6aecbcae33dd6340e439"}},{"ruleId":"D2","level":"warning","message":{"text":"set (cognitive 62): set has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 9, ternaries 5 (9 pts), loops 3 (5 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":"packages/joint-core/src/mvc/Collection.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c4747e557429dc8a5eb2672f19b49ac13fa442b1c71a2476aa7dfba62f314"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-projection.graphProjection (cognitive 60): graph-projection.graphProjection has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 6 (13 pts), boolean chains 6, ternaries 3, match/switch 1 (2 pts) (nesting depth added 29). Most of this is not in the body itself: 3 of the 60 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 80, 139). 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":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7cf636d299d3f1a18d25e918df735b3aa341131be8dcc3f4cccebe766a9eee"}},{"ruleId":"D2","level":"warning","message":{"text":"remove (cognitive 52): remove has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 16, loops 3 (6 pts), ternaries 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"023a9dd3a9f2057a8054597a2e87905abbdbdc1805fc606fbcd81679bb883c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"updateViewsBatch (cognitive 49): updateViewsBatch has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (42 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"41acae9c93245d9ab3b176af8f174779a71b0c81b0c8fd19af382b4d7b098731"}},{"ruleId":"D2","level":"warning","message":{"text":"onHandleChanging (cognitive 49): onHandleChanging has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (37 pts), ternaries 3 (7 pts), boolean chains 5 (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":"packages/joint-core/src/linkTools/Segments.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f9e4697b5a2285cc17100aae7fb26d3b99f2a9a17df565c98cf37a12ec9769"}},{"ruleId":"D2","level":"warning","message":{"text":"path.Path (cognitive 47): path.Path has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cad5e6092d53891dab2642492b8c17763107dc03eba05c8ea51aa3f3acfbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"updateDOMSubtreeAttributes (cognitive 45): updateDOMSubtreeAttributes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf94a4687efc3e290e233de5f30ac3c89c7286ad0305b92a4b5585b74608fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"baseClone (cognitive 44): baseClone has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (21 pts), ternaries 8 (17 pts), boolean chains 6 (nesting depth added 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7edbdbe36a51844b34280fa1405b7a0983654a5541830de3b004323bdba0aea"}},{"ruleId":"D2","level":"warning","message":{"text":"points.convexHull (cognitive 43): points.convexHull has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 6 (7 pts), boolean chains 3 (nesting depth added 14). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/points.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9356c33a9b1366ab9b251441924f9d3d71206b49c7d1fd37bf1ef13246eff38e"}},{"ruleId":"D2","level":"warning","message":{"text":"number (cognitive 43): number has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 15, ternaries 9, loops 1, match/switch 1 (nesting depth added 3). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b092717938b9bf4c7388b7aeb931e907e5d5ada2fa1f8a927acd86155500ba73"}},{"ruleId":"D2","level":"warning","message":{"text":"_createPortElement (cognitive 41): _createPortElement has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (30 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/ports.mjs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d39c33c258a3d076128378147c7f3cad91b3226b550592eb60305c726a48621"}},{"ruleId":"D2","level":"warning","message":{"text":"util.parseDOMJSON::parseNode (cognitive 40): util.parseDOMJSON::parseNode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"515889cbbf728e3e5dddc4c833426946763d1bcd30d181ed63dd5116fcf9479e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseTransformString (cognitive 38): (anonymous)::parseTransformString has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 9, ternaries 7 (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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6762eae33e020f511c2eafa16f13e7433062e1480aecc52fe20709aa3086ca"}},{"ruleId":"D2","level":"warning","message":{"text":"getNeighbors (cognitive 38): getNeighbors has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 14 (nesting depth added 12). Of this number, 16 points are the body\u0027s own statements and 22 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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a1288da708f9edf5436208c0a3eb6c63570f540cf1bd88266f13d16a0efdf"}},{"ruleId":"D2","level":"warning","message":{"text":"path.Moveto (cognitive 37): path.Moveto has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 3 (7 pts), boolean chains 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"d090da68dbedfaf2c8ee7150b243a975ba8aac70ab1a00ce8995f014014fc15b"}},{"ruleId":"D2","level":"warning","message":{"text":"updateViewsAsync (cognitive 37): updateViewsAsync has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8 (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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da779ee2f81054d3d791d67c7958318beffaf5ecac8bfeebc6bb5e8021d47be"}},{"ruleId":"D2","level":"warning","message":{"text":"pointerdown (cognitive 37): pointerdown has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 18). 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3da5798e3559985dea725db90046096df153841c298be192c1a9bc97d27ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"import.importNode (cognitive 36): import.importNode has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 24, if/else 5 (8 pts), ternaries 2 (4 pts) (nesting depth added 5). Most of this is not in the body itself: 14 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 300). 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":"packages/joint-layout-elk/src/import.mts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c171db637bb251a425f70bddf28d37f681a54f2561f6e0f361207d1f5663f266"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::(anonymous)::pathToAbsolute (cognitive 35): (anonymous)::(anonymous)::pathToAbsolute has cognitive complexity 35 (threshold 15). Drivers by points: loops 4 (12 pts), ternaries 2 (10 pts), if/else 4 (5 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35f1c5e4d710befefcfc6dc35d27afe2650078e365f466b16100b12a66a424f"}},{"ruleId":"D2","level":"warning","message":{"text":"add (cognitive 35): add has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 13). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd217b564941f2c83cdcb9dd2f46e70d54c76749ab45321d74d8c0eab5776ba"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::annotateTextLine (cognitive 34): (anonymous)::annotateTextLine has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60054b4638586f1d123dbb32c17b3feb5428b65a2360c17243b80c3161bbff9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::(anonymous)::a2c (cognitive 34): (anonymous)::(anonymous)::a2c has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 5 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bc54cf0811d94f89b5302e1d78af41b73196f466ad8338340e056320327c63"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::annotateString (cognitive 33): (anonymous)::annotateString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"e458480d550975f5e77eeadf6eb654e03a8b432cd6ba5ee6604910b31593573f"}},{"ruleId":"D2","level":"warning","message":{"text":"uniq (cognitive 32): uniq has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 5 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74d31e609fd31e3f5b8e837f3b84b2c43d3d8ae4bd0361175308a864480ed12"}},{"ruleId":"D2","level":"warning","message":{"text":"intersect (cognitive 31): intersect has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 3 (9 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 16). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee0d6ef4586b11aaf6d4184586403b5d6a5af1b7feddead7ce8b229aab0a33"}},{"ruleId":"D2","level":"warning","message":{"text":"Dom.$.event.handlers (cognitive 30): Dom.$.event.handlers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0e7f7a761596fe1ea7d7bc97c19865a82b2e16b4b936663712619408177486"}},{"ruleId":"D2","level":"warning","message":{"text":"orthogonal.orthogonal (cognitive 30): orthogonal.orthogonal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 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":"packages/joint-core/src/routers/orthogonal.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1385df8a96c6e259d82e6a10ebad7d7100ebdeafa72eac2ba504e3d792ea5f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.boundaryIntersection (cognitive 30): index.boundaryIntersection has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 3, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectionPoints/index.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ac514b4d4d6ba7ef2b258f1aa43de4eb2edd47130fea11c84031e06df01214"}},{"ruleId":"D2","level":"warning","message":{"text":"updateRelativeAttributes (cognitive 30): updateRelativeAttributes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4819e8cac84fed7b10835d128b1c34c3ac2f8acc5988f9a5d19c28172e72c01a"}},{"ruleId":"D2","level":"warning","message":{"text":"tAtLength (cognitive 30): tAtLength has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 7 (11 pts), loops 2, 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"286d3b1cb9cd186c53010173e5181f4b6ab693895a7f17fa840d89842b986897"}},{"ruleId":"D2","level":"warning","message":{"text":"_snapArrowhead (cognitive 29): _snapArrowhead has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 10, ternaries 3 (nesting depth added 5). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ea21dc33d5a8bd4a88a3f7661e4e12932d30b426bdb410dd9a1a779c0247aa"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getBBox (cognitive 28): (anonymous)::getBBox has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 1 (2 pts), loops 1 (2 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36315183cabd9d94b15fb0c0d68a76507afda9c834b1ca09a7c1c8495350a72"}},{"ruleId":"D2","level":"warning","message":{"text":"closestPointT (cognitive 28): closestPointT has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 4 (7 pts), boolean chains 5, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b5d79369f67a5a1b42f049dee06a5c41e7ddf0db3ce60889aff4fe12572ba"}},{"ruleId":"D2","level":"warning","message":{"text":"prop (cognitive 28): prop has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (8 pts), boolean chains 4, loops 2 (4 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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6411fed23ed9670fa2ccbd13f8c2f6493918676ca857cdc799a273f71e34a7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"offApi (cognitive 28): offApi has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts), boolean chains 4, ternaries 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":"packages/joint-core/src/mvc/Events.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da872f246fc13c967fac43391750eea44beb821d824a101345004d13614a32a"}},{"ruleId":"D2","level":"warning","message":{"text":"divideAtLength (cognitive 27): divideAtLength has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (10 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fd769dd660a0ab229bbb529c5fa6001fde80482548120ad0b94e222027ee9b"}},{"ruleId":"D2","level":"warning","message":{"text":"baseIsMatch (cognitive 27): baseIsMatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (7 pts), boolean chains 3, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4cf2b5d4c11f7cab5f01e98f1cc05380a072234afc8a2db9d49fa1de382f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"set (cognitive 27): set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/attributes/text.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ff5683af5c377c297812436f92ad3854c3aa9f5b29815903362c9e9c689413"}},{"ruleId":"D2","level":"warning","message":{"text":"use-create-features.useCreateFeature (cognitive 26): use-create-features.useCreateFeature has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 340, a function literal at line 270, a function literal at line 395, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-create-features.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7dbf063ffc8ba6274615a50717923f2d8eb495237aecf7263bae78ec1fffb3"}},{"ruleId":"D2","level":"warning","message":{"text":"code-controlled-mode-peerjs.Main (cognitive 26): code-controlled-mode-peerjs.Main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 404, a function literal at line 391, handleCopyId, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eb79f0afc51ee71f405e1975d6b9202dbdea264b575fecff6e472af36dd8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"debounce (cognitive 26): debounce has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 5 (7 pts), boolean chains 6 (nesting depth added 4). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 12 function items inside it that branch (debounced, shouldInvoke, trailingEdge, \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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"469a7eea76b66ac1c1a9cd90080d1f0095bbdd386583714d5b3606268968dcac"}},{"ruleId":"D2","level":"warning","message":{"text":"findNodesAttributes (cognitive 26): findNodesAttributes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eed1cb899fa5ff68efdde5ebe54f03594e3ea732e1f5918d04b59736499033"}},{"ruleId":"D2","level":"warning","message":{"text":"curve (cognitive 26): curve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af7c4a3830438756349927bd8dd98e2f50773c0336fd1e0f0db0fba25b4e58e"}},{"ruleId":"D2","level":"warning","message":{"text":"set (cognitive 26): set has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Model.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ec76af0c6b9980b6bea38034a9ac42ff3fbdf80a42a28463ab2662fa38cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Dom.$.event.dispatch (cognitive 25): Dom.$.event.dispatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9022f6a7e1b8d0765ac08b4da0b6cc1c5e42de82e84e972f8768f1d4c30938"}},{"ruleId":"D2","level":"warning","message":{"text":"index.getMiddleSide (cognitive 25): index.getMiddleSide has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 12). 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3bb6d011fdaf251f092bdc4dd6dc5cbcc5e644f97b752fcab6db08c5f3d2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"equalObjects (cognitive 25): equalObjects has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e647b5ef7945c9ad232a181605d95d1ed69670a540efb6dbb8a9f44f390382f8"}},{"ruleId":"D2","level":"warning","message":{"text":"equalArrays (cognitive 25): equalArrays has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 9). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc796a551cd42975396fb9a7e3c80365f015ccb5c6209c5e353d9b69c2a72e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"bboxWrapper (cognitive 25): bboxWrapper has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 97). 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e43c09cc2383ddaf27e0e68fbaa9d578b74263d86ac0ee521cb12a7bacfbf"}},{"ruleId":"D2","level":"warning","message":{"text":"path.Curveto (cognitive 24): path.Curveto has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"571dd7d0a788d9b239ce77cad300064feb42afbe4ec8e3c881add42843bf5a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"use-cells.useCells (cognitive 24): use-cells.useCells has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 4, loops 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 375, 325, 361, \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":"packages/joint-react/src/hooks/use-cells.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76b3068308da07531e5e72557e0d74b82da419aba7c27af655b75915d08e09"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitizeGraph.sanitizeNodeAttribute (cognitive 24): sanitizeGraph.sanitizeNodeAttribute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf5275221ff6f49fbf05d425da5530343abc542145b6b0cba5e702a8d92044"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeWheel (cognitive 24): normalizeWheel has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 4 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f4d4d84667cc6836e8d5b4e882f3ddb348ed8b5da27db5e7372671bc0bd0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"utilHelpers.baseMergeDeep (cognitive 23): utilHelpers.baseMergeDeep has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32dd523d903e98e39745fc8f137ef33995b090592634a2466876f5e10361d15"}},{"ruleId":"D2","level":"warning","message":{"text":"path.Lineto (cognitive 23): path.Lineto has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de4604ce3d85f218afdf05f61da00ff9ee06b1b1dbf973e371d3683980441e3"}},{"ruleId":"D2","level":"warning","message":{"text":"props.attr (cognitive 23): props.attr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/props.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e2b98ddf8d0fbcc123b7256fe34c1486f0d893ea5d822c25a77c34594b47f3"}},{"ruleId":"D2","level":"warning","message":{"text":"curve.createCatmullRomCurves (cognitive 23): curve.createCatmullRomCurves has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a798c68deee237fbe9f5a546a17fae66da4e9dc77fdd10584b2cd00ca88c73f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.bboxWrapper.\u003Creturned closure\u003E (cognitive 23): index.bboxWrapper.\u003Creturned closure\u003E has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, ternaries 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b85a201258ab19de0f02e223c50b04b032191189f119664acb33e24419ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.build (cognitive 23): parser.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (23 pts) (nesting depth added 7). Of this number, 17 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":"packages/joint-decorators/src/parser.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"206727ca34b5a26a3367be10e2efb730acbc860499b344d856181714d4c2e9df"}},{"ruleId":"D2","level":"warning","message":{"text":"cell-record-merge.mergeCellRecord (cognitive 23): cell-record-merge.mergeCellRecord has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/state/data-mapping/cell-record-merge.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"107c53d8677429451e372b199828e85748e5964b56f8e0d1165b858c39fe137a"}},{"ruleId":"D2","level":"warning","message":{"text":"use-create-portal-paper.useCreatePortalPaper (cognitive 23): use-create-portal-paper.useCreatePortalPaper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 223, 382, 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":"packages/joint-react/src/hooks/use-create-portal-paper.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c423767542fb52d9abcd7505827a094ba99346d47fc6f7233002686e6d354a"}},{"ruleId":"D2","level":"warning","message":{"text":"confirmUpdate (cognitive 23): confirmUpdate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"820097097737b881b6074907580b609a99fc64474f5d23826e219cd39a8a7cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"manhattan.router (cognitive 22): manhattan.router has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 1 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c452c518abe31c98ff07ad69c2234e960a29fa5372ef41aea90abb2e930e558"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAngle.resolveForTopSourceSide (cognitive 22): rightAngle.resolveForTopSourceSide has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rightAngle.resolveForBottomSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05e4782b5365267bd01e4828e75d5daf7c20b53fe0ca24d5a85cb0747f89816"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAngle.resolveForBottomSourceSide (cognitive 22): rightAngle.resolveForBottomSourceSide has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (rightAngle.resolveForTopSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3440bda516d03875d1550900841b68e7091fb4ada98101ca0ea357d8e20c9be"}},{"ruleId":"D2","level":"warning","message":{"text":"_getLabelTransformationMatrix (cognitive 22): _getLabelTransformationMatrix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0927301af47d4f05c6c0ca3b4b1af63869a8c33429544327748f15aaad7bf83"}},{"ruleId":"D2","level":"warning","message":{"text":"replaceSegment (cognitive 22): replaceSegment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff188126b4b5f1dc46be0e0c7958a65fc44851802c92895dd6954e5b40b7609"}},{"ruleId":"D2","level":"warning","message":{"text":"bbox (cognitive 22): bbox has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd3a8d544d2fb5716d8aa14dd686725294b884acf2103aa3697eb147561e67"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.applyLinkLayout (cognitive 21): utils.applyLinkLayout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (21 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-msagl/src/utils.mts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"982583d1f8114beb0782b18a43aff351bafd492ed34be20e43667d9b5266a8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitizeGraph.sanitizePorts (cognitive 21): sanitizeGraph.sanitizePorts has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 6. Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (getGroupProperty, getTargets, removeMergedLabelMarkup, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd5952e75c959073956e94631d5189f05e81a694a7ab0f0a1ba971266858046"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduleViewUpdate (cognitive 21): scheduleViewUpdate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53303d8fbe478ccea559f5456eab932a5f5ea99c231159760e509556f1b18a5"}},{"ruleId":"D2","level":"warning","message":{"text":"getFitToContentArea (cognitive 21): getFitToContentArea has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 17, if/else 3, ternaries 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"190b8db0a6c951a036700d86142137f74380720d7628ff98d7218401b2a1edee"}},{"ruleId":"D2","level":"warning","message":{"text":"pointAtLength (cognitive 21): pointAtLength has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (9 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39383a152204370b3add45b1087f4b31e160c8f484d85c181da168a2616f6a4"}},{"ruleId":"D2","level":"warning","message":{"text":"baseIsEqualDeep (cognitive 21): baseIsEqualDeep has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 8, if/else 3 (nesting depth added 3). 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"25229ef50c993cc850f0e555d6df8ca073c4610a1337c01f3c144672637a7cde"}},{"ruleId":"D2","level":"warning","message":{"text":"compareAscending (cognitive 21): compareAscending has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 16, if/else 3 (5 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ad1cbcb288ec46f50721f0c33c4e0f543ee8d413fe5b9e10ee86291d65c15"}},{"ruleId":"D2","level":"warning","message":{"text":"containsPoint (cognitive 21): containsPoint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed05fde14c640370033b4be091d0556ca4fb1b62ed9131aff81271ebea7df1a"}},{"ruleId":"D2","level":"warning","message":{"text":"intersectionWithLine (cognitive 21): intersectionWithLine has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (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":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"286d63221e79229d3ecc77ec58d8de3122e92d7b86bb6805f9774a263857eed8"}},{"ruleId":"D2","level":"warning","message":{"text":"jumpover.buildPath (cognitive 20): jumpover.buildPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 235). 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":"packages/joint-core/src/connectors/jumpover.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb585f5dc85b6ef6af7421102d5e44f8dedaaa2d287895d312f31a0457f73aa"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::toGeometryShape (cognitive 20): (anonymous)::toGeometryShape has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 2 (4 pts), match/switch 1 (nesting depth added 2). 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd71878045a063a8e37d475553a24e9604e03118c41890b5866f97277488825"}},{"ruleId":"D2","level":"warning","message":{"text":"confirmUpdate (cognitive 20): confirmUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc5c3f0a7a1723afd74d9b7fc29e58e97af3e01725cc30611f5db750ae29a72"}},{"ruleId":"D2","level":"warning","message":{"text":"tangentAtLength (cognitive 20): tangentAtLength has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71ee517ff4afc1edc91c4fc78e3d7b08121db7f824ca1d4940fad9df6614103"}},{"ruleId":"D2","level":"warning","message":{"text":"processEmbedding (cognitive 20): processEmbedding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"522572404c038cd280c6d021d334fba94f87caff1ffd3ce16993926d49aa604a"}},{"ruleId":"D2","level":"warning","message":{"text":"jumpover.jumpover (cognitive 19): jumpover.jumpover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 420, 372, 401, \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":"packages/joint-core/src/connectors/jumpover.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e3fc194df54dfe2a425f61527222d895d6d5aa1238813dfc8f064548e65ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"set (cognitive 19): set has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (8 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad12a4d8e3ba96935d6e30daebb542c98caf2441741362eb1229b4d4de2d4cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"checkMouseleave (cognitive 19): checkMouseleave has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c568b547000319868ccdf82a9722e054d35efb43af33a31f1bd26bedb84ed"}},{"ruleId":"D2","level":"warning","message":{"text":"getSubdivisions (cognitive 19): getSubdivisions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75d67e11f71edbeeb4f7f73ff2848535d23462d7e8729566716ef1da37da748"}},{"ruleId":"D2","level":"warning","message":{"text":"toGraphLib (cognitive 19): toGraphLib has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-directed-graph/DirectedGraph.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3736a396fa04c524201dfa1314e100f8bf14eaa809ab0fcbd181a55e98102ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight (cognitive 19): highlight has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 6 (8 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 40, 37, 38). 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":"packages/joint-core/src/highlighters/list.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a35049b6f291d9f51388ffb968951d9f38e60668d3c5f5891c7a1597d9e25e"}},{"ruleId":"D2","level":"warning","message":{"text":"animations.animateNode (cognitive 18): animations.animateNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 29, 66, 82). 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":"packages/joint-core/src/mvc/Dom/animations.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46387bf57db4b61adfc06ef5e37b313dc58c5406a27b4da6fc6e562bcf6d3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAngle.resolveForLeftSourceSide (cognitive 18): rightAngle.resolveForLeftSourceSide has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (rightAngle.resolveForRightSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897ba07399a9398b96c6825c9fe39f07f9298103a4bbc2bd048abcdd96a9a38"}},{"ruleId":"D2","level":"warning","message":{"text":"rightAngle.resolveForRightSourceSide (cognitive 18): rightAngle.resolveForRightSourceSide has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (rightAngle.resolveForLeftSourceSide) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b20e2a964ab42849e1041cab35e2182403474942f15fe46b30c5479f4f8c24e"}},{"ruleId":"D2","level":"warning","message":{"text":"diff (cognitive 18): diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"696e12aa1329179e4cc6c17e404faee03a9f6b7d35080804be6aad2a22c5176d"}},{"ruleId":"D2","level":"warning","message":{"text":"getSubgraph (cognitive 18): getSubgraph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 1121, 1134, 1148, \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d2a9fb0596feeb71659a92c6c9a98850b8a81d7f70ddee9472512bbeb1f6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveSides (cognitive 18): resolveSides has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, ternaries 4 (8 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"165bdc84361b45f2a24bf4743706ffdd3835987c86753a0eeed41c3178d65931"}},{"ruleId":"D2","level":"warning","message":{"text":"position (cognitive 18): position has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"41da2cf417937b87bb65b410e2fef981f93f5af590aacf6aa09b862fc54aeb94"}},{"ruleId":"D2","level":"warning","message":{"text":"resize (cognitive 18): resize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), ternaries 1 (3 pts), boolean chains 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":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4fd3767076266d137dba7ca23fc1cb4f21c72c1d3cf0865e281a29636b9c24"}},{"ruleId":"D2","level":"warning","message":{"text":"tangentAtLength (cognitive 18): tangentAtLength has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (8 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"06427c7f6df2aedcc98de7d7841b16f0c735c295a999bbd072d5821d0c78a2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"utilHelpers.sortedIndex (cognitive 17): utilHelpers.sortedIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9531e8bf4f96a092dcfa539dfffb0ff0df9136e5102fc46b8bd99bd0d34f10e9"}},{"ruleId":"D2","level":"warning","message":{"text":"util.flattenObject (cognitive 17): util.flattenObject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"508e11388f734de90efdd30fdac65776d81ec00367e5eed6388040d65db4ad66"}},{"ruleId":"D2","level":"warning","message":{"text":"straight.straight (cognitive 17): straight.straight has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/straight.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadc9580b05b28ca152491dbe20defd6637d6fc462ef71946ccf062916f4cf71"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-projection.graphProjection.updateGraph (cognitive 17): graph-projection.graphProjection.updateGraph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d8eb464367760be15e8556bc0ec60ef0e62767a2890cbb58d7ba56c5fd9cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"defineMarker (cognitive 17): defineMarker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc34f05311639ca86afaaca9ebd9846d383f20e7f6c7b062a19810a6750f6b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::V (cognitive 17): (anonymous)::V has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9b102ddfc64e8d8aa173f8e7a0d4f08622c2705dc6cd1e51920f4c059a8bea"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::findIntersection (cognitive 17): (anonymous)::findIntersection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ec47338aecda490ec1646e306fa05d1404859ec78c71300de338f9137a2567"}},{"ruleId":"D2","level":"warning","message":{"text":"getAnchor (cognitive 17): getAnchor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2a7a1cb73a966877a5eeb06bf1604fcdb6668fcca748156212fc43ec0e1dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"syncCells (cognitive 17): syncCells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ae5f854b22e4dcd21671a6a66117084c9637acfc6aa7fb4ffb8c95c89cf9c"}},{"ruleId":"D2","level":"warning","message":{"text":"isSafeAttribute (cognitive 17): isSafeAttribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/security.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe7e1700ecf6c763709665bb7a1b9a9622f3dddf0c091466808c6993ff98f91"}},{"ruleId":"D2","level":"warning","message":{"text":"mount (cognitive 17): mount has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/HighlighterView.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc64ea1d2c729c692b19346a692e048a5570bbb2ffd9454d3e9f8ae0b943a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"evalCalcExpression (cognitive 17): evalCalcExpression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/calc.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4e407ddc45b82e8b52fcafd139b2c1e6e7158e33151fb30db16c2caf741bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dom.$.event.on (cognitive 16): Dom.$.event.on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e8afca807874850d8351f1b663e80632cd8797e8f20637e3f27bcff0b875cf"}},{"ruleId":"D2","level":"warning","message":{"text":"export.buildElkNode (cognitive 16): export.buildElkNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/export.mts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d39f123d7d8359d700fa7e089e31c592ba3778789f3be9fa078161faa8dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"dev-warnings.warnUnstableSelector (cognitive 16): dev-warnings.warnUnstableSelector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/utils/dev-warnings.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adb81f2cae31a84dec4c6087de03b20e2bd7c34229e7f7c75ba72db0540c996"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveHighlighter (cognitive 16): resolveHighlighter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a357c70d1ef4c22d77aaa1440b87426424ea21aaeb23bf7e9de8c40bfc1bb182"}},{"ruleId":"D2","level":"warning","message":{"text":"drawBackgroundImage (cognitive 16): drawBackgroundImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72626dacf74160b82a6b164e7392b597dd0f2fd53a00d69996825b4b5366659"}},{"ruleId":"D2","level":"warning","message":{"text":"insertSegment (cognitive 16): insertSegment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ba623c26d35831c7edaa41bd479fb9eb39cdbd93066f8c726542c28457dc33"}},{"ruleId":"D2","level":"warning","message":{"text":"compareMultiple (cognitive 16): compareMultiple has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"7582b492fc4e80eb96e71834b32e7aadc5de3d2056b160cc9356fd09f9e80680"}},{"ruleId":"D2","level":"warning","message":{"text":"translate (cognitive 16): translate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3532bf8e5e57df6d4ada583ffd501e38176adc381745fa4d7f10a803dc94b8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"reparent (cognitive 16): reparent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda6e28e368fe2f99b6c0373bf3c85d6a8c7b9a1c8b46a8aebddf43b5f9772ce"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 16): get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/HighlighterView.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"53775fe364a8e6afc8a9b476ab16ab97a2f8b5fcd7478a4c24ec9d623c1f1084"}},{"ruleId":"D2","level":"warning","message":{"text":"_resolveDrawGridOption (cognitive 16): _resolveDrawGridOption has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/GridLayerView.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf95804d647a2b832fe5f8870581c3d8e491bc83de5b73be2b27c5cbc6ab630c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rightAnglePath.rightAnglePath: FunctionTooLong \u2014 rightAnglePath runs 503 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 403 over it, 5.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d52b249690faf4bc5d0c3a4c9c9ee1eef33e6a81f8a38e887d0b4b9296a5d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dia/Paper.mjs: FileTooLong \u2014 2394 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 894 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf216e6757c8de81ce3ecf808bdc490919c28d8d73e67c9e73f7714ae4c08b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/utilHelpers.mjs: FileTooLong \u2014 1589 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1089 over it, 3.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05ca838f2aa35b98b8a81f8ca5d36b60f4aa759cb71db5550b33b715efcc13f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-create-portal-paper.useCreatePortalPaper: FunctionTooLong \u2014 useCreatePortalPaper runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-create-portal-paper.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc87e95399e41c3913d4ca3aac1b1126fef24cd381dd54228fdb8fb5e9e899ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: g/path.mjs: FileTooLong \u2014 1153 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 653 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09021aad82ea6ccf1e2dd29bfb4d56e1b86b5a353a2d4f242f600569bdf04dff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/util.mjs: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 520 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be96cc58b164d111fd6d5683ce0ecb0d4ff44d9b1872a8c310b117b4e382d588"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: measurement.createMeasurement: FunctionTooLong \u2014 createMeasurement runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/store/measurement.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"91060ea27953d4a174311e64963364f13e73fa216176c60dc641c6aef73d65a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: alg/rightAnglePath.mjs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 61% of them inside a single declaration: rightAnglePath (583-1416). The bar is 500 significant lines; this is 321 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4fb24b34a927f561fd40f55721f2a36fef5df66be354c50212305e83e92572"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: paper-events.addPaperEventListeners: FunctionTooLong \u2014 addPaperEventListeners runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"packages/joint-react/src/presets/paper-events.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eadd23b812841b91b6225462fe3c042d2778296bccab825c85b5522f4df4a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code-controlled-mode-peerjs.Main: FunctionTooLong \u2014 Main runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae9f1ec600dfe78cf2534bdb16332327ecd427f0acd386a262465b3c91f5f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rightAngle.rightAngleRouter: FunctionTooLong \u2014 rightAngleRouter runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d467b783db62ae1ec35143a144eed431e4af2f3c381e24977c30e89b19c3f7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: rightAnglePath: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 103 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2368d841a57cf44679a1335e54caae0e72e98461a3ef3f84109fc7d356e3ac0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dia/ports.mjs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\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":"packages/joint-core/src/dia/ports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40db7e56646a2fcfa90057f1d3fc80fdd5965367780798567a9ede6501da5da2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RouterService: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630e4262ac9d9f3d5d454d573124e29f436f2a9ed6980ddbcbbd356c42cca99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: use-cells.useCells: FunctionTooLong \u2014 useCells runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-cells.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"18caaff55aa4adfe4e94212d43d6ee026e7613d7b60f322f6cc8fc559488c0aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dia/Cell.mjs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3881943357d16f1121055da42e69c439e26dbce1456c2730fbde32d1463db9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaperView (LCOM4 4): PaperView\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/mvc/paper.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"481d3b06dcfbec3fd324c58229d31f2764ca6d388a6605497a81fc595d176a0f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: needs a replacement, since the mocked one never calls back: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-mock-svg/test/jest/src/customizations.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f330e98d2f5334f047ca3b00c0d72d6ba66b2bbf6a4652da6e52d1fc5fc09c54"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-cli/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e4031c0197f10fc4f5497a83574b704cbbcc3778ac77ff176f4c8236b05e42"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: core-js: core-js 3.8.3, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022core-js@\u003C3.23.3 is no longer maintained and not recommended for usage due to the number of issues. Because of the V8 engine whims, feature detection in old core-js versions could cause a slowdown up to 100x even if nothing is polyfilled. Some versions have web compatibility issues. Please, upgrade your dependencies to the actual version of core-js.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59ee24e1182bacd9b232d83160472e5974c48176cadd7ac17417191e7a3a1bc"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dd7d06cb1bd5b196802c770f2cc4a11c5773a58adf05d0d9a04f4b670ad961"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: rollup-plugin-commonjs: rollup-plugin-commonjs 10.1.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022This package has been deprecated and is no longer maintained. Please use @rollup/plugin-commonjs.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8928d96018cac2925d13cd40002017730ab34ce319540728f111353f24c797b0"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: rollup-plugin-json: rollup-plugin-json 4.0.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022This module has been deprecated and is no longer maintained. Please use @rollup/plugin-json.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6667f819e23539fa0c28236e20eb16b48bd56e5f33c643a0524381da85713a"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: rollup-plugin-node-resolve: rollup-plugin-node-resolve 5.2.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022This package has been deprecated and is no longer maintained. Please use @rollup/plugin-node-resolve.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"64730b55ac7d9d71d2484e7f5255c03dcffab650f68cb2482819c2edd75cd7d4"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: sinon: sinon 7.2.2, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u002216.1.1\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"700c6046684a9fc3276f0bfd7b260d0364ec19a06e8acf80ea43c102faaa388b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: time-grunt: time-grunt 2.0.0, declared in packages/joint-core/package.json, is marked deprecated by its publisher: \u0022Deprecated because Grunt is practically unmaintained. Move on to something better. This package will continue to work with Grunt v1, but it will not receive any updates.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b243ac7f48b0ae028df5b78c4ec22daa8f4b62f8062a4c9ba2c86f6b6926c2"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-decorators/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-decorators/package.json"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"075406f3f296415df384bc7b3c7c67b2ca9bddee025ae9107592a957798e5559"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-eslint-config/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-eslint-config/package.json"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0169a4ccd5c130bb469e50a36a5bfdfd45e5fd7b2811a276ad67ac8e9972b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-layout-directed-graph/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-directed-graph/package.json"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"483ea6f2d1e5e005b9423554fb9125e2f47b52a453e8b2c1bd16cabdaf1b5d7b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-layout-elk/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/package.json"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ace2d303b9adbbc3a4625087a7f364a6fd9852ede7dae221c17c5baae286296"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-layout-msagl/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-msagl/package.json"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"04952c22558d2c078983f140587cf755627cce8d33c3ecdd03e848769a42c88e"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-mock-svg/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-mock-svg/package.json"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab537e3caa1f8fe822a06b8a63d85d9b66a5c16f35239c0285a609544b06e5b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-react/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/package.json"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95b10d0a37d08dec2b41a5830593696fa12a814e3aed96e734fb8f26141a98"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-router-avoid/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/package.json"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea3cfb8cbe2c42440ad8f17290e9acabb96c4654894d8d11e226d13c18dbb4b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-sanitize/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/package.json"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0060f8e8f39b938b21e4fbcefb1a99f313edb963f8da4e530a4bac6cd4052d7d"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-shapes-general-tools/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general-tools/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8959f0a86c23acf1ed2ae1eb0a59a6db7cad38241ed2c64241c3e2116d91db2e"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-shapes-general/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general/package.json"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ae0dbd6829a2c537dd1220ecda38b25db8a6f189386ee50ca323a461edf30b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 9.39.2, declared in packages/joint-vitest-plugin-mock-svg/package.json, is marked deprecated by its publisher: \u0022This version is no longer supported. Please see https://eslint.org/version-support for other options.\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-vitest-plugin-mock-svg/package.json"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb43479166b40309d3b393bf6c13bcc9191bde692586c5ab956fc439b41fcb9"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @sinonjs/text-encoding: @sinonjs/text-encoding 0.7.3 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Deprecated: no longer maintained and no longer used by Sinon packages. See https://github.com/sinonjs/nise/issues/243 for replacement details.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":8761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a3585865f938b9057e1b54f400ca29a90ea9f433ff5861046f1bec51a6929c"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @ungap/structured-clone: @ungap/structured-clone 1.3.0 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Potential CWE-502 - Update to 1.3.1 or higher\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":10231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0342206d94757661fff0372024607551e19e48dfec77799ca3edc4de1de7da"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: core-js: core-js 3.6.1 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022core-js@\u003C3.23.3 is no longer maintained and not recommended for usage due to the number of issues. Because of the V8 engine whims, feature detection in old core-js versions could cause a slowdown up to 100x even if nothing is polyfilled. Some versions have web compatibility issues. Please, upgrade your dependencies to the actual version of core-js.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":12711}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb22358f970464bdaea589c2682eacb8d78fcf4f25f1503a92a1761902785971"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 10.5.0 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting [e-mail redacted]\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":15390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebcbe5cfec9965c6fbf9529785e9791032568451cf64dd1c1c01dd611643944"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.1.7 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting [e-mail redacted]\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":15431}}}],"partialFingerprints":{"codehealthFindingId/v1":"31beac7282a29dcabcca981a76386e2a3e3bc8c0c313cf0de57a17da22e5d150"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: inflight: inflight 1.0.6 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":16176}}}],"partialFingerprints":{"codehealthFindingId/v1":"55be9905a34a12b9511076231a068531da3ac6b41453399bbd9f2029c07dc756"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: prebuild-install: prebuild-install 7.1.3 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022No longer maintained. Please contact the author of the relevant native addon; alternatives are available.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":20569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bac525eb3df86ea17abc18dd625f6f6e75bd726b3012f5f8076612d2cb9e7a"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: rimraf: rimraf 3.0.2 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Rimraf versions prior to v4 are no longer supported\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":21529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eee92188ebd48360d1f320b3f5bc255da846526549cda5081de851ea4cbe73"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: sourcemap-codec: sourcemap-codec 1.4.8 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Please use @jridgewell/sourcemap-codec instead\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":22720}}}],"partialFingerprints":{"codehealthFindingId/v1":"385503975d481de15a077dd4a742958d7328a9340c98126609784cb1f4cd14d3"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: uuid: uuid 8.3.2 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022uuid@10 and below is no longer supported. For ESM codebases, update to uuid@latest. For CommonJS codebases, use uuid@11 (but be aware this version will likely be deprecated in 2028).\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":24258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c74464e841fe625856850f14ed2ca8294e5bf5896adcdd3d2f7186fbd329a02"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: whatwg-encoding: whatwg-encoding 3.1.1 is resolved in yarn.lock and is marked deprecated by its publisher: \u0022Use @exodus/bytes instead for a more spec-conformant and faster implementation\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"yarn.lock"},"region":{"startLine":24819}}}],"partialFingerprints":{"codehealthFindingId/v1":"af53de653a0bb0be8ffdc0a977fb9371aa6cc6deacd91c571f062076c05fb927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/joint-core/src/routers/rightAngle.mjs: packages/joint-core/src/routers/rightAngle.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rightAngle.rightAngleRouter at line 459. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 14:50:22 \u002B01:00\u0027 --until=\u00272026-11-09 14:50:22 \u002B01:00\u0027 --full-history --no-merges -- packages/joint-core/src/routers/rightAngle.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09eb9e09ade3abfc044f88418f431b072068d66f2697132d85ac7fa4c73800b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/joint-react/src/store/graph-projection.ts: packages/joint-react/src/store/graph-projection.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in graph-projection.graphProjection at line 54. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 14:50:22 \u002B01:00\u0027 --until=\u00272026-11-09 14:50:22 \u002B01:00\u0027 --full-history --no-merges -- packages/joint-react/src/store/graph-projection.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f43374f9726919a471d4ab2d85202cf65f1039cbd3ec19762868e645a91bac6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/joint-react/src/hooks/use-create-portal-paper.tsx: packages/joint-react/src/hooks/use-create-portal-paper.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in use-create-portal-paper.useCreatePortalPaper at line 186. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 14:50:22 \u002B01:00\u0027 --until=\u00272026-11-09 14:50:22 \u002B01:00\u0027 --full-history --no-merges -- packages/joint-react/src/hooks/use-create-portal-paper.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-create-portal-paper.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6dd8c30a32b983ee1730fe19556acda3d22d8f1d0eeac8395374d0b7e603ae"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 17 significant file(s) lose their only recent owner: packages/joint-router-avoid/src/RouterService.mts, packages/joint-layout-elk/src/types/elkLayoutOptions.mts, packages/joint-layout-elk/src/export.mts, packages/joint-react/src/hooks/use-cells.ts, packages/joint-layout-elk/src/import.mts, packages/joint-router-avoid/src/providers/MainThreadProvider.mts, packages/joint-layout-elk/src/types/elkNodeOptions.mts, packages/joint-react/src/presets/link-routing.ts (\u002B9 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"120d1e0d1d98a67535c367eeb654bec154c6da5d626af867aabd3e5f84f8917b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: packages/joint-react/src/hooks/use-create-portal-paper.tsx, packages/joint-react/src/store/graph-projection.ts, packages/joint-react/src/store/state-container.ts, packages/joint-react/src/store/graph-changes.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc594f3a483b5cc05e824d2a1af36a87a52b5018c993873b8f2473ba5796152a"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (26 single-owned of 207 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 207 of the 442 production source files in this repository met that bar). They are anonymized user #3 (3 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: packages/joint-eslint-config/eslint.config.react.mjs, packages/joint-react/scripts/create-rollup-config.ts, packages/joint-core/rollup.resources.mjs, packages/joint-core/src/dia/Link.mjs, packages/joint-react/src/components/html-host.tsx."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix \u0027MyElement\u0027 is assignable to the constraint of type \u0027E\u0027, but \u0027E\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee79e34446f1298f6f1aadfb72bf776e35f7186663ca27bcdac3c4bc83c893e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support multiline text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/offscreen-rendering/src/index.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde9c6e0378b1f9d5d10d0778e81e393cccec4bd36731dce143764d292ab530d"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060packages/joint-cli/package.json\u0060 makes this repository a deployable product (line 7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe97fdfb15f99321f8d78459414cc0dd9b27a30d7cfd63530903b0db76a0f8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022unknown \u0060cornerType\u0060 provided =\u003E error\u0022 repeats the code it sits on: 4 of its 5 words (corner, type, provided, error) are already in \u0060throw new Error(\u0027Invalid \u0060cornerType\u0060 provided to \u0060straight\u0060 connector.\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/straight.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e6276303ad32d3912dafb64130a818f5f98ed708e7191605ad7337537657da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set the new default layer ID\u0022 repeats the code it sits on: 4 of its 5 words (set, default, layer, id) are already in \u0060this.defaultLayerId = defaultLayerId;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c48357d8166e969cbc9b08293559a724304c44263eb68f8103e5e1e015b236"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Move the cell between the two layer collections\u0022 repeats the code it sits on: 4 of its 5 words (move, cell, layer, collections) are already in \u0060sourceLayer.cellCollection.remove(cell, moveOptions);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/GraphLayerCollection.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ed10cf3fbc0ad21c7b0ced53837f20b224d2f7d4e1ddcf50a8444923be200"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add the cell to the target layer collection\u0022 repeats the code it sits on: 5 of its 5 words (add, cell, target, layer, collection) are already in \u0060targetLayer.cellCollection.add(cell, addOptions);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/GraphLayerCollection.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d3f11764286f7656f054e7a382a02dbf1806f5c4b1edef8d05273d3d93b8e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Copy and set defaults for the view management options.\u0022 repeats the code it sits on: 5 of its 6 words (set, defaults, view, management, options) are already in \u0060options.viewManagement = defaults({}, options.viewManagement, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d00352ebb22dd1551a207c6e8416c883ffcfd5aac6d80eef0c0bd6adf0384d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check the visibility of all cells and schedule their updates.\u0022 repeats the code it sits on: 4 of its 5 words (visibility, cells, schedule, updates) are already in \u0060this.scheduleCellsVisibilityUpdate(opt);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a8705eca394ebfbd7c4d3792f81da048c5df9f26f2cf1c4ec0bf43430f650a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get first control points X-values.\u0022 repeats the code it sits on: 4 of its 5 words (get, first, control, points) are already in \u0060var x = this.getFirstControlPoints(rhs);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc2d44da63a16dadd779262d1c8ce23b77601a507eede072440b0df5541dac3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022First control point.\u0022 repeats the code it sits on: 3 of its 3 words (first, control, point) are already in \u0060firstControlPoints.push(new Point(x[i], y[i]));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4811b2d0e71e40a7c524fa8062576972f75fafce5dfab548f7ffefc11eb963"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get first control points X-values.\u0022 repeats the code it sits on: 4 of its 5 words (get, first, control, points) are already in \u0060var x = getFirstControlPoints(rhs);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0405d2e154d744a3b30d8c054608a089fa1cddcf5e9f81936cc8887236404b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022First control point.\u0022 repeats the code it sits on: 3 of its 3 words (first, control, point) are already in \u0060firstControlPoints.push(new Point(x[i], y[i]));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceffb3e5886b84d51e94ec052d74691fccd0cd2a9c4cf60a186d8ebe646cfa4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022assign self as subpath start segment\u0022 repeats the code it sits on: 4 of its 5 words (assign, subpath, start, segment) are already in \u0060segment.subpathStartSegment = segment;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241e077349c970e8d675d2c347a9a34965809b2541f52fdcf680d9559971035"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022assign previous segment\u0027s subpath start segment to this segment\u0022 repeats the code it sits on: 5 of its 5 words (assign, previous, segment, subpath, start) are already in \u0060if (previousSegment) segment.subpathStartSegment = previousSegment.subpathStartSegment;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22e685cf788dd1ecfdc7777e0685ea68a230806ad9f37a8f12813771a12f106"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022the index of the record with lowestHullIndex\u0022 repeats the code it sits on: 4 of its 4 words (index, record, lowest, hull) are already in \u0060var indexOfLowestHullIndexRecord = -1;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/points.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c41f25e548aa7ac550fd467be02054857a9f1384ddec986450dd74f0eda27cc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022= closest point on chord from middle point\u0022 repeats the code it sits on: 4 of its 4 words (closest, point, chord, middle) are already in \u0060const closestPoint = chord.closestPoint(middlePoint);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b553e2690afa2b8a3ab4df3c525a8fa1954c4fa06f11f7bd344e32b0a7e10ff"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 280, 289, 384, 437, 669), for example \u0022expand by padding box\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"725cee8a04f4d8fd9b69e840bc6101ede1b81466c6d960694c45ead59f1553f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update the default theme on the view prototype.\u0022 repeats the code it sits on: 4 of its 5 words (default, theme, view, prototype) are already in \u0060mvc.View.prototype.defaultTheme = theme;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/setTheme.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfafbd5dac9746545de971d93f26cd492a5c88dd3734ecbf504e8a36106a785"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Layer = Back/Front\u0022 repeats the code it sits on: 3 of its 3 words (layer, back, front) are already in \u0060[\u0027back\u0027, \u0027front\u0027].forEach(function(layer)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/dia/HighlighterView.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cdac17221f86441535bb6302b04fd805524bf588fba56275cd72626122b3ba"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022explicit nonScalingStroke = false\u0022 repeats the code it sits on: 4 of its 5 words (non, scaling, stroke, false) are already in \u0060highlighter = HighlighterView.add(elementView, \u0027body\u0027, id, { nonScalingStroke: false });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/dia/HighlighterView.js"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f47bfcb4bb286f4f30b27a5aa254cae9aedd410464da253f528266693d9397f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022explicit nonScalingStroke = true\u0022 repeats the code it sits on: 4 of its 5 words (non, scaling, stroke, true) are already in \u0060highlighter = HighlighterView.add(elementView, \u0027body\u0027, id, { nonScalingStroke: true });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/dia/HighlighterView.js"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e035fbf9c3b4ee970e3ce48bbac7430b49705060feeaaf820d694944792ccf"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022vertexAdding = true\u0022 repeats the code it sits on: 3 of its 3 words (vertex, adding, true) are already in \u0060const vertices1 = new joint.linkTools.Vertices({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/dia/linkTools.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca1759e81b2e2130e49bfc4ef00a154cba22e9c99d7af3801eeeb2023b73280"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022vertexAdding = false\u0022 repeats the code it sits on: 3 of its 3 words (vertex, adding, false) are already in \u0060const vertices2 = new joint.linkTools.Vertices({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/dia/linkTools.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c206c3c76a39d7e3c201ddc0189643b0965e0893e519abbb8156b39f54bb6c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022a(out port \u002B .body magnet) -\u003E b\u0022 repeats the code it sits on: 3 of its 3 words (port, body, magnet) are already in \u0060new joint.shapes.standard.Link({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/graph.js"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a2efcd4119cd69dcba76343e7d66a096fdce64ddb8020d46e351857a733930"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set a new layer\u0022 repeats the code it sits on: 3 of its 3 words (set, new, layer) are already in \u0060rect.set(\u0027layer\u0027, \u0027newLayer\u0027, { testOption: true });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/layers.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af1b0b46579555ecf5d43bad0ba7cc21a5aff1fc5facc8abdeeb50f6486eca4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a new element for this test\u0022 repeats the code it sits on: 4 of its 4 words (create, new, element, test) are already in \u0060const testElement = new joint.shapes.standard.Rectangle({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/paper.js"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d4f1a7cc94d16558824d32e37e65cc2615c8a10ddd6246166bb67ac7d138fc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a new element for this test\u0022 repeats the code it sits on: 4 of its 4 words (create, new, element, test) are already in \u0060const testElement = new joint.shapes.standard.Rectangle({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/paper.js"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"177da4bab43e94316c05a81f509c4d148892d6a6d5a6d9df0ceec7162428b7f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Line Height \u0027Auto\u0027\u0022 repeats the code it sits on: 3 of its 3 words (line, height, auto) are already in \u0060function testLineHeightAuto(annotations)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/vectorizer/vectorizer.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c64ac3039231a701beb4bd065a30aa198a28d888cdd72ac067cb3fbdb598a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022E.g. a chunk that failed to load.\u0022 repeats the code it sits on: 3 of its 3 words (chunk, failed, load) are already in \u0060const error = new Error(\u0027chunk failed to load\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/test/index.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2608ac74ef7ee7aab34c22f5a488c6eceb60c58da6cfbb1e9218d8222ad1368"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Propagate the margins (cluster padding) to the subgraph\u0022 repeats the code it sits on: 4 of its 5 words (margins, cluster, padding, subgraph) are already in \u0060geomSubgraph.margins = util.normalizeSides(finalOptions.clusterPadding) as Required\u003Cdia.PaddingJSON\u003E;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-msagl/src/index.mts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc18a2c02cdc9f67d34a980c65605d5fb65e632f78980dc7db9b206d69bba01d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Call checkPendingLinks to process\u0022 repeats the code it sits on: 4 of its 5 words (call, check, pending, links) are already in \u0060paper.checkPendingLinks();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/mvc/__tests__/paper.test.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"23457ef4c9104ada96e7ddf08a1c840db379bf69596ff3697549ac2e228e0e12"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle incoming state update from peer\u0022 repeats the code it sits on: 4 of its 5 words (handle, state, update, peer) are already in \u0060const handlePeerUpdate = (message: StateSyncMessage) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"528b1fee2b857805386c8b2b4af0c58e2a750204a19f6f82a3b9093394324317"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The prefixed attribute names (the same as in \u0060V.attributeNames\u0060).\u0022 repeats the code it sits on: 3 of its 3 words (prefixed, attribute, names) are already in \u0060const PREFIXED_ATTRIBUTE_NAMES = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6214327fae7d83035b0f9f07a5288790fee71daae45ba2e75b46579c0069c3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022the default label markup of a link\u0022 repeats the code it sits on: 4 of its 4 words (default, label, markup, link) are already in \u0060const link = new joint.shapes.standard.Link({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/test/index.js"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b16f6b6ffc1727cc482a5d0c03f74758ef148068bdf3c5711ed3c2f0df2f47"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/joint-core\u0060 (54639 LoC, 164 module-visible types across 57 directories) overshoots its size bounds. 2 of 14 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9f53a31e68ed7ae081472e432ff898f01ff6db0950b2c5db739fafd94a6b5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/joint-react\u0060 (32089 LoC, 257 module-visible types across 81 directories) overshoots its size bounds. 2 of 14 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06145395b79a082083a7e368095801a68ad50ceee404527e784f4980bd501546"}},{"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":"ddc49ef52c93f5d89390c80bf8f0444bb97743496eeea781d1b7fcf904a3ea48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9517cc4ae56162be6ef5c2593f4757b2854c319ee602e4c89f34f65769f92a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4eea78d0ca570c8bf9f9a1d0016a881b1f6f62d09e5c47fb97185d0d232107ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23f9007d9d076306fa61024b77990aaa399254a90ffb48c0b7597e325bb45740"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b4c21883eae1d0f290e63edb48d19195c1ea8ef1a971b81e9d74b34e7fc3f69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f4a9e44c790b7568c9bed6277f668ba6e98c6ef3c31f1b98411723b362c294b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97628aa0624a7f40efb45901ee7367c0b3804872df37de03c74230cd9ab69545"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3840bbf7cf1a6afe2c202f79e2ea11b7da26a8b078833e63862ba80fe677539"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a70a3ada3bae9a9b4937c8dadf6051d91e207198f3aa5e67fbe9037a6335a0ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f92241376401502a76b0521c8325ec5ac4b2679a6c13f66166ec884cf715b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30edadd297edc88432f10a649bd8ad4b1d2d6c7a14c2a4b900ef41fe9debe24b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5d14d01959f8bc74cfb47cedb20165c1651927e69ca7f14db02f6d54f0db1ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"858eb7f80b7507dfba0c3f1f3da34922e68eec00c263f8d42558fd15e99292b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6fd8769e9ebe3517f566f32030362ae6b605d82de93d94a3689df168cac0d36"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3643ff687baaf09e4fa86f24721b381bb8ec583e4fb1bc9174a893ca376bdfb1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cda12ade2ec2710b7dca5e054f0e71d75819267a9850f73b253c183b256cf29"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f26cf859b21a29d8199401b33bcf3af3c7310d1527e0674e2e7f9168d28c86d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aed91efa958a4129f51b4624c93c2931aa54d599449757d318b6fa01f4378927"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"865c1256b0af6cac7fabd52ec1703a6840a81e82c2cc09619e5e78e47af02756"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcacad19e587b8017e872aeda69d84c7a376e37a6ab8ae7cf6fb1bc38fc8903e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1876750e6afcc2cf8fb888a132c968d2a125ad8fe2921fb24f759dfa65691749"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfbafc21d71fcbbd31028f726ec009cb1847164c1783cda50531f067b63d0496"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f15f01db4f4f2a881cba158dfedb1411e394c1da08c69ca26a75104e5c984007"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef3194b3503a4ca8e9023e0d98dea03c1708e3c32032f0502fe826e2ec1213d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62cb904c74c72926676e0444d52c586192118da44af16e062bcbcfc4b5acf0d7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69f07487c7f83447da76a4f6ed4c45448348555229374452a19c7b29bfa596fd"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dde10b05aca0b06788d57ba536aaf28ad3b94aeec4349d1dad04affd67316a04"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23a55cefb3b12d3567fcc7b638a46ad596a698a622ebc070bcacc3962abf62e1"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37b28151abbf03c01afb0ba1ca20ada8b3617226e7375cfd59bec7689f815bde"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cf83d582661ded11fe81208ffc46f03f6041b3b58c7c3a5c4bcf9bc0a18ee87"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"450e49b5e921770ed56fe85f4a2c3020457d6ad8f549a46936501d63fb95099f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7d4a0f6202666b59d8592a3c480b30755ca1c095c8c801971bb7ef4f484c24d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72f7b2db54f119e25801a3d5721f652d591661437554656a6827e5d2361f8bf9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e37d8c3080d3f8e690d19a540a352f863a9d0d11f51431a4df4b2e0a9df4df9"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"eb37e679f80898d381d865f4fba889abf59c3c3f4731a3a1fd65f44ac0ffe0f6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fb6fde425a76e197fa2afe81266543150958ccdaf1f52c2cbec5831565598c93"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0edee0b6e0b8b2935888bc8238bc2a06ed1f3173806e37adfd62d122933d011b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1850075e85e672bb00dac4cf98c40741c927cf062214201f9e38610898556e01"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"51964071f06120359abfe837fa4a2f14a67a3b7c2543fa9cbd97c02a83ff1ab3"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"642b005acc740ebacd9565b0ca9177d5cb21aed2a5da128ac8398e04896ed773"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce147d56febe729f307bd4c5bb7ad3ee5a0bf502ec5efcdb54c650ffb3c34723"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72ae40a7340beda13777542bcf82e329f080246052632d7417a821c3c8bbc958"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b006d12c2a6e9ad2556804ecd5cfbda4097e4b2846043e87318fe32258a1229"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"00cc42a9e37baf176ed423f465e8d668b00d786d7c145d6807f89a6bc74c4944"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6671760d1a0ca85ee004fc6e42fb7d58941f09d1747e5280e687d0278cff04a4"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b96e41350d24a55bb7a4ce324b1fb1ad38245a4989dcd90b24b364edb9cca67a"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a497f06524679d58492add08d06fc325885cafd92b8f659b86243dfed6b62885"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02f67053b075293a6c0537bbeceff1a851a2df21ca61cda5b246d8c902a68d79"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"4b56844fd4871ec3e518ea7d539d10867a110e34a618dd41a81f14d4e362ab0d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad20bfc87a9f22eed5c14a1fc81efd9c6462a26f669fb14077d39b7b7d90e600"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b4a275ce8ad9e174cb909fdddbc7fba3bdbbeb223fa4c9dce4ce63ccd3d895a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c4a213fa1181879d486972d3e375c568264bf4b05b70d42d16a13fc2de26f62"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cde436105dcd845defe01228cb26878860c31d398118028a0b35c514138b1f9e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f56ea69bf7cdb2e79d41cf2ca5cdc763edb44fe722477e72496bd033ae7b8733"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"e06710aef8b43e5ab3cc959cf0733118ade08f972b766f3a56e709984f862b1b"},"properties":{"dependency":{"package":"@hono/node-server","version":"2.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.1.6","relation":"transitive","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":"3c91332e44e8a931557396b2c500348b6ddc87da880c4c58e4e587d91722da8f"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"7b45f6d6eb00dfc5ef5087cb396ad542a1281bc8d2becd1074172e1ea49c641d"},"properties":{"dependency":{"package":"glob","version":"13.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"b7f5706695b26ad5a588eb0510ecb004fdbfd8846757410cef4fd2b03ef347b7"},"properties":{"dependency":{"package":"hono","version":"4.13.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.13.16","relation":"transitive","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":"e318cc0d29137ca2671628ecff85a84e5b5ae3fb20a852492771ec5f8fd50b58"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"e250dba94f55bbf0618381081bf13e848b42e63dd5acf1bd82745c10c66d7c7d"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"9a0f7eac430276be11b5a7bbf60e285ea7568fad6a3cb007b01c97b7a1a466cf"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f15e6a01102d8fe1a6fc40a1f1fc0d7bc28bc85ac46c1d670fb5828a79f19d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13931d8d36810654659777175b7f037e496176d83f674118a76ed5531b17124e"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 10 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: packages/joint-core/src/g/polyline.mjs, packages/joint-core/src/g/rect.mjs, packages/joint-core/src/g/point.mjs, packages/joint-core/src/g/line.mjs, packages/joint-core/src/g/ellipse.mjs, packages/joint-core/src/layout/ports/portLabel.mjs, packages/joint-core/src/g/bezier.mjs, packages/joint-core/src/layout/ports/port.mjs (and 2 more) (12 orphaned of 210 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 210 of the 442 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfcdb36f47bee788f7a36e7fd51ff7725af4ebd2d4e1a2f77b3294bf42397be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/rect.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31113f55c2d5c82584bf8d390d4dd353be44ba4b917f575eed8cf121de206eea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/point.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ba6cd0081a463bbdbe9490e7922d2254a343edf1c20a43c643f2bed25e0afa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/line.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cfbd8d099af10308e6b0ab404400695bbdb859cb71fc518d98f6041a4aa43a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06c2eb3835e3abb493d5723e9673cdf11ee7b0a07519c231e1d8a4c35947020"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/layout/ports/portLabel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff278dc226078fb6f53fa1707a6e26b133b879b612167a20f82a48dff7b19bea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0764893c7cab7948f81cb7eb1404151a385e6dce52a7b7dca38f74ad3891f21a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/layout/ports/port.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee452a625e42772cfd61db750330d345c13e8eb429a9942fc4e9a9b17c4b6409"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/linkAnchors/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85064e6d01a4084735a068f094fa3f66aafc572ac43cc682129248ebf398445a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/polyfills/base64.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a304d1fc9eeb5375eb3d6f7555bc15de1daeace8305a0283a6e60bf31877377f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: joint.d.ts \u2192 ElementView.mjs, HighlighterView.mjs, ToolsView.mjs: \u0060packages/joint-core/types/joint.d.ts\u0060 changes together with 3 other files \u2014 \u0060packages/joint-core/src/dia/ElementView.mjs\u0060, \u0060packages/joint-core/src/dia/HighlighterView.mjs\u0060, \u0060packages/joint-core/src/dia/ToolsView.mjs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/types/joint.d.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7cd69e7856a4a61d8df06a780bf1e45ea6079183f6cbaa0528592282f08b2"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de970651495f3ca8d7dd25bf24e3e155f0987aaf9afbc037bba3aa42cc3c344"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"244133c6990eaec21d6929230e5449d1650076158452446a2252e2bbf1120655"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f0460042acc9a701c94f06cd570ee7c41b69f5590ac9ee466afda1199acc94"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a34bfeb984f383050a15ead27a7246a1affc3b38c8e00b724f5fac17de822"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368dfd874081deb8bb9d8376543f0ed86c578522a2325429bcd9a5ae6d77d88"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.3:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac3aa70fdbc72a1ee95fc17a1d24459de78b778635d670fb9770405e6347fee"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.node\u0060 sets color: #dde6ed on background-color: #ed2637 \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/examples/index.css"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47df163106eb55c2868ddfa9684b8ed7f4e2b3b6e951d643e9e97620b4514b1e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.0:1): \u0060button\u0060 sets color: white on background-color: #007bff \u2014 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/element-tags-and-badges-js/src/styles.scss"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d8cae296463ea209834bd2bca38b72cb91b7a657707bec2bec0587d4403b1d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.toolbar button\u0060 sets color: white on background-color: #3b82f6 \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/angular-element-view-ts/src/app/app.component.css"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd926703df755849c5f55b0e8b4f6d477ed1e0aa2c98cb2c11da76ad688555a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.router-switch\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/demo/routing/css/routing.css"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1477162e6f603c3c5e026163e02184d706fab084e43846fcc914b4784b0a45fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.html-element-field\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/demo/html/css/html.css"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac78b46241f6d5af289b1212d63ffc47589c4c452850c6132a9548313f8126b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar-button\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/demo/html/css/html.css"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"523ea9c27eb57486ab513319e716b2bb3b3815bcb6af97e219fc08a05d4c0b76"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.joint-element .highlighted\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/demo/archive/logic/css/logic.css"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0d15461abb936404e7adc71fa28fb7062c73944d65b64ecbb0c72daf561825"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar button\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/vue-js/src/styles.css"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495f01b19588b2632bb44bf6cc9886c37497208dfcfd950a19a598d9165b78e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar-button\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/layout-elk-dependency-graph-ts/src/styles.scss"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dce5e1253dcbbbce58e3488d9c75979a0fe52ef1bb2bbc6f56b385936ba5c7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar-button\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/layout-elk-defaults-ts/src/styles.scss"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7609ab7b625267769d02064374ce9e9bbdd46cca95af864768e79299a2b3f8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar-button\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/layout-elk-containers-and-ports-ts/src/styles.scss"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d0d3457ede5598ca7ae2c8ff7707dcc124557c85b710df1761a037374da9c3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060$el.animate()\u0060 moves (\u0060Web Animations API keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/mvc.Dom.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac8d9bf4eba93308be8f619c5df89b0184c60b5d91fb0edaef0ba6585dd6b2b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060$el.animate()\u0060 moves (\u0060Web Animations API keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/mvc.Dom.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97652aff2d0449aa19802681a725d09e20efd87f2016ad9dbaef99bd61ee55d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060$el.animate()\u0060 moves (\u0060Web Animations API keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/mvc.Dom.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b25e3ec3356b152f5160b98590ce75457221ee48e8d21be0347caf3ba05f21"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060$el.animate()\u0060 moves (\u0060Web Animations API keyframes\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/jointjs/mvc.Dom.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"14358a8d1f5938f436a3f6708f338a66a0bd5e9cbfa45dd8018fffbbfbab0992"}},{"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":"M4","level":"note","message":{"text":"README/code drift: packages/joint-react/README.md names React 18, but the manifest declares \u0060react\u0060 ^19.1.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/README.md"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3200dc8c352d43cc72933d053aee8a93d5596f31d18b43eeb2cc37ecc8133510"}},{"ruleId":"P12","level":"warning","message":{"text":"Workspace package\u0027s tests never run by CI: \u0060packages/joint-core\u0060 is a workspace package with 8 test(s) in 8 file(s) (e.g. \u0060packages/joint-core/test/ts/geometry.test.ts\u0060, \u0060packages/joint-core/test/ts/index.test.ts\u0060), but no CI command runs them \u2014 no step names the package and no workspace-wide command reaches it, so its tests gate nothing. Run its tests in CI, or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff0666bb85ffead5685c341343a67f1e0af41989e9bb36ff1deae8b929fc936"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/routers/rightAngle.mjs\u0060 reports through \u0060console.*\u0060 at line 552 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91a212de45334d721db16bef539e53a5f9f827982d5cf8c0b5bb00dad9778a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/routers/rightAngle.mjs\u0060 reports through \u0060console.*\u0060 at line 553 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f76e9141a9c0c27a32c7ba27ff815e174b16bd5622147e11e11d8dae74dd5b0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/routers/rightAngle.mjs\u0060 reports through \u0060console.*\u0060 at line 555 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a597c314c81eb8484ecb09f8bf81200d9e26913d52a1c483cf268e7eb83759bc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/routers/rightAngle.mjs\u0060 reports through \u0060console.*\u0060 at line 557 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f072f964624d56f957434bb44c75951d186e952b43a2a08af937251655a8e8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/linkTools/Vertices.mjs\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/linkTools/Vertices.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea6f0d3768d47ca95cb3ead44741029bf29b90aa1bd85ef9906bee827c9ea8b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/g/bezier.mjs\u0060 reports through \u0060console.*\u0060 at line 13 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28b4c307a8fb1a34871c0ed240c21ff70e91d232c618de378cb594c6b693106"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/g/bezier.mjs\u0060 reports through \u0060console.*\u0060 at line 25 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2020d4c9b5d283bcf6c245dedadb61912d1d2585485c8b8c3425b047abc386ca"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/g/bezier.mjs\u0060 reports through \u0060console.*\u0060 at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"407e9015bf4638ab6c80df911fe8f9ed5705f937fb4285092540cd21b97618e8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/g/bezier.mjs\u0060 reports through \u0060console.*\u0060 at line 133 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c182779c02f1bbf555e1ae68f1f07f531363a3a99a0f743463005fead1746"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/g/bezier.mjs\u0060 reports through \u0060console.*\u0060 at line 166 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37419e2745cbb68adea91bf4bb22a4fdd02f408cab8fbdd0d66894fd20831d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/dia/CellView.mjs\u0060 reports through \u0060console.*\u0060 at line 834 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e71a5e1e015358e70dab92e0ec2b6147e15ed33fe14756210695d8b3c4cb09"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/src/cellTools/Control.mjs\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/cellTools/Control.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6622b5ee850efae9682b35de97d7e2ecd009ec97ce14359de36649db111553"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/joint-core/demo/expand/shapes.js\u0060 reports through \u0060console.*\u0060 at line 44 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/demo/expand/shapes.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe29dea54d572c0d128157c70a4fcad9f6f3b74f6828e5092610feea74020fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/src/commands/download.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbf1718a17769200a20f3f4b374067d322784ec90fd5d7136882719115834dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/src/commands/download.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"692df6fab29e1363e27c2ea19367058317520677d1c870525e86c3fea057670f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060sparseCheckout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/src/lib/git.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8831993b255a5189b8d47897ae8a892f579030a9ef62d5283a9d82b541b5295b"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 299 typed \u00B7 242 plain JS \u2014 the untyped files are packages/joint-core/grunt/config/aliases.js, packages/joint-core/grunt/config/clean.js, packages/joint-core/grunt/config/concat.js, packages/joint-core/grunt/config/copy.js, packages/joint-core/grunt/config/karma.js, packages/joint-core/grunt/config/qunit.js (\u002B236 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (9 clone groups): 9 duplicated blocks under packages/ have copies in at least two of the sibling directories joint-core, joint-layout-directed-graph, joint-layout-elk, joint-layout-msagl, joint-router-avoid, joint-sanitize \u2014 3 of them are reported below, and 6 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 9 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 9 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 9 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":"packages/joint-layout-directed-graph/karma.conf.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93a3c00383f3f5c41f4a20ebe74e8a90c4d14188e866aecf0c9fe29c390cf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 11 sibling directories (8 clone groups): 8 duplicated blocks under packages/joint-shapes-general/src/ have copies in at least two of the sibling directories arrow, card, cube, document, hexagon, note (\u002B5 more sibling(s) not listed) \u2014 6 of them are reported below, and 2 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 8 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 8 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 8 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":"packages/joint-shapes-general/src/parallelogram/parallelogram.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910deaa4d09b94bf8929f6d940b5113582733c0adca8664679dfe6e8f1d5e96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (5 clone groups): 5 duplicated blocks under packages/joint-core/src/ have copies in at least two of the sibling directories anchors, cellTools, dia, linkTools, mvc \u2014 2 of them are reported below, and 3 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 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 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 5 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":"packages/joint-core/src/cellTools/Control.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"713e1412fe0e15b1c42ba077d51be10979720101129b9ef9a9eff0f5d9fe30dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (60 matched lines \u00D7 2 locations): packages/joint-core/src/g/bezier.mjs:27 \u00B7 packages/joint-core/src/g/curve.mjs:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 629 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":"packages/joint-core/src/g/bezier.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8978b48f2a97c13bbba14712843dbdb2842128fe5c9d0ae2a67fa3c998fadf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:37 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949c47a394cd2ec2ce69a5737e8613f69465fca8fba2fe730c2e8b9802f49bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:261 \u00B7 packages/joint-core/src/connectors/curve.mjs:303 \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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d7ad1322ceeef385df6c0f38bb9297d095126a35c0dc62d811d99b9b94e6f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:88 \u00B7 packages/joint-core/src/dia/Link.mjs:129 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"949e4f0bcbabd5d2aa8961f1ff547d86cd1d02deda7227154aedb6f55d50e7d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:100 \u00B7 packages/joint-core/src/connectors/curve.mjs:140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"38634d5374afb214f53cf20921abcd6526f6759f32941d56ffdfa8ba1b422497"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:269 \u00B7 packages/joint-core/src/g/path.mjs:308 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d394010e1379eb882548aba4ca7e1292ba0435fe5a9e4156d2c7adade45624d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:337 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:378 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8579044ec42d9a4f13699507f6f0a454ceff77db8c426c4d95e7e8ffce080817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:421 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:462 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de78cb9d3483454de33bd80a531ddf694d7672d32259838f05e55b927fa469"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:366 \u00B7 packages/joint-core/src/connectors/curve.mjs:403 \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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d1a5c43010d071106fea5047eb4a58f7c9940f8a0144f4399363a37c2811d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:703 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:803 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4462940c6a17d43a25139b558528531128f35df6113ed3abfb9216385671ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"940604c9ef978bca61be14c39dec28904d8241afde408acbb914b43d431e9161"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): packages/joint-router-avoid/src/providers/MainThreadProvider.mts:132 \u00B7 packages/joint-router-avoid/src/providers/Worker.mts:289 \u2014 the two spans are one implementation copied and then locally edited \u2014 177 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":"packages/joint-router-avoid/src/providers/MainThreadProvider.mts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676126258a2cf31a0ea6aa51b389e022a8258250916beb94212e1e4de6b7156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/StepOffsetControl.ts:5 \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":"packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9682d36484bdd2840257fbf61253d2da5fce8932de0241bcf04370ce889d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:50 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:55 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:55 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f519ec8983f0ddeae4a66b04d4c1ebb496fa9eb8ddaf734b17e13c0f434ca1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/TableDividerTool.ts:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 217 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":"packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"662da3eb08a8f46b546e92f705ba8247dc05a72e66715e3c3c44fca3ad81bb0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/joint-core/src/dia/Paper.mjs:3682 \u00B7 packages/joint-core/src/dia/Paper.mjs:3716 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3682}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e230dd3373b275def0e242890f53331fb913e8a9adcd9298028957b24787a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/joint-router-avoid/src/providers/MainThreadProvider.mts:272 \u00B7 packages/joint-router-avoid/src/providers/Worker.mts:184 \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":"packages/joint-router-avoid/src/providers/MainThreadProvider.mts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac24007db95924f1f588146339b96b4718628890439b18e7b7a49e614634e488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/joint-core/src/cellTools/Button.mjs:66 \u00B7 packages/joint-core/src/cellTools/HoverConnect.mjs:93 \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":"packages/joint-core/src/cellTools/Button.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96488385244044f5b5fc31c282a4bd9f020ec2aae1118031e79f61883f5829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/joint-core/src/dia/ElementView.mjs:577 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1318 \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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3f3bb7ff84c95645765af8cb53f678e75b31a335bc1691ec3bc85b661f7a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/joint-core/src/dia/ElementView.mjs:675 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1418 \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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"422ff5d8140f0ed7c10f8f87742b9db7ca37f01be3b5121da2ab97a329f072e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:143 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:393 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935f124fbf4364823d5ad989db23a6e8fce71218162d00c56a8a5a9666d2674"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/joint-shapes-general/src/parallelogram/parallelogram.ts:11 \u00B7 packages/joint-shapes-general/src/trapezoid/trapezoid.ts:11 \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":"packages/joint-shapes-general/src/parallelogram/parallelogram.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06491acabb01968a8d99d25c610f818d005cbed56260e748075528902e00cd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:140 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:167 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1710f895c87ce1c9d99a9288bdedb0073318e0873bd0008d515a86211380e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:510 \u00B7 packages/joint-core/src/g/polyline.mjs:202 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d4a3b14b8f98ac51a71aab6acdbd4349069c49ed97b86825ce5a84e1e8a01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/NoteOffsetControl.ts:29 \u00B7 packages/joint-shapes-general-tools/src/PlusOffsetControl.ts:29 \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":"packages/joint-shapes-general-tools/src/NoteOffsetControl.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ee9eda12260be975c866a44c7b75549043a28a0df54f291ce84da5b45296b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:198 \u00B7 packages/joint-core/src/connectors/curve.mjs:238 \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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0106b681defde0422da5ae9d5725f913dae6b5bbc0c54f7a6bd5373787a474d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:170 \u00B7 packages/joint-core/src/dia/Link.mjs:190 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31326755cd1a00fbe3c313f472a3551fbda2bf9ae8c2af30ec0492d541727b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): packages/joint-core/src/g/path.mjs:373 \u00B7 packages/joint-core/src/g/path.mjs:1010 \u00B7 packages/joint-core/src/g/path.mjs:1080 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61fb2eda50d464edc58528043abc8f67c449d3e7505c560a8b46bcb6a001b92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:1591 \u00B7 packages/joint-core/src/g/path.mjs:1906 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c8932c5f5e6f8f7382e57ee2f86727d4c862e88d9a68bd4fd9309ff11c01be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/joint-core/src/mvc/Dom/methods.mjs:78 \u00B7 packages/joint-core/src/mvc/Dom/methods.mjs:98 \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":"packages/joint-core/src/mvc/Dom/methods.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc31175a5f84695281b5743f934e8d76670e9e560e158366fe40d769d37f647d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-core/src/dia/Graph.mjs:858 \u00B7 packages/joint-core/src/dia/Graph.mjs:884 \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fc76d9c30aa922a95d53d490232fb4aa47d32afd5a0d0c295cb36903f22959"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-core/src/dia/Graph.mjs:1209 \u00B7 packages/joint-core/src/dia/Graph.mjs:1241 \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"03562ec0e3fb68b2553417fddaa1ec7cd400ea026d23773b6e0c2341a5892be3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-core/src/dia/GraphHierarchyIndex.mjs:9 \u00B7 packages/joint-core/src/dia/GraphTopologyIndex.mjs:9 \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":"packages/joint-core/src/dia/GraphHierarchyIndex.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea3fce51e9829a20ba9daf5509d172e407e6734f36d9de371144303c16de37f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-core/src/g/ellipse.mjs:187 \u00B7 packages/joint-core/src/g/rect.mjs:448 \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":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d33c0c33627164fff83c1a8cf59e8daf021fe618e97613219ccfb42fdf518e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-core/src/routers/rightAngle.mjs:688 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:711 \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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd882b3a31e9618a4c8f8d50a631db2578535ab963c064bbcb60a7689cb33d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx:111 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:166 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d556eb3115ac43698f40b30bf0471086581fa076a070f02274c947c0d587ca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:753 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:853 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd32b94bd7c0d9f598b0bb6192a8b14f1983f12d3fa2ad71c0803e202c8a22a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/joint-core/src/dia/ElementView.mjs:620 \u00B7 packages/joint-core/src/dia/ElementView.mjs:647 \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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9453d93d6917d509e1559c03bbd96500bf3fb0e90397376f3483cd4a7b5a249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/joint-core/src/dia/Graph.mjs:927 \u00B7 packages/joint-core/src/dia/Graph.mjs:947 \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a27ef854b7d82c3d147102086b53788b43c51f6cebc4fa9a907d53594e04ac4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/joint-core/src/layout/ports/portLabel.mjs:63 \u00B7 packages/joint-core/src/layout/ports/portLabel.mjs:116 \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":"packages/joint-core/src/layout/ports/portLabel.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"827076d096c9acf2a4b03a9f7d5626f8a76bcdc890c2b8db41ece6783245dc26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-core/src/anchors/index.mjs:115 \u00B7 packages/joint-core/src/anchors/index.mjs:134 \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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c33033a1a25eea04f8556850adaced7404b142f177e1c59c90b5d6b6e1d28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-core/src/dia/Cell.mjs:212 \u00B7 packages/joint-core/src/dia/Cell.mjs:256 \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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5c1fbdf5536aefabe8ed2467fe02df27d1f318cdedbda0ae1367e1c668a1e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:841 \u00B7 packages/joint-core/src/g/path.mjs:1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e5da9cb35124facaa4a090dfd1086830e7d47c8b380413de852a6ccd08e3e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:1679 \u00B7 packages/joint-core/src/g/path.mjs:2063 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"0426703390a1ef2fbb0e82a167ce4dbb10cb9e314f4498a8fdd2e793c5904a48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-react/stories/utils/make-story.tsx:43 \u00B7 packages/joint-react/stories/utils/make-story.tsx:102 \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":"packages/joint-react/stories/utils/make-story.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4fcb01215a98d696862a34cdbe3c442788211995a69d724f1309ce1d5c795f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/ParallelogramOffsetControl.ts:40 \u00B7 packages/joint-shapes-general-tools/src/TrapezoidOffsetControl.ts:39 \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":"packages/joint-shapes-general-tools/src/ParallelogramOffsetControl.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0ea3252d721e7035db0465942dd47fe1be879262445ec5cb86ca1b1eec0ab8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/joint-core/src/dia/Paper.mjs:137 \u00B7 packages/joint-core/src/dia/Paper.mjs:158 \u00B7 packages/joint-core/src/dia/Paper.mjs:178 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e704db6366d79c94f358651c8992d60e25c1767f3b0afd87cb8cd2fcb1226b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/joint-core/src/dia/Paper.mjs:3654 \u00B7 packages/joint-core/src/dia/Paper.mjs:3670 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"baab383de7fba493db70b6a08a7506ede5af9b0df5b396665e22e2248b07eebd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/joint-core/src/linkTools/Anchor.mjs:150 \u00B7 packages/joint-core/src/linkTools/Segments.mjs:154 \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":"packages/joint-core/src/linkTools/Anchor.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd413dc9ed3192e9714915825fbdf87309e1ff8cbc33a9ae6c9466235da35d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/joint-core/src/routers/rightAngle.mjs:88 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9357799858e19d708a23b498e3ccf86bd6dd5388eebdb6dca12350fca41032d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/joint-layout-msagl/rollup.config.mjs:10 \u00B7 packages/joint-router-avoid/rollup.config.mjs:9 \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":"packages/joint-layout-msagl/rollup.config.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d735fa7ce8d798a14a03d6f2cac04386e9303df0be4545fa8514f1147614307"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-html.tsx:30 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-svg.tsx:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 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":"packages/joint-react/stories/tutorials/step-by-step/code-html.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfcced3a920a35e9e2e6eedd0490192d1e7eb945e49c2f29490c2c23998207c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts:41 \u00B7 packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:37 \u00B7 packages/joint-shapes-general-tools/src/StepOffsetControl.ts:39 \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":"packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4399be5d5dc0a3a32d783159e506d790a5f2c67047cfe3f8def20f6bc4f96b20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1191 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1355 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbd1a549fd1cff50e1de338138b319f13556c61258fd7b247956f279ff8209d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1241 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1296 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"041d8f970d8823f13c288f99a9ff21b4ef762917123053628c501d95b9430b7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/anchors/index.mjs:42 \u00B7 packages/joint-core/src/anchors/index.mjs:59 \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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168602febb6bd8d9803cc947c76d0a42cc2f1d749a1d1077f06aa2caf4376e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/joint-core/src/g/ellipse.mjs:184 \u00B7 packages/joint-core/src/g/point.mjs:264 \u00B7 packages/joint-core/src/g/rect.mjs:445 \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":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"815b703886d3b0f2dcd6d5e5524fd122f6bd79cb04a4d3c004f4d2669f307a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/g/line.mjs:297 \u00B7 packages/joint-core/src/g/line.mjs:312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/line.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa32128522384db27d3e95fd575a9cc463513344199e41834ea429dc9fcf54ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:1025 \u00B7 packages/joint-core/src/g/path.mjs:1095 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abdad23eca5877c4371c05ec60c270e9c03c0e05e0b80ead93158744feae555"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/joint-core/src/highlighters/list.mjs:77 \u00B7 packages/joint-core/src/highlighters/list.mjs:92 \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":"packages/joint-core/src/highlighters/list.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0efc621f185ab1da8d69fbc1eebf1fcf4474f1f4cec30e94d2b42467319d516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/ParallelogramOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/StepOffsetControl.ts:5 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c248da915458f2490a915254d3ccff2308223aba023133cc62a0f89d9675b1c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/joint-shapes-general/src/card/card.ts:12 \u00B7 packages/joint-shapes-general/src/note/note.ts:12 \u00B7 packages/joint-shapes-general/src/plus/plus.ts:11 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general/src/card/card.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516380fb7346105fb9678d790bee36a5e936431ce23ba712c24fd951e3b7c42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/joint-shapes-general/src/note/note.ts:34 \u00B7 packages/joint-shapes-general/src/parallelogram/parallelogram.ts:20 \u00B7 packages/joint-shapes-general/src/trapezoid/trapezoid.ts:21 \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":"packages/joint-shapes-general/src/note/note.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc23c09286549a31e013863e68783a3c3dabdf59db99877b6f8728d971baea1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1313 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fefab9f1529a1c158675307fe1288c0a9f60e5b0083ebf9247477fd0de03d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-core/src/g/intersection.mjs:448 \u00B7 packages/joint-core/src/g/intersection.mjs: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":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e71451069adf948b7fe3c556fde8c8bb31e9fca63e370e589f75f605df2853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): packages/joint-core/src/g/path.mjs:1376 \u00B7 packages/joint-core/src/g/path.mjs:1402 \u00B7 packages/joint-core/src/g/path.mjs:1508 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e32ff40bced2bf6c44df6b35b6d092725741d78ad59749e5da3d3bfa5679cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-core/src/routers/manhattan.mjs:292 \u00B7 packages/joint-core/src/routers/orthogonal.mjs:76 \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":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15cb7975d514cc474917a99e9f35b6e2da0c337de35b252c266a75088022d9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): packages/joint-layout-directed-graph/rollup.config.mjs:1 \u00B7 packages/joint-router-avoid/rollup.config.mjs:1 \u00B7 packages/joint-sanitize/rollup.config.mjs:1 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-directed-graph/rollup.config.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7af5fa8f5584af75b8e8729b5f8446ab0128fd9bda56de6d20db18f4bb65048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/joint-react/src/presets/connection-points.ts:19 \u00B7 packages/joint-react/src/presets/connection-points.ts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"packages/joint-react/src/presets/connection-points.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8497f16daaf461445205b6f33611ff0c3abdca2eabb90f9998f8d88cda029d34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:184 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:245 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c8daa52b6d018afcf6690d717ee3534ceee7a651829adf20313f7b7e699f96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx:303 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:172 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58da048925827b5e29d01bf1311391541518913f16ba3623770192efc4a8ed0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/joint-router-avoid/src/RouterService.mts:872 \u00B7 packages/joint-router-avoid/src/RouterService.mts:888 \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":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"91da5899e59c12c84223fe7211c090b755b6825d31129ed4b82c608ef5be332f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:235 \u00B7 packages/joint-core/src/connectors/curve.mjs:315 \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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa177c07143d5ba9f9dcaf993e99e36f1f4fdf6d7749b570f71a5ff3f0f48194"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/dia/Cell.mjs:792 \u00B7 packages/joint-core/src/dia/Cell.mjs:812 \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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1722802c00fd937f22d00f80ffbc8a53a8b25f82c4954179e6b388e038af5fe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/joint-core/src/g/intersection.mjs:313 \u00B7 packages/joint-core/src/g/intersection.mjs:343 \u00B7 packages/joint-core/src/g/intersection.mjs:387 \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":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c23a161236c47e26b762b2fac9acd9cadab92f0532ef854259b1704910fb4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:818 \u00B7 packages/joint-core/src/g/path.mjs:1128 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c858ac014817631aca146b65069fac543d8646c555ef382106a91c95704eba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/g/polygon.mjs:7 \u00B7 packages/joint-core/src/g/polyline.mjs:8 \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":"packages/joint-core/src/g/polygon.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7ccf2b20a258129d7bc1e5ea23a028e93ea4a927426b84fbdcdebfafb301b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/g/rect.mjs:39 \u00B7 packages/joint-core/src/g/rect.mjs:62 \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":"packages/joint-core/src/g/rect.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb9485551f4ceac914ff7141f6326aae87586d2e12c3654f0c48a1761bb88a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/joint-core/src/layout/ports/portLabel.mjs:25 \u00B7 packages/joint-core/src/layout/ports/portLabel.mjs:78 \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":"packages/joint-core/src/layout/ports/portLabel.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79384d493706e5a0aeef23fb3e6c15c381faef448e0c223a3a23fc5b8846b6c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/joint-core/src/routers/rightAngle.mjs:153 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:191 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:224 \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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e47a3ab3682aaa54d97bcbcb94f35f78fb5f1c2506d2fb5479a44f877193e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7 locations): packages/joint-shapes-general-tools/src/CardOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts:5 \u00B7 packages/joint-shapes-general-tools/src/ParallelogramOffsetControl.ts:5 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general-tools/src/CardOffsetControl.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a5072c1eeb502cd5d4bd89befe14327a479fd239842654ba1b6da9ec75fdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/V/index.mjs:2050 \u00B7 packages/joint-core/src/V/index.mjs:2069 \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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f6d64a3b223b53fa76040d73cdb5df57b9bef3d4ad8c229564f89b381e0ac9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:185 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:228 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e96d3cc9ab74aeed504512ec947b07b30fa3150fd1b611f948aec41c142f6cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/dia/Graph.mjs:1294 \u00B7 packages/joint-core/src/dia/Graph.mjs:1307 \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca6bd1a675ac07db21ad776c7b57cd8686da288a2348050728ae409768c2bf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/dia/Paper.mjs:2552 \u00B7 packages/joint-core/src/dia/Paper.mjs:2564 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6250454a4a0115a86aeacdcc20fdc453c16e797a52c4a22142668bf08ec8845"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/g/intersection.mjs:251 \u00B7 packages/joint-core/src/g/intersection.mjs:263 \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":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"116a84cc5420eca9d19b8064e85dc3951bac409cf785f541a2b96fef4f039eb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/g/intersection.mjs:287 \u00B7 packages/joint-core/src/g/intersection.mjs:360 \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":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"918ac2e13a88ab0b3841cf7c235ff4a7bd32c58c4ed0ef801a9966d27b2a5ca8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:166 \u00B7 packages/joint-core/src/g/path.mjs:637 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9f8681d4166e6cbd966960060c4703ba6ebc19de66bf72ee28620399ab7426"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/joint-react/src/presets/can-embed.ts:93 \u00B7 packages/joint-react/src/presets/can-embed.ts:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"packages/joint-react/src/presets/can-embed.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c969472973efd7b83926bec9545dc1eba0691638f033066cf707f9123d16f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/joint-react/src/presets/link-markers.tsx:104 \u00B7 packages/joint-react/src/presets/link-markers.tsx:122 \u00B7 packages/joint-react/src/presets/link-markers.tsx:147 \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":"packages/joint-react/src/presets/link-markers.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce2853de3325b791e2cdc830400dd1cc800cd0721e1a6fa1bc34e1e23ae29d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-react/src/utils/test-wrappers.tsx:47 \u00B7 packages/joint-react/src/utils/test-wrappers.tsx:95 \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":"packages/joint-react/src/utils/test-wrappers.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cfc9d6279742212a56b19109dbc3898ac3258a42ae0d0b090a1b4e60e1fec6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx:390 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode.tsx:196 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0139598e969d2186425103a46f2e78738407d884d05cfcea4e6dc9b3c9e51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): packages/joint-shapes-general/src/arrow/arrow.ts:29 \u00B7 packages/joint-shapes-general/src/hexagon/hexagon.ts:28 \u00B7 packages/joint-shapes-general/src/note/note.ts:37 \u00B7 packages/joint-shapes-general/src/parallelogram/parallelogram.ts:24 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-shapes-general/src/arrow/arrow.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2528f773230d3a637b342c5b127bb28c7043ec6799f0de4b2cbb154192c83be2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/joint-shapes-general/src/arrow/arrow.ts:34 \u00B7 packages/joint-shapes-general/src/cube/cube.ts:65 \u00B7 packages/joint-shapes-general/src/table/table.ts:40 \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":"packages/joint-shapes-general/src/arrow/arrow.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d969427e23e169794fe37174e35fa54505b03d6fcaad156cc785b1d6d44ba92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/joint-shapes-general/src/document/document.ts:41 \u00B7 packages/joint-shapes-general/src/plus/plus.ts:33 \u00B7 packages/joint-shapes-general/src/trapezoid/trapezoid.ts:28 \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":"packages/joint-shapes-general/src/document/document.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"40752ab382f0092d9faa1a5a9acddf24329d70862ee283f5f0a40903e74024f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/joint-cli/src/lib/github.ts:30 \u00B7 packages/joint-cli/src/lib/github.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"packages/joint-cli/src/lib/github.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39e7b34d312b90e6af7a75fef5bf710835a4d15219a0542d67c4c07a71f8f8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:496 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:522 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21941f30e45ecbf481ab6b88273aebd84faa0c542f98cc9f16e0b4da86ae24e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:929 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:954 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"04120e575f5b2030690a2f6e68c01d84258805253cd63a82557b23f3b92f22ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1018 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"011c058180feca1bac12b8cb433b7dda0815002dc78abf6fe6745559b1003f0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1129 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1185 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcf83927ca0722b88411c214d7d880c2792b1c2d6da8f1566e633bd05632fc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1348 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a235f4c0fe49ac94e2f16cf8043c82cd737797fd0ad3428014cdfea1e45f166"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/dia/Cell.mjs:248 \u00B7 packages/joint-core/src/dia/Cell.mjs:292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d46a3cbbe75baed6c167fb4d9252753e7b7d75ceb5be346f13c55967d4a805"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/dia/Cell.mjs:438 \u00B7 packages/joint-core/src/dia/Cell.mjs:457 \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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2547cd4a79aaf388b203ffc57d0f3553cc804a5c84c516c5a288fd425739ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/dia/Graph.mjs:1121 \u00B7 packages/joint-core/src/dia/Graph.mjs:1134 \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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"941249a9432d17dadcf012764131079759c582a6ccb01f0cee57b941865473eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/dia/LinkView.mjs:1371 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1402 \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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d5ec07f577d7c991311196d5f6368e775e0cd148533c6e21e4fdeeaf795734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/dia/LinkView.mjs:2043 \u00B7 packages/joint-core/src/dia/LinkView.mjs:2056 \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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"f846b3351f57ee31b8089cabbe8ab48a97e1e732fcf7dac116af0448b53e4f66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:2160 \u00B7 packages/joint-core/src/g/path.mjs:2171 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f092909da645216ebdf6308a10930933faa83db8bef207b86a79fb428291eb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-core/src/g/polyline.mjs:281 \u00B7 packages/joint-core/src/g/polyline.mjs:403 \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":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa1ebd29c6066395b51af2faa2d7ba184f115eaed62fccd32a4f0cf499bf8f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/joint-core/src/mvc/Dom/methods.mjs:171 \u00B7 packages/joint-core/src/mvc/Dom/props.mjs:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"packages/joint-core/src/mvc/Dom/methods.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba92fed3efa2f5b7e2454b717f8510204dcd3d2b558cdd4a8132d574bb99835"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/joint-core/src/mvc/View.mjs:181 \u00B7 packages/joint-core/src/mvc/View.mjs:197 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"packages/joint-core/src/mvc/View.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"38069978f0b5a89b8a248206be04f9c2dee539e9d9f1e716e503281d179ef1e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/joint-core/src/util/utilHelpers.mjs:1732 \u00B7 packages/joint-core/src/util/utilHelpers.mjs:1790 \u00B7 packages/joint-core/src/util/utilHelpers.mjs:1835 \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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7c3205781f2e0b604572e5f07399847e4a13bbb8b2b745d72a7aa4ec0291a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/joint-react/src/presets/link-markers.tsx:86 \u00B7 packages/joint-react/src/presets/link-markers.tsx:268 \u00B7 packages/joint-react/src/presets/link-markers.tsx:348 \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":"packages/joint-react/src/presets/link-markers.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd4e1fbcf66c5b3955c86a121fa4068800f6b6300430363f1a1c79e20e2bbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx:124 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:141 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode.tsx:210 \u2014 the 3 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. 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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d645b8740ac7e007e8a26bfaa88a71d86e412178c38ec5e601724687300ccfa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode.tsx:89 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-html.tsx:28 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bbd74b746ef9107cc44aa67f3c3697a2c1312a809c73031417d309cb6ffd98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/CylinderTiltControl.ts:47 \u00B7 packages/joint-shapes-general-tools/src/RadiusControl.ts:111 \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":"packages/joint-shapes-general-tools/src/CylinderTiltControl.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d79bc53cde93c60cae88aacf987b68a3e84493eff94b5c63021c143cc96c7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/joint-core/src/alg/Deque.mjs:55 \u00B7 packages/joint-core/src/alg/Deque.mjs:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"packages/joint-core/src/alg/Deque.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6661ed1badc37baae2b65d0b786664500983f8debc6cd0002eaafe1ada0f6ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:793 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:843 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dc6734e13a9a585080a8de77e152546ab7bafaf5b80e1947c346aeda7c85c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1074 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1186 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b7ca082c38ab65b5e7ac7ec4ec200b89c466ebca2aba32fb3025916bbabf87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:1295 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:1349 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc5fbce695cc104d929b36e43202ebb13d23c1724b32394b508e2e87469f68b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/connectors/curve.mjs:63 \u00B7 packages/joint-core/src/connectors/curve.mjs:81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6beaecadb05324acf6650f5eabb3b276bdfaa3aa5f0c52a16eafa841a20fc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/joint-core/src/dia/Cell.mjs:186 \u00B7 packages/joint-core/src/dia/ports.mjs:397 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d384a9ed0da0b77d6a4973e9038edab0a1d5b5b3c77a21ba2cfc83219bbfd13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/dia/ElementView.mjs:179 \u00B7 packages/joint-core/src/dia/LinkView.mjs:242 \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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d136af66ce581fb06e92bc47fb2c4d91791d3705360ef493532f0ce32f0ff819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:257 \u00B7 packages/joint-core/src/dia/Link.mjs:337 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"591b0cc52a6e19a60da16d4085297bd7c3f2fdcf902662096ed22dfca2e9ba00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/joint-core/src/dia/LinkView.mjs:1112 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1128 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1144 \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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df9cdf3ba58eefa63724ef5d65ac9fa3baa3bed396b66859c327e93b4ba5c3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/dia/Paper.mjs:219 \u00B7 packages/joint-core/src/dia/Paper.mjs:241 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bc50fc4d17532ab32de45f720db702e977178d16b5395c91db39a0678c2ee7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/dia/Paper.mjs:2020 \u00B7 packages/joint-core/src/dia/Paper.mjs:2038 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"665e1bc71d93c661b4bfdf3517892940392638cc5cffeedaa627a183fe901d9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/joint-core/src/dia/Paper.mjs:3438 \u00B7 packages/joint-core/src/dia/Paper.mjs:3461 \u00B7 packages/joint-core/src/dia/Paper.mjs:3490 \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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a295ef653d978a2b7f1f990e4e21bec8c7e923fcc95384ee8ed051502e52b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/joint-core/src/dia/attributes/legacy.mjs:29 \u00B7 packages/joint-core/src/dia/attributes/legacy.mjs:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"packages/joint-core/src/dia/attributes/legacy.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9805acd3ceb54292d22394f10a6072408e1fc43bf3e9a1ab831c6336fb49e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/g/curve.mjs:730 \u00B7 packages/joint-core/src/g/path.mjs:1847 \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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d047a8aeb6c84149ba2cfcca24d6e1ae412df0ec1594349215fa88675210d239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/joint-core/src/g/path.mjs:397 \u00B7 packages/joint-core/src/g/path.mjs:796 \u00B7 packages/joint-core/src/g/path.mjs:1035 \u00B7 packages/joint-core/src/g/path.mjs:1106 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf63f5d4f2238018436f3fe3f34c45be7ebecde7c8fc3461e6763d629f7df337"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:1650 \u00B7 packages/joint-core/src/g/path.mjs:1660 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"30512c0dfb6a0f645a4df753be59af03a18aada1681cbfc00e8aefd727851d8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:1803 \u00B7 packages/joint-core/src/g/path.mjs:1813 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8efa00ffb9b921057e36db87f7fe34467b052e5a403248e4d5cf5e0d37335a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/g/polyline.mjs:302 \u00B7 packages/joint-core/src/g/polyline.mjs:425 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bb61028c0503e5b6464c9f9857262b27edb268212f51f317a4c2bdd86d4d9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/g/polyline.mjs:489 \u00B7 packages/joint-core/src/g/polyline.mjs:506 \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":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"32401b2d2e8914ac1cec2aea022219e5f06f508085fd1f077f6262ac504b693e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/linkTools/Segments.mjs:140 \u00B7 packages/joint-core/src/linkTools/Vertices.mjs:141 \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":"packages/joint-core/src/linkTools/Segments.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a4f25f351e3d4e02166524e48f91776dbb326f6267059874b3d9afd08ba4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/linkTools/Vertices.mjs:147 \u00B7 packages/joint-core/src/linkTools/Vertices.mjs:166 \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":"packages/joint-core/src/linkTools/Vertices.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96ccd1857dd4c4be271fbbd94b1cf6d03608848dc62880d80626e25bed5c03f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-core/src/util/util.mjs:206 \u00B7 packages/joint-core/src/util/util.mjs:229 \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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caac58825e11bd25ad9db3f040cd54aeda2e352cf140c1f936cef435bf3469c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-react/src/hooks/use-cell-setters.ts:78 \u00B7 packages/joint-react/src/hooks/use-graph.ts:168 \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":"packages/joint-react/src/hooks/use-cell-setters.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd4d3d85945b99a0650f84b6370c88e740851a89def2a1497c80207a76d2027"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/joint-react/src/presets/link-markers.tsx:63 \u00B7 packages/joint-react/src/presets/link-markers.tsx:184 \u00B7 packages/joint-react/src/presets/link-markers.tsx:233 \u00B7 packages/joint-react/src/presets/link-markers.tsx:249 \u2014 all 4 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":"packages/joint-react/src/presets/link-markers.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d972a23247a1ae8e8f51efc12ff7fd9609c795a2e880ee00c9dae3146e9d41ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-react/src/presets/link-markers.tsx:230 \u00B7 packages/joint-react/src/presets/link-markers.tsx:246 \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":"packages/joint-react/src/presets/link-markers.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4dd38ff40bd6fe996b992ff3424ecf0b298ca0103c3413a6eda094b7f0f2d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx:113 \u00B7 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx:129 \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":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f83615e5aad965a0af98b29a58c38a62458b25a828fad1d6f530e6f26d7fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/joint-core/src/V/index.mjs:169 \u00B7 packages/joint-core/src/V/index.mjs:193 \u00B7 packages/joint-core/src/V/index.mjs:219 \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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02922e6e5a814a1f22d5e9f3e729eb74e8b424e11c18e061ef53850c92c0c65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/V/index.mjs:2064 \u00B7 packages/joint-core/src/V/index.mjs:2085 \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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c01b31179a5f82fe26822cb87f4b0880daab970a53236612df61bf15dbd107"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/dia/CellView.mjs:378 \u00B7 packages/joint-core/src/dia/ElementView.mjs:562 \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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b37f32ad421cb1e0cd68060be8227583520cc164a1175eec5d96a415d6447b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:291 \u00B7 packages/joint-core/src/dia/Link.mjs:357 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dde3096be0f1d26bc79adb80300f343c0b4be411dbe3f65c7dcdc864d5e92b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:314 \u00B7 packages/joint-core/src/dia/Link.mjs:374 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8da6ac6896ed439c0da96b933418e49c3b3c3d38226334118ecbe9bde00138"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/dia/ToolsView.mjs:80 \u00B7 packages/joint-core/src/dia/ToolsView.mjs:95 \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":"packages/joint-core/src/dia/ToolsView.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c5c44efc8c395c2298e778ac0deea9b2b88a7fcaf095e93d5fffa0bb90e2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): packages/joint-core/src/g/curve.mjs:797 \u00B7 packages/joint-core/src/g/path.mjs:384 \u00B7 packages/joint-core/src/g/path.mjs:779 \u00B7 packages/joint-core/src/g/path.mjs:1021 \u00B7 \u002B1 more site(s) not listed \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0d7c6ea71e6593c71988b102727c99249860ca82ac9a0cbcde7890ae69aa82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:530 \u00B7 packages/joint-core/src/g/path.mjs:879 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8691d6b18e484970cb97ee5644713429816985ebefc832d5bc33af5b317aa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/joint-core/src/linkTools/Arrowhead.mjs:40 \u00B7 packages/joint-core/src/linkTools/Vertices.mjs:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"packages/joint-core/src/linkTools/Arrowhead.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e078289b515416d70170d956a203b85690112e509be52602749fe7403ee881a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-react/src/components/paper/render-element/paper-element-item.tsx:42 \u00B7 packages/joint-react/src/components/paper/render-element/paper-element-item.tsx:69 \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":"packages/joint-react/src/components/paper/render-element/paper-element-item.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6d3ecb2c1bef7a6c9d766e22c4b77d4625079fb518bb3eeb46cac86e54584b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/CubeCornerTool.ts:26 \u00B7 packages/joint-shapes-general-tools/src/TableDividerTool.ts:24 \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":"packages/joint-shapes-general-tools/src/CubeCornerTool.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"340b85afbfb89b5c6f72547b67d42d03bb46ee275e1ad7685c6ec208f86d77b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/joint-shapes-general-tools/src/PlusOffsetControl.ts:40 \u00B7 packages/joint-shapes-general-tools/src/TrapezoidOffsetControl.ts:45 \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":"packages/joint-shapes-general-tools/src/PlusOffsetControl.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f5cc3e503f7efe0107e27c3d59419712dc15347e1262efbf223c0db4c8b8bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:557 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:572 \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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb977028bb1fe49f687818bda39d3939e4e49006904564c4f780765eeeb60d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/alg/rightAnglePath.mjs:914 \u00B7 packages/joint-core/src/alg/rightAnglePath.mjs:964 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5285dfb05099a342467fb8bbda33027ce94e9539f994572cb0fc87572ed0db1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/cellTools/Connect.mjs:58 \u00B7 packages/joint-core/src/cellTools/Connect.mjs:67 \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":"packages/joint-core/src/cellTools/Connect.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4418241c295a4bae3959ee8397050846268b13bd17d29938854b787a5cb9e860"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/joint-core/src/dia/CellCollection.mjs:94 \u00B7 packages/joint-core/src/mvc/Collection.mjs:217 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"packages/joint-core/src/dia/CellCollection.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52326fb1de768778abda0ae8c94136ba9e1386c77db8879700aa1a02b6c33bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/dia/Link.mjs:207 \u00B7 packages/joint-core/src/dia/Link.mjs:320 \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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccae725a83b35e09d8f8674832d640cc35ca84e8443d4a52f31b47e86e3e82d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/dia/attributes/text.mjs:96 \u00B7 packages/joint-core/src/dia/attributes/text.mjs:112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/attributes/text.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4b96c66127b1305b9e32d161d8da362dc8b5be8768fe5e3f7e6c377fc24dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/g/curve.mjs:648 \u00B7 packages/joint-core/src/g/path.mjs:1837 \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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"109f484493c3cb4065869b1c1292daeba0e6b2efb069cd86b0733617ae0185a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/g/path.mjs:646 \u00B7 packages/joint-core/src/g/path.mjs:947 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"453b4a814ce2588eea702f8fbcc9f9e0c227f237c4ba6f9b14121dcf30e67091"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-core/src/g/rect.mjs:117 \u00B7 packages/joint-core/src/g/rect.mjs:518 \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":"packages/joint-core/src/g/rect.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6514919a4f76c8490f9df87454ae24090f13d59874e08a1173c0068b51679056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/joint-core/src/routers/rightAngle.mjs:122 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:160 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:198 \u00B7 packages/joint-core/src/routers/rightAngle.mjs:232 \u2014 all 4 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3c04a60d973857d4ba624d9fd1aa71805e94ac20fa69d4f5d7bb0c5be5659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-react/src/presets/anchors.ts:15 \u00B7 packages/joint-react/src/presets/anchors.ts:22 \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":"packages/joint-react/src/presets/anchors.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d4b32ce01744bcf2c73685398be689fcf9f3231ec9f1c0d0b32c9732577aab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/joint-react/src/presets/link-markers.tsx:258 \u00B7 packages/joint-react/src/presets/link-markers.tsx:278 \u00B7 packages/joint-react/src/presets/link-markers.tsx:358 \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":"packages/joint-react/src/presets/link-markers.tsx"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a2cc8eca76d5ad6a5cb6d3add5cf761d7b108552245dbef5b9728e2c2509c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-router-avoid/src/providers/MainThreadProvider.mts:42 \u00B7 packages/joint-router-avoid/src/providers/Worker.mts:163 \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":"packages/joint-router-avoid/src/providers/MainThreadProvider.mts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87ceee1fdb892ed9b6776608c0adae99b70e844ea63515ffb5fb1d442fa1c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/joint-sanitize/src/sanitizeGraph.mjs:151 \u00B7 packages/joint-sanitize/src/sanitizeGraph.mjs:167 \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":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"573e3b18f809a2cf7cc76f45b17f68a5b6877d101d64e9125a1b3d84dcb72798"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/joint-core/src/cellTools/Control.mjs:130 \u00B7 packages/joint-core/src/linkTools/Anchor.mjs:124 \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":"packages/joint-core/src/cellTools/Control.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621e87bca572d4c19ce50c8bbb06b772abb51e8746f9c380f249704d80c2f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): packages/joint-core/src/g/curve.mjs:280 \u00B7 packages/joint-core/src/g/curve.mjs:290 \u00B7 packages/joint-core/src/g/curve.mjs:306 \u00B7 packages/joint-core/src/g/path.mjs:236 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c47d2670ce9b24af126e20c7f8fa96eeb3e7a53971fd85679000dee9f8109d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/joint-core/src/g/curve.mjs:943 \u00B7 packages/joint-core/src/g/path.mjs:1871 \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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac41b6262dd2d05c610ce72dbe982d81ed2e7c0bfe716059f467053a1c6d06d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/joint-core/src/g/path.mjs:747 \u00B7 packages/joint-core/src/g/path.mjs:805 \u00B7 packages/joint-core/src/g/path.mjs:1115 \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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2cfa3aae85391bb0a3e3f369f7f6760db9b46ae073e0827df1e35f1843d79f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/joint-core/src/mvc/Dom/Dom.mjs:56 \u00B7 packages/joint-sanitize/src/sanitizeHTML.mjs:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a3db59b643243ba7913b69681b8e5d685c0a964ddcc75c6f040efbebe9e52c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/joint-layout-msagl/src/utils.mts:179 \u00B7 packages/joint-layout-msagl/src/utils.mts:186 \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":"packages/joint-layout-msagl/src/utils.mts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3b77860f715e277ba16c5bcf3311e1ba8cf50084679ff9d58e21c41cda498"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/joint-router-avoid/src/RouterService.mts:550 \u00B7 packages/joint-router-avoid/src/RouterService.mts:579 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65c23e0f11366c76fa2a678b57cf4d0fa2e783f40ae44ec5ffbbc53e16c101"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/joint-core/src/cellTools/Connect.mjs:69 \u00B7 packages/joint-core/src/cellTools/Connect.mjs:75 \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":"packages/joint-core/src/cellTools/Connect.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a665107dbeef2ed3eb855dd7f3c58eccfb7fb7c4659658c7f015126768f5e9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/joint-core/src/connectors/jumpover.mjs:317 \u00B7 packages/joint-core/src/connectors/straight.mjs:71 \u2014 the two spans are one implementation copied and then locally edited \u2014 110 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":"packages/joint-core/src/connectors/jumpover.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63611590488129e1f689e03d6e7e71b74520d1419bf39ba190886d0ae5738c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/joint-core/src/dia/LinkView.mjs:1964 \u00B7 packages/joint-core/src/dia/LinkView.mjs:1988 \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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"8097798473fb656e02ab1e72e4202ae1ce0e5751fe26ee15d4695674f4e595c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): packages/joint-core/src/g/curve.mjs:312 \u00B7 packages/joint-core/src/g/path.mjs:275 \u00B7 packages/joint-core/src/g/path.mjs:314 \u00B7 packages/joint-core/src/g/path.mjs:405 \u00B7 \u002B3 more site(s) not listed \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a174922b1f621e8d7155ab8614850baa243545c5c158ca38eb02de047a7f74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/joint-core/src/mvc/Dom/Dom.mjs:328 \u00B7 packages/joint-core/src/mvc/Dom/Dom.mjs:399 \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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e400bce51cdfa836491455acbaa291258682b3deaef440bc060808937430ad5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/joint-router-avoid/src/RouterService.mts:921 \u00B7 packages/joint-router-avoid/src/RouterService.mts:972 \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":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d79ecb8e27a77ed790873d93c20429bfba6a11ad8bdf0e1d53a0607957f965d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/joint-router-avoid/src/providers/Provider.mts:112 \u00B7 packages/joint-router-avoid/src/providers/WorkerProvider.mts:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/providers/Provider.mts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd988b1dc25e975254ba2ef779235471448d67a6ba6f987545cb6b3c6ac786b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/joint-layout-elk/src/elk.worker.mts:5 imports elkjs/lib/elk-worker.min.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/elk.worker.mts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafbb88592b492f453832f71b8e423e488322ada90103551818af5a1d25206b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/joint-layout-elk/src/mainThreadElk.mts:13 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/mainThreadElk.mts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edf581dd509286e8e8211b841358e70c3582702824b83a14d2dc41561a433c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rightAnglePath (cyclomatic 193, cognitive 296): rightAnglePath has cyclomatic complexity 193 and cognitive complexity 296; 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":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd31278563fbaa2ada319ae30f07948dbca932fa476dcf298cac8d8c81a763e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function breakText (cyclomatic 64, cognitive 162): breakText has cyclomatic complexity 64 and cognitive complexity 162; 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"335c62a432f2a508acbefb7fec8aa8c1cca2c49dae78c679bd7f235ed88b0de3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function text (cyclomatic 55, cognitive 110): text has cyclomatic complexity 55 and cognitive complexity 110; 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ebfdf80a6b32b9e326602adf595a668db56700c1b37657c30f4d611aefa45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function number (cyclomatic 48, cognitive 41): number has cyclomatic complexity 48 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e773f6fa9e675b2bf3ad44d7a08efbd62bcf439792c708e1ba349eb3991433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rightAngleRouter (cyclomatic 47, cognitive 65): rightAngleRouter has cyclomatic complexity 47 and cognitive complexity 65; 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d278d3db9192d3a2084a8dda7e8041d4cd19fa646851fce7f72df3db00e5a045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 41, cognitive 62): set has cyclomatic complexity 41 and cognitive complexity 62; 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":"packages/joint-core/src/mvc/Collection.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbc3079959c8f531e65c77bc9686ce7855b3331ae1ee550c7dbf742f1041b41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remove (cyclomatic 35, cognitive 52): remove has cyclomatic complexity 35 and cognitive complexity 52; 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eb96a41b21d6621fc32c05e6911957e34886dca1d801891f2c854eea51aaa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processNodeAttributes (cyclomatic 33, cognitive 76): processNodeAttributes has cyclomatic complexity 33 and cognitive complexity 76; 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"855f832acb451a92da6bbf23fa453ff3c9862408a17be354ee3b7a26f1ab86ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exists (cyclomatic 33, cognitive 14): exists has cyclomatic complexity 33 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"778942a878a8ad46dc9a24246ece88a48f1900330ff960b55218b99107cd91a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareAscending (cyclomatic 32, cognitive 21): compareAscending has cyclomatic complexity 32 and cognitive complexity 21; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f11081190a9764995d156e553f7951066bec61ef012ab2e3c8cb14b4c89f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRoute (cyclomatic 31, cognitive 75): findRoute has cyclomatic complexity 31 and cognitive complexity 75; 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":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd284396a826c10e7b5e450b13c8d28b0da441dd287c58c76677e8cc96091c99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onChanges (cyclomatic 31, cognitive 56): onChanges 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":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27dfad4173b97d723d2e3bdebc5d28544508d9d5f93fb3525b66b229353c7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onHandleChanging (cyclomatic 30, cognitive 49): onHandleChanging has cyclomatic complexity 30 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/linkTools/Segments.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c2bde73d423f2c4588e7d8598c1059a395d45b28f02f056f39157ce4a00100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDirection (cyclomatic 28, cognitive 80): resolveDirection has cyclomatic complexity 28 and cognitive complexity 80; 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c315979a2a591adf7b938d71904f5d939c4bb261f53d0e4649b519ac82ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseClone (cyclomatic 28, cognitive 43): baseClone has cyclomatic complexity 28 and cognitive complexity 43; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f00324332d5834f76440bdb39bcb2e66a89507e3532cb9a90154c0f3dec95ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convexHull (cyclomatic 26, cognitive 42): convexHull has cyclomatic complexity 26 and cognitive complexity 42; 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":"packages/joint-core/src/g/points.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b77f64c651aed701ea579eb0819fd4d8e8ad871c1f276bc02a0d30912d6750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTransformString (cyclomatic 25, cognitive 38): parseTransformString has cyclomatic complexity 25 and cognitive complexity 38; 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c865ac521aea6f5e77e6c3348bb4df4c2d7648ad369d91eb62063c319dacb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toGeometryShape (cyclomatic 25, cognitive 20): toGeometryShape has cyclomatic complexity 25 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb499dc2323980f649baa8f16f33dddc1409e4286d3960f542b962df5960aaf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Path (cyclomatic 24, cognitive 47): Path has cyclomatic complexity 24 and cognitive complexity 47; 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa14de0dc097afeb5c1673d0a33ea43def47d5cfd4c739f48f86142c3f5e21a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDOMSubtreeAttributes (cyclomatic 24, cognitive 45): updateDOMSubtreeAttributes has cyclomatic complexity 24 and cognitive complexity 45; 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241d1aa06634d46a18e8f3bb8d17c28bb0964e23ec48d50c4e90e5913289158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createPortElement (cyclomatic 24, cognitive 41): _createPortElement has cyclomatic complexity 24 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/ports.mjs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da9b6a7e20304c4ad5cebe04492f719cf53df1a9eb4a1369e9fc4fffa5839be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateRelativeAttributes (cyclomatic 24, cognitive 30): updateRelativeAttributes has cyclomatic complexity 24 and cognitive complexity 30; 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3695b1dabef0c3bcf6292dab9ebd480be5698f5a307ff3d4cdab957dc9c584d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 23, cognitive 33): add has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3f5c5b7e8423d3d427bb0c8a88c93f8abb9177e164bf5335935889eee9c638"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundaryIntersection (cyclomatic 23, cognitive 30): boundaryIntersection has cyclomatic complexity 23 and cognitive complexity 30; 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":"packages/joint-core/src/connectionPoints/index.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf68211254095c9f73685f3246c4440e9a6a3c527e5370b24c8b03be0ca7dae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateViewsAsync (cyclomatic 22, cognitive 37): updateViewsAsync has cyclomatic complexity 22 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a0388a2c589d99657f75c929cdc485a6e16763932ad0674d01443a519b2977"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMiddleSide (cyclomatic 22, cognitive 25): getMiddleSide has cyclomatic complexity 22 and cognitive complexity 25; 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"139366f9564404b528a4cc1c98338032c29aa959f87d363147ad557cd8c34b8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWheel (cyclomatic 22, cognitive 24): normalizeWheel has cyclomatic complexity 22 and cognitive complexity 24; 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7fd7cb3695334205c48306a6ff7f618027152bd4e3bca896b94530ddb138c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFitToContentArea (cyclomatic 22, cognitive 21): getFitToContentArea has cyclomatic complexity 22 and cognitive complexity 21; 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e2ba499a250b38421378431d554d35abc284b6b85d45f42b727d09c23fa3ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathToAbsolute (cyclomatic 21, cognitive 35): pathToAbsolute has cyclomatic complexity 21 and cognitive complexity 35; 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6aa0ffc91d23a2bbcb3657b85fe4029718342e1a0c8b7f91b633da6e8624ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _snapArrowhead (cyclomatic 21, cognitive 26): _snapArrowhead has cyclomatic complexity 21 and cognitive complexity 26; 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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c775a9aedf74fd3023a91cf02a9a8ef2daddb80d521c8437545e4b5e68620073"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equalObjects (cyclomatic 21, cognitive 25): equalObjects has cyclomatic complexity 21 and cognitive complexity 25; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc045b89924270c4196b52f352ea93e469ea62cf75b075780fbf5a61d501b25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForTopSourceSide (cyclomatic 21, cognitive 22): resolveForTopSourceSide has cyclomatic complexity 21 and cognitive complexity 22; 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67cd48b4a4709c81375849b045271d0249a3ec9a39030ff47246a6a17d1510b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForBottomSourceSide (cyclomatic 21, cognitive 22): resolveForBottomSourceSide has cyclomatic complexity 21 and cognitive complexity 22; 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f567b532e789198c3a7d79d2c63d11215ff3cd62641244381e00a1e29aa917f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateViewsBatch (cyclomatic 20, cognitive 49): updateViewsBatch has cyclomatic complexity 20 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01efd38bce463ef53746f07c301482626e1757b9fd4125e7565a9ff8d44d10d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function a2c (cyclomatic 20, cognitive 34): a2c has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc642ec627fa6fa8ffbd8af9a68b142647e83272422cba9efced3d7c162e4a5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointerdown (cyclomatic 19, cognitive 37): pointerdown has cyclomatic complexity 19 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"435fd35fcf1788a0a99f067e604c69460ea0b2b5b3b296ada38601e741339fe6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateTextLine (cyclomatic 19, cognitive 34): annotateTextLine has cyclomatic complexity 19 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5da352040230ce7f8c1d88f9dc703eca33410c168b470bfde2c095c07906322"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateString (cyclomatic 19, cognitive 33): annotateString has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40ae3ef645cf83a06df87aafd77598ec0fba351257e5821d69f9cff41b05b43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closestPointT (cyclomatic 19, cognitive 28): closestPointT has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"330e190c1646772c9c35cda2b8bf6857023f000bd17cb624e523a2af645bb235"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function divideAtLength (cyclomatic 19, cognitive 27): divideAtLength has cyclomatic complexity 19 and cognitive complexity 27; 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e98edcc0c4fe022d9372248983497b334c6ad9d979b983a3ae558399deb7b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) has cyclomatic complexity 19 and cognitive complexity 22; 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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e89df2fcf338bc2a5445058bf4401713ff7d2093d9a7d6a84d251c0d60598"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseIsEqualDeep (cyclomatic 19, cognitive 21): baseIsEqualDeep has cyclomatic complexity 19 and cognitive complexity 21; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e569337b42b3b70c6dfd64ff199d37c6088ef0fa171726772f2c5b9d2d87714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmUpdate (cyclomatic 19, cognitive 20): confirmUpdate has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"57916640fe6dcb7dd6e855a680e1cf93b5ab3f7b92e4d8f1e8302a31cbef5371"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForLeftSourceSide (cyclomatic 19, cognitive 18): resolveForLeftSourceSide has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"119e82dcc49856efb052a35d9df3d410789cac0458cd7dddb3d3396cbff20f0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForRightSourceSide (cyclomatic 19, cognitive 18): resolveForRightSourceSide has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7209e8a4cc6b8bc13cab4ce4b0b4528d05a2aa778a61a4791b9edab1dfd4381b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 14): (anonymous) has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/import.mts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84449d0a55b25aad3c70da98948054dbc31ba6a176b40645a89f304626f1938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNode (cyclomatic 18, cognitive 40): parseNode has cyclomatic complexity 18 and cognitive complexity 40; 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":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cece04063dc3e27aca00a2a77b27fd2bde6c9d3ff9aa14b63bbdc6df973f76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tAtLength (cyclomatic 18, cognitive 30): tAtLength has cyclomatic complexity 18 and cognitive complexity 30; 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70d56bc03ba00051df23719483f8e7ef813cd340afa49fad6b2ae086a9e5a79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function offApi (cyclomatic 18, cognitive 28): offApi has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/mvc/Events.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"712fd5dfda733ff1a5157c487f45334e24cd51f781c09a7a7d579dd920e1d559"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 18, cognitive 26): set has cyclomatic complexity 18 and cognitive complexity 26; 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":"packages/joint-core/src/mvc/Model.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf02b46d817b6d727b6597413096e906298301c56cbc349d8a3268bc90927ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scheduleViewUpdate (cyclomatic 18, cognitive 21): scheduleViewUpdate has cyclomatic complexity 18 and cognitive complexity 21; 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a592a4b0c1315b5f76305b5389939ed6b078b2e787f300ff23a01bf1b3445f34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processPath (cyclomatic 18, cognitive 15): processPath has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7504b95175ac33532230c9697c784ddb87567552ca904fc6ba95d8cfaf99e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformToFitContent (cyclomatic 18, cognitive 15): transformToFitContent has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5449f40e6c04aa4fca66e62638b06985f6fb55aac0d4961de637c14cbf6e1ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equalByTag (cyclomatic 18, cognitive 10): equalByTag has cyclomatic complexity 18 and cognitive complexity 10; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7561d87730a03c6aea8e74ca19ce5e87c7120dc21a54303e3b6ce2871e26df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Moveto (cyclomatic 17, cognitive 37): Moveto has cyclomatic complexity 17 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"8566c29ad3b7721a68b65a05593ef3ec7096e3f1c993e5edfd521717f492484b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 17, cognitive 27): set has cyclomatic complexity 17 and cognitive complexity 27; 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":"packages/joint-core/src/dia/attributes/text.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"02605c10302924af1b2d3e5d0ff52629a8b90250931ecdf81bb635146d65958a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function curve (cyclomatic 17, cognitive 26): curve has cyclomatic complexity 17 and cognitive complexity 26; 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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0171621ee610584d2bc9567de2462e337e9753e66e558d93c3636b0c42c15085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseMergeDeep (cyclomatic 17, cognitive 23): baseMergeDeep has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dcfe08bba24988745acd6111c273318b37eaf6290dbf9b7cb8f28aeaa7d35f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortedIndex (cyclomatic 17, cognitive 17): sortedIndex has cyclomatic complexity 17 and cognitive complexity 17; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7870bee48f90b94526156ac2a6218c07940bfd60eb005eae37148c037098a8d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orthogonal (cyclomatic 16, cognitive 30): orthogonal has cyclomatic complexity 16 and cognitive complexity 30; 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":"packages/joint-core/src/routers/orthogonal.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"acad52de1217e443247903cb1831803f5c74147ff8434ebbc8216579799d25d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 16, cognitive 25): dispatch has cyclomatic complexity 16 and cognitive complexity 25; 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"832c052986b3382b942e0466256cd298d2bb508e538bb10f7b56df13388684b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getLabelTransformationMatrix (cyclomatic 16, cognitive 22): _getLabelTransformationMatrix has cyclomatic complexity 16 and cognitive complexity 22; 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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6a7564f424f24e8d0d2ffedfef8f6d45f292e1030272b4640be08badd6a8e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceSegment (cyclomatic 16, cognitive 22): replaceSegment has cyclomatic complexity 16 and cognitive complexity 22; 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"389b688f6e4dbbc07c16c56bd8cff92ea42c3bb4d53dc860cb0d19602257ce3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resize (cyclomatic 16, cognitive 18): resize has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce1558b44fa38fba17ca4ec25a8ea140d52e41f671e75e74fa7bf7191c6ed22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findIntersection (cyclomatic 16, cognitive 17): findIntersection has cyclomatic complexity 16 and cognitive complexity 17; 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"90967154b3784a4e9837fd86c30446140ac9a152dcbbe23c3d3b9d4754a2fd7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function warnUnstableSelector (cyclomatic 16, cognitive 16): warnUnstableSelector has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-react/src/utils/dev-warnings.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5da0cf2fbc2f185ba588d97b7bd7c7b64d9e931ca2c19fe3d90e4fb2f2903ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function position (cyclomatic 16, cognitive 15): position has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/methods.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8240e846df45358e35c4345175979d5bcdc117ce2518670b44064e9bffe5e653"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importNode (cyclomatic 16, cognitive 14): importNode has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/import.mts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f5fb03d117257f7551cc831cd88004a4ffe7ddf1ca4b3c74745a78284e1047"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arrayLikeKeys (cyclomatic 16, cognitive 12): arrayLikeKeys has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5b16c097cd4107c755a070af49f0285d52486cb9a564909f69719cf8266956"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uniq (cyclomatic 15, cognitive 30): uniq has cyclomatic complexity 15 and cognitive complexity 30; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e7c9daf6ea1f3f3be2efbeab5ae87c703cb56e78d662cf8ed6f5ae9c6e19a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeCellRecord (cyclomatic 15, cognitive 23): mergeCellRecord has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-react/src/state/data-mapping/cell-record-merge.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc404ddbe6585b8e22b5c8565ed1c38c07eda438a99a6ee21394e0fffd5034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeNodeAttribute (cyclomatic 15, cognitive 21): sanitizeNodeAttribute has cyclomatic complexity 15 and cognitive complexity 21; 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":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9945fafa94a236abdc877122c963ff5a43c1b1713da686d49283401ffe50e63e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processEmbedding (cyclomatic 15, cognitive 19): processEmbedding has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef70bb34e4cded44a5f5e923d27b58783a6a7087dc3b0a87cc62b9945f34b87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equalArrays (cyclomatic 15, cognitive 19): equalArrays has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bc7ed960d6543af80749b7dfab9555225b222362ec0d067b9f93610751c47a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intersect (cyclomatic 14, cognitive 29): intersect has cyclomatic complexity 14 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e5d44e5899a4a9c9b11908847d372749a7b2927d3663273fa0acbcfd9c315d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBBox (cyclomatic 14, cognitive 28): getBBox has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a259073a97db64d61db4ddbbec40991937c94d742d1c34aaf862d23f2dc780"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prop (cyclomatic 14, cognitive 28): prop has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1dceffc86a0cfec97ac9576e7fa7e75d01334c0ec1706e2bf97c51783ad78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlers (cyclomatic 14, cognitive 28): handlers has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea2aac645be99a900d79c7351099f5d49dad04d3962d022ab6b69ecf94a7fc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseIsMatch (cyclomatic 14, cognitive 27): baseIsMatch has cyclomatic complexity 14 and cognitive complexity 27; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d550972dbbe996fd108fa2902f46990bdb5852bcbe0d47a4d098f8708fb5ca4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 25): (anonymous) has cyclomatic complexity 14 and cognitive complexity 25; 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74f5e477d79b949bf822cd813684a5162d2760eb6018959d00bd692e57ed126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Curveto (cyclomatic 14, cognitive 24): Curveto has cyclomatic complexity 14 and cognitive complexity 24; 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b3341d9e636701d10966d529f405c760a231d91d5f971d4552242f5f5ee8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCatmullRomCurves (cyclomatic 14, cognitive 22): createCatmullRomCurves has cyclomatic complexity 14 and cognitive complexity 22; 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":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c31d943a9cdfa4267b051b57c3762b021a02110ce26406388acb15e34fdcf4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function router (cyclomatic 14, cognitive 22): router has cyclomatic complexity 14 and cognitive complexity 22; 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":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5860bcbd1d8f93d8f0d12a23bba5d5b5701cae98f664b45c660bda99a94d5a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointAtLength (cyclomatic 14, cognitive 21): pointAtLength has cyclomatic complexity 14 and cognitive complexity 21; 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e739bf601b97c14abb049bb6681ecb31866f7c188f4f2fbfff9918277c5cc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/jumpover.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccc5cf5ade794986bec2cca6156138152e05f509c13d8dad73b63191e767be8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSafeAttribute (cyclomatic 14, cognitive 17): isSafeAttribute has cyclomatic complexity 14 and cognitive complexity 17; 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":"packages/joint-sanitize/src/security.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d58a07baa40cfe0e25d97d01c2a902673457bef16b8f1be530a92e3f7f52a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveDrawGridOption (cyclomatic 14, cognitive 16): _resolveDrawGridOption has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/GridLayerView.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b3d8d14a941f86a8d296bf2f3862c839177f47680bd4f1f168341276f58ee5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 14, cognitive 14): layout has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-layout-directed-graph/DirectedGraph.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"221dc2561d53f05c1cec6291d94895fef32aa128f1add9d3d650d1ec889586f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rectWithLine (cyclomatic 14, cognitive 13): rectWithLine has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0618416d103ba8209e327d9bfe1a373d05eada705329123bec97e5bfe874b064"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmUpdate (cyclomatic 13, cognitive 23): confirmUpdate has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaac67246a0a75b47aa453688877af94dbb26313d43388e120195f4b2d388c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Lineto (cyclomatic 13, cognitive 23): Lineto has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51deeb4bd746a346193579c1306cc41ae2b32953979e47ff74373ac75e6a12f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bbox (cyclomatic 13, cognitive 22): bbox has cyclomatic complexity 13 and cognitive complexity 22; 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b624c4f520f7b7b9dc1fb7fe1c641546e8819663e187e6bd9390e989b9e875f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intersectionWithLine (cyclomatic 13, cognitive 21): intersectionWithLine has cyclomatic complexity 13 and cognitive complexity 21; 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":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f47da139e950b5b11c85c06499764867a1b46f6231280c0be35ddd74d84ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tangentAtLength (cyclomatic 13, cognitive 20): tangentAtLength has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d358e4c4ff088d5ebfd1f0e9522b81d18160b0cd3535b3323f135f845ce50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSubdivisions (cyclomatic 13, cognitive 19): getSubdivisions has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7d3feb58d24917369c1ddf39e50dbead68451c06753b043cc20e68c0b2a70a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSides (cyclomatic 13, cognitive 18): resolveSides has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d8116d7161ccd3feb61dcbc42e2f8c89e7e179e747db499450d5c9cec6c7de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function straight (cyclomatic 13, cognitive 17): straight has cyclomatic complexity 13 and cognitive complexity 17; 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":"packages/joint-core/src/connectors/straight.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f67b38fd4e14cac39289e45cfd364596b792dc4967469ee6cc60847c48298e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translate (cyclomatic 13, cognitive 16): translate has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef487d9a461f8929d62c0e0c72fe764b847ba053e8df02d93bf6bdd7b55631d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNeighbors (cyclomatic 13, cognitive 16): getNeighbors has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a4b93ac5e9ee4c463e713831783b9b2c65f81c395a0b836d367b97cffd342e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawBackgroundImage (cyclomatic 13, cognitive 16): drawBackgroundImage has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb0f98b06724010a626cdfa45813c8e044d68a4dddcf93a1ae44d1e29da02f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function on (cyclomatic 13, cognitive 16): on has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd481b423e756b869196876328ba30a0b3b0d72e530a31774d7b134edbd7d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLabelPosition (cyclomatic 13, cognitive 13): getLabelPosition has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d9e9d71d6c224822e080905e5a31dc14a8d0d93833b4f7bfda2cb73cd35e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDirectionForLinkConnection (cyclomatic 13, cognitive 12): getDirectionForLinkConnection has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c0da7dca40045b9d2b04426585875196b35592cafd1e35d01ae4897a9ff047"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEmpty (cyclomatic 13, cognitive 12): isEmpty has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1122fa92d9b3252ca995797fa9ac0483361197b76c78617d2aefbf11769827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function containsPoint (cyclomatic 12, cognitive 21): containsPoint has cyclomatic complexity 12 and cognitive complexity 21; 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":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14eca487f0d6a386b7b20040319455e85b8f51f253d6cbc3a04b5f499eeaed4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function position (cyclomatic 12, cognitive 18): position has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e48eb4a811dcb00fe0436c42f705854de45d83614dedb654ede1bd720b763a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveHighlighter (cyclomatic 12, cognitive 16): resolveHighlighter has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec2c67f5ae85199ad0c2961044b1559de86d8e0c0420ca0bfa41ab93093d265"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasDuplicateLink (cyclomatic 12, cognitive 14): hasDuplicateLink has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-react/src/presets/can-connect.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8434808a0ab1f5cec67df16268c04d3f83fd86f4289a0dd537cc1bd8251a38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Dom (cyclomatic 12, cognitive 12): Dom has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c784d015475e7de2877d5dd845aedcc77c6de25790b01deeb813dc0fdbeff1f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTextWrapStyles (cyclomatic 12, cognitive 11): getTextWrapStyles has cyclomatic complexity 12 and cognitive complexity 11; 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":"packages/joint-react/src/components/svg-text/svg-text.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a613eed5227245f0ccc66b93b264d51999a51e2a5ceb2c43b3f7d3f2faf32229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PortControl (cyclomatic 12, cognitive 11): PortControl has cyclomatic complexity 12 and cognitive complexity 11; 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":"packages/joint-react/stories/examples/element-ports/code.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab864142a8f77de1285c2e1c2c723a8a3a63b5f56cacf5aeeb293e2b59d965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; 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":"packages/joint-core/scripts/parseDocs.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7215ccfa5aa2acb33b5d732c5a560390e11db08d8d8f7cf7a4b49360ac233d46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNodesAttributes (cyclomatic 11, cognitive 26): findNodesAttributes has cyclomatic complexity 11 and cognitive complexity 26; 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":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"60455787e46a527eede003e6e39689eab62286c8523848174755fe59b63dd780"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 11, cognitive 19): set has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"55191d7d015d1eb60b7b926444701ce3b268d4a485e3c4e21da61452b283851e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 11, cognitive 19): build has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-decorators/src/parser.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d099c21d4d88f25e31dd4c99a4034227437a156cef0666a626f02542008af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toGraphLib (cyclomatic 11, cognitive 19): toGraphLib has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-layout-directed-graph/DirectedGraph.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1050e39e30edbaa573bed8de3b432cc623a2b60acfc030acb92dcc78ce856e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tangentAtLength (cyclomatic 11, cognitive 18): tangentAtLength has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/polyline.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cefd2252991966e40f20c4c8680f3ae2313dd1b921de099ea51fdaafbe6355"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function V (cyclomatic 11, cognitive 17): V has cyclomatic complexity 11 and cognitive complexity 17; 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c19bf4bb17ba6fe04ad4c2b8e897d9f71fe2f89c7b2e74cccdfd7f1f519ce91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mount (cyclomatic 11, cognitive 17): mount has cyclomatic complexity 11 and cognitive complexity 17; 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":"packages/joint-core/src/dia/HighlighterView.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb02e3f08d3fbac454760201a531b0b022af0e87aeea7d8731e2b43aa2365b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evalCalcExpression (cyclomatic 11, cognitive 17): evalCalcExpression has cyclomatic complexity 11 and cognitive complexity 17; 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":"packages/joint-core/src/util/calc.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0389d5f740e303fe401d8131d7345e8be01c76020f13aa1582464f18cca7fc06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateGraph (cyclomatic 11, cognitive 17): updateGraph has cyclomatic complexity 11 and cognitive complexity 17; 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":"packages/joint-react/src/store/graph-projection.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46255ea5be41d5a45f8e717330f0ba3bce18ccab0458817afbcac1631f70b26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reparent (cyclomatic 11, cognitive 16): reparent has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be55e80b887641fe8fe784207675e6bc718e19ba728f3d33653111b858a42ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertSegment (cyclomatic 11, cognitive 16): insertSegment has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"62863f84659a685f6cb96b27e21d135a7c21e19ffcd0aab88c2356c5a0c45b60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildElkNode (cyclomatic 11, cognitive 16): buildElkNode has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-layout-elk/src/export.mts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516eb703f20187f8c5350a26c60ea57c096ba61a61d34a7e2de6c90431edd80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 11, cognitive 15): normalize has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9e8f539e1a0270811de637adb82db4ca341b50050c2f8b295a2006eb196f1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _perpendicular (cyclomatic 11, cognitive 13): _perpendicular has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/anchors/index.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"850518dd0b7b273127a7c0f6e6fbd4faf306c426c3898e63718f6be7374cfcbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNode (cyclomatic 11, cognitive 13): findNode has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/HighlighterView.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c76cf60f3796f228b6604888acd48ea5caf99780a8c5daecff17c7c6670c219"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findConnectionPoints (cyclomatic 11, cognitive 12): findConnectionPoints has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45626ceef56550591ef217a2adb4352c82177f93e34a58f9d4673d180f0855a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matrix (cyclomatic 11, cognitive 12): matrix has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45083db96a7ebbbfd52330c4124f50c75bb757322d0edd72ebab5a86e2ea563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e2cc29a6e4cc297619290d326efd53c568f1c14173d7b488161392fdf6650c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function containsPoint (cyclomatic 11, cognitive 11): containsPoint has cyclomatic complexity 11 and cognitive complexity 11; 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":"packages/joint-core/src/g/rect.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9049729d20aad335dd84e0ca5304180364c04404b2c07c1751ea30fb46434374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cloneOptions (cyclomatic 11, cognitive 10): cloneOptions has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"1796fb477255155e9326c776f8bb25e2e9baafec398ebe81dc12360dcc3b0c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasPath (cyclomatic 11, cognitive 10): hasPath has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd508f503a69f3935137d8c34f24d2d68d90ee266d29bab92eb716f8944789a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-core/test/geometry/path.js"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7df82f7de4ecb75e2ceadea5809f39a703470b7fc2a08544eae1d10acf5f4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-layout-elk/src/types/toNativeElkOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"006ade6466028ec8a46bc01cdc36e023eccd5c9d1f920682f318aa2f58da9ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-react/src/presets/can-connect.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e4c4cba1c4dd04ceeaf9f9348446da743eb6217c7145a21a0cbdc2ec8428a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ColorSelect (cyclomatic 11, cognitive 10): ColorSelect has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-react/stories/examples/theme-editor/code.tsx"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"500f42cc53853b3ae999989bebe03976faba4b8e625ba009e4215ee7d98494bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRouteValid (cyclomatic 11, cognitive 10): isRouteValid has cyclomatic complexity 11 and cognitive complexity 10; 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":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e133f2bbebe25b4f999529fe2f909013f343f0c24a8ed2f1d4a310a828fc2dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 9): main has cyclomatic complexity 11 and cognitive complexity 9; 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":"packages/joint-cli/src/cli.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c543c97deb870b32acff269743a86393a41d6e1bd640a52eba09c68c243b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PaperBase (cyclomatic 11, cognitive 9): PaperBase has cyclomatic complexity 11 and cognitive complexity 9; 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":"packages/joint-react/src/components/paper/paper.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60b29b40d2820319be5503b55d77ac8ac3f6ffe0a3a7cbfc948cac29395ee64"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/Paper.mjs: 3721 lines of code: packages/joint-core/src/dia/Paper.mjs has 3721 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Paper.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25cf6a0254cea8ad92856a94156d7af5c87047f981a31cb9c68933549335195"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/util/utilHelpers.mjs: 2087 lines of code: packages/joint-core/src/util/utilHelpers.mjs has 2087 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/utilHelpers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d395a82635b21d0d805326cea8ba80866f2e1d8a100e2d68a6a95be9a4fb4c4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/V/index.mjs: 2078 lines of code: packages/joint-core/src/V/index.mjs has 2078 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/V/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ac5c91ebf193b58477f61875030e36fda5d75192238e90eb3da71a346a0ef2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/LinkView.mjs: 1723 lines of code: packages/joint-core/src/dia/LinkView.mjs has 1723 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/LinkView.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df18088ccc3317f94d3d4369fb3ef7c5c43d35f46afd8339a4c2503730efce7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/g/path.mjs: 1631 lines of code: packages/joint-core/src/g/path.mjs has 1631 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/path.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"256c87fcfcd4d1453c8ab9019338db8b4fc5bd3b71256802939ca717ce6b8616"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/util/util.mjs: 1445 lines of code: packages/joint-core/src/util/util.mjs has 1445 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/util/util.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23e5245c6be9085a8a8e9201c2ede298cfdbd3e53cbf7b77380c40d38236da5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/Graph.mjs: 1322 lines of code: packages/joint-core/src/dia/Graph.mjs has 1322 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aaf32dc4355441af293d8e9ecb7825011d125b1dcd841982ff1c27a0c65d7a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/CellView.mjs: 1214 lines of code: packages/joint-core/src/dia/CellView.mjs has 1214 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/CellView.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9603df5f87affc6f987de1c8b0c55cde63fc7d9f8c019787f3e1377abdf6e54"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/alg/rightAnglePath.mjs: 1169 lines of code: packages/joint-core/src/alg/rightAnglePath.mjs has 1169 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/alg/rightAnglePath.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ecf3086de2a2af0774922e4cbca3ebe0708f6f95583b900d67acb2d0125110"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/ports.mjs: 932 lines of code: packages/joint-core/src/dia/ports.mjs has 932 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/ports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68c2da38107681269280d7b6adfce1e8c4051596252790672afbf33513d9082"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-sanitize/src/sanitizeGraph.mjs: 894 lines of code: packages/joint-sanitize/src/sanitizeGraph.mjs has 894 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02e1eb76ccde28bd5d68934719c5e72bd55a3d3abe0e0affc60c73c96b770b6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/Cell.mjs: 771 lines of code: packages/joint-core/src/dia/Cell.mjs has 771 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Cell.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6745d8eb5e679e9bf1b052e4ee9ea928a7bb9cabc79cc1591104ff5b02166c4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/shapes/standard.mjs: 728 lines of code: packages/joint-core/src/shapes/standard.mjs has 728 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/shapes/standard.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0114f730bd6383556419fd705b032a7b69c477a622e4a10ece17499a87b87838"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/g/curve.mjs: 720 lines of code: packages/joint-core/src/g/curve.mjs has 720 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17500c65c99f1162802c209f74285be9f264449023015ec90a520aeedcc42b8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/ElementView.mjs: 696 lines of code: packages/joint-core/src/dia/ElementView.mjs has 696 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/ElementView.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c032d2bce6d61f60482a81c777803996be0d1a671a9d7fe8a4aca3f24f3f6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/routers/manhattan.mjs: 637 lines of code: packages/joint-core/src/routers/manhattan.mjs has 637 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/manhattan.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aab193bdc699b4977ea4b16a6cc9b1e6b3566271a7313e7c063fd56c72326d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-react/src/presets/paper-events.ts: 634 lines of code: packages/joint-react/src/presets/paper-events.ts has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/presets/paper-events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa323715bd9c92bc0a0f8c6f32ecdd311891ab86570089a94160648475e7e2c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/routers/rightAngle.mjs: 611 lines of code: packages/joint-core/src/routers/rightAngle.mjs has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/routers/rightAngle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de322472feeb208bb11c489d1cc48b7f70d0dcf503b093abdf513a98e616d7c4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/mvc/Dom/Dom.mjs: 527 lines of code: packages/joint-core/src/mvc/Dom/Dom.mjs has 527 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38db2402d96b5050b54b406bf26753408de293c0c98149921073508b7274e46e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-react/src/components/paper/paper.types.ts: 506 lines of code: packages/joint-react/src/components/paper/paper.types.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/components/paper/paper.types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bccdeb99fc279c7f3409389cecbddf3db83fdb7d2244aee9c19a4be0f59d2e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/Link.mjs: 495 lines of code: packages/joint-core/src/dia/Link.mjs has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Link.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad482db35ba98cdbfab214c620816ad02043860a10c3776b450c955c904c48"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-react/src/hooks/use-create-portal-paper.tsx: 495 lines of code: packages/joint-react/src/hooks/use-create-portal-paper.tsx has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/hooks/use-create-portal-paper.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"004dc67a3703ebca6d0df21cc56990020a198843b9a258689d33819fae029dfa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/connectors/curve.mjs: 488 lines of code: packages/joint-core/src/connectors/curve.mjs has 488 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/connectors/curve.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b562a05813e823fdb1fe7b01d94e7017385428978bb6bc6c641443132341bff"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx: 481 lines of code: packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8767bd4407e700750d087a18faca58184b9bbf27ec4bad467c32fa54bf4c664e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/mvc/Collection.mjs: 480 lines of code: packages/joint-core/src/mvc/Collection.mjs has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Collection.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833857bfabad1f27a88d716aea1a427b2955679edd0b6f0551ce7fef8156338"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/g/intersection.mjs: 468 lines of code: packages/joint-core/src/g/intersection.mjs has 468 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/intersection.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf4904b01540c02b82c1d1031b9058d1aa3ac176ba91d80c9a52cb253f89d9b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/g/rect.mjs: 450 lines of code: packages/joint-core/src/g/rect.mjs has 450 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/rect.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba4da294db7db0d000baaafef8f24e66551c5f93245f357f7c177ce1bb4128"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/joint-core/src/dia/Element.mjs: 440 lines of code: packages/joint-core/src/dia/Element.mjs has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/Element.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e83c8e25a1387c64a22a667744f002dbc51b7a9b94718c342e3e811b12237"}},{"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":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9377315ccb41c7bc0c28d96435729cfbebbdbdc356c5d133620fb7c66addad8b"}},{"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":"packages/joint-layout-elk/src/types/elkLayoutOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"225bda8e25cb433d3ff9fdac3e2edafc54b5848b9d16c3bd4ca899dcbcf5e0d3"}},{"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":"packages/joint-router-avoid/src/providers/Worker.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bef466a51d42c4219c02c1e0a462e3ac8eb648e5c9664df70a6ccbd8a628b2f"}},{"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":"packages/joint-router-avoid/src/providers/MainThreadProvider.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8bc9dbc1f02f6805939e8d8fcb6005a5780dc512563eae7e34663964dc413a"}},{"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":"packages/joint-layout-elk/src/types/elkNodeOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6241e7972bbed93e4a0d0ea69a6af075374800c59ad461697bb634b4afad3c3"}},{"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":"packages/joint-layout-msagl/src/utils.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03446357a172aa9864a237aa4235dadbc11674a8924fa5fe79bc170bc2c07879"}},{"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":"packages/joint-router-avoid/src/providers/WorkerProvider.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c80dbf09c9762a55bdc1050e4bd3f58ca96db72d61c77c8bfc95eb5722016"}},{"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":"packages/joint-decorators/src/parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76363726aa19502e658261f4f05a083ff8bf3f9d62ab5b42870a9d24522d6926"}},{"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":"packages/joint-router-avoid/src/providers/Provider.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e0cff3ffb7c342a48cab8f2792d31d4c1407ea7e0b9e3367942de06d7107cc"}},{"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":"packages/joint-react/scripts/create-rollup-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332607655668558b49bc6107f29a3ca30a84926128c1a357d0c333ba2a1501bf"}},{"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":"packages/joint-core/rollup.resources.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"401122e95487b8a0fbc41ea7180d532f022a635ffa1368638054fa68e5c4aedd"}},{"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":"packages/joint-router-avoid/src/init.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8042a41e4c0e46740d52d2bdadad2b0587f010fb8ca1d9ff6e3d86ca0aabfe"}},{"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":"packages/joint-layout-msagl/src/types.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397a408202f4871bc351f8a57cd9145839d84dd44fd72da8d800a1c3ec1e6564"}},{"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":"packages/joint-shapes-general-tools/src/RadiusControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2ae27e8ac1bc485cfe29d014d393fbc2c0ea295e68941b5ccde67c29a0087"}},{"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":"packages/joint-cli/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"081f17bc5050b8b8e03c44e75a6f0955db8249d78be2ce6babe9f2ef38d715d0"}},{"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":"packages/joint-core/grunt/config/karma.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca85b4a477758a8f60530ffc6ed647982306bee1b0b7ae10ba7089dce8b34f"}},{"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":"packages/joint-layout-elk/src/types/elkEdgeOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1716e7b19778199d566df59b3a3f24683bfcfe73c2aff8868d84af7cea35cd00"}},{"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":"packages/joint-decorators/src/decorators/Model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc67d19055f822175cccff05467cb34d65fcb3007fb0cc449066f26bff3833"}},{"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":"packages/joint-core/scripts/parseDocs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be21df4ee8b70b3ee537cb97f22bec3a3314c3aab215196eeeaf4b0ce5f82796"}},{"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":"packages/joint-layout-elk/src/types/elkLabelOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27707076c6bc434290909439d227b3292e9bbc5829c59c9a6f40f47c8c83e908"}},{"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":"packages/joint-layout-elk/src/types/elkPortOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a89a7852673b332028617c6ffd08e0f9ea7df3190838d7eae71b8a20d0e08d4"}},{"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":"packages/joint-layout-msagl/src/index.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae525c1b0f4d050e5bd6a44e873b6ef2b4fc49ce43ca01b30c053cc3ebc6d1b"}},{"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":"packages/joint-shapes-general/src/cube/cube.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bc7cc661c095c81218e91c302e6cefe355bb5a8103cc701e5fa08b47ec72b6"}},{"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":"packages/joint-layout-msagl/src/defaults.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4742b246b573ccec1aa365b8b86cd4c84df834e295abb91b1f5cb8b70940c77f"}},{"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":"packages/joint-shapes-general-tools/src/CubeCornerTool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d81d35902a68f1754c5b35a63bd1122a1f23beb1c8fc3a6e9379b9dded8efc"}},{"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":"packages/joint-core/grunt/config/aliases.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd656342fcbf3b751b652aec22cb87257ccf94a55647f56d90d6f86d5523c0"}},{"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":"packages/joint-layout-elk/src/types/toNativeElkOptions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e8c776f91c9d0159983b9b713cdd6a3edcf89cfba33b77b8d154e229ffd0da"}},{"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":"packages/joint-shapes-general/src/linked-process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11482627a0abed1ea11ef397e36ab87804b5eec49e187822856051f369a68de"}},{"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":"packages/joint-shapes-general-tools/src/ArrowOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"020e6068e5fb34f684cc6e633a8dee97d5730a6addc92bf3b8ba4eba9668d227"}},{"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":"packages/joint-shapes-general/src/table/table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02fab244c88f82e521b1d4ac846708529694582edf002841b5cc31b634775ce"}},{"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":"packages/joint-shapes-general-tools/src/CylinderTiltControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3c5b7b0871a4f4f4cb2a5f1573ea47033967e912e4e78b18528be39d46ef1"}},{"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":"packages/joint-shapes-general-tools/src/DocumentOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9693e34ef1f113cf0ff8968fd756f6acf9cd50c49f97908edb8ce7146f62d3"}},{"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":"packages/joint-shapes-general-tools/src/ParallelogramOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d543150e6dc8eff8a7ee35aa49fa29ebb375cab87ae20c0a8b6251141a3e08"}},{"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":"packages/joint-shapes-general-tools/src/TrapezoidOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15202d12ae947b8b17dc0e6b85eadc841a2f4a312ba63192ae6bf825e9bdddde"}},{"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":"packages/joint-shapes-general/src/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc22c24dd4ca9f29d0227dade1c87b3c0bcfdc7bd6030057979304575a76de5"}},{"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":"packages/joint-shapes-general-tools/src/StepOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d627852ff79289cd256a8d0a9289feb7a8121f568bc3979f1e13a63e93e881"}},{"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":"packages/joint-shapes-general/src/document/document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5538ef7c70f8bf4668a110e9f295170f80ae9abe272b2f265517f560f17fd8"}},{"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":"packages/joint-shapes-general-tools/src/HexagonOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0246b2e7e9fb62d21b676bf89873497dd034688adfee22ecd63cca6dc568c3b5"}},{"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":"packages/joint-shapes-general/src/arrow/arrow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"924ea060f4aae1a4ce2bb474883d1f987b1b45aeb7752ffb7470d4f49c389e14"}},{"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":"packages/joint-shapes-general-tools/src/NoteOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c66f25450d3d4f4965ff05dd6117ea2ec5c4848a901ed9e0f311fb3a6e5255d"}},{"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":"packages/joint-shapes-general-tools/src/PlusOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23f6140a448b1263d54aecf931ae0ef4aa541a01ad18ddb593178e66b1306ef"}},{"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":"packages/joint-shapes-general/src/note/note.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aff1d4a9a03beb41934ca3a989254db034cf92337d39ff965d54b82e68933f1"}},{"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":"packages/joint-shapes-general-tools/src/TableDividerTool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df00ba9d9e14cbaf3db1bf501190ed637857736b6e7f9b3836923b6aa045f14"}},{"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":"packages/joint-layout-elk/src/types/elkGraph.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95365be7f3035a4b3a5960452ab55547ac379a9af6e906f6d041621b982a405"}},{"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":"packages/joint-shapes-general-tools/src/CardOffsetControl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5f04888338037ee55644e8b9f8199d744147e858f236f1c45268df654425e9"}},{"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":"packages/joint-shapes-general/src/mark.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa60492e6de1d8392c9a8c3cd118044833b75fafef480744971c5c7a859f43a3"}},{"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":"packages/joint-core/grunt/config/uglify.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0a5d6b3d8b2d21a0c3e1216858dbcd9d691e2cae9a2cc2079e9ce099ad9b19"}},{"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":"packages/joint-shapes-general/src/plus/plus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5523a5fbce10f1572b05fe5b0f60d54fff0dd07fac273f339ae4c81753ff3317"}},{"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":"packages/joint-layout-elk/src/types/elkEnums.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c5a4f383a27db511f6b324d24ec623fc82130a11d93b27b942e5276ac52a5b"}},{"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":"packages/joint-shapes-general/src/card/card.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"747a487326289d5f46c6095246ca649f918f44ccc94ea82c12c45efaa3d17750"}},{"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":"packages/joint-shapes-general/src/hexagon/hexagon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c9db924584c7f05b9b0951e793f98cd68cc4a29afabd359b684ca04c5623a2"}},{"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":"packages/joint-shapes-general/src/step/step.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4817cb1410e8e4df4098193d87a9d8e4f17894a69ffba7bc0dba2b73b437b63d"}},{"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":"packages/joint-core/scripts/demos.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ae082138113845d9ce8b8735ae4cac81a764a35d83f2917c090480f1c85cb"}},{"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":"packages/joint-shapes-general/src/trapezoid/trapezoid.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d31036c87bb3eeaa074c1fb9ca32fbfe5f89624b43f2e24b9c63d1e695519"}},{"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":"packages/joint-shapes-general/src/parallelogram/parallelogram.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d99b6e2f87eb8fc3562a7016291a55ca13efe1323613681c01f58823c10efe4"}},{"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":"packages/joint-layout-msagl/src/sampling.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe5ef605f4cd8953aa8db84e00fdc6ac1eeb73ee3c7117c1d170616cf50d06b"}},{"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":"packages/joint-shapes-general/src/shipment/shipment.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a485933521e2bd9fe49a28f124641cdeabba694260b062ed88ef1f83328d1"}},{"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":"packages/joint-decorators/src/decorators/SVGAttribute.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ec33790065329f71836d54ad86388835003a48927fad66a52f7519e5166fb"}},{"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":"packages/joint-core/grunt/config/copy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41aae39b28a1a059ea994151308595f4314a4802de3f1af82e83b7c7ce15d38"}},{"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":"packages/joint-layout-msagl/src/IdentifiableGeomEdge.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f25e02b61d7d8fbfd43f404d3eaf6505c11e27487fa62229c4fb94cdf89e8c"}},{"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":"packages/joint-decorators/src/decorators/View.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac9bba9ff1644928971fc1b274e5d0c05cd609b1dd3f434a8b9df575ca27328"}},{"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":"packages/joint-shapes-general/src/actor/actor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5a4215ce12996de969791bfa3565bd49dd412669a3feffb9e3f9ddeedca0d9"}},{"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":"packages/joint-decorators/src/decorators/On.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284831b2d52945840508ff2e5ddee11b322bf19a0edc64a958e3d7f06fa56e2"}},{"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":"packages/joint-core/grunt/config/concat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b75dc39edc0432366373ec13e66e624ba0a97c5e947a17a2296770bae081c"}},{"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":"packages/joint-core/grunt/resources/banner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59226863e9a02e648bdd3ed9ba0669fa06224a4212aa63e623dac6d1e55ede98"}},{"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":"packages/joint-decorators/src/decorators/Function.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e37e6ead5469f1d7ca02744e924f4db2d3f7337f8b318d518d0cdcf8784e22"}},{"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":"packages/joint-layout-msagl/src/enums.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d371785836a7a95fec5e2a7d437ad39fabf49c4424eaac96a4f60b2c9da2cc"}},{"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":"packages/joint-core/grunt/resources/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10780f5be2b130fd0f9fd29cede364f27e9a900695d511305e7514aa9841ce3"}},{"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":"packages/joint-core/wrappers/joint.wrapper.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f02db131164b99c6d1c8b604711bbee30c75d06295249f8e144ca6ea93e04b6"}},{"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":"packages/joint-layout-elk/src/elk.worker.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c0be89f9e08eabd6acf45bc6c5ae186d81cb257433ee3768803adf963a057"}},{"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":"packages/joint-core/grunt/resources/dependencies.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6210f5dcc4c4fe92e15f62a22d63c7dffd3ef0c6ad6e576bc17bf1f68e0d3183"}},{"ruleId":"R6","level":"warning","message":{"text":"Type errors in this package cannot fail any build or CI step: \u0060examples/tree-shake\u0060 is TypeScript, but a type error in it cannot fail anything this repository runs: its \u0060analyze-S\u0060 script (\u0060ENTRY=S vite build\u0060) compiles TypeScript with a transpile-only tool that strips types without checking them, and no script, config or CI step of the package runs \u0060tsc --noEmit\u0060 or another type checker over it. Add a type check that can fail \u2014 a \u0060typecheck\u0060 script running \u0060tsc --noEmit\u0060 (or \u0060vue-tsc\u0060/\u0060svelte-check\u0060) that CI or the workspace pipeline runs, or a build step that checks before it bundles."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/tree-shake/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa33b7e7a0d7968771bbeaf4afc8adc5ec3811bf91b88c3c34d62d392b4f8be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (280 application, 79 tooling, 259 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/stories-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd8d9d41db6ac5aeb10d8027c6d211d2c6959bc86bb9bcb6504e93ed122b96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_everySidesOptionIsListed\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/elkOptions.mts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0717578d915e2496874f7903d0daf71207ebb2861020110e5954e284c3298d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_everyPointOptionIsListed\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/elkOptions.mts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"008fe846bd20e906332473fa3f7d974bd9eb84d5917419389fb4ab9206780282"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_everySetOptionIsListed\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-layout-elk/src/elkOptions.mts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1cd67215edea2a4eff7df0ad523fe731dfb0b7c164930698476ef72d439fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027selectCellLayer\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/selectors/cell-selectors.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb6f3eee468e4ceca60551c25a9749da5a3122beb444d787b682ee84f99808e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027selectCellZIndex\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/selectors/cell-selectors.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6d7507092b81df179acdb3ea2c4f4a5b5908b42bcd45e1878420e15ebaa4fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MapAttributesToElement\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/state/data-mapping/element-mapper.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"12028596e622fe7b8e0bd8a19ffc2270d7e34292be9a6cff7ff45779b9622307"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MapElementToAttributes\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/state/data-mapping/element-mapper.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"784772fb29db07a1e529b7a0379f47e9ff944feb1a93a1e974651b2b44a54851"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MapAttributesToLink\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/state/data-mapping/link-mapper.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0763d9689fe7265f331d9b10aebc28e02752355cda15b439338e4b0fb8da2883"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MapLinkToAttributes\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/state/data-mapping/link-mapper.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a3aa43b87f046797bf8884ed7e6f74bbe5b9d37ec435333aaad6c3808f6ef0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027makeOptions\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/joint-react/src/internal.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/joint-react/src/internal.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/utils/object-utilities.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa22757264ced24044eaedc94a639f6717e1480a94177d6e6ffa9ddffbf6465"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAPIDocumentationLink\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/utils/get-api-documentation-link.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d905b13964e6da400e06cbd8f526e70a0893476ef74eaf440118161c7f91a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAPIPropsLink\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/utils/get-api-documentation-link.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b619437c77dbb622f7ed63282260b1ba2d02d7c7be34273ef15ee5a8f0f16e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FallbackRouteAttributes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aa790c371dae7b545d32f70fc9cd0d2028707aa27096f4b3aa9e121e70dab0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isElementAfterObjectSet\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f9dfec63ede56e0ed55655507ac96978bc3e28b8d2848c586cbd1c3e5c4d67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027portLabelPosition\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c025c071aa4897614ca9902ae94fe5f0a2f58bcf9b6a3f98875aee5a0b315f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027eventOptions\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4945497534d77248541e4c8eba891d1aa5634a75b1ce66ab301cf025269c8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isHTMLView\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1353fb3f7279ea21581a6ed7acf7e147628526190b9646da58e3570b05e847"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isSVGView\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"660c8269a2fa1835d82da2996003c931c33a7b5e7ebb75bf5286a4ef13a8039d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isTypeofSize\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a78bca3e28f0014b08dcb4e446c14bd34cfd1fc4d2f4942bc3105e5e8aa69"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isTypeofPoint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e66005fd1b9c7cfbed41aca67a13a675dee265cfc7b8fbb59691b48df08c1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AttributeHighlighterView\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/index.test.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48988a3f037c99bfe8dc523b833527f3988de85870acea2b844e155dd26a500"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isRectangle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/shapes.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"465b3d078d671674b3ebfc4025bd94f2ef8e41bfae398872bd5036f00d2d34a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/shapes.test.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f905d3e2d6ab0d07831f227e13da8e955541053f25d3fb43dca914cd56d15"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isMask\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/test/ts/shapes.test.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e51fe78fd509fe7dc27b338857f2caa01082e0d4d53e3aaa56928db4b945849"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027cheerio\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/scripts/parseDocs.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"73101ae461ecbd691b0ebf7aa07e98435438eb056c076be6afd401c497f71cb3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027async\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4edc5c0eeb2c19285203ed59b81712b7d7ed3abfe5394cb7addd88a365adc4"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-contrib-clean\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"320d0d9d231b8545b0761d7d97ae1001b28883b59fdbc1cd234ab65917aee2b5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-contrib-concat\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341260d388a6c9f4db5652dd9ddc0dc8cbc62de34dce8d0e2ec305e1f8b1966"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-contrib-copy\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa34abe7ef1b9e90e215178b0a59e64e5950db73152756ff64c12b66e6bb6150"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-contrib-qunit\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdfbb000a94febfdf890c673f3e71a9bde72079d99442c40393f22472fba3c1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-contrib-uglify\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"804623f11f61d05dd1d35a4e5b9eccbe77700eb0423188d6bf368f68512c8756"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-karma\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90afc740f9f4056e9b7309300f572638a88e24384cd1e4aa5d242adfee5a11a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-newer\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"754e9bab068229fba052eee1e636293da1d7e71c4ecba2aec47a3553638e0f46"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027grunt-shell\u0027: Declared in packages/joint-core/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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/package.json"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b372562cb2916f99879ea346bbc5b952ce4cf3c0514445b15606635664c92b"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/joint-core/src/dia/GraphLayerView.mjs \u2192 packages/joint-core/src/dia/Paper.mjs \u2192 packages/joint-core/src/dia/GraphLayerView.mjs (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/GraphLayerView.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc3bfc83c10f05c72c3e320f68a4379bec692f40734dde8372c7edc5bd1a526"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/joint-core/src/g/ellipse.mjs \u2192 packages/joint-core/src/g/rect.mjs \u2192 packages/joint-core/src/g/ellipse.mjs (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/g/ellipse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fa68457608aecd30b2b39bcaf3c1c83f3cb722f23cb4b3c244fc3435194eda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connector.sourceId === undefined || connector.sourcePinId === undefined || connector.targetId === undefined || connector.targetPinId === und\u2026\u0060 appears character-identically in 2 files \u2014 packages/joint-router-avoid/src/providers/MainThreadProvider.mts, packages/joint-router-avoid/src/providers/Worker.mts. 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":"packages/joint-router-avoid/src/providers/MainThreadProvider.mts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"750b48e0cc17d4ca6bea5f97795578fe4c1e7d6efda2140605bc4a1d75f0b31a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060link.source?.id === removedElementId || link.target?.id === removedElementId\u0060 appears character-identically in 2 files \u2014 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx, packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-zustand.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-redux.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35716bab43e942d84b3ca5cbe2df744e8277b16ff96d9cb2ddb9bf4d7560fac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060originalIndex !== -1 \u0026\u0026 index \u003E originalIndex\u0060 appears character-identically in 2 files \u2014 packages/joint-core/src/dia/Graph.mjs, packages/joint-core/src/dia/Paper.mjs. 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":"packages/joint-core/src/dia/Graph.mjs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"e414e18dc463b15032a9f23c2c27244e234a47a233f10c42a14c9a91b70a312f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source?.id === removedElementId || target?.id === removedElementId\u0060 appears character-identically in 2 files \u2014 packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx, packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-peerjs.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/stories/tutorials/step-by-step/code-controlled-mode-jotai.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb76140e5f10394186d14d864911f3f60bd9b6194929b641ff6e3e7b29f5546"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start.equals(control1) \u0026\u0026 control1.equals(control2) \u0026\u0026 control2.equals(end)\u0060 appears character-identically in 2 files \u2014 packages/joint-core/src/g/curve.mjs, packages/joint-core/src/g/path.mjs. 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":"packages/joint-core/src/g/curve.mjs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5afe192e7eab5377962b6c2e2064b2528dd1a8bcd6081fc12a7dc55e7a6ee3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tangent.vector().vectorAngle(new g.Point(1, 0)) || 0\u0060 appears character-identically in 2 files \u2014 packages/joint-core/src/cellTools/Button.mjs, packages/joint-core/src/cellTools/HoverConnect.mjs. 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":"packages/joint-core/src/cellTools/Button.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfea57873e71588a6b3f69b5fa41600f9b179fd8a7607fac79d560bb420e6eb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tangent.vector().vectorAngle(this.xAxisVector) || 0\u0060 appears character-identically in 2 files \u2014 packages/joint-core/src/linkTools/Arrowhead.mjs, packages/joint-core/src/linkTools/RotateLabel.mjs. 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":"packages/joint-core/src/linkTools/Arrowhead.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8a8db94769ea0ff3039cf2102400f9ca11cbac10691a385a285f1a2768c32d"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDemosConfig: \u0060fetchDemosConfig\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/src/lib/github.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"32015f5d35a892dc6e9f3962b7dcaa7f22f2e05793beebecdcb011726b4ce057"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listDemoFolders: \u0060listDemoFolders\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-cli/src/lib/github.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b7e7d6646b4e64d8d5a18abffe07cc99ae7512c03b7cd5889ede385cb565da"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060html\u002B\u0027\u0027\u0060 is text this program did not author, and it is written into the text of an element through the DOM library\u0027s \u0060.html()\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/dia/attributes/index.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2247aa409e32d65779b6a087a04e7c64db6664b1bb4802f97032d150d02f8299"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060string\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/Dom.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcf73023b99765f9e7a1831ed99f91fbd3451885236c62014761c33dd90e335"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060html\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-core/src/mvc/Dom/methods.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d273a151892755319d565c714d70511bc50c2bef8a95f294eb22353b3e96d50"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060string\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeHTML.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc5e3218740a573e84b4dc86460ef9ee53ff6fc9b4eaca94559b4ef21755c5d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/RouterService.mts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2154bc2fc1d699b76141780d645eeb57a5ce060d7353c50dc059ba179437b16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/providers/WorkerProvider.mts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"071e9c9dc7ffe11f36d3f443283b803456f2a69e38dc2f70d5e52a54f7217d7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-router-avoid/src/providers/WorkerProvider.mts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21aed032102b1f9719990c448c2d64bea90b470bb08c33cb86d9728f1ef3fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/presets/paper.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"470f60cae9553ef9a49c849e95df2393abc6f987a9d46c87c83c8a4a60f24d4f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-react/src/presets/paper.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5403eed7b53542fdd257e2b85ed13c808c23502ffc18fb33a0449c77ef855065"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 16/34 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~1.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 47 assertion(s) across the 26708 source line(s) of the 209 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/joint-react/src/store/graph-projection.ts (13), packages/joint-router-avoid/src/RouterService.mts (9), packages/joint-router-avoid/src/providers/MainThreadProvider.mts (7). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getDefaults\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/joint-sanitize/src/sanitizeGraph.mjs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f43f6346ca830c506e65e25028ef505b005aa1ae6bed2c3db1502d0caf1320"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-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-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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":71,"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."]}]}