{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"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":"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":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"Unit.createUnitClass (cyclomatic 288): Unit.createUnitClass has cyclomatic complexity 288 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 228 belong to 44 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0a7ab26c8563e5ffd9144b1eb1593a76e7755d5f7e921ec02285828cc1d38c"}},{"ruleId":"D1","level":"warning","message":{"text":"DenseMatrix.createDenseMatrixClass (cyclomatic 112): DenseMatrix.createDenseMatrixClass has cyclomatic complexity 112 (threshold 15). Most of this is not in the body itself: 9 of the 112 points are its own statements and the rest belongs to 26 function items inside it that branch (a function literal at line 875, _set, a function literal at line 685, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae59aeea034911dcdf8f2c8e8142acfe5577b39e881dc740d82a07c99096a23f"}},{"ruleId":"D1","level":"warning","message":{"text":"distance.createDistance (cyclomatic 106): distance.createDistance has cyclomatic complexity 106 (threshold 15). Most of this is not in the body itself: 1 of the 106 points is its own statement and the rest belongs to 16 function items inside it that branch (a function literal at line 139, a function literal at line 85, a function literal at line 104, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2442e6959bc46e366545383c06d530df98e11eff09998ce43e10a916d78a935"}},{"ruleId":"D1","level":"warning","message":{"text":"simplifyCore.createSimplifyCore::_simplifyCore (cyclomatic 86): simplifyCore.createSimplifyCore::_simplifyCore has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e408cfc71779b81c81e2930807c09fdf8ebf2ee5b0d0dd33bc7eebb90fb3dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_simplifyCore (cyclomatic 86): (anonymous)::_simplifyCore has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c9bd9521679f32ec959e6b4df016b0e96ec216e8794e1036815670cda3d1e8"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorNode.createOperatorNode (cyclomatic 82): OperatorNode.createOperatorNode has cyclomatic complexity 82 (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 (OperatorNode.createOperatorNode::calculateNecessaryParentheses) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d181774e7a84803721f6200ed83738ff3c65e839d566b556c8769344340e2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionNode.createFunctionNode (cyclomatic 82): FunctionNode.createFunctionNode has cyclomatic complexity 82 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 38 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eddd691127ba1a29cfb5bf3aaeb5f42e765e3730d266fa683e2853c6f0c4de6"}},{"ruleId":"D1","level":"warning","message":{"text":"derivative.createDerivative (cyclomatic 82): derivative.createDerivative has cyclomatic complexity 82 (threshold 15). Most of this is not in the body itself: 1 of the 82 points is its own statement and the rest belongs to 13 function items inside it that branch (a function literal at line 232, a function literal at line 588, a function literal at line 133, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53fde1d4b28cc332451af84baeeffba2d4608400bbfabf1471ccffbe22b2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 82): (anonymous) has cyclomatic complexity 82 (threshold 15). Most of this is not in the body itself: 1 of the 82 points is its own statement and the rest belongs to 37 function items inside it that branch (_compile, _toTex, expandTemplate, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ddd0a30753b9fa397da456ada1fa56373ca65a2fb6386945fbf17077eca921"}},{"ruleId":"D1","level":"warning","message":{"text":"simplify.createSimplify::_ruleMatch (cyclomatic 52): simplify.createSimplify::_ruleMatch has cyclomatic complexity 52 (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: 2 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::_exactMatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"3262b30257317d8804b124015616c70a0f4331e0972b7e44acb6b95113644c9e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_ruleMatch (cyclomatic 52): (anonymous)::_ruleMatch has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b77da517aadc98a1486f31d47ea185ec35d28b169cd462b77aaf47e50ea98d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ConditionalNode.createConditionalNode (cyclomatic 51): ConditionalNode.createConditionalNode has cyclomatic complexity 51 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcbc12c9593e9a9bdb9e71a1c0613691f0dd22ae75c8003df92664f907b2eab"}},{"ruleId":"D1","level":"warning","message":{"text":"rationalize.createRationalize::polyToCanonical::recurPol (cyclomatic 49): rationalize.createRationalize::polyToCanonical::recurPol has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rationalize.createRationalize::expandPower) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d472a7d0d3c4a357e8cc62139ab4899a25c46af4dc95106313ce81a323f59d3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::polyToCanonical::recurPol (cyclomatic 49): (anonymous)::polyToCanonical::recurPol has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"418ee49cc6c99bb2f10e088bc8e732bde914241a8a75a1390e0056c200e9432f"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.createParse::getToken (cyclomatic 48): parse.createParse::getToken has cyclomatic complexity 48 (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: 2 other methods here (parse.createParse::parseBlock, parse.createParse::parseAccessors) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e676ea762616b58ec109a4b60f9d0470ff11a1f0c1d0334ec267a5ea678d4b53"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::getToken (cyclomatic 48): (anonymous)::getToken has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"011d3915ccb094786d5dbb9dcb977db0db150b4828f99f7d7b884ee944a5beb1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::FunctionNode, function (cyclomatic 48): (anonymous)::FunctionNode, function has cyclomatic complexity 48 (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":"src/function/algebra/derivative.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f039fc40963425231fcf6a1a5a6e3a59d40b4e2d16e98d1fdf3cdc008e8cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorNode.createOperatorNode::calculateNecessaryParentheses (cyclomatic 46): OperatorNode.createOperatorNode::calculateNecessaryParentheses has cyclomatic complexity 46 (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 (OperatorNode.createOperatorNode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e19a800679e05497e5f1534e20a94cf791613e6f6ca867672a490b4d2b10bf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::calculateNecessaryParentheses (cyclomatic 45): (anonymous)::calculateNecessaryParentheses has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43c0743909b9b14090329f0e756a1fba852dd9eff4fe75d48874c64897b8204"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::createUnitSingle (cyclomatic 43): (anonymous)::createUnitSingle has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"828bef16d2a9d2326350b39f6b29e81d1857a14958ab86a3d6eddaede8aac9a9"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionNode._compile (cyclomatic 41): FunctionNode._compile has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 14 of the 41 points are its own statements and the rest belongs to 9 function items inside it that branch (resolveFn, a function literal at line 227, a function literal at line 257, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9040d1f74871e2e87e3e8fe5311eb31e90510a4c3632fe9fbdcf3c3842488d"}},{"ruleId":"D1","level":"warning","message":{"text":"createRealSymmetric (cyclomatic 41): createRealSymmetric has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 13 function items inside it that branch (sorting, diag, diagBig, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a29b9eb8b784848e54e659595d28bd2cc6a317322eb05c21f58b05c22e813b"}},{"ruleId":"D1","level":"warning","message":{"text":"solveODE.createSolveODE (cyclomatic 40): solveODE.createSolveODE has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/numeric/solveODE.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d9cf60e959a40f2617eed390eb95e931bfdfd70bb146a7a01b9ec381790c87"}},{"ruleId":"D1","level":"warning","message":{"text":"RangeNode.createRangeNode (cyclomatic 40): RangeNode.createRangeNode has cyclomatic complexity 40 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a3ec641c9fbaea96306e9b6a28be432ceab2ac6a63589eb14f354ce48250d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::Object, Object (cyclomatic 40): (anonymous)::Object, Object has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bfd450bb3c4dc787ecc220272490b46eacbb472dbd55916ee1c15aa7a38f94"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 40): (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 23 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/numeric/solveODE.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7370ec4f32edae939fb66256df7d34c7d49b007c5968deae60ccc104b2c3c50"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 40): (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 16 function items inside it that branch (calculateNecessaryParentheses, _toString, _toHTML, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f67bd43191e77509bc27873eb075b28631516a29b6b17febb6800ff0a11d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"simplifyConstant.createSimplifyConstant::foldFraction (cyclomatic 38): simplifyConstant.createSimplifyConstant::foldFraction has cyclomatic complexity 38 (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 (simplifyConstant.createSimplifyConstant::_foldAccessor) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdcc91c8ef5d6d43cbf40ed87c17a31b44545ddfa3a482a270d828d8f011fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::foldFraction (cyclomatic 38): (anonymous)::foldFraction has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a060542652d60dfc631a0ddcd0470c2a86e2bde2c891973531e2f6917261572"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentNode.createAssignmentNode (cyclomatic 36): AssignmentNode.createAssignmentNode has cyclomatic complexity 36 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01d5689282a3c28314f179535983227d2a1c75e6c225552f2b806315c0ef6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"intersect.createIntersect (cyclomatic 36): intersect.createIntersect has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 10 function items inside it that branch (_AAAA, _coerceArr, _4d, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/intersect.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa73617285623da17b3b7f97798e7e60f2b26125bc7c28da4749dbc14e1a1ede"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 36): (anonymous) 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 18 function items inside it that branch (constructor, _compile, _toString, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2922e8cf0e71877560db649299418ac1bcab6bfe1c625c26b2567367f56aca35"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 36): (anonymous) has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 13 function items inside it that branch (_AAAA, _coerceArr, _4d, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/intersect.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"226503079ad2f561df9f73c684e097bdcf8aa9a920d8d901553b8eabe81280ed"}},{"ruleId":"D1","level":"warning","message":{"text":"simplify.createSimplify::applyRule (cyclomatic 35): simplify.createSimplify::applyRule 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. This shape REPEATS in the file: 2 other methods here (simplify.createSimplify::_ruleMatch, simplify.createSimplify::_exactMatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b7f60371a4bcfa7406bcf71af3340585105b46b2b365c633c8a4eb4278653a"}},{"ruleId":"D1","level":"warning","message":{"text":"map.createMap (cyclomatic 34): map.createMap has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 14 function items inside it that branch (_mapMultiple, mapMultiple::iterate, _getCallbackArgCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba9d5ab0e7da6ae30a8fb1915337d1825f85456c0558f2f8aad427d0115c1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::applyRule (cyclomatic 34): (anonymous)::applyRule has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7163d764164de49d26f5270ec393c2b67a82e5e49d423548e8ebcfab28392ed"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 34): (anonymous) has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 26 function items inside it that branch (_mapMultiple, mapMultiple::iterate, _getCallbackArgCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd38c0c255d00c7d8e905050ce43592506803c62ecefe32d3896f07be5f61f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 34): (anonymous) has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 16 function items inside it that branch (Index, _createImmutableMatrix, size, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2303ed5473958e358328325b3fcfac2070d407b6ed013e245360b13c9ca5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo04xSidSid.createMatAlgo04xSidSid.matAlgo04xSidSid (cyclomatic 32): matAlgo04xSidSid.createMatAlgo04xSidSid.matAlgo04xSidSid has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b22ce187a244c4ee082e516b182345d012052a9ebe69b688d721ecb4bd5e67"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matAlgo04xSidSid (cyclomatic 32): (anonymous)::matAlgo04xSidSid has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee61661cbc0bb90e8538abe050ea17fb977d56edb4d52c9104bb495a9d8595"}},{"ruleId":"D1","level":"warning","message":{"text":"typed.createTyped (cyclomatic 31): typed.createTyped has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 19 function literals inside it that branch (lines 401, 420, 174, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04eb1b90c495fa4faafdbc7eec2459613950216aa6a1f3721c78ea0c353f99a"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo05xSfSf.createMatAlgo05xSfSf.matAlgo05xSfSf (cyclomatic 30): matAlgo05xSfSf.createMatAlgo05xSfSf.matAlgo05xSfSf has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d91a0a5ca79af024a7e6071e83ca5ec7b00dafc7b630660b8dcb7a50ce149e"}},{"ruleId":"D1","level":"warning","message":{"text":"RelationalNode.createRelationalNode (cyclomatic 30): RelationalNode.createRelationalNode has cyclomatic complexity 30 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92ee89d3164014d705facb5e42ed470986ae93be3e04d1acaadac52fac04fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 30): (anonymous) has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 18 function items inside it that branch (_toString, a function literal at line 126, _toHTML, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e4d77893b51e809c7955f02398feacd4725513cd5681fd8964f2ea46e6f161"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matAlgo05xSfSf (cyclomatic 30): (anonymous)::matAlgo05xSfSf has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2706b6e2dc2a2c16331b2ccf7795a4f0e957a20f47ca2dd707de9c92474f060"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrime.createIsPrime (cyclomatic 29): isPrime.createIsPrime has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 67, 37, 52, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/isPrime.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a351f788964f512750c413ef912b684ad1ace31781ec7e62a7f5412ff8f068"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessorNode.createAccessorNode (cyclomatic 29): AccessorNode.createAccessorNode has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (needParenthesis, a function literal at line 106, a function literal at line 123). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a315568978ec003796a8d847fece2f313d1bbc950b06fc5aacae1c4b044193f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parse (cyclomatic 29): (anonymous)::parse has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df528c563dd38075c8d2627532f115f1236f4dcd7b2b8708ab7417592d0b8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 29): (anonymous) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 15 function items inside it that branch (needParenthesis, _compile::evalAccessorNode, _compile::evalAccessorNode, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee818fb83f35c8a8a0bdbef912f8cd95016cb9d8e2dc2bf010152945bb7beac"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionAssignmentNode.createFunctionAssignmentNode (cyclomatic 28): FunctionAssignmentNode.createFunctionAssignmentNode has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa660caa48bd43ed11b0a81a012d0a6eb5e369b7d02620627bacb5197d0c34af"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorNode._toTex (cyclomatic 28): OperatorNode._toTex has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7979ea4416dce29bffeb84bde9a7f35d8eff5bb3d6de9f7023bd212978d1e29"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 28): (anonymous) has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 18 function items inside it that branch (constructor, _toHTML, _toString, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2fdfcba49966a6efc455122b6bf60eab19bccc2d1123ce9c816d2cbf40e42d"}},{"ruleId":"D1","level":"warning","message":{"text":"norm.createNorm (cyclomatic 27): norm.createNorm has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 9 function items inside it that branch (_vectorNorm, _matrixNorm, _norm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee8bae6b8becfa5a78432d3c4a7b6c28516b120346317d439819098dad85486"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_toTex (cyclomatic 27): (anonymous)::_toTex has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7335e7a758e9593d4ec21a8797fa52888374692df5712faf1b57077623daa5c9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 27): (anonymous) has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 22 function items inside it that branch (_vectorNorm, _matrixNorm, _norm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"399413d930a361fe7680ed455f17c19a6edc72dd444354f43e3b71c64f141cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.createParse::parseAccessors (cyclomatic 25): parse.createParse::parseAccessors 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. This shape REPEATS in the file: 2 other methods here (parse.createParse::getToken, parse.createParse::parseBlock) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ee49cf569f699d1aa074dcc76bf92fba11dd55ab2cd317d5edf263db43fc15"}},{"ruleId":"D1","level":"warning","message":{"text":"lup.createLup::_denseLUP (cyclomatic 25): lup.createLup::_denseLUP has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d2270aace56e056fd4132792331a3dc968cc245bb818bc8fa88eb02c7892e3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseAccessors (cyclomatic 25): (anonymous)::parseAccessors has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccbe6b36bf5aa0842ea4d07de3634559a394f684581fd7ec4cf3be5ab4d3c5a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_swapRows (cyclomatic 25): (anonymous)::_swapRows has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d175bc1a4baa71a9f67b25b1d479debdaee834e2b375ac44f8c4c7bb38eb4d0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_denseLUP (cyclomatic 25): (anonymous)::_denseLUP has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c5747545ec76eab3b5dc0bb00158814664a6837d19b68d56ca2e618c2e4deb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 25): (anonymous) has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 12 function items inside it that branch (_findMinimumNode, extractMinimum, _decreaseKey, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1667a8b105e733ecfd2298eda220f8ae3d86cb722e4fa32876ba9da32650f26"}},{"ruleId":"D1","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cyclomatic 24): multiply.createMultiply::_multiplySparseMatrixSparseMatrix 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. This shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c682f7c3d4aa843592cdb0647624f264e6d1f2bf282b89243cebdd6f2f463352"}},{"ruleId":"D1","level":"warning","message":{"text":"bitwise.bitOrBigNumber (cyclomatic 24): bitwise.bitOrBigNumber has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4e5133bcde95345963c2756a4491b521b4ce8c4efd6d6d3d677860ad65fd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"solveValidation.createSolveValidation.solveValidation (cyclomatic 24): solveValidation.createSolveValidation.solveValidation has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/utils/solveValidation.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b807ae67ebdc912ec6620df9bc7085ddd6093fcddb36415236e58951bb29aa"}},{"ruleId":"D1","level":"warning","message":{"text":"FibonacciHeap.createFibonacciHeapClass (cyclomatic 24): FibonacciHeap.createFibonacciHeapClass has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 7 function items inside it that branch (_findMinimumNode, a function literal at line 98, _decreaseKey, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69662930649674e0f39e8a07a6b5cbe39de3d882ed588ba26b3a7495accb97b"}},{"ruleId":"D1","level":"warning","message":{"text":"dot.createDot::_denseDot (cyclomatic 24): dot.createDot::_denseDot has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1faf3687de1beb243489d9ee47689ee90d32c8f9be6d7d3b9d134624470767"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorNode._toString (cyclomatic 24): OperatorNode._toString 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":"src/expression/node/OperatorNode.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b979918a767676ac5d8f087b7e849fc7b1b306b387b2c1b87feb020f16c67812"}},{"ruleId":"D1","level":"warning","message":{"text":"simplifyConstant.createSimplifyConstant::_foldAccessor (cyclomatic 24): simplifyConstant.createSimplifyConstant::_foldAccessor 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::foldFraction) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"db631a5291ab551f3135b58da4c43dfd5bc14093ad9fddf096a3ed40bbfd735d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixSparseMatrix (cyclomatic 24): (anonymous)::_multiplySparseMatrixSparseMatrix has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aa0749257b5122944b227683ff83506fcce11b4984a90105f6f4d19e9644fb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_foldAccessor (cyclomatic 24): (anonymous)::_foldAccessor has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5748cf0be6af172754900e328ce621df8e618bfcfac560407b7c51b233f8092"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 13 function items inside it that branch (ImmutableDenseMatrix, subset, min, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/ImmutableDenseMatrix.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f492078ce9f4211217cc4937b967d77be231fc64fafe91ea4733fc8b6b00789d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 6 function items inside it that branch (format, fromPolar, compare, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/complex/Complex.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be4a1e6753b058330d4a69a42ab5bd5afc71b533457f8ffecb32bd1a097a839"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_denseDot (cyclomatic 24): (anonymous)::_denseDot has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8748a3af7f8bae9e0bac5409c10ed0b5e703670952bc1c0c34c7fe5de475b16"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass (cyclomatic 23): SparseMatrix.createSparseMatrixClass has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (SparseMatrix.createSparseMatrixClass::_resize) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"59501737e21d5ffb92793aa5cc46619cc4898daa24649dc56afdddd0f71de8e1"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo06xS0S0.createMatAlgo06xS0S0.matAlgo06xS0S0 (cyclomatic 23): matAlgo06xS0S0.createMatAlgo06xS0S0.matAlgo06xS0S0 has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8f366201624105f319a332ac52ce63ef2a2ae20952e10af8fa496d9f2803b7"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo09xS0Sf.createMatAlgo09xS0Sf.matAlgo09xS0Sf (cyclomatic 23): matAlgo09xS0Sf.createMatAlgo09xS0Sf.matAlgo09xS0Sf has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo09xS0Sf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd9d57f764bb65114780574c06886a371d9e223bda4c47f077a8974b353b1b"}},{"ruleId":"D1","level":"warning","message":{"text":"bitwise.bitAndBigNumber (cyclomatic 23): bitwise.bitAndBigNumber has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa790c44253b830b89935b46a2c3785e162d9e7591bf76406483b95e045a55f"}},{"ruleId":"D1","level":"warning","message":{"text":"compareNatural.createCompareNatural::_compareNatural (cyclomatic 23): compareNatural.createCompareNatural::_compareNatural 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":"src/function/relational/compareNatural.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0789e2baf84b4ceb9312b4eb778384b14661859a374bc4d13a980322a42dbd2f"}},{"ruleId":"D1","level":"warning","message":{"text":"pinv.createPinv (cyclomatic 23): pinv.createPinv has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 58, _rref, a function literal at line 105, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdecf0b749a72ad3b5da0a66c426e2658a142902d17bc51e62a761e777e673dc"}},{"ruleId":"D1","level":"warning","message":{"text":"complexEigs.createComplexEigs::iterateUntilTriangular (cyclomatic 23): complexEigs.createComplexEigs::iterateUntilTriangular has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5f413394d4adb749f44af03a412f226fda17c9b0af4807e2a2d08d69ae6209"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_toString (cyclomatic 23): (anonymous)::_toString has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165abbdcd638ae23cdfaf998e5ec302872028948695e89858f2f24a472edf7a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::OperatorNode, function (cyclomatic 23): (anonymous)::OperatorNode, function has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f89d45228d395babc763ebb60bf5df4524dcdc28807db4fac47f3c5c52ce2f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_compareNatural (cyclomatic 23): (anonymous)::_compareNatural 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":"src/function/relational/compareNatural.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"568bdfdccaff83cb24985f1c3fa49351beba706f541be721c8cb42421d1ea030"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 23): (anonymous) has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 10 function items inside it that branch (Array | Matrix, _rref, any, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1261cea0f2ec7bb9c5cab1d32074f77b4bda2868e74bc59707742df5a8598bf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matAlgo06xS0S0 (cyclomatic 23): (anonymous)::matAlgo06xS0S0 has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af10f2ea770978b9335f4cfbb4b196ae51e54b8c60ee105bd0d8ac0eadc3ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.completer (cyclomatic 22): cli.completer has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"bin/cli.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2101abf24ca74e805b454d38522739490d67b323c4a67e2b6ecb18c9629dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Range.createRangeClass.Range (cyclomatic 22): Range.createRangeClass.Range 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":"src/type/matrix/Range.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89d10da83bde0ee9ee0579f2ed91fb2786eebd178c61d883d422c8a12c17142"}},{"ruleId":"D1","level":"warning","message":{"text":"resize.createResize (cyclomatic 22): resize.createResize has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 41, _resizeString, a function literal at line 52). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/resize.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"49139e188ad3a559c29f5a2793c69a9eee4b5533fe6ead0ac31267a76e61e3f1"}},{"ruleId":"D1","level":"warning","message":{"text":"pow.createPow::_pow (cyclomatic 22): pow.createPow::_pow has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/pow.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbd47acdb833197699adebf82fa347279901885afe427e2d75746f693eb8af"}},{"ruleId":"D1","level":"warning","message":{"text":"MatrixIndex.createIndexClass (cyclomatic 22): MatrixIndex.createIndexClass 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 9 function items inside it that branch (_createImmutableMatrix, a function literal at line 130, a function literal at line 146, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ef69007a95cf25420ac72598c4d5ba4c628515d209a03467bcd74b7a25f92c"}},{"ruleId":"D1","level":"warning","message":{"text":"import.importFactory.mathImport (cyclomatic 22): import.importFactory.mathImport has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to one function item inside it that branches (flattenImports). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/import.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf499cd78805540d3705bb39ab0169b5fdd4238df94d37e59dfed34ad2b34df"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::Range (cyclomatic 22): (anonymous)::Range 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":"src/type/matrix/Range.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9ca9d2327dc61734a45b690c55c75d6ead4efc89b856c7a93460052b5f8d6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_pow (cyclomatic 22): (anonymous)::_pow has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/pow.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0f62acaa3f23c7b848d70670f187e699721f31492557751f77e6129a3a6ed"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runStream (cyclomatic 21): cli.runStream has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 203). 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":"bin/cli.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc23a47f7508fa571205bfaab2d956e3a289dcdd413707220bde26db073885"}},{"ruleId":"D1","level":"warning","message":{"text":"matrixAlgorithmSuite.createMatrixAlgorithmSuite.matrixAlgorithmSuite (cyclomatic 21): matrixAlgorithmSuite.createMatrixAlgorithmSuite.matrixAlgorithmSuite has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae650630c575b9b0dd7366c516392318c5c0aa66b57536837a128de3fe0d6fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo08xS0Sid.createMatAlgo08xS0Sid.matAlgo08xS0Sid (cyclomatic 21): matAlgo08xS0Sid.createMatAlgo08xS0Sid.matAlgo08xS0Sid has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6176d99bbd94fc039ee018e389bcccf03dd2a1e8ee26d87760779941cb921be3"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectNode.createObjectNode (cyclomatic 21): ObjectNode.createObjectNode has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ObjectNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d61feae6b252c1de0e2a94097067ceaa2c2fc1a879598662ac2fd75bbaaa0a1"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatorNode._toHTML (cyclomatic 21): OperatorNode._toHTML has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"199045695f0d076bbe5c5726134aa93d91021bc9c745ecfe537aa4cb62bb308e"}},{"ruleId":"D1","level":"warning","message":{"text":"det.createDet (cyclomatic 21): det.createDet has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function items inside it that branch (_det, a function literal at line 40). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/det.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe3fbf8fceee3ccb67a6cf5ea4c0d97c342c0411ada7bfe4d564b368294e8c"}},{"ruleId":"D1","level":"warning","message":{"text":"eigs.createEigs::coerceTypes (cyclomatic 21): eigs.createEigs::coerceTypes has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99a3d0849c914666868fa59b372eaffe79e5fdea7408824b4118fd34334292c"}},{"ruleId":"D1","level":"warning","message":{"text":"stirlingS2.createStirlingS2 (cyclomatic 21): stirlingS2.createStirlingS2 has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to one function literal inside it that branches (line 79). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/combinatorics/stirlingS2.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"396edfe9f86c9705738c2706e16ec306c641250beda0ca917b5d1b961f21bbbf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::coerceTypes (cyclomatic 21): (anonymous)::coerceTypes has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"534fed00c914c7961640b62cce702c10f80d2e3d574683ca1dee5abd66461f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matrixAlgorithmSuite (cyclomatic 21): (anonymous)::matrixAlgorithmSuite has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"927ce357273546af1df004f11e000889545740a421c728902906b968d23811fc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 13 function items inside it that branch (constructor, _compile, _compile::evalObjectNode, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ObjectNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63d5c7a1913ef422f5a48dc3e75716a621f58a8445668f743b3425f1c81a106"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::matAlgo08xS0Sid (cyclomatic 21): (anonymous)::matAlgo08xS0Sid has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d24c9362867bbab0c2d44306a95a01f19736f37adcb802a8b6240cae0d89bc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function items inside it that branch (_det, det, any, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/det.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7963afdcec0f0739c1b7008ec4059d01b62752bd80365a854784db8d1bb990e"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo03xDSf.createMatAlgo03xDSf.matAlgo03xDSf (cyclomatic 20): matAlgo03xDSf.createMatAlgo03xDSf.matAlgo03xDSf has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2fd69396cf68dc89977bf2c656d19c319e0f352cd409b4568298914ff3c6c4"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo01xDSid.createMatAlgo01xDSid.algorithm1 (cyclomatic 20): matAlgo01xDSid.createMatAlgo01xDSid.algorithm1 has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2c25c92f9c570f5dc7eb11aaedc4b645d6c624dc3e1e0897ca82a2afd8b220"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo07xSSf.createMatAlgo07xSSf (cyclomatic 20): matAlgo07xSSf.createMatAlgo07xSSf has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 22, _scatter). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo07xSSf.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb14d70e88590d55f72b6188c3f22910cf4a7fc2bc2e532c8d60acdc7b6aed59"}},{"ruleId":"D1","level":"warning","message":{"text":"lsolveAll.createLsolveAll (cyclomatic 20): lsolveAll.createLsolveAll has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e8e30825512acc0dbf1d5ea3e40ebc620416f2c52912e98488875ad7495874"}},{"ruleId":"D1","level":"warning","message":{"text":"usolveAll.createUsolveAll (cyclomatic 20): usolveAll.createUsolveAll has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function items inside it that branch (_sparseBackwardSubstitution, _denseBackwardSubstitution). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"109bf51b622956f84a45a0623e0340ee769f82d5158de950049ae141241cb830"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexNode.createIndexNode (cyclomatic 20): IndexNode.createIndexNode has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d8787bd2b5c8899e856fe7b848ef23933c27ba9fa6244ecc36a97a8ed2a6fb"}},{"ruleId":"D1","level":"warning","message":{"text":"complexEigs.createComplexEigs::balance (cyclomatic 20): complexEigs.createComplexEigs::balance 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. This shape REPEATS in the file: 2 other methods here (complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e89c2568a6cf005343d78bb57a606d202c39aed3d0a9890377d896f80165c47"}},{"ruleId":"D1","level":"warning","message":{"text":"quantileSeq.createQuantileSeq (cyclomatic 20): quantileSeq.createQuantileSeq has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function items inside it that branch (_quantileSeq, _quantileSeqProbNumber, _quantileSeqProbCollection). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/quantileSeq.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2040af708dee058f9274b401f26143e668a74a8d3b7f1b3c73eba8688767922"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::diagonal (cyclomatic 20): (anonymous)::diagonal has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ef5e0df031a48eb548e1f95dd44bb7844c92e882b100066a9d7c0266f054f6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_toHTML (cyclomatic 20): (anonymous)::_toHTML has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a673b88e9c7e374eec7eb91e6cbae4b578b335d2dd51c17a234de98457d3b20f"}},{"ruleId":"D1","level":"warning","message":{"text":"importFactory::_importFactory (cyclomatic 20): importFactory::_importFactory has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/import.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e11bcd0b6ffd6d80ba5a74d9adf2f81f7893ddee9e4a3b487b1edaba640702"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 19 function items inside it that branch (constructor, _compile::(anonymous)::evalDimension, isObjectProperty, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9431723971de3b116b2d4e2ebcbf75e19e720d5e246f32797b14b53f12b81ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 11 function items inside it that branch (_quantileSeq, _quantileSeqProbNumber, _quantileSeqProbCollection, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/quantileSeq.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f52b5d84215351bc8a5ec58c1df75f05566cadb06bdef898fa6995e15e2de9a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 12 function items inside it that branch (_sparseBackwardSubstitution, _denseBackwardSubstitution, SparseMatrix, Array | Matrix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ff2c5d9c917e627d4134216387e1e32db9331f56e11ae96aa27ad226863f00"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 12 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution, SparseMatrix, Array | Matrix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5e3dfabcce8486f0be673a3a538f4228ea0a36efb1bb922eb0834f58a4b3d9"}},{"ruleId":"D1","level":"warning","message":{"text":"multiply.createMultiply::_multiplyDenseMatrixSparseMatrix (cyclomatic 19): multiply.createMultiply::_multiplyDenseMatrixSparseMatrix 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. This shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25b5051bc8228a238163d7fb598926a09e450db5afdd3b7b747835735102165"}},{"ruleId":"D1","level":"warning","message":{"text":"ConditionalNode._toString (cyclomatic 19): ConditionalNode._toString has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (ConditionalNode._toHTML) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1704242e8cbc966d64de1841225c101d72cf700cc9c0090c8b8d6b8216a1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ConditionalNode._toHTML (cyclomatic 19): ConditionalNode._toHTML has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (ConditionalNode._toString) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b22234c398cc30e19dd8be251b2de42e00240b30a84e83e252a6f05b34633f"}},{"ruleId":"D1","level":"warning","message":{"text":"simplify.createSimplify::_exactMatch (cyclomatic 19): simplify.createSimplify::_exactMatch 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. This shape REPEATS in the file: 2 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::_ruleMatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"348b2f8caf0357630b5ff58cfb934712ab128471ce9ba0f10e082e0323c9efaf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_exactMatch (cyclomatic 19): (anonymous)::_exactMatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"a140d3ff1e9b05d5004fd078e54106a8b7482dced0f22c72806d7cf814fdfd31"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_multiplyDenseMatrixSparseMatrix (cyclomatic 19): (anonymous)::_multiplyDenseMatrixSparseMatrix has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e5febd9317789315e4cce0b96d4bc598a93b33bd816f09449f33330132a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_toString (cyclomatic 19): (anonymous)::_toString has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbda992714df578f400b8e50be2dc6b0eef76c1d7e61a1e301c01f9c850041b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_toHTML (cyclomatic 19): (anonymous)::_toHTML has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4e439d902ddcc83dc92fc3b6efe3fa066bdd6230e54f1f75c9c44b253bbc77"}},{"ruleId":"D1","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixDenseMatrix (cyclomatic 18): multiply.createMultiply::_multiplySparseMatrixDenseMatrix 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. This shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87da776336cd42c72534a7331688f6f60ac764813ae34c251c903663a4f2130"}},{"ruleId":"D1","level":"warning","message":{"text":"rotationMatrix.createRotationMatrix (cyclomatic 18): rotationMatrix.createRotationMatrix has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 7 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, a function literal at line 82, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotationMatrix.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43b974ba1f05b19b18ee250f849d1ad04387a3b690faa94642422dc9e7c4b74"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolNode.createSymbolNode (cyclomatic 18): SymbolNode.createSymbolNode has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/SymbolNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9ed1538fdb7dca3b5b9e36c3187378292ebcaa16a8257355275019e18d9027"}},{"ruleId":"D1","level":"warning","message":{"text":"qr.createQr (cyclomatic 18): qr.createQr has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (_denseQRimpl, _denseQR). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"43717f6c7b6304c859523c46943ef62dadc2bbf3c987d17339ebf2a3960cd205"}},{"ruleId":"D1","level":"warning","message":{"text":"inv.createInv::_inv (cyclomatic 18): inv.createInv::_inv has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"030baa6948757c3a256f2a5fd2cbcbd70bf1232a3c68355c3d36fb71eaf2ae75"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::diagonal (cyclomatic 18): (anonymous)::diagonal 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":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c345908e2aec3d7b151f919954b2a5ce9ac02e6b68c1e02daca44be79c3d13e9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixDenseMatrix (cyclomatic 18): (anonymous)::_multiplySparseMatrixDenseMatrix has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7013a21e58b438536915f6a66384c26f61799e923d565589451b66348e547944"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 7 function items inside it that branch (_denseQRimpl, _denseQR, DenseMatrix, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e036ee933592355d70f213770523d4c29b5180122df1a80e0aed219b845dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 14 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, number | BigNumber | Complex | Unit, Matrix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotationMatrix.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1bc9a46fd2f92d4161b4539a9ef33dbfb5795e3948de92b59bdfa6f008a2af"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (_toHTML, _toTex, _compile, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/SymbolNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3d8f53333bcbae60b7341bd90338df8cb9f3efc3df2d9e4e38a42eba85d0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_inv (cyclomatic 18): (anonymous)::_inv has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c95c5d6fe5e814f4edd8d6329b22d3a78bd64ad8026d1040595b03c0a91eaf"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass::_resize (cyclomatic 17): SparseMatrix.createSparseMatrixClass::_resize has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SparseMatrix.createSparseMatrixClass) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"19083b5053a83ac90fb4dcd67c0f7453c69aaeca0a5af8cf67d064273ca8d109"}},{"ruleId":"D1","level":"warning","message":{"text":"matAlgo02xDS0.createMatAlgo02xDS0.matAlgo02xDS0 (cyclomatic 17): matAlgo02xDS0.createMatAlgo02xDS0.matAlgo02xDS0 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a62027ddc2685ab26b087bc9ffe0c40bd48b3aabcac2d22d4c7b1e5b0c64b5"}},{"ruleId":"D1","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixVector (cyclomatic 17): multiply.createMultiply::_multiplySparseMatrixVector 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 shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5a4e4f5d08635aa64c8af55cc523d7d099c11d388f24720db522137f5b7898"}},{"ruleId":"D1","level":"warning","message":{"text":"bitwise.bitXor (cyclomatic 17): bitwise.bitXor 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"241b8bc592279e7d7add3db800a29b703721526eaaab8ea6a8d81a770db5138e"}},{"ruleId":"D1","level":"warning","message":{"text":"diff.createDiff (cyclomatic 17): diff.createDiff has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 6 function items inside it that branch (_ElementDiff, _recursive, a function literal at line 63, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diff.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a8ad7fda66e35a56a9c96372ccaf252cf5a8e9cafed5e7e9300c060adf6cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"partitionSelect.createPartitionSelect (cyclomatic 17): partitionSelect.createPartitionSelect has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function items inside it that branch (quickSelect, _partitionSelect, a function literal at line 54). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/partitionSelect.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"67125ba9259ad5a8fc8def3c985b8e781d4982415e275ef5714f6d11d3649cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstantNode.createConstantNode (cyclomatic 17): ConstantNode.createConstantNode has cyclomatic complexity 17 (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":"src/expression/node/ConstantNode.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e497127ce9525ac163130ffdb1405d36bc4837f3497a377026f5ec1d6b53cab"}},{"ruleId":"D1","level":"warning","message":{"text":"ParenthesisNode.createParenthesisNode (cyclomatic 17): ParenthesisNode.createParenthesisNode has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ParenthesisNode.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a181f5ced1abdc7435cf1383cd480c51606f26c1140864d1c4a1900c4e75b5"}},{"ruleId":"D1","level":"warning","message":{"text":"complexEigs.createComplexEigs::reduceToHessenberg (cyclomatic 17): complexEigs.createComplexEigs::reduceToHessenberg 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 shape REPEATS in the file: 2 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5a06d4bde0e5e90019b862b9559bc2ac161d4c65ae976d4ec3a7d53bac0c42"}},{"ruleId":"D1","level":"warning","message":{"text":"pickRandom.createPickRandom::_pickRandom (cyclomatic 17): pickRandom.createPickRandom::_pickRandom has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc333f72322b8a1fab934ed584a2ff13fc2593723e7a326277625e1148918f5"}},{"ruleId":"D1","level":"warning","message":{"text":"rationalize.createRationalize::expandPower (cyclomatic 17): rationalize.createRationalize::expandPower 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 shape REPEATS in the file: one other method here (rationalize.createRationalize::polyToCanonical::recurPol) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bf1545eb33303a80b59c5cbd5745fd9880e6b06e013b3aa7105c0ebe18437b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_resize (cyclomatic 17): (anonymous)::_resize has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b8d81f428ed243ac8b53cc42b209c282563c1edcb0e91a745bb94cdabf1328"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixVector (cyclomatic 17): (anonymous)::_multiplySparseMatrixVector has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c02397d31ddec299953162fd1731b995cef511d8cf51b6636cecbeefaec8467"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::expandPower (cyclomatic 17): (anonymous)::expandPower has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5419aade29ad0b8ef2ea1c07634492766d51b9644f61c0c0195a5908ae04a0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 11 function items inside it that branch (_ElementDiff, _recursive, Array | Matrix, number, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diff.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5885d20fc93102456a32608af1e7f7801196b51c243c322c7c47bae96cc4de6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 12 function items inside it that branch (_toHTML, _toTex, constructor, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConstantNode.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9db12611e60176c933ca910721067e6b58990f482afc6f4013053ac6b130cc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_pickRandom (cyclomatic 17): (anonymous)::_pickRandom has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9737a6a3096ffdd798d7f9562d608bdcac56b3626050a5301f8f0c20fda85604"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 12 function items inside it that branch (_toString, _toHTML, _toTex, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ParenthesisNode.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a9aeb01b82eb1793c5963843791a49311d71f9032ade957478fa6f28942ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 5 function items inside it that branch (quickSelect, _partitionSelect, Array | Matrix, number, string, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/partitionSelect.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"634c06196ad6d382aa0b86ba6640eb2de8f4a7521258230d06e2d84af828fe7c"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.format (cyclomatic 16): formatter.format 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":"src/utils/bignumber/formatter.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd5a5e5331414573d85e63e74cae09f4cae2de69d4b77dd2e9e15f9f451a0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"diag.createDiag (cyclomatic 16): diag.createDiag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 3 function items inside it that branch (_diag, _createDiagonalMatrix, _getDiagonal). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diag.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"861a50c9ff5ff79401ec4105645cad093d8136969dbe14245addbed934f8d7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"identity.createIdentity::_identity (cyclomatic 16): identity.createIdentity::_identity has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be32bd01c7f54e95e05807b3c652d3994f493bde42c4535e662dc199909287d"}},{"ruleId":"D1","level":"warning","message":{"text":"lsolve.createLsolve (cyclomatic 16): lsolve.createLsolve has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3b0eafcae148e26e60cc076cb0a4fa0a17881e8f05d51abc2c90e5552d96cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.createNode (cyclomatic 16): Node.createNode has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/Node.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d9dc4a64dae06acd16693912374286af51db15f5ea78f6e19aa5436e1ca665"}},{"ruleId":"D1","level":"warning","message":{"text":"parse.createParse::parseBlock (cyclomatic 16): parse.createParse::parseBlock 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. This shape REPEATS in the file: 2 other methods here (parse.createParse::getToken, parse.createParse::parseAccessors) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c80af2867919ca3ea0c44e19b07d09a362c90cbd3bf06d1abe118a10c75d0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::formatUnits (cyclomatic 16): (anonymous)::formatUnits has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26edf9072a7ad221d27f36ded1a65467abf2ab64a9cb2444b398d9300432e09"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseBlock (cyclomatic 16): (anonymous)::parseBlock has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7cbe0a3fb6911e77d157502100833d1bc881c7d3ec626004ad3a67bf352218"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_createFromArray (cyclomatic 16): (anonymous)::_createFromArray has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dffbaf5331934a6a563d0640b7c04cb8cc923d954c1a4a05da2e023bad170c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 31 function items inside it that branch (_getCustomString, _validateScope, equals, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/Node.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c5d2c12f4f7c4b6f75dd0855554d99509efeb7d4c1fecfcf8f9c7186ed8874"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 15 function items inside it that branch (_diag, _createDiagonalMatrix, _getDiagonal, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diag.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb63c6d4b9ee44110e1d6ce7f9dc913f3e2ec2150e7d1bda319868422c7cbcd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_identity (cyclomatic 16): (anonymous)::_identity has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a287b542f8e2fc2914e50ea9c63ddc3fa5f14fa06ccda04a9536465e26013ef"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution, SparseMatrix, Array | Matrix, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a80f516ec687ef2035a44e389848d5bf7bd1f165e43cebbfef283d73bf8360"}},{"ruleId":"D2","level":"warning","message":{"text":"simplifyCore.createSimplifyCore::_simplifyCore (cognitive 200): simplifyCore.createSimplifyCore::_simplifyCore has cognitive complexity 200 (threshold 15). Drivers by points: if/else 66 (171 pts), boolean chains 16, ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 114). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac190d0286961429c2e565d7c5cd9383f580d51b50da32dab4165e575f498ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_simplifyCore (cognitive 200): (anonymous)::_simplifyCore has cognitive complexity 200 (threshold 15). Drivers by points: if/else 66 (171 pts), boolean chains 16, ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 114). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"119f6f9799d3977dbd915b2bfaa1d9e0cc0249aafe265ead52c8b113d9966be7"}},{"ruleId":"D2","level":"warning","message":{"text":"distance.createDistance (cognitive 115): distance.createDistance has cognitive complexity 115 (threshold 15). Drivers by points: if/else 57 (88 pts), boolean chains 22, loops 4 (5 pts) (nesting depth added 32). None of this is in the body itself: all 115 points belong to 16 function items inside it that branch (a function literal at line 139, a function literal at line 104, a function literal at line 85, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de5fd884de4272f56c1fce0cf4eaef4444ae4e5fecb560888c4194a9fee8a2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_ruleMatch (cognitive 110): (anonymous)::_ruleMatch has cognitive complexity 110 (threshold 15). Drivers by points: if/else 37 (86 pts), boolean chains 11, loops 2 (6 pts), ternaries 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9282cebe8ed97009412755e652f5f17594daa8aec215bfe1a0ec3177ea1c98"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.createSimplify::_ruleMatch (cognitive 109): simplify.createSimplify::_ruleMatch has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (86 pts), boolean chains 10, loops 2 (6 pts), ternaries 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 58). 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. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"8151fb6c032eb27637462b46655d090ed75e5428386b758616c531afd60f0607"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorNode.createOperatorNode (cognitive 104): OperatorNode.createOperatorNode has cognitive complexity 104 (threshold 15). Drivers by points: if/else 80 (139 pts), boolean chains 32, match/switch 4 (8 pts), loops 4 (6 pts), ternaries 6 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OperatorNode.createOperatorNode::calculateNecessaryParentheses) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2ac5005db32cc3c967bfd82ed20d3ff3c2efa0e7632253266a02ead6bc5a94"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionNode._compile (cognitive 87): FunctionNode._compile has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (66 pts), boolean chains 14, match/switch 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 42). Of this number, 21 points are the body\u0027s own statements and 66 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b3621ffc65dad164cf9739185c506599c3975c5a3b8bf93cd222bfadbffe97"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::getToken (cognitive 87): parse.createParse::getToken has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 10 (27 pts), boolean chains 12 (nesting depth added 40). To reduce it, split the body into named stages: move each independent 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: 6 other methods here (parse.createParse::parseBlock, parse.createParse::parseRange, parse.createParse::parseAccessors, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"595084b82be6873f07e74201007f14712657cb5711c1c8fbd3a83d0fdd707eea"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getToken (cognitive 87): (anonymous)::getToken has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 10 (27 pts), boolean chains 12 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aba50a61b16a1ed88da6fd8cf3c3f6196cb27d9178fb8f90ec8928dfc39cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::polyToCanonical::recurPol (cognitive 85): (anonymous)::polyToCanonical::recurPol has cognitive complexity 85 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 13, ternaries 4 (13 pts), loops 2 (5 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"505a1d8ac6393ab43d195f151062fb61568cdab35e09e2237d049bc9276aebb5"}},{"ruleId":"D2","level":"warning","message":{"text":"derivative.createDerivative (cognitive 76): derivative.createDerivative has cognitive complexity 76 (threshold 15). Drivers by points: if/else 38 (58 pts), boolean chains 11, ternaries 3 (6 pts), match/switch 1 (nesting depth added 23). None of this is in the body itself: all 76 points belong to 13 function items inside it that branch (a function literal at line 588, a function literal at line 232, a function literal at line 133, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0af04fa36e7839bb94baf99738a47552987386d34a920dc8e188cc9297c44a0"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorNode.createOperatorNode::calculateNecessaryParentheses (cognitive 74): OperatorNode.createOperatorNode::calculateNecessaryParentheses has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 10, loops 1 (2 pts), match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OperatorNode.createOperatorNode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c955c6e1ed7920ff81950a91fc7a8f34e583fd5e9e768d9ca9499707103be84"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.completer (cognitive 73): cli.completer has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (52 pts), loops 6 (19 pts), boolean chains 2 (nesting depth added 52). Of this number, 71 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/cli.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddb38b3f89e95bdb03f3096edc1df679dda91598efd7cb0c3ef53fc621e7248"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::calculateNecessaryParentheses (cognitive 73): (anonymous)::calculateNecessaryParentheses has cognitive complexity 73 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 9, loops 1 (2 pts), match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2fe221126aa3cb2965168008246c08638106026f068fe2dc3bf2eec04e8ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"rationalize.createRationalize::polyToCanonical::recurPol (cognitive 72): rationalize.createRationalize::polyToCanonical::recurPol has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 13, loops 2 (5 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd003fd62acc767855db24968fa9d51d68e6dd24fdfac54e51474bbe218e7c45"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::createUnitSingle (cognitive 71): (anonymous)::createUnitSingle has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 7 (15 pts), boolean chains 11, error handling 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d9bbb9090e3ba3ceefb2bd0dfb63f62f615be4c8695bc44d8346ed619ce2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Unit.createUnitClass (cognitive 67): Unit.createUnitClass has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 67, if/else 37 (63 pts), loops 12 (16 pts), ternaries 3 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Unit.createUnitClass::parseNumber) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f91fd5babf0d59b362a8f12aff6a4972e9dd031ac8606d410d49f81549f84b"}},{"ruleId":"D2","level":"warning","message":{"text":"lup.createLup::_denseLUP (cognitive 66): lup.createLup::_denseLUP has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 9 (18 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ca9a264b10ca2faf9aa37dd0c96820041cecc19987a11789639329451e4d66"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_denseLUP (cognitive 66): (anonymous)::_denseLUP has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 9 (18 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"671fbcc64808f20f33250bcaefc0e14e99774d252f8c3449736b09810204c298"}},{"ruleId":"D2","level":"warning","message":{"text":"createRealSymmetric (cognitive 61): createRealSymmetric has cognitive complexity 61 (threshold 15). Drivers by points: loops 22 (30 pts), if/else 18 (29 pts), boolean chains 2 (nesting depth added 19). None of this is in the body itself: all 61 points belong to 13 function items inside it that branch (sorting, diag, diagBig, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde40239ca418da9139aec9676e5d577ccbe1cca0ce93aa02147b1d7d4231301"}},{"ruleId":"D2","level":"warning","message":{"text":"inv.createInv::_inv (cognitive 59): inv.createInv::_inv has cognitive complexity 59 (threshold 15). Drivers by points: loops 8 (32 pts), if/else 11 (27 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7ca7036ad060ff1de758168098c960b4f61c01476a3f895f4bb3569374c5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"simplifyConstant.createSimplifyConstant::foldFraction (cognitive 59): simplifyConstant.createSimplifyConstant::foldFraction has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 3 (10 pts), error handling 1 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 32). 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::_foldAccessor) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d4e611aab962e0a46df3e0077bd440a36abc6021e64900fdf7609355469c74"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::foldFraction (cognitive 59): (anonymous)::foldFraction has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 3 (10 pts), error handling 1 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"02210866935231838487ebba63d61aa68dcce336479ad9223b480c44cd291387"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_inv (cognitive 59): (anonymous)::_inv has cognitive complexity 59 (threshold 15). Drivers by points: loops 8 (32 pts), if/else 11 (27 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf94fb4b22e7e88777ef59849fa9d5ad7a8ba8fd7c52a2c756aa2337a02af81"}},{"ruleId":"D2","level":"warning","message":{"text":"solveValidation.createSolveValidation.solveValidation (cognitive 58): solveValidation.createSolveValidation.solveValidation has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 6 (22 pts), boolean chains 2 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/utils/solveValidation.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3154f9c53d62f6a2a03975101e2e0fe9b632f963121360e573227c6239ad123c"}},{"ruleId":"D2","level":"warning","message":{"text":"simplifyConstant.createSimplifyConstant::_foldAccessor (cognitive 56): simplifyConstant.createSimplifyConstant::_foldAccessor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 30). 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::foldFraction) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cde8c9532e9267c2b74d8de18d53df73ab56685561fdaa4780034ad1a1e005"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_foldAccessor (cognitive 56): (anonymous)::_foldAccessor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab2789a7ab4114865c714e883f07d9938d8f11a4fc3fae2c41ac6508c6b556d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Object, Object (cognitive 56): (anonymous)::Object, Object has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 23 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c82daa1c9d1ce8694b27fe49eb8f32b3c7fe3ad9ee39a7deddcd203ccb4054"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo05xSfSf.createMatAlgo05xSfSf.matAlgo05xSfSf (cognitive 55): matAlgo05xSfSf.createMatAlgo05xSfSf.matAlgo05xSfSf has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 8 (16 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc704259db3d6adda83da519b053907d227c7b641afc52ef665e90956be40e51"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo04xSidSid.createMatAlgo04xSidSid.matAlgo04xSidSid (cognitive 55): matAlgo04xSidSid.createMatAlgo04xSidSid.matAlgo04xSidSid has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 9, loops 4 (8 pts), ternaries 6 (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":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa142a53fca423926aaf6812608de798749c18604f5e776a60bb987717f430a"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.createSimplify::applyRule (cognitive 55): simplify.createSimplify::applyRule has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 7, loops 3 (7 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. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::mergeMatch, simplify.createSimplify::_ruleMatch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5896dcad8089ee3eab3459432eaa3eddfd860d7870a61d376a47cf2682423f02"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matAlgo04xSidSid (cognitive 55): (anonymous)::matAlgo04xSidSid has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 9, loops 4 (8 pts), ternaries 6 (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":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c9b39f1e2af95b58d450337211be55080bac28b3dcbc5ffcf2fb403a0b6bce"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matAlgo05xSfSf (cognitive 55): (anonymous)::matAlgo05xSfSf has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 8 (16 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf47d73d2fa74307d66c3b8f567b0d6890930eaf01c3e1359e9d7df7b4be0d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::applyRule (cognitive 54): (anonymous)::applyRule has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (41 pts), loops 3 (7 pts), boolean chains 6 (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":"src/function/algebra/simplify.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a078956e7acb40ddd59f7f41b2574cbe59628d62099f794a6d5e925c47c946c2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseAccessors (cognitive 53): (anonymous)::parseAccessors has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (10 pts), boolean chains 7, ternaries 1 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42c59fbd16febd2da199b2aa99468c7ac213233295e33c5f7227824fff50090"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 51): (anonymous) has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 15 (21 pts), if/else 13 (17 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 11). None of this is in the body itself: all 51 points belong to 23 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/numeric/solveODE.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb242b88468d79037418bd14785aaa9be5c2f8baf2d74cd47f3960cd899b2b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"complexEigs.createComplexEigs::balance (cognitive 50): complexEigs.createComplexEigs::balance has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 6 (19 pts), ternaries 6 (7 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eba566e427a36637dacfbd2e928413922122f3b4f92d415e29a5a0c48de885"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseAccessors (cognitive 49): parse.createParse::parseAccessors has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (10 pts), boolean chains 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"097c474fe5d89fcd8aa0b0ffba5d90e786c8b502a3cd5a04f704e7a83cc66758"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parse (cognitive 49): (anonymous)::parse has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 4 (7 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f13f31bca42266759663bb039868fb5c648730e561d3fa81a5be14ab7f9666"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 48): (anonymous) has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 14 (22 pts), if/else 17 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 14). None of this is in the body itself: all 48 points belong to 26 function items inside it that branch (mapMultiple::iterate, _mapMultiple, _getCallbackArgCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0527fc167b99d1da3b98236811fbeed09b83c67f53621c87311cd45f607ad73"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_swapRows (cognitive 47): (anonymous)::_swapRows has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 6 (20 pts), boolean chains 5, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c80fb65d81672169ae9e44585e4a1c3ad5423d7812a052031fcbecef0c4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalNode.createConditionalNode (cognitive 46): ConditionalNode.createConditionalNode has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 25, if/else 15 (18 pts), ternaries 3 (nesting depth added 3). Of this number, 33 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703a9e9f11ce19fd0d770f8fdfbf697eb8cbef07166fb41021d44d3fec3f195"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionNode.createFunctionNode (cognitive 46): FunctionNode.createFunctionNode has cognitive complexity 46 (threshold 15). Drivers by points: if/else 50 (99 pts), boolean chains 23, match/switch 4 (11 pts), ternaries 2 (4 pts), loops 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent 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 (FunctionNode.createFunctionNode::expandTemplate) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d7017365998eddb77c8defa5f02be4428e2a3313c63f16bfbde8c2d0158a1"}},{"ruleId":"D2","level":"warning","message":{"text":"solveODE.createSolveODE (cognitive 44): solveODE.createSolveODE has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 12 (14 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 7). None of this is in the body itself: all 44 points belong to 7 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/numeric/solveODE.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed5a553791c15f516a22df53b6ffafb114ed684df58b0c86fb5c8694d6b89b4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_createFromArray (cognitive 44): (anonymous)::_createFromArray has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3058dd205f16de4b58e71b5ac4cf690ddc4a8c3f023468a287a033cfe53fc29c"}},{"ruleId":"D2","level":"warning","message":{"text":"isPrime.createIsPrime (cognitive 43): isPrime.createIsPrime has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 8 (12 pts), boolean chains 6 (nesting depth added 13). None of this is in the body itself: all 43 points belong to 4 function literals inside it that branch (lines 67, 37, 52, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/isPrime.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8917f86b862a65f213322fb88178dc27cac3b3c40d25dd6a191e1feca92e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeNode.createRangeNode (cognitive 43): RangeNode.createRangeNode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 17, ternaries 3 (nesting depth added 3). Of this number, 35 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"005a67898bd219eb17f097b0bf723ba4aae372f9c8423dadefca306bbf210b68"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixSparseMatrix (cognitive 43): (anonymous)::_multiplySparseMatrixSparseMatrix has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (14 pts), boolean chains 6, ternaries 5 (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":"src/function/arithmetic/multiply.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ec7056d59b8062bab2b9c9665c171df0b94a9f1cdc5fdbc19b0bbdc6222fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 43): (anonymous) has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 17, ternaries 3 (nesting depth added 3). None of this is in the body itself: all 43 points belong to 16 function items inside it that branch (_toString, _toHTML, _toTex, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"15da4dd42e8259f8ce43faf696c675901074b77a6f498a613f3bbf8bc60c3a38"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass::_createFromArray (cognitive 42): SparseMatrix.createSparseMatrixClass::_createFromArray has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 27). 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. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_setsubset, SparseMatrix.createSparseMatrixClass::_resize, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7696c965a375fa99533b90b70b50118d63b4ed55263fdd0686b2b10e5e6771a3"}},{"ruleId":"D2","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cognitive 42): multiply.createMultiply::_multiplySparseMatrixSparseMatrix has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (14 pts), boolean chains 5, ternaries 5 (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. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d477cd20900a22f3785d95bc41fae634f3601de8a8190defeb263c3b60d76f0"}},{"ruleId":"D2","level":"warning","message":{"text":"complexEigs.createComplexEigs::iterateUntilTriangular (cognitive 42): complexEigs.createComplexEigs::iterateUntilTriangular has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (11 pts), ternaries 5 (6 pts), boolean chains 2 (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. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa60a64e7451b35e2587f747d46f7269748397b404e9adb381e70d76b886952b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::OperatorNode, function (cognitive 41): (anonymous)::OperatorNode, function has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a9d91085188297946ef8c489866bb20ff3e6cde307a9a7e9f387e07b06a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 41): (anonymous) has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 13, ternaries 7 (8 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 41 points are its own statements and the rest belongs to 18 function items inside it that branch (_compile, constructor, _toString, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"650abdded2cdf9a30355fd431fcae4327456d566eab5da6b6a882532ea72e785"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo06xS0S0.createMatAlgo06xS0S0.matAlgo06xS0S0 (cognitive 40): matAlgo06xS0S0.createMatAlgo06xS0S0.matAlgo06xS0S0 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (7 pts), boolean chains 6, ternaries 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"822bc024a833eca2bcfb72715f13bfcf719d92ab1e3c53cbc4d5b0776eef5056"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentNode.createAssignmentNode (cognitive 40): AssignmentNode.createAssignmentNode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 13, ternaries 6 (7 pts) (nesting depth added 3). Of this number, 37 points are the body\u0027s own statements and 3 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":"src/expression/node/AssignmentNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dff7407c355f3f2b2a41e3f4611fa342f51ec1f1ca12f68e4596bd5a07fc79"}},{"ruleId":"D2","level":"warning","message":{"text":"importFactory::_importFactory (cognitive 40): importFactory::_importFactory has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 4, ternaries 2, other 1 (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":"src/core/function/import.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20cdf25720aeb5316ee9b8c10fe801595cfc463544f024d8a67a495afc18be3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matAlgo06xS0S0 (cognitive 40): (anonymous)::matAlgo06xS0S0 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (7 pts), boolean chains 6, ternaries 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbf6c5c5f1b9db09c767910e795f53be9697f21c3d3d7d773c6636c3195ecf3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runStream (cognitive 38): cli.runStream has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 3 (9 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 20). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 203). 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":"bin/cli.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"880ab6511ddbb4c4bef1dab5c255a2dc614b96c90f7b74f4d79f1cf093e2b7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"map.createMap (cognitive 38): map.createMap has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 10 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). None of this is in the body itself: all 38 points belong to 14 function items inside it that branch (mapMultiple::iterate, _mapMultiple, _getCallbackArgCount, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f6e5ae50f3a03641e1063d04671962453fa2b8d220855211abe556c605d2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"complexEigs.createComplexEigs::reduceToHessenberg (cognitive 38): complexEigs.createComplexEigs::reduceToHessenberg has cognitive complexity 38 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 7 (17 pts), ternaries 2 (3 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. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::iterateUntilTriangular, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12767f015c24e18e3cb123e644fe77f291a5dc80e5209287b72b823e867584"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorNode._toTex (cognitive 36): OperatorNode._toTex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, match/switch 2 (5 pts), ternaries 2 (nesting depth added 12). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1121f96cc279dafef0e145301263851e423f2bd1c15c3f66d0132b2fd9ce3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_toTex (cognitive 36): (anonymous)::_toTex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, match/switch 2 (5 pts), ternaries 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d134a25fa6bd5e344d38002a341b24bd475db72e010be4919852950d8d9dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::simplify (cognitive 35): (anonymous)::simplify has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (4 pts), boolean chains 3 (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":"src/type/unit/Unit.js"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3105eb3e277e67e7322e363c3a4688582f09df6e6fd706c8cb495114a47c287"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass::_resize (cognitive 34): SparseMatrix.createSparseMatrixClass::_resize has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 8 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b4c1306ee23d8dce72376f34e08d26aac1eec32e5d7132c34d1ee8d863d45"}},{"ruleId":"D2","level":"warning","message":{"text":"matrixAlgorithmSuite.createMatrixAlgorithmSuite.matrixAlgorithmSuite (cognitive 34): matrixAlgorithmSuite.createMatrixAlgorithmSuite.matrixAlgorithmSuite has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 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":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2208b10e37b838e6f08cf63462d075f1ed69dbe920202b4edeab562e77bd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo09xS0Sf.createMatAlgo09xS0Sf.matAlgo09xS0Sf (cognitive 34): matAlgo09xS0Sf.createMatAlgo09xS0Sf.matAlgo09xS0Sf has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 6 (9 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo09xS0Sf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0ce5f3ae76ab7a116ddd61d1e4b61ec87e8a6cb96c32c75de1f8ab4dd84dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"bitwise.bitAndBigNumber (cognitive 34): bitwise.bitAndBigNumber has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 8 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5035650c3755a876f1ba608849d2a3427a8554fd068256ec8030ed403115cc26"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseMatrix (cognitive 34): parse.createParse::parseMatrix has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (8 pts) (nesting depth added 23). 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. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab4907da3d8d77e613261b338afe749da41ff772afa34e2d88d040db3657e37"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseMatrix (cognitive 34): (anonymous)::parseMatrix has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (8 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e090e076f700c3b5e3e9f3f68bed45793076eecbab36b8151dbc4fe7c2ce53"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_resize (cognitive 34): (anonymous)::_resize has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 8 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81c273d64f89e0e924384093764b1748a882ebbf8c13e7616b46442a0f7d2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matrixAlgorithmSuite (cognitive 34): (anonymous)::matrixAlgorithmSuite has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 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":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe52b9c69508efff662dd9a434017138559b8614d18861937a87eeb95d4e2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"det.createDet::_det (cognitive 33): det.createDet::_det has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (13 pts), ternaries 2 (5 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":"src/function/matrix/det.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa49e4aa5df7d3ccce252966b7c56c38a16de76ed5b6700db7d4065b2d91b19"}},{"ruleId":"D2","level":"warning","message":{"text":"eigs.createEigs::coerceTypes (cognitive 33): eigs.createEigs::coerceTypes has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 10 (12 pts), boolean chains 3 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f403251b21cd8a6fba17bfdd9b891080087a0ffaa17d1b6d59479185c8dd505e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_toString (cognitive 33): (anonymous)::_toString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 8, ternaries 4 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee50c334663bdddf093552f4f246c9d3def9405ea2612d267b8b4e2827d04e0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::coerceTypes (cognitive 33): (anonymous)::coerceTypes has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 10 (12 pts), boolean chains 3 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34cb5e114f0eaf10ac78099d5332d5ceeb746ed8463360421a4dff7878f6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_det (cognitive 33): (anonymous)::_det has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (13 pts), ternaries 2 (5 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":"src/function/matrix/det.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a423a9b20f4d442069d0a3b8f8752014a6960aaf0927fabc5172c9f6ce5de3"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.createQr::_denseQRimpl (cognitive 32): qr.createQr::_denseQRimpl has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (28 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"560886c23e80d37a5e154388ea1a775c2ca7b94e296bf8995bc65320482f2524"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_denseQRimpl (cognitive 32): (anonymous)::_denseQRimpl has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (28 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c80d80d5cf7f0826de67195e2eadb7bcdb0a5731b4539d086a1e1722c1ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.createDenseMatrixClass::_set (cognitive 31): DenseMatrix.createDenseMatrixClass::_set has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (6 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c38469bae10f0952445b8212bdb41e6315745a03803aae3950b8fe46d94991"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessorNode.createAccessorNode (cognitive 31): AccessorNode.createAccessorNode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 9, ternaries 3 (5 pts) (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 15 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3876c3f67131dc0fd429a01e17bb7a777b9b6000c283a76363a1e6975bcc08"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_set (cognitive 31): (anonymous)::_set has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (6 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1742fce945b9f6d7166aaa9153faf5eb516cd9149d8681d1cf3b0649227597f8"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorNode._toHTML (cognitive 30): OperatorNode._toHTML has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, ternaries 2 (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedfe16c7af86d529b7bc875812c5e66d113b9c4c11ba13621b56ab05bd80cf7"}},{"ruleId":"D2","level":"warning","message":{"text":"RelationalNode.createRelationalNode (cognitive 30): RelationalNode.createRelationalNode has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 6, if/else 4 (5 pts), loops 4 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 15 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30e36fecdc4dd557a9f344bb965d3c4a968d764af55e25728ed32ca24b15ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.createSimplify::_exactMatch (cognitive 30): simplify.createSimplify::_exactMatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"44918eadaef1d99c6f81188d49838fdef2f8f9141acc3aaee4f21daa74f8e4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rationalize.createRationalize::expandPower (cognitive 30): rationalize.createRationalize::expandPower has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::polyToCanonical, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccd9610e7558d8c8ce4cc28b578d94ac2cd098a6c29108ada08bac4e52cfff6"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_exactMatch (cognitive 30): (anonymous)::_exactMatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca8749c9a565290987d51c500a23814802ed5606944aa06c058e793f1448cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_multiplyDenseMatrixSparseMatrix (cognitive 30): (anonymous)::_multiplyDenseMatrixSparseMatrix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (8 pts), boolean chains 6, ternaries 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c9944be968405e79e0cea7ace7e08f96d4861ec7ccd50ff42e342b45826a1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_toHTML (cognitive 30): (anonymous)::_toHTML has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d34b6d2da6cff0678c2848db730129ccca69615cff67d61a83d1051f06affa"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::expandPower (cognitive 30): (anonymous)::expandPower has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f9c897bf32acefc350b4a1d0e56730eed237eba92e263abbd24c780ab08c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 30): (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 4 (5 pts), loops 3 (nesting depth added 2). None of this is in the body itself: all 30 points belong to 18 function items inside it that branch (constructor, _toHTML, _toString, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c5cc34d3482a6ae94239772e85568a7a099ba295c7d6cb3a6d5809551dbdff"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 30): (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 6, if/else 4 (5 pts), loops 4 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 18 function items inside it that branch (_toString, a function literal at line 126, _toHTML, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951b25ca7deccd01ac3632b697bccc09cadea66210f3843327c64b21991f29d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 30): (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 5). None of this is in the body itself: all 30 points belong to 15 function items inside it that branch (name, _compile::evalAccessorNode, _compile::evalAccessorNode, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c87bcaad8697df3304cf426f4ce7a194d36173fc41fe84c2a8cfe516879077c"}},{"ruleId":"D2","level":"warning","message":{"text":"multiply.createMultiply::_multiplyDenseMatrixSparseMatrix (cognitive 29): multiply.createMultiply::_multiplyDenseMatrixSparseMatrix has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (8 pts), boolean chains 5, ternaries 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. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b8892d826d665a0e16da470684efb4df44f37828802ef2260d59b23b87d510"}},{"ruleId":"D2","level":"warning","message":{"text":"lsolveAll.createLsolveAll::_sparseForwardSubstitution (cognitive 29): lsolveAll.createLsolveAll::_sparseForwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 pts) (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. This shape REPEATS in the file: one other method here (lsolveAll.createLsolveAll::_denseForwardSubstitution) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bce95e28bac7715d892b0b8430993d13591f5baa9563744e677b8d72c40be24"}},{"ruleId":"D2","level":"warning","message":{"text":"usolveAll.createUsolveAll::_sparseBackwardSubstitution (cognitive 29): usolveAll.createUsolveAll::_sparseBackwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 pts) (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. This shape REPEATS in the file: one other method here (usolveAll.createUsolveAll::_denseBackwardSubstitution) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a91c880566574b35c210fe09f2bd2cb6b192708c55dc0a0c540416e295d45"}},{"ruleId":"D2","level":"warning","message":{"text":"norm.createNorm (cognitive 29): norm.createNorm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 9 (nesting depth added 2). None of this is in the body itself: all 29 points belong to 9 function items inside it that branch (_vectorNorm, _norm, _matrixNorm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa75e4da5b937f5301cd2fa1b97e62811220054ba5d9ea9ad43f7bd0d19e411"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionAssignmentNode.createFunctionAssignmentNode (cognitive 29): FunctionAssignmentNode.createFunctionAssignmentNode has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 4 (5 pts), loops 2 (nesting depth added 2). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e24f089bd7a90446482b8678031a2df7a5d50e8c5a02c5bacb4a772189077a"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectNode.createObjectNode (cognitive 29): ObjectNode.createObjectNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8, boolean chains 2 (nesting depth added 9). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ObjectNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a84f5e6d968513ee7477978358b7111b9ee7a36b425ba4fe2071ddde722c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"pickRandom.createPickRandom::_pickRandom (cognitive 29): pickRandom.createPickRandom::_pickRandom has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346320a4ed2bd291ea4a593c111d09845aa229b779500935827b7158a40e7f7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::formatUnits (cognitive 29): (anonymous)::formatUnits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65fed47b05e6b1b00a707a60ec5ceffa429fdc47000ff1a6a30652b382a3e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 29): (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 9 (nesting depth added 2). None of this is in the body itself: all 29 points belong to 22 function items inside it that branch (_vectorNorm, _norm, _matrixNorm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0cc0b061e15671e5dd5d35c72adc217b3142799c7d8a134d3b25832e98ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 29): (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8, boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 29 points belong to 13 function items inside it that branch (constructor, _compile, _compile::evalObjectNode, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ObjectNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f23c56a0ee17f0eef55a751529d4c03d5e34b3dc9aa8b29a0051911dee899be"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_sparseBackwardSubstitution (cognitive 29): (anonymous)::_sparseBackwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 pts) (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":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c378faac1905d66b5a34408eaf31fc59e777e006de05ba29e5a1bd422e780f55"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_sparseForwardSubstitution (cognitive 29): (anonymous)::_sparseForwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 pts) (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":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5618b58ec59acd498c47f95c4ad653596c35ca5b8cec9463c58efa420a91ef44"}},{"ruleId":"D2","level":"warning","message":{"text":"resize.createResize (cognitive 28): resize.createResize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). None of this is in the body itself: all 28 points belong to 3 function items inside it that branch (a function literal at line 41, _resizeString, a function literal at line 52). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/resize.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9830e4672370df3df46e69322ceb4443795883a423f6abd25c89c21f0a7018f9"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionNode.createFunctionNode::expandTemplate (cognitive 28): FunctionNode.createFunctionNode::expandTemplate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (FunctionNode.createFunctionNode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d2da8d98f6c430894f9a7399e8aff9f372b43fbcf0cedd48364990fc6bbf47"}},{"ruleId":"D2","level":"warning","message":{"text":"stirlingS2.createStirlingS2 (cognitive 28): stirlingS2.createStirlingS2 has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 10). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 79). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/combinatorics/stirlingS2.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"714b9c247dfd6de69c156c6e52844fa007adbe26d13bd26a2c46b8bccd0b2ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::diagonal (cognitive 28): (anonymous)::diagonal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a90f284388bad5477f59066917ed0b0638e1abd17426a60cda1bc47d6f2b630"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::expandTemplate (cognitive 28): (anonymous)::expandTemplate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb41718758ce3f7d289c4260106c0ca1f06a5a3b6cf82af43d7a3122b0528e7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 28): (anonymous) has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 4 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 7). None of this is in the body itself: all 28 points belong to 13 function items inside it that branch (ImmutableDenseMatrix, subset, min, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/ImmutableDenseMatrix.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e92ea45ffb67eff797a5d11a8276df6050e1e6a26db83402d2d69668ed7ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"scatter (cognitive 28): scatter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (9 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/collection.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9b2182ddacf849b6096d6ab2158f5533a4f301f16bc0e61e1cb6f123f645fd"}},{"ruleId":"D2","level":"warning","message":{"text":"object.deepStrictEqual (cognitive 27): object.deepStrictEqual has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6fa45342b134ac79ebb00542a10063779c7fe37d85ab6d294f3efb28263971"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo08xS0Sid.createMatAlgo08xS0Sid.matAlgo08xS0Sid (cognitive 27): matAlgo08xS0Sid.createMatAlgo08xS0Sid.matAlgo08xS0Sid has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), boolean chains 6, ternaries 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bca5a7042d2fde0943b812c8ac3afdee5efe1e5cdc5948cc39896663c13861"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorNode._toString (cognitive 27): OperatorNode._toString has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, ternaries 2 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1ab25475e2c1c5afb6682c7a9f61df84dcec737fe985dbb86a2a16e035f8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixDenseMatrix (cognitive 27): (anonymous)::_multiplySparseMatrixDenseMatrix has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (9 pts), boolean chains 5, ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676ebf5b658c5ff27cf8e48bdc335667a1b867f05d3a64e0dc16603cfc6131a"}},{"ruleId":"D2","level":"warning","message":{"text":"optimizeCallback (cognitive 27): optimizeCallback has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (9 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/optimizeCallback.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8f8faa74353a30d1132fe91965da08093bbedf6c8be20b920dd713cf66ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_pickRandom (cognitive 27): (anonymous)::_pickRandom has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), ternaries 4, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd4defef5f968f374160beb4a3876fdfe7f765014e948f2e8d4946ce1595997"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::matAlgo08xS0Sid (cognitive 27): (anonymous)::matAlgo08xS0Sid has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), boolean chains 6, ternaries 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af16692f1325579da73ba54809b66c2cc7e5f669a35e65d1f2b034a3cc12d8"}},{"ruleId":"D2","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixDenseMatrix (cognitive 26): multiply.createMultiply::_multiplySparseMatrixDenseMatrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (9 pts), boolean chains 4, ternaries 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. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a79fb3adcab95253762682aabee41bc066a131b54369b4b2e96227e390330c"}},{"ruleId":"D2","level":"warning","message":{"text":"createTyped (cognitive 26): createTyped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, error handling 4, boolean chains 3. None of this is in the body itself: all 26 points belong to 26 function items inside it that branch (convert, convert, convert, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a5da647df55a56cc57cde84d80066ced11124bcfc850bf472bd22756d1a19"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_pow (cognitive 26): (anonymous)::_pow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, ternaries 1 (4 pts), error handling 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":"src/function/arithmetic/pow.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e21cff9afb860714a6ded36f37ea35560a941d6948d6a23b1cc36c835b47cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass::_setsubset (cognitive 25): SparseMatrix.createSparseMatrixClass::_setsubset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_resize, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f811042e78f356c8ac925c307f24fa743f5c034a588aa80717482e24b855a"}},{"ruleId":"D2","level":"warning","message":{"text":"bitwise.bitOrBigNumber (cognitive 25): bitwise.bitOrBigNumber has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), ternaries 2 (5 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aaa7a49e8e5b2d7921de4e746c532c1639bff103a64a4f015d1d39452871f7"}},{"ruleId":"D2","level":"warning","message":{"text":"bitwise.decCoefficientToBinaryString (cognitive 25): bitwise.decCoefficientToBinaryString has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 5 (11 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a00915d85980b97a3b451da41f0540a3100ffcebfd10b3ac47c7ce649630fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo07xSSf.createMatAlgo07xSSf (cognitive 25): matAlgo07xSSf.createMatAlgo07xSSf has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 6, if/else 4 (6 pts), loops 3 (4 pts) (nesting depth added 7). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (a function literal at line 22, _scatter). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo07xSSf.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"130ef1d93b41efb55c82d518bfb50aebde1bf054fb2a88bb2a08a681d71084ba"}},{"ruleId":"D2","level":"warning","message":{"text":"concat.createConcat (cognitive 25): concat.createConcat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 10). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 64). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/concat.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aaf9a27ff0c725be8274db151956dac9d78f59cc0cb4ba835bdf9869cfe9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"compareNatural.createCompareNatural::_compareNatural (cognitive 25): compareNatural.createCompareNatural::_compareNatural has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compareNatural.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d357524830c4f32c211d294be648f7fb3238090e43a6349813146d1ec9e2d1b5"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.createSimplify::_simplify (cognitive 25): simplify.createSimplify::_simplify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, simplify.createSimplify::_ruleMatch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ea168f940b7070c4f5a9a36c0e836018ba78c05db9c25a75bdf59a2cf37d6"}},{"ruleId":"D2","level":"warning","message":{"text":"rationalize.createRationalize::polyToCanonical (cognitive 25): rationalize.createRationalize::polyToCanonical has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd6a74c175910db6ff13d9cdd6f5f605f3041c72cb0f4f60de4aece5c268ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_setsubset (cognitive 25): (anonymous)::_setsubset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9760c6ed0b1c2533d726f217ab1032533076d77f7e0f0fa389a391fbc9098be"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_simplify (cognitive 25): (anonymous)::_simplify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3b8623d8615ee663b7de7c371b8b145110f117f870976fba5abd584a2775a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::diagonal (cognitive 25): (anonymous)::diagonal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 3 (4 pts), boolean chains 2, 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":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a6465775a794ec2fa4d52d19db8379ce3cd2d7f10ca69eb344ec1e548fd1b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::polyToCanonical (cognitive 25): (anonymous)::polyToCanonical has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b45f5c6225a66be258cd44e7b54dcb921652314aef8e6232e7eaaf8a16a9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_compareNatural (cognitive 25): (anonymous)::_compareNatural has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compareNatural.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e167a2b161720744001e66b21656afdbdd63fc1048e8ad8f5154474335a768cc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::format (cognitive 25): (anonymous)::format has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/complex/Complex.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d784a2257796ab3570cad2a6639e6aaed9f3b529d5f5f4be56f3b295b1d2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::...Array | Matrix | number | BigNumber (cognitive 25): (anonymous)::...Array | Matrix | number | BigNumber has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/concat.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"402a818a1f1b584a80b68f7180581b59f7ebe93bd4233f8a726e529440380770"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_denseDot (cognitive 25): (anonymous)::_denseDot has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 8, loops 4 (8 pts), if/else 5, ternaries 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b6ac4da6eb4d6bf5561cd8320b470f6ec1cf8e7d86230f29ae2d16e25f2a77"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass::_map (cognitive 24): SparseMatrix.createSparseMatrixClass::_map has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cbddf7ffae96614bf07c2c0b0d467bf159ac4721bc4c8d6e00a5a3f2d11f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"dot.createDot::_denseDot (cognitive 24): dot.createDot::_denseDot has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 7, if/else 5, ternaries 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca96e2dee6d3f5831e5ef5d1957a229fe1d6df0c36b18726410b790747fa994e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseObject (cognitive 24): (anonymous)::parseObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b7d8f9ded0efa0be35b35b7d826cf688bdf4a7473a084cd37cf59370209c7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_map (cognitive 24): (anonymous)::_map has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae9ecaa5044c63fa0983ded0d394ddc8584ccbc172a9aef65949e7d1edc5898"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Range (cognitive 24): (anonymous)::Range has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7, ternaries 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":"src/type/matrix/Range.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc319849b85ec76a63814446ba23fde28652c9dc2dd7428f66af405e98c22456"}},{"ruleId":"D2","level":"warning","message":{"text":"pow.createPow::_pow (cognitive 23): pow.createPow::_pow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 10, error handling 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":"src/function/arithmetic/pow.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca403c4e935e33aabaee90868fd1d9ebf3bf3bf6b834b8176aa62b3e8168844"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_rationalize (cognitive 23): (anonymous)::_rationalize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb9ea070ba396870a5b0e35782cfb20c0a666f42e543db3993dd695f129fa1e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Array | Matrix (cognitive 23): (anonymous)::Array | Matrix has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (3 pts), boolean chains 1, match/switch 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d1020e38569d23ced139a2287f27af87923fdb30f9aae452b0bdc37096c00"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseMatrix.createSparseMatrixClass (cognitive 22): SparseMatrix.createSparseMatrixClass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 48 (91 pts), loops 24 (51 pts), boolean chains 34, ternaries 2 (5 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, SparseMatrix.createSparseMatrixClass::_resize, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99d82118febedb4c45bbf9601db1c9063c6252215ca2f2c8f5c7dcfaeb962ea"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo01xDSid.createMatAlgo01xDSid.algorithm1 (cognitive 22): matAlgo01xDSid.createMatAlgo01xDSid.algorithm1 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), boolean chains 5, ternaries 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d672c8523def9cba78cc35e491f9465baec174d8f42457f93eb545553e3022"}},{"ruleId":"D2","level":"warning","message":{"text":"MatrixIndex.createIndexClass.Index (cognitive 22): MatrixIndex.createIndexClass.Index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec2cc6d19d4db03bde0703c8dc8a549237bf745e2a1aae6b5ee01bd5704f1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"setDifference.createSetDifference (cognitive 22): setDifference.createSetDifference has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 30). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setDifference.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb44919773589ee3460caa115052698506f17cccb418d20d3627147a50fb8f78"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolNode.createSymbolNode (cognitive 22): SymbolNode.createSymbolNode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, ternaries 4 (8 pts), boolean chains 2 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/SymbolNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa460f4a09c24d9c6b6dae3c9f3d8690756e5e9d20c38f45790d6deb6475780"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseBlock (cognitive 22): parse.createParse::parseBlock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseRange, parse.createParse::parseAccessors, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3be74f87b86afda4b9fd4691f857d1713d2c5217da64a3dfde80b3da80d97a"}},{"ruleId":"D2","level":"warning","message":{"text":"pinv.createPinv::_rref (cognitive 22): pinv.createPinv::_rref has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa382423f2841f97851cd264c196c67327ce87e1d8515365195233861027e88"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseBlock (cognitive 22): (anonymous)::parseBlock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0418e98cf4992b33b8d6d888fa1de08a2cd068b25bb15c0e81296bd65d27a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_compile (cognitive 22): (anonymous)::_compile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, match/switch 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"180a343586b0102150df3d7650a6d6cc7fdf0969e37786eafba514f414fae63d"}},{"ruleId":"D2","level":"warning","message":{"text":"deepExtend (cognitive 22): deepExtend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f738c0fb656fc18de6ec7581b27e1ac9451f161c82253a995628b0ecdebdf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Index (cognitive 22): (anonymous)::Index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5963c68c10d3eda50160d6146385eca767a82088ed7697db1ee6097d034de0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_rref (cognitive 22): (anonymous)::_rref has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5dd6fb813c315f49688e1465e5d7aae1f240fa3877cfa34f9e0621b4c5020"}},{"ruleId":"D2","level":"warning","message":{"text":"Range.createRangeClass.Range (cognitive 21): Range.createRangeClass.Range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (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":"src/type/matrix/Range.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0974037219bda3822938ec4ce8ae2fe04d7160b7a3d76776bd6527a01d8fe054"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo03xDSf.createMatAlgo03xDSf.matAlgo03xDSf (cognitive 21): matAlgo03xDSf.createMatAlgo03xDSf.matAlgo03xDSf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), boolean chains 5, ternaries 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8817b5d03d04a76d24b8ef4e0e157525377bff741596b9ab57f3568088ad2d22"}},{"ruleId":"D2","level":"warning","message":{"text":"lsolveAll.createLsolveAll::_denseForwardSubstitution (cognitive 21): lsolveAll.createLsolveAll::_denseForwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (lsolveAll.createLsolveAll::_sparseForwardSubstitution) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba59cbf826ce8526d7934925cab2a4890286de2e10202dc736a3837b199fc8be"}},{"ruleId":"D2","level":"warning","message":{"text":"usolveAll.createUsolveAll::_denseBackwardSubstitution (cognitive 21): usolveAll.createUsolveAll::_denseBackwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (usolveAll.createUsolveAll::_sparseBackwardSubstitution) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5438268de331398b6c510b6a1f2ef049787da1a1c93acbcfd7af8f85d992a60"}},{"ruleId":"D2","level":"warning","message":{"text":"FibonacciHeap.createFibonacciHeapClass::_findMinimumNode (cognitive 21): FibonacciHeap.createFibonacciHeapClass::_findMinimumNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4063c25258478d1a1406d981757352368f2c11514b71f9d8628e1dbf9483f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Unit.createUnitClass::parseNumber (cognitive 21): Unit.createUnitClass::parseNumber has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Unit.createUnitClass) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"284ced3cf4688e2b53170531a974ef4f703b262f5ef10530cdb67ec6e6ee94f6"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseObject (cognitive 21): parse.createParse::parseObject has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"41181d23dd299feca8de703b97459a511153eb13570d192309a2476f53b50105"}},{"ruleId":"D2","level":"warning","message":{"text":"rationalize.createRationalize::polynomial::recPoly (cognitive 21): rationalize.createRationalize::polynomial::recPoly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::expandPower, rationalize.createRationalize::polyToCanonical, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba39322ba73084c1e1e082fd73f8c87e0469b5c8d2c8f4c75cc6c836463b288"}},{"ruleId":"D2","level":"warning","message":{"text":"import.importFactory.mathImport::flattenImports (cognitive 21): import.importFactory.mathImport::flattenImports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), boolean chains 3, 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":"src/core/function/import.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6d888dff72acbe9f4b3a4731c45ba7ef0c933accc42ec3fd46ba00e5079bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseNumber (cognitive 21): (anonymous)::parseNumber has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e57e8e255e864972714566ef070c0bd069e26b78499e44ea271b047da4a5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_multiplySparseMatrixVector (cognitive 21): (anonymous)::_multiplySparseMatrixVector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"821c28a21aa1e0fb91eeb47f522fb40a0a1eb653d7a991fae536967ddfb446b9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::polynomial::recPoly (cognitive 21): (anonymous)::polynomial::recPoly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d7e903f9e6cec41000a92e0ace60e3f5521c8838056aca83633ec08ccee79d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_findMinimumNode (cognitive 21): (anonymous)::_findMinimumNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aa9a14477045537ee79fea3bd42b4ac067dd1445a5ec4ba7103766da51df42"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 3, ternaries 3 (nesting depth added 1). None of this is in the body itself: all 21 points belong to 19 function items inside it that branch (constructor, _toHTML, a function literal at line 69, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b85fc9d6b57b425962192a9b1c2a7b07cd7b11de939f986fa0aa1b8e511de"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, ternaries 4 (7 pts), boolean chains 2 (nesting depth added 3). None of this is in the body itself: all 21 points belong to 17 function items inside it that branch (_toHTML, _compile, _toTex, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/SymbolNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef9f2329c7b128ab4bdc0b00889f34210ae6d3879e29ec2978061d326d90ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 14 function items inside it that branch (createProxy, a function literal at line 132, Chain, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/chain/Chain.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbce7a02e5fdd0d6b90dffc213c02cc3a90a053032e2860c4e081221017ac06d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_denseBackwardSubstitution (cognitive 21): (anonymous)::_denseBackwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7caf376c0129fc0ec74e8a48cd52e529d53c7dd6b400158529f267e0850823"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_denseForwardSubstitution (cognitive 21): (anonymous)::_denseForwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d811549159c6eefa1b1361e5d86596a0029c021760b6a0328c3be2cf866c75c"}},{"ruleId":"D2","level":"warning","message":{"text":"matAlgo02xDS0.createMatAlgo02xDS0.matAlgo02xDS0 (cognitive 20): matAlgo02xDS0.createMatAlgo02xDS0.matAlgo02xDS0 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cc82fe39fdcaaa798f15e1531505ff9a99963106e081b7ebe8f1c05ba1d00f"}},{"ruleId":"D2","level":"warning","message":{"text":"multiply.createMultiply::_multiplySparseMatrixVector (cognitive 20): multiply.createMultiply::_multiplySparseMatrixVector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 4, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40cd7e0c068cee1e8811c9974d9458e7d5209123c6453b008e4b651da929e82"}},{"ruleId":"D2","level":"warning","message":{"text":"subset._setSubstring (cognitive 20): subset._setSubstring has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/subset.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec87de7b957062f1b427b5ed7418c9ef807af0d3b1e32fed2cad4877722c2541"}},{"ruleId":"D2","level":"warning","message":{"text":"lsolve.createLsolve::_sparseForwardSubstitution (cognitive 20): lsolve.createLsolve::_sparseForwardSubstitution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec8771ea6e93ce8aa5fee3bbd8fda0ccef49390b838354c73274ae9115a492"}},{"ruleId":"D2","level":"warning","message":{"text":"trace.createTrace::_sparseTrace (cognitive 20): trace.createTrace::_sparseTrace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/trace.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee82eb09235437709f17d182097d852bdc1706679d4482c26d9a245f6fcd95da"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexNode.createIndexNode (cognitive 20): IndexNode.createIndexNode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, loops 3, ternaries 3 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"326b89eae0dc9999e7dc2ddc0d1eec6f57e882a83586ce98849ac7bef2353320"}},{"ruleId":"D2","level":"warning","message":{"text":"rationalize.createRationalize::_rationalize (cognitive 20): rationalize.createRationalize::_rationalize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, rationalize.createRationalize::polyToCanonical, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5754e18fb4fa60c809b4504fb62e2fdb43dddb11866b22428a2aaf3266ff5263"}},{"ruleId":"D2","level":"warning","message":{"text":"importFactory::mathImport::flattenImports (cognitive 20): importFactory::mathImport::flattenImports has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/import.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3458cf192c7b55d0112972f0db080502ae4e4a24d82bb8c4d1cec27b0563a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_sparseForwardSubstitution (cognitive 20): (anonymous)::_sparseForwardSubstitution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4d391b8485ab5b0207fa2d0e58c1afcf43deaed99d23c908ecc0425f06a02"}},{"ruleId":"D2","level":"warning","message":{"text":"string._format (cognitive 19): string._format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 1 (2 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":"src/utils/string.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"945017f95b1cf62d07ae7b7310203ba956dcfd8bd621726402dddd53571f5a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"diff.createDiff (cognitive 19): diff.createDiff has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2. None of this is in the body itself: all 19 points belong to 6 function items inside it that branch (_ElementDiff, _recursive, a function literal at line 63, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diff.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3a91a05eff5c0aec85156b3cd61a113c817f4935baf0af53bd7efd999c5a82"}},{"ruleId":"D2","level":"warning","message":{"text":"usolve.createUsolve::_sparseBackwardSubstitution (cognitive 19): usolve.createUsolve::_sparseBackwardSubstitution has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolve.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8128fb38b04312a3f671919caa7cf3d72decd9fc6394630e9fb222c630472f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"setIntersect.createSetIntersect (cognitive 19): setIntersect.createSetIntersect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 8). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 30). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setIntersect.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaa1d4acac1fdb3bd82a16dedbcfb557efa84b02139dbf04d9a0f7ff96920cc"}},{"ruleId":"D2","level":"warning","message":{"text":"intersect.createIntersect::_AAAA (cognitive 19): intersect.createIntersect::_AAAA has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/intersect.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4a5c374b13c0dcd40f7353b535cd164b9eefc848cc19cda401e46d40238c4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::FunctionNode, function (cognitive 19): (anonymous)::FunctionNode, function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, match/switch 1 (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":"src/function/algebra/derivative.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"772be85a8718616e38c90fe1910cdcc0e2e8ac6c3b7d755a52ddbc4e6a5b1ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Object, Object, Object (cognitive 19): (anonymous)::Object, Object, Object has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6 (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":"src/function/geometry/distance.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5f3d893b7464aad364f12f8fd10eb759f58411b0cc87c923f3e884038b5f1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Array, Array (cognitive 19): (anonymous)::Array, Array has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a1f8cc57127dee31e7b3554107ed2d1605a9b9fd9e9327a7a22da135dab7a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_AAAA (cognitive 19): (anonymous)::_AAAA has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/intersect.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbc0ebfca7a816ab1213fdaa2d885ad449c47a500b9ae5f4f36caa2fab341e7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10, if/else 5 (7 pts), boolean chains 2 (nesting depth added 2). None of this is in the body itself: all 19 points belong to 14 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, number | BigNumber | Complex | Unit, Matrix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotationMatrix.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1d6d9977fa23157dfdb280bf2c76de41cff7e457f046ba7b6695a403c8d79d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2. None of this is in the body itself: all 19 points belong to 11 function items inside it that branch (_ElementDiff, _recursive, Array | Matrix, number, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diff.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5be0e4fa9cc99ffd28ff1ee0d58489d3b804c43f9a039197387ee85f80e852"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_sparseBackwardSubstitution (cognitive 19): (anonymous)::_sparseBackwardSubstitution has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolve.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6698d80462bef19680f1516f2c48ff2c49b9d2d2e38fcadc0dd873c84fa8832"}},{"ruleId":"D2","level":"warning","message":{"text":"bitwise.bitXor (cognitive 18): bitwise.bitXor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c1265315d7217edd8efb3c0b77172f77c7c47a2e79c0211e8b4700ac7f03a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rotationMatrix.createRotationMatrix (cognitive 18): rotationMatrix.createRotationMatrix has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, if/else 5 (7 pts), boolean chains 2 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 7 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, _validateVector, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotationMatrix.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdee41bea2fbfebfc067e5f9d08c89369d75e832f35548a49863d39f43b91dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"transpose.createTranspose (cognitive 18): transpose.createTranspose has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 2 (5 pts), match/switch 2 (3 pts), ternaries 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (_sparseTranspose, transposeMatrix, _denseTranspose). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/transpose.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b9f21fa54170e1f0f20ed170ed4fb2ee1b76abc1a9182605c13675fda7e8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"deepEqual.createDeepEqual::_deepEqual (cognitive 18): deepEqual.createDeepEqual::_deepEqual has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 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":"src/function/relational/deepEqual.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84e498027cc4cdb7fba9cb01b3abbc2ddaac88232bd1c119601a07c39291052"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseRange (cognitive 18): parse.createParse::parseRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 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. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseAccessors, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def1d5ab81709f69cfe1dc348e6fd3024dccbfcf2c1018a38c197486f17766a"}},{"ruleId":"D2","level":"warning","message":{"text":"expm.createExpm (cognitive 18): expm.createExpm has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to 4 function items inside it that branch (a function literal at line 36, findParams, infinityNorm, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/expm.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de287505f7738703e0545a62d8c136a0115e0bda2470a023280b34ea05756b9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_bestPrefix (cognitive 18): (anonymous)::_bestPrefix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3948ed808488cd636bf59c9990e9a176770973344a9f2641e62cb0aad2dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::createUnit (cognitive 18): (anonymous)::createUnit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":3170}}}],"partialFingerprints":{"codehealthFindingId/v1":"284073fbf5cfd3afea95709ebf8d000dcb15021486fe44563709b0c02b364310"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseRange (cognitive 18): (anonymous)::parseRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 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":"src/expression/parse.js"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"672872029742afb3723935d9777861aadeb23a84a0e745837cf9bd003d14c9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::forEach (cognitive 18): (anonymous)::forEach has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (4 pts), ternaries 1 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ce0aeda22a3f149c9b9d12c89cb0f25d8ce33af0c33d2120fbd99b60ff95d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_toString (cognitive 18): (anonymous)::_toString has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, 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":"src/expression/node/ConditionalNode.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a632e4bb8a022eef632f81186b89337cd2e9ff802b48dd17eb7cb65598f9aa19"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_toHTML (cognitive 18): (anonymous)::_toHTML has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 14, 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":"src/expression/node/ConditionalNode.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d4046661ca64a5df46e9138f3076eb569cfb379712a776e2631b251562235e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, ternaries 4 (6 pts), boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 17 function items inside it that branch (_bigNthRoot, a function literal at line 86, a function literal at line 97, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/nthRoot.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7935229b7b3ea5e98c462067765e7b944d9962d8eafa0aaad7fcc0c909d9c676"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to 4 function items inside it that branch (Matrix, findParams, infinityNorm, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/expm.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ba87afd3e082d25354464bc798a01b4d4ecfe97e65f3a5984b9841896f68f"}},{"ruleId":"D2","level":"warning","message":{"text":"multiply.createMultiply::_validateMatrixDimensions (cognitive 17): multiply.createMultiply::_validateMatrixDimensions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 10). 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. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99093a4becc37192509215ca6aa7ce72b7b57e3fe93403c5a6a5250802f8430"}},{"ruleId":"D2","level":"warning","message":{"text":"nthRoot.createNthRoot (cognitive 17): nthRoot.createNthRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, ternaries 3 (5 pts), boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (_bigNthRoot, a function literal at line 86, a function literal at line 97, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/nthRoot.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a97ed9925c65ac42248368dabbb3ed2dc9e68da20a3a5caed9cec3e862427"}},{"ruleId":"D2","level":"warning","message":{"text":"bitwise.bitwise (cognitive 17): bitwise.bitwise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (6 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9385bdd92daab2b85e481a3ba460b4c6b65e30a99348aec60f2522bc25dd1c7"}},{"ruleId":"D2","level":"warning","message":{"text":"identity.createIdentity::_identity (cognitive 17): identity.createIdentity::_identity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac457e1ddfcd9844261a77fd053ed34cf487d8391adbbf325b0e5e59d80c500f"}},{"ruleId":"D2","level":"warning","message":{"text":"range.createRange (cognitive 17): range.createRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (7 pts), loops 1, match/switch 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (_range, _strRange, _out, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/range.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e41d9c8a025eb26d9e3d15b4e142fb9a1a2d6fa6af09169a54f60f0e6c9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"partitionSelect.createPartitionSelect::quickSelect (cognitive 17): partitionSelect.createPartitionSelect::quickSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (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":"src/function/matrix/partitionSelect.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87b6a3ddc2fb0aca7b05595d81b330307860822dd32e4617f278afc15035da"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessorNode._compile (cognitive 17): AccessorNode._compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7 (nesting depth added 4). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 106, 123). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dac544b9c1edaa49ce17b80ae2458e875854a2a1f266adf0b665f8d22bc6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"polynomialRoot.createPolynomialRoot (cognitive 17): polynomialRoot.createPolynomialRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 75, 145). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/polynomialRoot.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c17f1c8cfb51bcd52cafb72c54d40655dd9df289bcb3e1de0a43968804721"}},{"ruleId":"D2","level":"warning","message":{"text":"cumsum.createCumSum (cognitive 17): cumsum.createCumSum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), error handling 2, boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 5 function items inside it that branch (_cumsumDimensional, _ncumSumDim, _cumsummap, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/cumsum.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7179aeb54ba1e935683df72e0efb5017490c71b6613464f455bd42d7f6e0015"}},{"ruleId":"D2","level":"warning","message":{"text":"quantileSeq.createQuantileSeq::_quantileSeq (cognitive 17): quantileSeq.createQuantileSeq::_quantileSeq has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), 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":"src/function/statistics/quantileSeq.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"80544ebaa16fbc379826001ded62e38904954189221e4b281536e07c836defa5"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.createSimplify::mergeMatch (cognitive 17): simplify.createSimplify::mergeMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, 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. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::_ruleMatch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1247fcf40950338d791395f3e8f373d950b177c5a83b4c324ce910920ba7b95"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 179 (294 pts), loops 48 (71 pts), boolean chains 68, ternaries 13 (20 pts), error handling 3 (7 pts), other 1 (nesting depth added 149). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9472595dbb7bb1037db5d615ff122c2814e736bd75f3ced9e756312819728fca"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::mergeMatch (cognitive 17): (anonymous)::mergeMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c423ab56e8dabde6f15ef8f3f288a725260af0f130b8becdd701413da1e93"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_validateMatrixDimensions (cognitive 17): (anonymous)::_validateMatrixDimensions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cf6964d609c3df7000e6e7cfa38497967faae35f0e06d84f4314d026178f84"}},{"ruleId":"D2","level":"warning","message":{"text":"createSnapshotFromFactories (cognitive 17): createSnapshotFromFactories has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, other 1, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 108, 143, 168). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/snapshot.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd36bd5bd9133e21d09fa7a49e7d7b24665d71a76707f4632e4e2a47ae27b3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 3 function items inside it that branch (number|Complex, ...number|Complex, a function literal at line 145, a function literal at line 144). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/polynomialRoot.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b315490e1e1d5a6ed44f1870e3971313348e2cf2dbc9fe3701f7dd54b5970"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_identity (cognitive 17): (anonymous)::_identity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cd81ee0b6eb47569959b2aacb7dbc0cc6b3b7cb9d70cceaec11b4a5b67fb63"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::quickSelect (cognitive 17): (anonymous)::quickSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (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":"src/function/matrix/partitionSelect.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c13c1038faf073b2da6728b5a4273c25b7ed1effd9a71c62c7b41e6fee909"}},{"ruleId":"D2","level":"warning","message":{"text":"number.toEngineering (cognitive 16): number.toEngineering has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (5 pts), boolean chains 4, ternaries 3 (4 pts), if/else 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/number.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c41e9dfd400caa6b219750290c4ddfc231cdae20b71acce218418e4ec06a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.format (cognitive 16): formatter.format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/formatter.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0508b84b352be9f33967dc5d87bf46e62f43d94c74fd4ac44f3f7b1b213972bf"}},{"ruleId":"D2","level":"warning","message":{"text":"array._resize (cognitive 16): array._resize has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/array.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1e3b0cd6b67287fe089b6e8392e4fb91666cb870b630fe34dc77976e5ce2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"diag.createDiag (cognitive 16): diag.createDiag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5, boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (_getDiagonal, _diag, _createDiagonalMatrix). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diag.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab37c99213cfd276abfef80791e8d1d055f7e38efb636255a73a0f5251c3188"}},{"ruleId":"D2","level":"warning","message":{"text":"zeta.createZeta (cognitive 16): zeta.createZeta has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 1). None of this is in the body itself: all 16 points belong to 5 function items inside it that branch (zetaComplex, zetaNumeric, zeta, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/special/zeta.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbe307eb416a248382daebce54274dfb631fc711db8dcf4526da1120e22aef6"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.createParse::parseStringToken (cognitive 16): parse.createParse::parseStringToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daeab904e3906db217c93d1149351d8e5b8ff3d77e6b1efc3d0c2e8496ce29b"}},{"ruleId":"D2","level":"warning","message":{"text":"complexEigs.createComplexEigs::findEigenvectors (cognitive 16): complexEigs.createComplexEigs::findEigenvectors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 4 (6 pts), loops 3 (4 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. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a4ac295c1f719b468e63e189dc8155bbb3ec53888e92189c61638ec643649"}},{"ruleId":"D2","level":"warning","message":{"text":"zpk2tf.createZpk2tf (cognitive 16): zpk2tf.createZpk2tf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 2 function items inside it that branch (_zpk2tf, _multiply). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/signal/zpk2tf.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56f041acd7be51ba460f31ce0de8ecf822b79dc84628cb64e312702a58d1d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::handleVAandVARUnits (cognitive 16): (anonymous)::handleVAandVARUnits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"441b4b71d906fac28e4d8e6bd4e1fd99c724d583f86ebbb62d46feab012ef079"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseStringToken (cognitive 16): (anonymous)::parseStringToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6ca6d9af9dba5b9ee673086703d91b0cc6cc9a2447b4a41a9074e52c1359fa"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::diagonal (cognitive 16): (anonymous)::diagonal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feba241d04b3ea254fb0e8d996619054fe3f315e2f20873d40220cca97a9ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_quantileSeq (cognitive 16): (anonymous)::_quantileSeq has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (7 pts), loops 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":"src/function/statistics/quantileSeq.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b833bcd59de275f0f82e2eb7a391dbd7eca4e77ba8a71b290579b8c86c5edd"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 13 function items inside it that branch (toJSON, isValidVariableName, Parser, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/Parser.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc2bc2ab7a367e29e2c7bcf659daf9135c0a4426dfce7781c7a43382dc2a9eb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::Array | Matrix (cognitive 16): (anonymous)::Array | Matrix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c747dd1b7b56c3c35cfa2981eae7478c38b4fa9585c5873d9f61338c887a9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5, boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 15 function items inside it that branch (_getDiagonal, _diag, _createDiagonalMatrix, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diag.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d0ef277dd518956bc4bf730536732acb7166a760de9891053d211c4d4467c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 1). None of this is in the body itself: all 16 points belong to 15 function items inside it that branch (zetaComplex, zetaNumeric, zeta, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/special/zeta.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c1ae9c098e1765c8535eab17d3379013b7ae3e287d448b9e2610353a6329c7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 4. None of this is in the body itself: all 16 points belong to 12 function items inside it that branch (_toString, _toHTML, _toTex, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ParenthesisNode.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb11b99d2a8dae2e068114bda0f3cb50f0dc522403ac8bcc9fbc56a9d9d305b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parse.createParse: FunctionTooLong \u2014 createParse runs 845 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 745 over it, 8.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53b020f8f5dabec88953b043904545a8b5bc8c61b4773d9117d4073c5f5077a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: simplify.createSimplify: FunctionTooLong \u2014 createSimplify runs 504 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 404 over it, 5.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41582efeb961ff764467aaf0410c439fd989341f9ad54c2779ba66d8559d4981"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unit/Unit.js: FileTooLong \u2014 2171 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 99% of them inside a single declaration: createUnitClass (29-3405). The bar is 1500 significant lines; this is 671 over it, 1.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1b9dac217ec08e278527fd88924f23c93b79cd0c0b99a81e5e51446b14bf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DenseMatrix.createDenseMatrixClass: FunctionTooLong \u2014 createDenseMatrixClass runs 432 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 332 over it, 4.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f3ccc5dbc09f5ca1c94ad61c0ea25995b0641e6d280b93ec8ceacc6caea490"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OperatorNode.createOperatorNode: FunctionTooLong \u2014 createOperatorNode runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf77aa2dc8913e75549a064ef6129ed7a920e479acc2df97f00e4ae98cbb5f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: multiply.createMultiply: FunctionTooLong \u2014 createMultiply runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"735cfb06115d40ede5021d5b28d7c840cfb8622906ee580a67369e38908edcd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: complexEigs.createComplexEigs: FunctionTooLong \u2014 createComplexEigs runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac32524b9ae8d183d1b83c985f7a7da814abb1d9eae97e3e555fd5946cca110"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: simplifyConstant.createSimplifyConstant: FunctionTooLong \u2014 createSimplifyConstant runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"04812dc6167c9a1e60252523b1dee18631337e261ee91e05d62a0af98bd2519e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FunctionNode.createFunctionNode: FunctionTooLong \u2014 createFunctionNode runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291df06ac9bf28e779e25967dcdce5fd84e0773a6f602b029e547ba2db667e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import.importFactory: FunctionTooLong \u2014 importFactory runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/import.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"64df2e6adbbea088b5e2256d8a04bd6f34b17bda1f62f72f17781688a384ceb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lup.createLup: FunctionTooLong \u2014 createLup runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cbdcc1cd00000840f3c515462c7b59e2592d16d2585afe88793e1b3e215edd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: realSymmetric.createRealSymmetric: FunctionTooLong \u2014 createRealSymmetric runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"307a9bc57c7607f278b19be9da094fe06031f9cbd36919e3a12f5746b35a7b66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expression/parse.js: FileTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: createParse (29-1857). The bar is 500 significant lines; this is 370 over it, 1.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bebd3840b7696bfd829808c1a0f10758d580d6e280819682d4f990e579b9668"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: distance.createDistance: FunctionTooLong \u2014 createDistance runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb0de7379e51dd7913a867300bb3514a7153d026d6f72790caf3cb34aa8b496"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: simplifyCore.createSimplifyCore: FunctionTooLong \u2014 createSimplifyCore runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0ffa2cb63bd4ff5a9b55a80a3f4fcbe17a58bdf56222ae30e7e8091b96cfde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: solveODE.createSolveODE: FunctionTooLong \u2014 createSolveODE runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/numeric/solveODE.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"99295aa7c35d7008b7f339ebaea55f3e02fdfbe788b71e8be5c14588d80ab0e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FibonacciHeap.createFibonacciHeapClass: FunctionTooLong \u2014 createFibonacciHeapClass runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f421b8f039576f1dd1161274a30bd6812ebbf9e4b31c5bcf1ca58ae0a8bfdc7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RangeNode.createRangeNode: FunctionTooLong \u2014 createRangeNode runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5db0d5e9df2b2778da256f5803d885ebba80bf651d5b2109cd858cb97eee0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AssignmentNode.createAssignmentNode: FunctionTooLong \u2014 createAssignmentNode runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a5d18d034c76769095c9f3596c2b4f1646978f7718931d4c8d14c5443ffc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ConditionalNode.createConditionalNode: FunctionTooLong \u2014 createConditionalNode runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a69d7ed6d69346ebdb279f991a8d33fcf86fe99a0386adec122661e6dbe4cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Range.createRangeClass: FunctionTooLong \u2014 createRangeClass runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Range.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f2c249649e5f59b8d32d9b9b9c2cb9b09c5127aef2f6251db649cefdda9538"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: matrix/SparseMatrix.js: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: createSparseMatrixClass (17-1483). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c0f7f55e90ea42db1e714f6183401b58683310dab1fb74b70642a7597993d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: util.createUtil: FunctionTooLong \u2014 createUtil runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify/util.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e0e0647b8cf7767f5b59eb4ad45c1db99dc5ab00cb844de530063f289ad1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MatrixIndex.createIndexClass: FunctionTooLong \u2014 createIndexClass runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76bb2558d10ef0a0dbea3cfa748a77b96e7ad8afaa042a4746425f0db9de6fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FunctionAssignmentNode.createFunctionAssignmentNode: FunctionTooLong \u2014 createFunctionAssignmentNode runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d65299e590670800c4fcd418f3d734e59989dd6019364ce883d7908ab47a25a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RelationalNode.createRelationalNode: FunctionTooLong \u2014 createRelationalNode runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdfe51efce450dd9f8cd933fc9674ecee0de54e29c643467ef5db5e0f9911bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: map.createMap: FunctionTooLong \u2014 createMap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173cf42a5dd2438d7171d4fd3fdff844c0e48286a5ed7b535ef050ecebe535c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: snapshot.createSnapshotFromFactories: FunctionTooLong \u2014 createSnapshotFromFactories runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/snapshot.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b0f6decd7c21b818598adb504abee02ede0f9f3300a39b8680cae414dae154"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: algebra/simplify.js: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68b213a8f3019ef73c82e31befef29b7e938bca8f31c8c8a2f9281b7f35e1c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionNode._compile: MethodTooLong \u2014 _compile runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1170647cfa6d5af47051878aedd250e99294cf6f87c8f3f9948a8120d2211e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: intersect.createIntersect: FunctionTooLong \u2014 createIntersect runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/intersect.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"747c2ad39d275f3e1431c6d8ac6fa6ec3d2b1bc384f00a1e7bd24ff9fb57713e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Node (LCOM4 5): Node\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/Node.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d761fd9f613fa272e371622adaf1ec015a3eb2c02305463fc2b90e516a91f36f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/function/algebra/sparse/csCounts.js: 22.6% line coverage (24/106)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csCounts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"920313eb1ad99065df8f73cd9280786778b66f20915a89933addaaf4b2e4f718"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/function/algebra/sparse/csEtree.js: 19.0% line coverage (12/63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csEtree.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704c38aef0e2eba4c2177dddbc61c471bca4518114a0d786675616a2f1097cdb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/function/algebra/sparse/csLeaf.js: 37.3% line coverage (19/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csLeaf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60ce2342b6c04e2bde0c23b65ad1eff697193298080de7e8b1184da496e7b61"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/function/algebra/sparse/csPost.js: 26.1% line coverage (12/46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csPost.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5b1202058cc9f493dc38d707c94926529cf6067ed25f4a4dfe995b07c5f4b9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/function/algebra/sparse/csSqr.js: 39.1% line coverage (61/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csSqr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7b0ff7337bfa52e5458434937aeb5e73cc65ca39ea87ef44963606df2235d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/utils/noop.js: 47.4% line coverage (9/19)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/noop.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1345274677ffd07757663724c2c753c3d164d2003aa91b5abace5498dc7a4e0a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should order functions by their dependencies (1): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/utils/factory.test.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e24848180ddc303c3949d444df5cbc5a7a3d7cdf82031c6398e197a88103a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should not go crazy with circular dependencies: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/utils/factory.test.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe0f76982ad0f807c0835ef65a60539c6e41a7dec5ce9c9befc40899af782d4"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should cancel units in numerator and denominator: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/unit/Unit.test.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf95fc2ff4d3ce0f560476a539ffeea0053b406e682806d8af25196e869247"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should throw an error when input array does not have two dimensions: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/SparseMatrix.test.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab2752c27002a3c3424d28aeb0c186694a4e7ba029b2719bef49f9fb98d932"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should throw an error when the dimensions of the input array are invalid: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/SparseMatrix.test.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34d175f7699c396871ea750a71ad8d44749b1be4486ef8dc07f7b26e746622f"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should skip zero values if skipZeros is true: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/utils/deepMap.test.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350db1090eef50625610545052ed366b85a1e35f12ab92261ba57758ef54c80"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return the product of strings (with BigNumber config): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/prod.test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"745369ea0b5beb91fb3d75ff3bd5e871ede04223cb20a4a61dd29828d6d47b24"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return the product of strings (with bigint config): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/prod.test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8763b07b9be74ed43b408eb9eff4c4f1c69798562886ec36b438015e03b9c36a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return the quantileSeq of an array of bignumbers with number probability: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/quantileSeq.test.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4ef934832c2ab242bf23d19e9e7626c636dcb924952d8b0b3bd271abddf4c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return the max of strings by their numerical value (with BigNumber config): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/sum.test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9aacfeb1baba5a70a3c66e667aa4df448dddb6943271db8a277df9f0e904e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return the max of strings by their numerical value (with bigint config): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/sum.test.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8811ebbf038bcb8c50d9a1579298ffc9e4743c83d43843d73601ec1f4e8de995"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should calculate the modulus of bignumbers for fractions: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/mod.test.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"372735cd4c1a830e277c8709b6d761a97e899a8f46243614a68a8bd453ee6135"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should multiply a bignumber and a unit correctly: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4e88f8fff4813a0a15f439d7a4cba98dc8e27ea74312239e8e608e3ff66b51"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should multiply a bignumber and a unit without value correctly: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5457bb04a1d11c8e46f6faca189890bd1a6c35a8fe45381194ab602261638f"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should return bignumber unary minus of a boolean: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/unaryMinus.test.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"838e23c88671d21cbbe40882047f986382fb5a6f3fc1a147845fa4d5fd9eab4e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should compute and simplify derivatives (3): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/algebra/simplify.test.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb12d3673556b111aa8b68f4c944a3e6bb7b2f61c762bb92787133719c91f85f"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should import a factory with name: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"69349230d21ed5d985ede03cfa6173e868578462c459e0a5bb41b680bd6e22e9"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should import a factory with path: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86919ff8b54b636a7a3064157a8a4ee23362d14ccc690640aefdcd9c0e1dbf4"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should import a factory without name: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c039cf96ddcd10060a2fb71203658162209d4a3f2fe9477a4f62ec500fc5b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should pass the namespace to a factory function: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbe34b2cbb83db7b3daf6512fc3d9b0263adc211140978e206b7baacde030fc"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should import an Array: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb4a608587112152de1c30fd848447bbde3186123ff14517b379fb8308b1ba"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): should throw an error if the axis exceeds the dimension of the matrix: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/variance.test.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872921c0cf424aa2fde518b3a4ff53e4baddca2908e6cb5216777402e4110e4"}},{"ruleId":"D10","level":"error","message":{"text":"Assertions commented out: should throw an error in case of unit non-numeric argument: The test body contains commented-out assertion calls and no live one \u2014 it runs, verifies nothing, and still passes. Restore the assertions or delete the test; a green test that checks nothing is worse than an absent one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"978f1935070a94b7384fa16b3bba1577dc5c437b9ef71dec9ec3a25bc627ea42"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should merge nested matrices: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/expression/parse.test.js"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91757e5613b51ddbdd885228cda9466139d567f8e301b0d1ff2e9549f8cffdc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should parse the user defined members: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ff6c6fe8155cef3f000b429786d7ba9da910ab233f8249532237571a436972"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should have all expected functions in lib/browser/main.js: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/node-tests/browser.test.cjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98421d6fef119d26d50caaecd55643db981f2bcf185ed212c2ee7c3ca7217ec"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should be ES2020 compatible: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/node-tests/browser.test.cjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab3eb22d9ce56ae647bbe906a1b5e1f925f70200d490f531745acf63f1ddacc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should contain embedded docs for every function: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/node-tests/browser.test.cjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a16c5bcc146fce6343ba3b63740dcf513390c5f7a9767a1456add5e3a749057"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should multiply matrix x matrix 1220 x 1220, Matrix Market, sparse x sparse: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/node-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"645640cf823faa1af04d7e924ce500b6e56ef0c6f27735e669e67a1283395fa0"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: codecov: codecov 3.8.3, declared in package.json, is marked deprecated by its publisher: \u0022https://about.codecov.io/blog/codecov-uploader-deprecation-plan/\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5586161b10249783e1cd86d81135fa43ab9534165af807402f52da1dc54fe67c"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: eslint: eslint 8.57.1, declared in 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":"package.json"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d6fe6ca46e7c5138acb9303f34c05bf26af5e4732d5aadfd02868b07841a1"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: glob: glob 11.0.3, declared in package.json, 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. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dfa8364448a636dde7d466403280de05e962b7d69e34ec0d3707ec14687871"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @humanwhocodes/config-array: @humanwhocodes/config-array 0.13.0 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Use @eslint/config-array 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":"package-lock.json"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3367f047ca48a2f4bbec028d1037c4158644375cb7f4ff97dea0a73eca0b3a1"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @humanwhocodes/object-schema: @humanwhocodes/object-schema 2.0.3 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Use @eslint/object-schema 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":"package-lock.json"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"16783e478c5e2496ef49cbd939acc4ed3bce191a6c2ac6202c1a08e7b956a7ef"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a21a0f511e79bf1641d8781e0ca2d1a227ed4ef5f1fd822135ca3108ada0d"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af59a68b703d1d09f733b4123d502871e54cb862646e84770d19bbb5c4c04c9"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: argv: argv 0.0.2 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Package no longer supported. Contact Support at https://www.npmjs.com/support for more info.\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":"package-lock.json"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f672197d55284919b2c372fd315d502065fc877f1d68a56512078e95efea0e0f"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: har-validator: har-validator 5.1.5 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022this library is 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":"package-lock.json"},"region":{"startLine":7011}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867476d8ed54f929bb8bee15d6736d4d24ac7cacbb2a4bab1cbf93b908966dc"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: inflight: inflight 1.0.6 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":7356}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f44f2d08ee8839d5172f941ab3bc1c660bb2257c3c3bd3354971f7072e14eb"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":8617}}}],"partialFingerprints":{"codehealthFindingId/v1":"468387141acdf2205d118e7df44ead947c3b0a91c2c515c7217f83690dc3b0fc"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":8675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d8b38b21e4ae834bbe46728e4b8e8485b219a263012b919a31cabdab271f3d"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 10.5.0 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":9379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8806d07e7c30d8cb43b941dfe3c859e50d169f8a0738e45ec752ff91debc52"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: q: q 1.5.1 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022You or someone you depend on is using Q, the JavaScript Promise library that gave JavaScript developers strong feelings about promises. They can almost certainly migrate to the native JavaScript promise now. Thank you literally everyone for joining me in this bet against the odds. Be excellent to each other. (For a CapTP with native promises, see @endo/eventual-send and @endo/captp)\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":"package-lock.json"},"region":{"startLine":10400}}}],"partialFingerprints":{"codehealthFindingId/v1":"23df66298c75dfbba991f3e45ecff40d0164aea2f55400cfdfcc13ce6891e002"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: request: request 2.88.0 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022request has been deprecated, see https://github.com/request/request/issues/3142\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":"package-lock.json"},"region":{"startLine":10672}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef6e4631e28f1ab9ba0b8a7e7105fc7498a143751f405fd2e251edb0d8dafdb"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: rimraf: rimraf 3.0.2 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":10828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f19ad8cb4391b735e04142442af28e60cbd91c2bb1f98ea175f4eb33e27294f"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":10856}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ec6712d38cde7110d97d542f9cc16adcd7d08e6192534b61eede4c869ab21"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 10.5.0 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":11898}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab833410fffdd64c4c27a02c76f338f8c178167372cc7da9f74f614a53afdd"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: uuid: uuid 3.4.0 is resolved in package-lock.json 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":"package-lock.json"},"region":{"startLine":12723}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fcf5042de4f0ca942d67e731bb998a0ee1555122cd23c16021d1b6be8b036f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/type/unit/Unit.js: src/type/unit/Unit.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 288 in Unit.createUnitClass at line 29. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:12:53 -08:00\u0027 --until=\u00272026-11-13 10:12:53 -08:00\u0027 --full-history --no-merges -- src/type/unit/Unit.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"49992323c2612637e84af4b831c5e5de88458504def511134e0cb85694d5800a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/function/algebra/derivative.js: src/function/algebra/derivative.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in derivative.createDerivative at line 21. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:12:53 -08:00\u0027 --until=\u00272026-11-13 10:12:53 -08:00\u0027 --full-history --no-merges -- src/function/algebra/derivative.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d062850dc92a7968236297ebbe0f17eda11f60b3ce8db233dd591b194e0da28a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: src/function/matrix/subset.js, src/function/geometry/intersect.js, src/function/matrix/transpose.js. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d7c8c7921c7de855ec313b96f0fd8aa590a5035c637d9fdd635373b05165000"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 9 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 (12 single-owned of 190 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; 190 of the 666 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) (\u002B3 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/type/matrix/DenseMatrix.js, src/function/algebra/simplifyCore.js, src/function/matrix/concat.js, src/function/combinatorics/catalan.js, src/function/probability/multinomial.js, src/function/combinatorics/stirlingS2.js, src/function/arithmetic/xgcd.js, src/function/matrix/mapSlices.js (\u002B1 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Typescript type declarations are not understanding typed-function\u0027s \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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e447f3760e5b7486fbb3adda6ee8b65fede0e69819553e001075aea06ef9ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO complete the rest of these... \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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9126803ed09d6ba2b73b77d417fd561e21f32755a89391e4467d481e68aedd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add proper types for toTex options \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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd6f06bed0d1041b9fe278702a1e36aa47e9da65e54e7c14ca3c8e025d0def0"}},{"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 \u0060package.json\u0060 makes this repository a deployable product (line 135)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022create commonjs package.json file\u0022 repeats the code it sits on: 4 of its 5 words (commonjs, package, json, file) are already in \u0060fs.writeFileSync(path.join(COMPILE_BROWSER, \u0027package.json\u0027), PACKAGE_JSON_COMMONJS)\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":"gulpfile.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5783e4fc62b358493f421512b0ab433e22fbe9acc50df55a3fd6c9fadc62070"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The default task (called when you run \u0060gulp\u0060)\u0022 repeats the code it sits on: 4 of its 5 words (default, task, called, gulp) are already in \u0060gulp.task(\u0027default\u0027, gulp.series(\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":"gulpfile.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c009ae5243d6afa2d8e08a37e8cafe02910a1146ae1eec5e26d8407fc56caa1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022syntax error or unexpected end of expression\u0022 repeats the code it sits on: 5 of its 5 words (syntax, error, unexpected, end, expression) are already in \u0060throw createSyntaxError(state, \u0027Unexpected end of expression\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72378ba0c46891084fcddaead2bfccf1fedcfb49dbc56ae1abc5233b3f2d95c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022swap j \u003C-\u003E pi in data\u0022 repeats the code it sits on: 3 of its 3 words (swap, pi, data) are already in \u0060DenseMatrix._swapRows(j, pi, data)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f20e5ee872af3322b17f9ea0ffdc65d3cbafb73ee90f8eef94c1d5777dece7c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 8 comments in this file only repeat the code they sit on (lines 274, 275, 337, 338, 370, 450, 614, 615), for example \u0022end of recPoly\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":"src/function/algebra/rationalize.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c451bbcba6c88d4bd44a8ebd22a05f66b2cbce09b36f0f0c0962b583b667057"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022create target matrix C\u0022 repeats the code it sits on: 3 of its 3 words (create, target, matrix) are already in \u0060const cm = _createTargetMatrix(order, a, m, n, dense)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csAmd.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6702b4cb7a9cf0edf59672a228e822557c48bb22068e616e3ebc21993b9e671f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022initialize quotient graph\u0022 repeats the code it sits on: 3 of its 3 words (initialize, quotient, graph) are already in \u0060let mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csAmd.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bc1803029df16292c2b77d66e5da238b74351dc379263f62a63dacd9cf0703"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022initialize degree lists\u0022 repeats the code it sits on: 3 of its 3 words (initialize, degree, lists) are already in \u0060let nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csAmd.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68dd5b921003eee6891abf49314d90f895760c274375dd23fc6de78ed5d7b1d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return [clone(Ei), clone(Sij)]\u0022 repeats the code it sits on: 4 of its 4 words (return, clone, ei, sij) are already in \u0060return sorting(clone(Ei), Sij, computeVectors)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b27dfe64e8ab1e71da736ec3b5b4841a7dccbdb5f7bc46b4792fc952179bb8b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022quantileSeq([a, b, c, d, ...], prob[,sorted])\u0022 repeats the code it sits on: 4 of its 4 words (quantile, seq, prob, sorted) are already in \u0060return isNumber(probOrN)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/quantileSeq.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea46b15f9771dccf46009e6945c9811ee8f9d59b82442969f23910ab835c813"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022x has a word size suffix\u0022 repeats the code it sits on: 3 of its 3 words (word, size, suffix) are already in \u0060const size = wordSizeSuffixMatch[2]\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/bignumber/function/bignumber.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"57037636462b058eb2b2f14e07840452cd5ae863c51aa6d0bdeba5e83005ce12"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022check data is a DenseMatrix\u0022 repeats the code it sits on: 4 of its 4 words (check, data, dense, matrix) are already in \u0060if (data.type === \u0027DenseMatrix\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5cee3af4857fdca0567ccd473d6f4dbcba02d66e24df81d3463733db18db73"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022create DenseMatrix\u0022 repeats the code it sits on: 3 of its 3 words (create, dense, matrix) are already in \u0060return new DenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc328a3b408736910c7f015be5dbba065abf5331f1e21589b18c2d52d9a85989"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022check it is a big number\u0022 repeats the code it sits on: 3 of its 3 words (check, big, number) are already in \u0060if (isBigNumber(s))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf20cdebf539e5de8217315b26adda92fc1465db05247558e042f9519daa28a7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022create DenseMatrix\u0022 repeats the code it sits on: 3 of its 3 words (create, dense, matrix) are already in \u0060return new DenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1157b0c97a651517c2f53a2b7436c0a7643dc2be33e98d39cf1443befde0b3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 121, 168, 203, 205, 253), for example \u0022set Parent[x] to null\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":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc46dd18824efaeba939e7015845db5cadb6a15d86c882f7b68aeb0489d23b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return immutable matrix\u0022 repeats the code it sits on: 3 of its 3 words (return, immutable, matrix) are already in \u0060return new ImmutableDenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/ImmutableDenseMatrix.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"def8beb93594264249a4654ef16dac1e6e93b18287a2feab1cb4bb1462da35fd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022insert node in heap\u0022 repeats the code it sits on: 3 of its 3 words (insert, node, heap) are already in \u0060node = heap.insert(n.key, n.value)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Spa.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0142f3154b2c8d16e82cf3783b2e5e258dee0b45222886a707f07f48fd7f1f1c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 73, 120, 639, 1257, 1366), for example \u0022check matrix type\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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"71424215ee8a2cbf0e3505cf128cad177f0c9e4ded55ccce54b645e65d7e8fc0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return dense matrix\u0022 repeats the code it sits on: 3 of its 3 words (return, dense, matrix) are already in \u0060return denseMatrix.createDenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"57006133af9f81b41425a64d01366f0d738c50aa3c4ab837181570994033cbf4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return dense matrix\u0022 repeats the code it sits on: 3 of its 3 words (return, dense, matrix) are already in \u0060return denseMatrix.createDenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d568f34eefec6a3ae563091de74fbc71390c3994e86afbd8af2ce32334663c8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return dense matrix\u0022 repeats the code it sits on: 3 of its 3 words (return, dense, matrix) are already in \u0060return new DenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo10xSids.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e9681da7455743af99208a98bb5535d310d0753f9fd82b428cbff4ecd58f92"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022return dense matrix\u0022 repeats the code it sits on: 3 of its 3 words (return, dense, matrix) are already in \u0060return new DenseMatrix({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo12xSfs.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"625686d003ef2f9b2666a126bc4405760c50ed96a01d07794a180183faaf24b9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Does the unit system have a matching unit?\u0022 repeats the code it sits on: 3 of its 3 words (unit, system, matching) are already in \u0060if (hasOwnProperty(currentUnitSystem, matchingBase))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca98770d16ea0e5f4e85e97202b9dbc241fc74b4cc358a601ebc2f2e470f2c83"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set the current unit system\u0022 repeats the code it sits on: 4 of its 4 words (set, current, unit, system) are already in \u0060let currentUnitSystem = UNIT_SYSTEMS.auto\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"f938585dc15cc6bd17483ff2a38c6fe59f5370b53892b435c00f40bfb0ec3b27"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022abs(a-b) \u003C= max(relTol * max(abs(a), abs(b)), absTol)\u0022 repeats the code it sits on: 4 of its 4 words (abs, max, rel, tol) are already in \u0060return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/nearlyEqual.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af2ceb724d57060d980fbf72eb276d25da600168791221490e54e8c4707b180"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022abs(a-b) \u003C= max(rel_tol * max(abs(a), abs(b)), abs_tol)\u0022 repeats the code it sits on: 4 of its 4 words (abs, max, rel, tol) are already in \u0060return Math.abs(a - b) \u003C= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/number.js"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7baa3fee5d5d49467142fc243025003a1a4d5f19bf484f6b979494443aba262"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Can assert that the array is a Unit[]\u0022 repeats the code it sits on: 3 of its 3 words (assert, array, unit) are already in \u0060assert.deepStrictEqual(math.ceil(array as Unit[], 1, math.unit(\u0027cm\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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f087a7a8a4090a7c322777ab167513209aa65e60218cdebe4ee44db859696ed"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Can assert that the array is a Unit[][]\u0022 repeats the code it sits on: 3 of its 3 words (assert, array, unit) are already in \u0060assert.deepStrictEqual(math.ceil(array2 as Unit[][], 1, math.unit(\u0027cm\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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cc67bfb3b6a46ebe02c7625ce6877b9c8cc074799150e3d4500c6ce530f3e7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Can assert that the matrix is a Matrix\u003CUnit\u003E\u0022 repeats the code it sits on: 3 of its 3 words (assert, matrix, unit) are already in \u0060assert.deepStrictEqual(\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":"test/typescript-tests/testTypes.ts"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"149995df339f53a6736b7252b712cafb3cd3a6e1d333dd6004e3614d2ab12c94"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022(null ?? false) or true\u0022 repeats the code it sits on: 3 of its 3 words (null, false, true) are already in \u0060assert.strictEqual(math.evaluate(\u0027null ?? false or true\u0027), true) // (null ?? 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":"test/unit-tests/expression/function/evaluate.test.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf278c758c9c9ad22f6dfb938f0b3e09e19746851872c90463b9988ba6c48c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022true or (null ?? 42)\u0022 repeats the code it sits on: 3 of its 3 words (true, null, 42) are already in \u0060assert.strictEqual(math.evaluate(\u0027true or null ?? 42\u0027), true) // true or (null ?? 42)\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":"test/unit-tests/expression/function/evaluate.test.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"54885924759d7c7d711277a3730250211ec9d47016be93fc10ff2a63535365b8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022false and (null ?? 42)\u0022 repeats the code it sits on: 3 of its 3 words (false, null, 42) are already in \u0060assert.strictEqual(math.evaluate(\u0027false and null ?? 42\u0027), false) // false and (null ?? 42)\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":"test/unit-tests/expression/function/evaluate.test.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0832beaaa737d783fcf3543f4bad8189ff4c29eaf7c8668fdca4631c52256a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022true xor (null ?? 42)\u0022 repeats the code it sits on: 4 of its 4 words (true, xor, null, 42) are already in \u0060assert.strictEqual(math.evaluate(\u0027true xor null ?? 42\u0027), false) // true xor (null ?? 42)\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":"test/unit-tests/expression/function/evaluate.test.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f7029fc4afeb7e5d971de593ec6ba0e1388d107d7a4c30c18c0557c0e9767c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022xgcd(36163, 21199) = 1247 =\u003E -7(36163) \u002B 12(21199) = 1247\u0022 repeats the code it sits on: 5 of its 5 words (xgcd, 36163, 21199, 1247, 12) are already in \u0060assert.deepStrictEqual([1247, -7, 12], xgcd(36163, 21199))\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":"test/unit-tests/function/arithmetic/xgcd.test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382b26872844833c7d52a21edbee083741911e87c069905bf6a2c12c0ddb403"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022xgcd(120, 23) = 1 =\u003E -9(120) \u002B 47(23) = 1\u0022 repeats the code it sits on: 4 of its 4 words (xgcd, 120, 23, 47) are already in \u0060assert.deepStrictEqual([1, -9, 47], xgcd(120, 23))\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":"test/unit-tests/function/arithmetic/xgcd.test.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fc9f0ec5414821b198770d080f1b912b0273494d78aa1d1f4ff518d95cf1fb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a new Map\u0022 repeats the code it sits on: 3 of its 3 words (create, new, map) are already in \u0060const copy = new Map(map)\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":"test/unit-tests/utils/map.test.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ec833359988b1c320a2ecda462023baa69d92301c30eeeedbf42c65d4f38e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022create file with all functions: impureFunctions.generated.js, impureFunctions.generated.js\u0022 repeats the code it sits on: 5 of its 6 words (file, functions, impure, generated, js) are already in \u0060fs.writeFileSync(path.join(entryFolder, \u0027impureFunctions\u0027 \u002B suffix \u002B \u0027.generated.js\u0027), impureFunctionsTemplate(data))\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":"tools/entryGenerator.js"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa435d5efb3f83498c24e4f10a6fdd4e0ae3a0a0fc973c5deaa6d8060985a3"}},{"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":"1a109badce344d491e273e65f4c873503581c227cf6e351e5d7d408324b94960"},"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":"e263ba84e613043a886058aec3a3eec473b92188a17dd3a49fbc50c16e74f42f"},"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":"43423dc467f10f14ab06a817aed6cdb00935b9e1675b130c1e45c802099616a0"},"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":"0963b5cf307a9fda8d263b0b901b57a733a15c46fb2b34158b63c4e655f7c8c1"},"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":"45373063652302dcad779c6d3c7fe157aa5ff0e0766b40aab17a39e6cf84151d"},"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":"bfebff139052ad7d0c9937a569895f57547efc25c33a4a1327a4c77dcaa5adf2"},"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":"ada1f8c4778b343f6fc1b07f28c0054f154a2392ef78fd4b03ba9080fced607e"},"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":"8c9b18c2c69fdc305d52f5dc53abff8542d0c30c002d33622848456b42f48e7b"},"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":"efb15c2180317a076db82394c287e9abcc55be17dd2b4ca29c5c3bb7872e25ec"},"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":"b1d2148ae8fe6bffdaaf8d3200c4b91b68a7be07896522262caeeb1f7f9b9f00"},"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":"9c574c455c040fec06481e12aebbd6ce5522d9970be8e3fe4a11809e4d4c9d82"},"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":"d3464f80f4dcf9ca4552134881dd15a4252970add572939be5fe552b5fea6215"},"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":"1500b7594a3775db268a985e8836aba740757de14c95d4d8a62de16d57244421"},"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":"20f1a9d502807c2a8d79053d6034a272ac8311184fe4812e98d3349d4d3281b4"},"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":"6fd5243f92d06ea2cbad74870c0b8a808866910978896cc37abe3b284655444d"},"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":"5969e98c260446222039a5dc74528778f0b56f49674d09985d388aafa74925bc"},"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":"761ea0777deccebd88d142b8d6ad6a68e677a5eaa8b921be2e7a3186ae29ae05"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07ad379e08485fb1ff97d9c4801bdec6fb3ec2f0809df8f3b7cbc69088610544"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b15b04aa8b76da4e09315abf98381281f6344558bf9492f5ac76a0d1fe5d1cc9"},"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":"00f4caa588d9818b706476b6e526e92c64745ead5e363221f157d433624ae137"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ef97b47528410615dd0431d93b3fbb7ebbba4187621658601dcf25150052a33"},"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":"b06c21aa3fed14e69b43ce73d78ba7603a57b2709b7d24abfa3e8f2f19905ede"},"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":"4a08c90e2518e6ec6f87bd49c4ca0ac878f9781e0892ea9592950c152a2c005f"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8b982f108de182ba77397a9b0f27addd5c03ae6840736a528b48703d2791837"},"properties":{"dependency":{"package":"form-data","version":"2.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd65312b21298385f5a9d2ff354c54fa15251c76c9cd93964278b63a1404a15d"},"properties":{"dependency":{"package":"expr-eval","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36bf8221411e8b163103a60e8e6bc762e68424b0e257370960bd6c26b957bea8"},"properties":{"dependency":{"package":"handlebars","version":"4.7.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c80c98744eb2bbcc1976262022e9b00587c0d4a65e638ea5b6fd4e0632aa274"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ccc41b24a28e9c71cc5c6885323e6bcc9ba55deee9f6999ed530ca73c4f3ba8"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbe29bec713b408452ca86f4523dcd4da63c022c68a4db4b8b04259c432d56bc"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"259570b38d2bb66b81f025d9a8eb9c9e11e843fb5265a68c1c9b8093fa8a4ee3"},"properties":{"dependency":{"package":"rollup","version":"4.47.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfc75716209310f92cbcbbfdf72b35fff46cb5068a0d7608567ac5c4ed5e11b9"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80bb0fa188fc186d077ab5382646faf7c336e813e2d9059d29b190b6e0988eea"},"properties":{"dependency":{"package":"vite","version":"7.1.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f859d229c887a7047790a6dd296f8b284bd2cc006da71fe8df31fd4c1195152d"},"properties":{"dependency":{"package":"mathjs","version":"14.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5163547957c66bdf78eec5792bba6ddf14d66ba30a16d2b008813acd0c80adb7"},"properties":{"dependency":{"package":"@babel/plugin-transform-modules-systemjs","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8aa23999529878889e40193ee34f834b13bb9ea358529ed1d00cf73ec828d449"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4eb682f81a2157ac3c0d1e3ea61aae2f0fba5360595eddce32e0a6e57223b2aa"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e405d2494dbc637e4473f16879796d9e7d926d1f2cce7028a0abf9fe27f769f8"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9eabe50e921d2c2a306c1659895f52c11083f6a9b5afd9baccfb22db496e06e7"},"properties":{"dependency":{"package":"body-parser","version":"1.20.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9883b9dca7ab883bfc824ae6f3668f907764cc0c21ad57ecf5f070c962cc36eb"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"384a0892f51a77ce6e1097a5154e203805ee2ad75d30693634ca5b796c0008c6"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fd85fd4b6192a538bfc9b04cfeef3e6aef7c43c13e5758877ac6be651aaba3d"},"properties":{"dependency":{"package":"engine.io","version":"6.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2567ea2f56ae79977dadd3bf380bcb8e0d5204997d0db598b3e49e1891ff5525"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a51cd9bac6da640e38cf883c1ea361c13f6e25c446f4643782afc1591a1c03f1"},"properties":{"dependency":{"package":"flatted","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90b9237a7188204cda43bc5c5934c53e004466b9459cd832887d87498fc2cbe4"},"properties":{"dependency":{"package":"minimatch","version":"10.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"cb72967e254de738d149ab47cabaec1da7d7cc8ac667c374974f579ede3da143"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce9074a8ca02728fcc1d03753ea9d91376f00dae795aa598fd65fddb2b7fb34d"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c5c5cd5d2c15eab685c2fe5d20df30112cf77ae6166e8eaeefbcaa1176cdfb2"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"b8de03b46f2c0000606805ceef521ba3a7d955aab0046bbf2e2431802728611d"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87839f7289af0999d94a99db6eefa4a0c9cb8f6ea36e8599abd5bd35ced532c8"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc847a02b6145586d3ebc7743aee3d106410cc7f16188923f5c4844ab467e8b1"},"properties":{"dependency":{"package":"socket.io-parser","version":"4.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed47a8e65fd1fb5fea367bc9cfbdb3930cc370f3d4ced310f31def0e9de298c7"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02f809db19946ff68dac97234c12abfc27eedc356a81cfd3ee9e444a4053df19"},"properties":{"dependency":{"package":"tmp","version":"0.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ccda73bd0143d5fffd3dfb7039e432d604944b26bd87c7e38e3f0435928ff6c"},"properties":{"dependency":{"package":"ws","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b872115a766fc14ce3df6040c820939c57d4527b4e085ee83c693154b98105fa"},"properties":{"dependency":{"package":"glob","version":"11.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"674c6eb4b892a8fa09bdd10431c87d093416a6130830e73a09c531477ef6501f"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ad9dbd3889d8f341f1cad0aa7eb5f5dc7c481d6edee2327e215e37852e0f41e"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edf4d2ba0c3c16c39a04d4e44c3e05b5264474d398fa15c76dc3a48285c90202"},"properties":{"dependency":{"package":"follow-redirects","version":"1.15.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"tools/docgenerator.js","line":9}}}},{"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":"cab9b738161215f9deca8486bdb50b407336d9b6b54761f0da81e53c35d86f74"},"properties":{"dependency":{"package":"qs","version":"6.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c9df911d37059b3eecb6ecfed6635fef088e2fb629d9316dd47091372cb1227"},"properties":{"dependency":{"package":"request","version":"2.88.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d2e83e5db7695e397a0b4b71aacc79ced50fe6f88d235878b86155db8bfdc9a"},"properties":{"dependency":{"package":"qs","version":"6.5.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2349bc94730ee0978fca05e4f870ae6f00461ba97da704b360c15eee0b24f1d8"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d819ca819e7022607000cdd10f216263d083cad622844f977825c6723232136"},"properties":{"dependency":{"package":"tough-cookie","version":"2.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce99e2822a5cf330cb436f990d0d7ae8ca319556b16bfc536d1041408fcf40a7"},"properties":{"dependency":{"package":"uuid","version":"3.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"4b9fce514bbf557a6735a5e00d3bfe120c29e355a2ab3c4714407ad5c943f50a"},"properties":{"dependency":{"package":"katex","version":"0.16.22","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"04929f1ea59675c09d63a1854e58e18d3ca321f453dfef4be8fafa30fb75cd78"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b2c2f7815bc2e3dc5c624dff5f3eb708691c4121a9eb5e23a9fac3c97c7d6a20"},"properties":{"dependency":{"package":"diff","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1e94af1236acf75b133e14af2bdc1a4c5060d804a8eda3b083930000189f7297"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 163 of 207 significant files have no living knowledge, while the repository is still being changed at a low rate (23 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 163 separate risks. Counted over 207 of the 666 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b7669d68d627a285d8a93a0c2fcd3bdd5b03bf1b892e942097ab6ab3a6f0f4"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e823503c0161d3f3eebb7311989e36bb48b78526db11a2c3a3d4402bb1579c2c"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22409a57817ebd397113d9baa349f232c6adc7a17ebc8af4aa639e65acd2cb7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef460566e686259e771ace540451264df495a1428982b429d1f6e4bf0e9f4442"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/number.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f79fe460af32346d8cf728a532725b8cb7373bfa4789018ef0bc413dc61f583"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8b24fb0c96d8893d44a5461fca79f86fd7777e904c43c98fe259f8876df814"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/factoriesAny.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98eedd1ad50f797c8d57c6c33bd7642107600cc8001d0385828a3b1bc26d8fd3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb28fb1e95af15697d8dc928ee5e1a505f47483e9e843caf3d20d0c3a89f4895"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/factoriesNumber.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5ddbc447fbf4868b477ddbe76d7cae0f62d300db7f91c04dfc2e2995143ad4"}},{"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":"tools/entryGenerator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdd226ef65725c9d5568dda8c9d836861b3eebb817f3f8a7729c755fb2348a4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f9e0f22359e0878acd7ae9720c402e00704dc95a22e61d03b247e0851d5d26"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"775217526194472cfdb63b3643a6ce878a21721dfbfa7c5ae47ec3a4416528ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/Node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d6503c1a46135f0f845fe6476a68ef36dc6e34dce3fd0d55d246873e0d1e70"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d530bd12dfb655a7906446b977c2e9df24e3468ddd6114c5785b9c33138ff62"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/latex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"781406ddad0d454bb4b66ab72f16c37f1e825d5b50bb13171a95b8a5a86b0130"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/operators.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2935d1a6fe7b3d9734b87e3dbcc8f81372324a602e91dbe60e282be75f6e167"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"454850249e4f72c73cbeefda9f8c22ea768651ea9dff021c5ab20eb87dac6da3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/formatter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0506bbd3b050adc91789d1f71bbe4f48b97a0b79d42c249f2ced9767c533e30"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12bc046353c6c0f8c9dacef54e59f2dfd188b5b15d9246b76cf66dc4f9a2fa6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"653787df2aded5e9c9e78baf14504ab82a90ece868bee7b660032bce71c63e09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42fd9fb5b476c00e3024e28f2e4ab1e80b0fd00a9b2a8b26d4387339925ccc6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9662f265908ba0e8684c9bf552bae043fd40ef6bd0153b7692a268dcb91af47"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77d8ff874a41ba8eefe00dd1f4635090734e9d2e5c8f28cd53a97db766adcaa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Range.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9cccdef0d77dc4e05c8937fe67ba19cf7cd1c2f81d793e8589e62ccd0e5b30"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RangeNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328d94000f6a61f373606882a8f3885e22b7260ab8a09f36a5b5b1cd89b7502e"}},{"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":"tools/matrixmarket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1006bd052e8c2eb0f2fc3659e360fec975e2420af2f6c3859fdfb1eb033f2c20"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Matrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86ed4a6d347575b161ebf1641d74dd7ca0582cd2708f67f3251b036ce5a574d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionAssignmentNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74114f5279d5a56c77a4dccdfe1e000e24d6a359bf3b78a37df9f81a5c204799"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compareNatural.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"761edbfbc385b51e4bad15fbf937dc86f7f719a43ca15b33cb96d29fafc76cd1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0dc8e10bc13f4de5145fb40a0108588c42c156d90ace3dab18aac95ea90652"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6006bece5c7576e056053b7219624e6852f6f6072ee77c68839d40e0db240009"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/create.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eecdb37fc976bf2617777adb06b6ee5f50f4b9ad5f80894415eed1cb31092da"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4807dac8a9d96d6205d52dc91089e2fe6d571288b836cdd7af1556d7afb19f41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2260da1ffb0745ab662e1f3a10ae91e60f6eafc62b4a48a87fbf998a653b9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f086e3b29391b5a8650dfe35e44646cb59e9433978f7e79e7b21ec241970372"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/round.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9b0d8719bb37282877622e826928bb2478df073ccae143ff7a2604253ef0a5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/is.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02766ea0de45c402a333cdb24f9dc0be9f9eb8fd67d88e27e415c3ec4ab769a2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd737da987684ad09dfbda9fcb0872c814879967ed68cfeeb96c5397a1839c4"}},{"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":"gulpfile.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f7d84a7e9d0031ce1e37b6fae172917c8072069e88dcb3c6544b830b467d46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/physicalConstants.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b23425ace758cb675f10e55617add71683ed607bda61497cac61bb9f68e9dad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cd75f58d835ad7f8bb0bc58b61f671284e994b713b1f7a9440a417c79ad7bf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/ImmutableDenseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1952c66b8b3848f7487878985bd02ce40ee25c39bfef7a2d5c5895fe536486e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/number/arithmetic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1886cdf44b551e8561a6743cef2f7d16ca0a4e29b48c9a43fa309c87a0d606"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ObjectNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af7635bdda31985c18baf0aee6c909693cfb2b31083ad0b62b1446e7ad5471"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/string/format.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"908dd433eb48445f1f26e0e88f63c28c92c1820a6b862fe9d611efb0c13006ea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a514cf151a2eeba96a2f96cea79a921f7966bddaf997619c86f694e86ac94fd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotationMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eec637d379bebe612789fb7ddba41d47d1516d6ede347ad24fa736d05fa3eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/string.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d206d67b7ed8d106ddd73a343bd0c50b40f8dfc0fb9cb10174b5102b55c217"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/pow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e640046b58ef476e2c87c3d7449544de9afe731006950c07397f59691b85d391"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/SymbolNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aeefc8530d01645edc5ac9d25c890d640d285c16fe62602ba9a9996c1e10dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/chain/Chain.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67057f2837c27d229f0e1147d68a5bafe447c070d7055aca4c7fa2cf1252b449"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/Parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ccdc8eed02ba3921952da8c94d7530f517a372a4ce56d4c3e4da892d7a8a67"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f280c055efc21e2f0eec62ab4a8b917bdbcfe84916d43db5d965fc02f62145f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/BlockNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dac9b53fd1abedef45bc4a6c2e4b4b0d697955bba73f9ec6136c84dcb5f73d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/variance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d7011ad1347f37832f26828f980014ab8ebcc905cd89e7d842c9012973419a"}},{"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":"tools/whitelistgenerator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a3d507fe48a576d060ad48fa6af312cd8f597a7a67225883609e8028b021f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ArrayNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbe5d59f8c71c3850051973735e0b0849c69c682ff08a9142b232b2ac121b51"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3378bfd56e1b757f9846e9cedae3a66a43be246d6b1b45a99ab2d6b9985135d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/nthRoot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63d89832d7e54d8eef4d63f08cd7368051dda03b3751106c36f2cce00638df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/complex/Complex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7642df22f3a23853a223ea439ada80dafd776e8e12becf57b69a201ecf7e1ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a01f4cc492f712cd9548aee863d60d15a7888c2b6065f92e122acb97da64ca"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/special/erf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbec24588d7ddf124521e29ff3d4e2e6bb709951fcce6337398ac9d566ac5a9e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/pinv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d93b6ffedd7b230a9217c3735e69bed084ce970ee0a9650e2aee17b74557f5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/diag.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ad415b3bb3dc93000b61037b94a3c82ae5adb2d3ca685101e0172b27c41ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8d4ea7c8acab060497bda6d5a076319aea093ccac745e3c7038fe74f085c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConstantNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6121a390ba9c7b7405370be73524a6c95b7f22928831e81882080b85ec243dbf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8820c9b5fff9555c8fd9e1dd289c8502b4d80d50b452f4f32e1454922ec4ac6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9df384408768e88e87e7b353dbd7241c94bb8f5605200ece84d6c7fd1fb02e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7416968ef294e69902dff462f3a5c5e7a5243d5d6560c2e97aafec6317493cdd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/special/zeta.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf67c4cbf8f748be7e6c5018aa9012d770bf31be164073ffb5185f39a50e2d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/map.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c19214e874b5f5e0f16b0051af6fcd04620d9c824179ce06e82c0db8edb53c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdee55222e4d5354fb983871245b8443c621ec2300eb3ab4e02578b90697db3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/factory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68539146e38a04e5afbe4946bec6d517e358d6e9e5d6d637595d6b8eef47a4aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ParenthesisNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9f3f449c0b152363321ab2faa5be341bc67c20b22c283b0b567b4f10ac8630"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/number.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3d7b0ac6a74ad718f2b6af086ddc33748a5fac7e0e36481d3fd223397e8668"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/lgamma.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f296f56d445d1f575defc47bcd798b007938d338e43fcc648bf612fbe7a1b0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/expm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccab28a8bfa8a89cfa10fa9ab21dc102c5d322ad0b16bfbaf57e4223c7bcc0e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolve.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328a9c8a37f0cd082d511d459e3762ebbd667d9aec2468ea007e309b3c3575d6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6904cd6300d9c84e2921bd3cdea4719d87e37b1dbee96bf06483ea3961040d26"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86eee1bf569ab9a97be22393b3e75ed9b71025861a8606d7c6c7b98316635ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9915b4d0ddc2a478a6fc0ec6213f4d734fe19e08197ce4a793696643bc6a4b2a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b88ee3acd997a639d89aaf87b5446c0c35766f13fb4cb754f43cb28e3fc3bf3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/det.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc2764ebf61b022b69148a09d6cab7e9cb2fbba19320235f1d569c693052ea5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/bitwise/rightArithShift.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceb6ca929c6a1ad1bfccf10bd7b6bd6a6caceadd2432c6216ae65200c1f432d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/fft.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cadb0a144d83a12537677efd6303b719d848f7e79765b01ab56d5f938d6badb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/partitionSelect.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e635b15199418d74fab8df5fce9622b5e65814c87ef33f46129493d29cccf7e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/bitwise/leftShift.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e6286074872bde337bb69cba552675687c05279f3d5d7685e29285dfc0e1eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/customs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ae6c45fc65b1cd3594375b95bb7375411f36beb8fe320d94af355e8c0235de"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/cbrt.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47ce7cb61b6ad8cf472f282b454a61027b8ba29594aaec93a4f4ff77f8e6ce5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sylvester.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbad7f507a3a693fdbda557cac8dac4d119675119cfcaba1ff0bd2b0702fc7e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/bitwise/rightLogShift.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"862afe5cf69b09f25852056d6571bfb1ed01679355d5bc06154fabaa1a78187b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dcd59db5b0d5a2c94c17da0c9514b2fa9827eddc7d171f155365a3f5afb119"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/isPrime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe1a992d8245cb5b4bca455490d12e953dfa263daf237145a1e6e85b014c350"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo09xS0Sf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead3f81e2c019d4053a1ea7aa1655daffbc28f61f1a0514e3619ccc854dbae87"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/cumsum.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c98b510a46950a8ff5a8d76408a0bbf33281db17c93b0b545ecd2ce7e8304ec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/and.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841a63f5247795a9294d1c23912f8337092c8cd65ec12f9206a4637938cb61d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad0f4fbcd079ece1a0d492bb8652d04666c2dd7aecfe36b62e3d90c70685d3c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad79280f1c983fc6179ff5694f5d054d9a13e461d8fe76ab519e02d6fd1e06e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/larger.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0658619d5a8b7ca054befb571539369777521d3fd116c9339f56cc2cba9a954e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/resize.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4583a78d2b5fed7b14536a0449d44f29bc299eb70876a451932e37638c395bf5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/smaller.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e0492aa34762696117168a9d7e256c0ca9055c04678c7d7e7209fa9c5ea1f8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/unequal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d07375b17edd894e01c9e4dadabbea441f5719beba057ef0556415c0790837b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d24ecc360b272441f6d92c23f8c3677a61cf62a2fa0c328ced3cc00c681fb8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/std.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d9b7cf31261f46998ee223fae38a58452a00b62ceb922987198f38032572c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"175d394faaa6cd7d19ef1a591bfb659092803994cded41a9ccb36bce69145aab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/ones.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb8e057a22d46fd670ebaeb149993e403d57b60ac1d3032488303edf388b1c2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/zeros.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a469d6b6c7382017bc47bb46451a1ebccba887b99f23195b92892cc5c18c9ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/gamma.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26efbdaa157ef36dcadee514d5e66547b71878f2c623ba215337768f038535e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lusolve.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae40aec615b099884273ed2a6baeec3d9114415b9f4b12108202b12bc5aaa65"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/complex/function/complex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61150cd096470f75f0037727fea34de3bc97161ebe510fcdd21dea766248d8e4"}},{"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":"tools/approx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c40df35f1f6c62c66dc1c980a8c8dddefd1a1bd102e0834d01085f45c45423"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/nthRoots.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"585cbfc59e65db0065a817c916d1417ffda05f475bed4a59243ebd7c75480b4a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/utils/solveValidation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0a86fd4c34fddeaae01f18d55ed97355d64bd7a878b8ccfbcf7bbead8082f5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/largerEq.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d0ab25270ed608e58e81f500ecd8010f5ad6ef1c03652d2f2393da22e77e26"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Spa.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ea955a3a5c4a65e7ac6f050bef7241520f718671ef54a1dacc57a76f742a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/Help.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a39792c82cd687c796be6ee66af42f32c898067cd483b38727997ff3f90e3a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/randomInt.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca248056dc4d3e2a6199cc799bc249ba5c0f93ac725d53e234fe0476aba79c9e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/random.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5974fed2440ce7b5a921ab9526fcf6eaa809e538f7a49d3c7b0cf760751d1bbf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/signal/freqz.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c2686d092d198fd12a96f3df46f51b93d97178338965200b46b2255a7ca3f8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/slu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30af514b6598b54d15a7b0422ed6b2ab7275beb1e2633b87afa18574ee0b3246"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/smallerEq.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c20502b6f85a89297aebde8bc005ba525cff047334ac04e6a79c3c4a445953"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo07xSSf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91c673b8892ebc2ae5854607e38e6c4c684b6d82e48d0f390fd0e3ec5f7e4d1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/nullish.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ebf71da2895be029cadd80fff0913c22e23e8cff6b0d430217ce54ae726fc9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/median.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098c437608f58507c3b6999a569d865ca633546e87d175aff234cca9cf01437a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/typeOf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67a2d9dc5ab48d01db99390c7264bc6380241f542dd9a8ae9546e21f7a690a1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/trace.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a78622cf5366467429ca5e25fbaac547ae3590176b2754e91b68b85d9f6c7c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/fraction/function/fraction.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89a06be4cfee26b9ef4d57416614dd4d22769003223d45829405cd4d58154b4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/sort.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e97fff346bdfd6541dd73803e6cf47cc1959e2937430fa914ebba5a4713ca"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/lcm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1301f6f395c11543290708f159a4faa293c19f7403e051d1bcce82d14eab63"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/function/matrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb176c62ad83597d1c044703e9acccdd9101a49cecbacbb81feb4ffdfee7deb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/min.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d142ea42f8a77a65a19bcf89f77519aaeddaac51c45d8a75917da05afdaf52"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/log.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd2f844f9d2423498d9d8def9e053fac268a482519c67fc840b3a896051e1d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/max.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a1bc7743b00075f326fe2d9e45015e4f6b718361183c003f9e8c9da3287c57"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/function/createUnit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9926c8a33733dde52179426ff3da4d5c07d2a838343fbaebdace4e94c48b78e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/number/probability.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f6b97906844a0ea99b6bacc05f22065670f6f98ec316fc5296e99d9db9072"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/corr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638adf6663ee8c00c12b5a919847efce93d99f48871b816bd226b8618c32ac6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/numeric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c4447cd7a6a0a24e6210d348a17ad027d738c3dfff049ca019583b9042982c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/sqrtm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"465f59c617f5804baf16c93623fd587e763d6f82f1317a2d125d68a34529cf17"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/string/print.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e2287e89fd6291edc1dd765b0ed1aa2f29f551b67fc983ba9fe665ec393eb3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo10xSids.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a65ef68d5ddbbf6a2a39855e57b885e3137c2d5006b19b14e4e350a0a7c0bb3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo11xS0s.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ffd156a1d1212356318cfa8f0e95d50b91022ecbb7dc4625adf849a0048889"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo12xSfs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc29d4158a7981ddfd5d61580593b7ffafdc68b9dab29cc451e4308fde0950e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/rotate.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e4d7166962460f7983e764bee3a865d52e7f29ac0b457db8b2fe554c27a5f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/add.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09b3a6470f153a70e8766a68534437c1f03eeb1a1441a877a419b7d810ef2f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/combinationsWithRep.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e283d37cc69eff2983aa5d49cbfce7202c5122056e3a96c882f2b8a6248067"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/function.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0bacdbcae385434f8d6ae82783636e3f907e95396c69dcece99d0ede19744"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/mean.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5567478cd3f6d54e15bd975614600464d18e4933eaa929a308ffa5e8874ae8df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/divide.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6e3a2f57d1e4f2138d0c28c41a16b95d50482006bf08c4576d548fd2d5a29"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/subtract.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0bb65d811fcadeca83c41452e4bfe1ae5850a862d544cb4505e5666dc58b0c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/bignumber/function/bignumber.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2641ad82629395b7a5830c79590c1b92a334b13ade3bed26067a2a0f4f39987"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo13xDD.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7703402db20d5e5c23afb97eb305f5fac47cd529f413d15ee46d169b09814d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/cross.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dae44186f62a0c650f17be8fdfab1f8bb7bcdc97c3f98d2643c1e86bdd1b598"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/number/trigonometry.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbcef03ff53cb20b0b8f6b247e6e380d5ac6ecc9ddb92f70565a228896399f0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/hypot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f56d441bdffc35a07f2ecae06cc00b0facf6930730fc1269c6abaeb0e4cbf2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/filter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68ecd551188808e31cd3419967a572e68cee11019c85365e4e010c362f62ab0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/xor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"149febde8461ff8bbd1846e141b9c43410f6da8d6add038985d40f9bfa755434"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/log1p.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac6ff44dc43e95a52a7502bf40590acc121860c5366806fe8a4f74b56736ab5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/dotPow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79b59eae00747fd652979a631867306c2e5cc033a215b522c1389e70c96ce5b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/or.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e187e04b5c859f922fb100f8628f93029129092fb268dc5ab61437e03d2375de"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/matrixFromColumns.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f446a4a1d145112f7a537e4aab6544eb6af245a76b8b57c551a35a3732b5ddfe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/signal/zpk2tf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f02a0c63f6f2f48394856dce6088dc75f99b6952b38ea46bf5a375cc6249cf3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/permutations.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda9fd30b8c58ff51174d496afce281bd5b0e48537884a6bcfbc62a947e50154"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/dotDivide.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3a2f04d08e359fedfd4a3f98e9b2ac59dd0c167450915488a57216f34087da"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: embeddedDocs.js \u2194 factoriesAny.js: \u0060src/expression/embeddedDocs/embeddedDocs.js\u0060 and \u0060src/factoriesAny.js\u0060 change together 71% of the time (27 of the 38 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 27 shared commits counted here, the most recent 3 are \u0060f7c10b1b\u0060 feat: Fraction numerator and denominator helper functions (#3605); \u0060faf249b6\u0060 feature: add function \u0060bernoulli\u0060 to calculate Bernoulli numbers (#3551); \u00609ee2a008\u0060 feat: implement functions \u0060isFinite\u0060 and \u0060isBounded\u0060 (#3554) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/embeddedDocs/embeddedDocs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0933cf5d76f68920fef5f022513eb7dffd1eb6d3b6af41bcec799b9e87c7e7ca"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DenseMatrix.js \u2194 SparseMatrix.js: \u0060src/type/matrix/DenseMatrix.js\u0060 and \u0060src/type/matrix/SparseMatrix.js\u0060 change together 62% of the time (53 of the 86 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 53 shared commits counted here, the most recent 3 are \u006010602fdb\u0060 feat: matrix subset according to type of input (#3485); \u00607c154a0e\u0060 feat: return arity and use it for faster alrogithms; \u0060367c0d3d\u0060 chore: improve performance of functions \u0060map\u0060, \u0060filter\u0060 and \u0060forEach\u0060\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15af19690c00146161c1a1c54854af86c58a8ced6709934cb894587fb036050d"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e37904db2ccbc85e059aeb48973ed8e1f6e6831834f4b40800c83663672d401"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c7e30200879b75cdc441da45f1d4d6d4f9a1b5e6d4283218d17aa0042a56c5f"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aec35cdb4071726dff3aa698a0ef1d703591b3df5e83098921ba27dc1945fdd7"},"taxa":[{"id":"CICD-SEC-5","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":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: package.json declares Node.js 18 as this project\u0027s engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return 0;\u0060 also returns \u00600\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/map.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4f3dfbceb011a341559e6ad1d2d52bcb02256d8aa23a807f37c8f59f7d198b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddca8a7d0e48c760a40d992b363157ef259eb5b76ad2be345c16cec7a2741864"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"92606e27ac0e69020114892232e8e54df0ec011aa4bea8d60c6cfb66706ea8ef"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec4024dfa7d9fbd808ca08ec20a582dbb0ef9402b343fddb46cdbc8746c2e4f"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c2c5d3a99ac3e053dad92021ef78396e4acb64e08fe51a43fc111ce48ec15"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/core/import.test.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e909e645e2875d33be9e70f0179ffd1d6534aa2de51af65d546d51fd764dbae"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/algebra/simplify.test.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7547a6d8837be0af776f5b820e754a467896980469c71ac813ea2b7eb062d063"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/mod.test.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16587e3e676a7ac51987cbb197755826db0f4f8ae615235d102585e4109b5c25"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6477401cf0e7194018e316deabf8012fd84e3969dc033afde8eb603e9978bc8e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/multiply.test.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4cf7d7f73f0b04739f0f1fa15a1cb7cb4247ada90b6b9317bef179f43119c5"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/arithmetic/unaryMinus.test.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"798525121359a75b8e2d3454cf4e0e3cbef958e8a27a7b60f1ccb0631c2089a7"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/prod.test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac7b91afd05e594de815cc5b0f698a5d7f6a78c33fc8670a430fbc3279b2f3"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/prod.test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9825fe1ef93d14b60b567dcd1d046b0b80a11f2a135789379de862cd56ac7f4"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/quantileSeq.test.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a4fe541511d51781e76e977b7660c39de882eb813156da67ee508b5567a070"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/sum.test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7fe01c47673cadde1f9a862928b7a92359442c8a7a6691153e9c09e2b4f3b0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/function/statistics/sum.test.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1917882bbdfe344244b239648318045e620cdee4308beaa9efbe3cad7a2e5164"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/SparseMatrix.test.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c98f1ed6d72a02e8df0e1e8fa7f510e6aec3a31d8569c96d7e0ef6312870e07"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/SparseMatrix.test.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf7a9b4fa213ad27c6ccf67772f1584f7b50afa68c0821ea49c9346373a7eb0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/matrix/utils/deepMap.test.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaf62404da8d6aa262c6c2eeedd996a5efa7762cf83fedf532729718184a345"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/type/unit/Unit.test.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd0ef02b6f678ed0e8a6cd4ce52b630d5dc991a021cc1ec41ab2c97ac555c5d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/utils/factory.test.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb7e03f9996abf4102973e7c5b572834fe9d9b1dd0ce718178fa5cd2d1869c5"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit-tests/utils/factory.test.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e3b671ce515da1824029ae20f00b33730f79265f5d7343adf362425437ff45"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/javascript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/build.yaml"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 1 typed \u00B7 1022 plain JS \u2014 the untyped files are src/constants.js, src/core/config.js, src/core/create.js, src/core/function/config.js, src/core/function/import.js, src/core/function/typed.js (\u002B1016 more). tsconfig.json switches off strictNullChecks, so the typed files are only partly type-checked."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 15 sibling directories (31 clone groups): 31 duplicated blocks under src/function/ have copies in at least two of the sibling directories algebra, arithmetic, bitwise, combinatorics, complex, fraction (\u002B9 more sibling(s) not listed) \u2014 17 of them are reported below, and 14 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 31 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 31 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 31 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d113ae286dfd34d2e165fdaf99fbfa6b243e28731f8ba1ba13ca9866f62608"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (24 clone groups): 24 duplicated blocks under src/ have copies in at least two of the sibling directories expression, function, plain, type, utils \u2014 16 of them are reported below, and 8 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 24 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 24 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 24 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/mapSlices.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8873e4a4104231d97a5598f04b73ecd9d06d28c93ee43320c6e7d31c0c355fce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (99 lines \u00D7 2 locations): src/function/statistics/max.js:9 \u00B7 src/function/statistics/min.js:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/statistics/max.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48a5e74097dbd5e624c610d206a2d4fc5f52293bb8187e2b1d728d425d6c017"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (96 lines \u00D7 2 locations): src/type/matrix/utils/matAlgo10xSids.js:6 \u00B7 src/type/matrix/utils/matAlgo12xSfs.js:6 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo10xSids.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59d5d6c1f5ae35fcb46f279d95de312c14de1b9d28c5c9d26025a5fc5e4484f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (74 matched lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:65 \u00B7 src/type/matrix/SparseMatrix.js:159 \u2014 the two spans are one implementation copied and then locally edited \u2014 474 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e547ca8fabe66aaef88ee3f79bd27f828768ec874938947ecbf5e5b97091a1b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (72 identical lines \u00D7 2 files): src/function/algebra/solver/lsolveAll.js:1 \u00B7 src/function/algebra/solver/usolveAll.js:1 \u2014 these 2 files are line-for-line copies of one another \u2014 72 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa6c1ed5fa6ce57dff3d756b0601475e5ff5d70c8d5db21add7f85544160a6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (65 matched lines \u00D7 2 locations): src/function/logical/or.js:16 \u00B7 src/function/logical/xor.js:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/or.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a3c0a7f575fa18a9cd5994625898f3010fecee85bfe0b45469c2df67368de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2 locations): src/function/matrix/ones.js:44 \u00B7 src/function/matrix/zeros.js:42 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/ones.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa013f88e80adff690e848616ed0b8a86db31d7724c490dcfabab56f1f47c9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (59 identical lines \u00D7 2 files): src/function/algebra/solver/lsolve.js:1 \u00B7 src/function/algebra/solver/usolve.js:1 \u2014 these 2 files are line-for-line copies of one another \u2014 59 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68daf63588fcf7e3e2431892739e27b3ee035b83000d368ed14cd77b1b2de5db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2 locations): src/function/arithmetic/ceil.js:127 \u00B7 src/function/arithmetic/floor.js:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/ceil.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1566860cf935149dedfb639431b6d65f400693765aa62835567072f3c0c64082"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2 locations): src/function/matrix/column.js:9 \u00B7 src/function/matrix/row.js:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/column.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cdeb03fa355985f4a1dccdbe600e35515640703fc76eb8310088e33ee3a9c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): src/function/algebra/solver/usolve.js:15 \u00B7 src/function/algebra/solver/usolveAll.js:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 399 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/usolve.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c995c3e2cca432f520162b5d0cb41e9dc6166a7b32d792794deb7ad2f4c8751"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): src/function/arithmetic/ceil.js:11 \u00B7 src/function/arithmetic/floor.js:11 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/ceil.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d034492a8eb9cc09e62e3667f2cd7f86b8affa8b325ca9775b2bcf897d91d7ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (51 identical lines \u00D7 3 files): src/function/bitwise/leftShift.js:1 \u00B7 src/function/bitwise/rightArithShift.js:2 \u00B7 src/function/bitwise/rightLogShift.js:1 \u2014 these 3 files are line-for-line copies of one another \u2014 51 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/bitwise/leftShift.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1426fb240c221d155ec0fb58420e5e930f52e5032ce0fff457ccfb09c8e0a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): src/function/arithmetic/addScalar.js:7 \u00B7 src/function/arithmetic/subtractScalar.js:7 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/addScalar.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17db40d24f60c72ec9e2837ac2b6c4a674be01b65aaace410623eb921c89807"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): src/function/trigonometry/acos.js:6 \u00B7 src/function/trigonometry/asin.js:6 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/acos.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"22481f37b369e7b92162e9ad49854b6fff6a1b79db4844486b91d040b6088d16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (40 matched lines \u00D7 2 locations): src/function/matrix/matrixFromColumns.js:3 \u00B7 src/function/matrix/matrixFromRows.js:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 263 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/matrixFromColumns.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0eee2f0581989ea9ec0d51bde8ffb230a3e4b90242c7b5131fb360c6ff4c86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): src/function/relational/largerEq.js:10 \u00B7 src/function/relational/smallerEq.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 232 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/largerEq.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa45922adc31230c71a145a07b625232cea9b8f67508be3ae35263a10c6777"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): src/function/matrix/mapSlices.js:53 \u00B7 src/utils/collection.js:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 233 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/mapSlices.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db2f46a6b2de7403c4979f704bcbaf613125665441de44c4272c4c417db553"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3 locations): src/function/trigonometry/cot.js:8 \u00B7 src/function/trigonometry/csc.js:8 \u00B7 src/function/trigonometry/sec.js:8 \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":"src/function/trigonometry/cot.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8007c68b7690ed88c033082fcd46fd4d1c348834abe2fe4b3eb201dae1141f77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3 locations): src/function/trigonometry/coth.js:7 \u00B7 src/function/trigonometry/csch.js:7 \u00B7 src/function/trigonometry/sech.js:7 \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":"src/function/trigonometry/coth.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fb77663031e4a987dddef4a3aeea79e319334d8b4f32dbcae76ecb7fc77797"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): src/type/matrix/utils/matAlgo01xDSid.js:4 \u00B7 src/type/matrix/utils/matAlgo03xDSf.js:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 357 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01ae04d2a63fd90ec1de6fa399a556e4738239c2deaa28fae5a2e5d45e2d2f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/function/matrix/eigs/realSymmetric.js:25 \u00B7 src/function/matrix/eigs/realSymmetric.js:56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b90f213ac97b557d6763cec998d00e5510675de4ce71deae9d2311da8b606"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:904 \u00B7 src/type/matrix/SparseMatrix.js:1292 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d25c721893c27a12d7f1bb64aedd456d7baf571cd70fc3e621ed6ab6f6ca63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/expression/transform/filter.transform.js:22 \u00B7 src/expression/transform/forEach.transform.js:20 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/filter.transform.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d52bee411c779a484a7b81ffe9b07726ef6d2145863830d6f415c9414d17fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/function/probability/combinations.js:38 \u00B7 src/function/probability/combinationsWithRep.js:56 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/combinations.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b9e99ca10b0a44a9656ca305603177e4834ecf877389c454e161d5bec1083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/type/matrix/utils/matAlgo02xDS0.js:68 \u00B7 src/type/matrix/utils/matAlgo11xS0s.js:59 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdecab005634876ce0c0e0004d42e0f291d7487309d3bbf93be855c28e368ebf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): tools/entryGenerator.js:367 \u00B7 tools/entryGenerator.js:400 \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":"tools/entryGenerator.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d8ca110bda2a5393d065094183a3cbebdb96587212499720a27f531926e126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/function/algebra/derivative.js:331 \u00B7 src/function/algebra/derivative.js:447 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76a67dfff94357b8840c76abba8b87e0a0b95f7582d0c536d0c1379a4584f28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/function/arithmetic/log.js:59 \u00B7 src/function/arithmetic/log10.js:38 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/log.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"03861e02e131a2ae379ebbe494a1a24c8b34fe24874435d05b7aae89860dc1a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/function/relational/equal.js:7 \u00B7 src/function/relational/unequal.js:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/equal.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f044681e474134ad274e3877853a98276e456a0929ff1ea66358c78258b23bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:341 \u00B7 src/function/arithmetic/multiply.js:551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a11b6fce5238ab371011a4ea21a983823f8bd75e6b63a763a5730e281cea31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/function/matrix/inv.js:64 \u00B7 src/function/matrix/pinv.js:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0865325d57209b6a174c54780cda314ab1772945bd5972cc3171c93ad2660814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/function/relational/larger.js:11 \u00B7 src/function/relational/smaller.js:11 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/larger.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"db143d5adb999df1bbb3009979d9cd56e9db8795b0cf28ab9b4aa8b609098d37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/expression/transform/column.transform.js:16 \u00B7 src/expression/transform/row.transform.js:16 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/column.transform.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd3308d8df904ce4e44af7ba0b6ea9a4a3703d07edf0aabd22641b11d4892d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/function/algebra/simplify.js:945 \u00B7 src/function/algebra/simplify.js: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":"src/function/algebra/simplify.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a3f651ef4656e7e94be001cf012556153f81c4c2759dc0e6628f36e051181"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:808 \u00B7 src/type/matrix/SparseMatrix.js:1151 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b465087d5cbbdae5090087ecd0fef4bffb64ef4aef913026619bd9f3f7574107"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): src/type/bignumber/function/bignumber.js:60 \u00B7 src/type/fraction/function/fraction.js:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/bignumber/function/bignumber.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e308ff5c2af46db709f8f032af2929763a1fd11b06552b1163fb8a08e9846a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/expression/node/ConditionalNode.js:169 \u00B7 src/expression/node/RangeNode.js:187 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73767767f06217c370a3d3800f298cccf17199304368f3edbdc2de42072f940"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/expression/node/utils/access.js:16 \u00B7 src/expression/node/utils/assign.js:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/utils/access.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49ae2389952fb86de205fca4927b8f8002a8a16f2223140006d406f92db193"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/function/arithmetic/ceil.js:154 \u00B7 src/function/arithmetic/fix.js:124 \u00B7 src/function/arithmetic/floor.js:164 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/ceil.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"253acb96c62469572d9d738e47b5c58ee02a76ddbf283ea09f49eaf90619b9e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/type/fraction/function/fraction.js:76 \u00B7 src/type/number.js:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/fraction/function/fraction.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a823c98f0ed12ae55da33775f15dc3d8ea1ad22f520565a3cff2954bd6440261"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:875 \u00B7 src/type/matrix/SparseMatrix.js:1251 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"e235b6afee690d00908101fb73360b9cb01b8a9812527414eb147acc278c36aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/function/relational/compare.js:91 \u00B7 src/function/relational/larger.js:88 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compare.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b9aeebbb197d5f7364e7952728d2464857b0c29cf2c4d469599055fc8fe434"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/function/trigonometry/acoth.js:4 \u00B7 src/function/trigonometry/acsc.js:4 \u00B7 src/function/trigonometry/asec.js:4 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/acoth.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56e7a243fabe20398ff687b7c45e353e72c6a590872c23676a7cfd08ff0a44e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:349 \u00B7 src/type/matrix/SparseMatrix.js:396 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8173094d74b5cb45faa281c281a410f1d6efb9803d030fa5a5b134437d4ecace"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): src/type/matrix/utils/matAlgo04xSidSid.js:44 \u00B7 src/type/matrix/utils/matAlgo05xSfSf.js:44 \u00B7 src/type/matrix/utils/matAlgo06xS0S0.js:41 \u00B7 src/type/matrix/utils/matAlgo09xS0Sf.js:44 \u2014 the 4 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 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab199b18039575d891bc4cd2e6c5ff684f70b7156479e38a9f209c252b12146"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/expression/parse.js:1447 \u00B7 src/expression/parse.js:1475 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89dbcb2a512d92783250d78c6c2088fa65b7e387b0e6e37440e9b73329df1b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/function/algebra/derivative.js:392 \u00B7 src/function/algebra/derivative.js:409 \u00B7 src/function/algebra/derivative.js:531 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"85003ebc91a2924aa1946bf85819c0936236e2ae6529a99f141e93cdd0ddf5e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/function/algebra/derivative.js:496 \u00B7 src/function/algebra/derivative.js:541 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8ab755e5d9c3f62db674855aa3dd48566363e8e920c5b3d8d7f42bb8aadcfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/function/algebra/simplify/util.js:138 \u00B7 src/function/algebra/simplify/util.js:159 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify/util.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ad66949874d7f8a963bba1d9669266fcd2e49c20e29c8310fa62a95e07d97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/function/arithmetic/norm.js:195 \u00B7 src/function/arithmetic/norm.js:237 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/norm.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4bc498ac3e5fd62b8ab1c0cb1beac9f70ab620c93777bb4ea8f8273445f20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/type/unit/Unit.js:657 \u00B7 src/type/unit/Unit.js:710 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"4169543619fac29a1f815145421a7ff34ce5aaab2643cb43b41d8e2d7d0f61de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/utils/bignumber/formatter.js:131 \u00B7 src/utils/number.js:270 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/formatter.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae085f9eccc1e0346c1f8aa7f25af43ee9054bf53981f914bb09ebf97b22883b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/function/typed.js:345 \u00B7 src/core/function/typed.js:361 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee13a165be49d0204f2e8e81edc07c4197f36a9e092072212b47db616bc6d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/type/bignumber/function/bignumber.js:50 \u00B7 src/type/number.js:99 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/bignumber/function/bignumber.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b68fb5f2d38e732028db976e68a620cb58a72a8cb87e7865a8e70704f6ec7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/type/matrix/utils/matAlgo04xSidSid.js:4 \u00B7 src/type/matrix/utils/matAlgo05xSfSf.js:4 \u00B7 src/type/matrix/utils/matAlgo08xS0Sid.js:4 \u00B7 src/type/matrix/utils/matAlgo09xS0Sf.js:4 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d42129b7288341a137bdba289f3d81c264a5c947ecbaf2ba7e26afae268545d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): tools/entryGenerator.js:339 \u00B7 tools/entryGenerator.js:368 \u00B7 tools/entryGenerator.js:401 \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":"tools/entryGenerator.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af84f7bae4843caa5e76696cdab754fb5350cfe70713e7c7d68a817e803b3a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/function/typed.js:291 \u00B7 src/core/function/typed.js:315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd4933721abb1c6212c365bba1c4a140ba0005751d5f87a08fc3d777a59787c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/expression/parse.js:1349 \u00B7 src/expression/parse.js:1449 \u00B7 src/expression/parse.js:1477 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a3f2351e38f89e54b9aad64756440bcb0279df6d2b2cf1a840b6ec94a39994"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:116 \u00B7 src/function/arithmetic/multiply.js:203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4a5a0308f1dd5f6a4aa199b09adb0f0f4201118c6d0cb24575a6cb4bb6ed8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/function/arithmetic/unaryPlus.js:39 \u00B7 src/type/fraction/function/fraction.js:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/unaryPlus.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4402c3f4e74b9a0cd916bb3255feed8eabe0550fd18503c7888a528498806a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/function/matrix/cross.js:7 \u00B7 src/function/matrix/kron.js:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/cross.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b59d1cc019a247da42e869ea7e915d1d02cb5a11cd1a51148e61d393dcf1a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/function/matrix/mapSlices.js:106 \u00B7 src/utils/switch.js:7 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/mapSlices.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e884d00289c29f707e793ec585513c0f69a89f761ae87d4c91715711d3901a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/function/set/setSymDifference.js:7 \u00B7 src/function/set/setUnion.js:7 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setSymDifference.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"692fb7bae2e8ade10318b7b167f048045719ffd69db2641a6472ff5d64297b5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/function/utils/isNegative.js:8 \u00B7 src/function/utils/isPositive.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 170 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/utils/isNegative.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe8943cd99c5c5cfa97d950c1d78dfe04c7bf0a555439bb539a37212b7f4c6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/type/unit/Unit.js:498 \u00B7 src/type/unit/Unit.js:523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c855020d24e46335526945c7f5f666383b69e9e90aa7af0f4cc111b87b792a79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): tools/entryGenerator.js:222 \u00B7 tools/entryGenerator.js:349 \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":"tools/entryGenerator.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4769e573c7004fd5a412e1eb1bea47e887d6256da7b1886b096c3b3ed0f9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/function/typed.js:401 \u00B7 src/core/function/typed.js:420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4dcfad8fb28a1f28c62fef1f0457fb35914b482dfa6c51642db35cfeb5c6df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/expression/function/compile.js:5 \u00B7 src/expression/function/evaluate.js:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/function/compile.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14d188ed4cac467979a49dac988782cb3061595dd83e4425b59a1d3fa516090"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/expression/node/ConditionalNode.js:124 \u00B7 src/expression/node/ConditionalNode.js:199 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ConditionalNode.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0186400d3af94c4c78c619a98e227e307d2a5b1540cfd3fb002fa2e475ac28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/expression/node/FunctionNode.js:232 \u00B7 src/expression/node/FunctionNode.js:291 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ab66a538f0ac191cf715c3a10dc49a106b8cc2ac03f13d7857e31cc838b300"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/expression/node/IndexNode.js:110 \u00B7 src/expression/node/OperatorNode.js:334 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/IndexNode.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c6fdf5bd78bf2f4ce46bbe35fcca8381e0b864ace0ec5797816f4bce942841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/expression/node/OperatorNode.js:423 \u00B7 src/expression/node/OperatorNode.js:531 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08bdcb87903d55b3dc4d887dfb99abaff3f2468c1f115fd201071ab7378304a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): src/expression/parse.js:778 \u00B7 src/expression/parse.js:810 \u00B7 src/expression/parse.js:842 \u00B7 src/expression/parse.js:1259 \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":"src/expression/parse.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0c7463b8fae9399abd6c73f56767fefc887d4c17091149147e6e5ceebf6a62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/expression/transform/max.transform.js:9 \u00B7 src/expression/transform/min.transform.js:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/max.transform.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b5c51ec7830c40e8900273695537c995bf4902ef95df4feff5312ea41f60e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/function/algebra/simplifyCore.js:202 \u00B7 src/function/algebra/simplifyCore.js:231 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a23405af74e003a9d83f3623eb5340ad1ccfaf307ab256ee01b6c04fb71daf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9 locations): src/function/arithmetic/add.js:7 \u00B7 src/function/bitwise/leftShift.js:14 \u00B7 src/function/bitwise/rightArithShift.js:14 \u00B7 src/function/bitwise/rightLogShift.js:13 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/add.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6730000d2bcc19770a3a2f262e8e3142ed467bb96b2f8d8a632d97077bfbae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): src/function/arithmetic/round.js:184 \u00B7 src/function/bitwise/leftShift.js:91 \u00B7 src/function/bitwise/rightArithShift.js:91 \u00B7 src/function/bitwise/rightLogShift.js:89 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/round.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf47237ba350976e075fb399fbe132aaf0bcec9418463173a136a03fb2007ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/function/matrix/range.js:215 \u00B7 src/type/matrix/Range.js:106 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/range.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"250fd58299ae93169403fdf68760ccce0182c84869575b698130d52388816c6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/function/trigonometry/acot.js:4 \u00B7 src/function/trigonometry/acsch.js:4 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/acot.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"943df5291b3753dbd5548e9512997c609672ada942b96fdd5854f398381b941a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/expression/node/OperatorNode.js:119 \u00B7 src/expression/node/OperatorNode.js:141 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"481a1c63cd51f21efad76013a8fb9bb8331a9ddb414adb3396227bbd8fc8d488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/expression/node/OperatorNode.js:397 \u00B7 src/expression/node/OperatorNode.js:504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c8d3d3ade13fe7d7ede44d4efeaf0e426f3f93c1f6176bc58c784a23d63413"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/expression/node/RelationalNode.js:113 \u00B7 src/expression/node/RelationalNode.js:166 \u00B7 src/expression/node/RelationalNode.js:199 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/RelationalNode.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34e6c2b1e4980085fb5fc40e3c4064c2b5a499742b3bdbc398a814269af99f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/expression/transform/diff.transform.js:10 \u00B7 src/expression/transform/sum.transform.js:17 \u00B7 src/expression/transform/variance.transform.js:17 \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":"src/expression/transform/diff.transform.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65b468b4eb09ad134d1857cc96e2364ab0f8a52c8183e11b4203a3d13b0395"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/expression/transform/mean.transform.js:10 \u00B7 src/expression/transform/std.transform.js:17 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/mean.transform.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2982ffcaa9c4cf8606fbf5abeb061605cea3333e7867e2337477dd43ae9e97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/function/algebra/sparse/csChol.js:59 \u00B7 src/function/algebra/sparse/csLu.js:53 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csChol.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"898978bc3d2aa7e5d4a43ca549edfbd5bc95e9dcc579053bbfa4b3c870db118f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/function/arithmetic/dotPow.js:11 \u00B7 src/function/relational/larger.js:13 \u00B7 src/function/relational/smaller.js:13 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/dotPow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ff019966beba6f1d77d7ae1651f83150fbbea4ff5aa4fe9b41014db5a455a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/function/arithmetic/log.js:62 \u00B7 src/function/arithmetic/log10.js:41 \u00B7 src/function/arithmetic/log2.js:35 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/log.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9951900a812ee24c8cf4238017648f7f21f30c67ab878bada07b461c5785af80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:31 \u00B7 src/function/arithmetic/multiply.js:52 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ade3f3a131b675128e5772eb888890622289c56130a0dcfaef659c5e7d01c6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:425 \u00B7 src/function/arithmetic/multiply.js:527 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6214eb575b0fef9d6e487095fe71b9ff7ecf761700b47f490d180f15e37d7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): src/function/arithmetic/nthRoot.js:9 \u00B7 src/function/bitwise/bitOr.js:9 \u00B7 src/function/bitwise/bitXor.js:9 \u00B7 src/function/logical/or.js:8 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/nthRoot.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8714c8db0cf361c403b677a9a0bc4dc7db9e3fc506fc4066726a8319129a120c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/function/matrix/range.js:76 \u00B7 src/function/matrix/range.js:132 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/range.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"483cd1a9050ebf4e62da618873d18e16811520dc2468fe9331ce95bf81edbd4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/function/statistics/mean.js:9 \u00B7 src/function/statistics/sum.js: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":"src/function/statistics/mean.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cf9b8affc6a4dd8eb191b935c1d04f12d027c796e943f447e2a39546d28cb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/function/statistics/mean.js:78 \u00B7 src/function/statistics/variance.js:99 \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":"src/function/statistics/mean.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492da2ed6b30b97e1047303dfd1e0225a8ba55dbee916780c26432c00f15b09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:989 \u00B7 src/type/matrix/SparseMatrix.js:1372 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7af7d28641feb0d9a24124acc9f63631c0dc1aa44a984c7791d39329d6b4b8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/type/matrix/Range.js:166 \u00B7 src/type/matrix/Range.js:187 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/Range.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da12b640b3d09736c53d10ea31d662e925e7415215425008f1177227b27fe54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/type/matrix/utils/matAlgo03xDSf.js:46 \u00B7 src/type/matrix/utils/matAlgo07xSSf.js:31 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e439ea4f02d44d9ecc29c4900ac26f01c754b38c0660a4a39c9ceaaafdf582a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/expression/node/FunctionNode.js:369 \u00B7 src/expression/node/FunctionNode.js:455 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01b34258953b3980baafbab5d932e493980094c8656098b9b8fd03542b14620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/function/arithmetic/addScalar.js:1 \u00B7 src/function/arithmetic/subtractScalar.js:1 \u00B7 src/function/matrix/map.js:2 \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":"src/function/arithmetic/addScalar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5755f3c76f04d991e63150b9a84fddf577bda5a6bed28acc899cff968019b7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/function/arithmetic/lcm.js:8 \u00B7 src/function/bitwise/bitAnd.js:9 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/lcm.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"76af63200d1555e9eed84e2bc39c1bf89a3288c662bc2acef8baddc3a50882aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/function/arithmetic/unaryPlus.js:9 \u00B7 src/type/bigint.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/unaryPlus.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c778733c713d2b7262d3daacc4c2d2d09c33f1524e3e33807c5005e93946423"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/function/matrix/eigs/realSymmetric.js:165 \u00B7 src/function/matrix/eigs/realSymmetric.js:199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f16c907324e7d8746dafd81cd1386db62c29377b0c8187ddf94e07962871f14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): src/function/probability/pickRandom.js:9 \u00B7 src/function/probability/random.js:9 \u00B7 src/function/probability/random.js:72 \u00B7 src/function/probability/randomInt.js:9 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/pickRandom.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f08cbe251fbace75fcc9d281e8de039d2a7d7ffb4b90f3293be2256617b1f72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/function/relational/compare.js:21 \u00B7 src/function/relational/largerEq.js:19 \u00B7 src/function/relational/smallerEq.js:19 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compare.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc526eab38bbc332cd2ec8e6d3318984061fe0e33028734afefa1d60069bf48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/type/matrix/DenseMatrix.js:418 \u00B7 src/type/matrix/SparseMatrix.js:578 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae320cfd11d1d24f0471214b7c55604ea1f6ca5aa6171596113cc62747db80f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/type/matrix/utils/matAlgo04xSidSid.js:84 \u00B7 src/type/matrix/utils/matAlgo05xSfSf.js:84 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7360c6cd0053c510569345e7755482183956f357509e3f42ed306cdd9e31fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/utils/bignumber/bitwise.js:350 \u00B7 src/utils/bignumber/bitwise.js:392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6937d5372d44f5236641e189b14a5057b6ef6729c707b3fbf1b4d2d241c31bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/utils/number.js:492 \u00B7 src/utils/number.js:524 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/number.js"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe42e0b5f2ff519485649a8cbeb5a90dd0bd1201206158b6e2ee3fee0a041857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/function/import.js:315 \u00B7 src/core/function/import.js:329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/import.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"47562524b26f89310745646db35ce4964775e87d8a8fc9ef984eb2cc7e4ff97e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/expression/node/AccessorNode.js:106 \u00B7 src/expression/node/AccessorNode.js:123 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AccessorNode.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5776b1fcb78fde3b9848dbf55d9cc5cef526ad56652b57e322c550dbeea31bde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/algebra/solver/utils/solveValidation.js:36 \u00B7 src/function/algebra/solver/utils/solveValidation.js: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":"src/function/algebra/solver/utils/solveValidation.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f569cd1fe5ac0f56d4b642f7cc4f73e5c896891cf562b383476661e70de5e99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/arithmetic/exp.js:4 \u00B7 src/function/utils/isNaN.js:5 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/exp.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"af73d1d91a3414378ed36574426cb8c0582a3eaf68b4874143debdaa06ff3752"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/function/arithmetic/multiply.js:326 \u00B7 src/type/matrix/utils/matAlgo01xDSid.js:27 \u00B7 src/type/matrix/utils/matAlgo02xDS0.js:27 \u00B7 src/type/matrix/utils/matAlgo03xDSf.js:27 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e014f21ccdeb778fcf43130bc87ed8d4c568dfcd67eb620a3d03e75f0d3b536"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/arithmetic/round.js:98 \u00B7 src/function/arithmetic/round.js:139 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/round.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"751ec9aeed6539e3bff6a5d415b0d110c4db37015265ab16edc857fb9468634a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/function/bitwise/bitAnd.js:17 \u00B7 src/function/bitwise/bitOr.js:18 \u00B7 src/function/bitwise/bitXor.js:18 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/bitwise/bitAnd.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba313cf378954207ffa5c2525550921bac2ff426577d091bf21ad077d735e145"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/matrix/eigs/realSymmetric.js:115 \u00B7 src/function/matrix/eigs/realSymmetric.js:132 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eac35352c489b182a30167dd1b9ce041e86f0280e68c77d029be6a678269136"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/matrix/identity.js:16 \u00B7 src/function/matrix/rotationMatrix.js:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/identity.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"949597916fecdfadb6c0d0257f0375ae704a886e2f813cbfbc06b3d0b31268a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/probability/permutations.js:36 \u00B7 src/plain/number/combinations.js:4 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/permutations.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51931b01df394d8329b73198969e1778c79e6a1818ba1e0512e9679ea97149a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/probability/random.js:55 \u00B7 src/function/probability/randomInt.js:56 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/random.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"65122c025dc55e22a4e203dec3f66823411dd463a0f8fedcef38eb6153822791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/function/set/setDifference.js:40 \u00B7 src/function/set/setIsSubset.js:38 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setDifference.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aceaaf14c6d6c10115c605d56d6385e45f43014f64d8daf3d2a22e36d36daa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/utils/map.js:40 \u00B7 src/utils/map.js:121 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/map.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee7c3bdaa3db0b7c19dd366840ce99a9435f49f87497fd9c287a68f7b5fd754"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/expression/node/ArrayNode.js:74 \u00B7 src/expression/node/IndexNode.js:119 \u00B7 src/expression/node/OperatorNode.js:343 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/ArrayNode.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e84d90e9346805e14eb66006e7795e18ad6373540df3c1c631ee2047cfc09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/expression/transform/forEach.transform.js:7 \u00B7 src/expression/transform/map.transform.js:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/forEach.transform.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b869731dca6b7e2aae8785a798c28cab7161daddb80e0fc5246c4efabf980cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/function/algebra/sparse/csSymperm.js:7 \u00B7 src/type/matrix/utils/matAlgo04xSidSid.js:4 \u00B7 src/type/matrix/utils/matAlgo05xSfSf.js:4 \u00B7 src/type/matrix/utils/matAlgo08xS0Sid.js:4 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csSymperm.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"149cdac00f93bd54da2255bbee20c9795cb36431e2276826ca27a8c135790dc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11 locations): src/function/arithmetic/add.js:5 \u00B7 src/function/arithmetic/subtract.js:7 \u00B7 src/function/bitwise/leftShift.js:12 \u00B7 src/function/bitwise/rightArithShift.js:12 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 11 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/add.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebe203d846cf3773f449b724c21cf6423cb96358126a3356dfdc2e98dceea48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/function/arithmetic/gcd.js:32 \u00B7 src/function/bitwise/bitAnd.js:17 \u00B7 src/function/bitwise/bitOr.js:18 \u00B7 src/function/bitwise/bitXor.js:18 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/gcd.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deda94694c28831d8f53b250c914bcc0759ffe7de28a09f081dfff494c114b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/function/arithmetic/mod.js:26 \u00B7 src/function/bitwise/bitAnd.js:17 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/mod.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fab974fa4e3c73236988a08719cbdf0f9cc6fa826ad452e1873bd541fbd321f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:499 \u00B7 src/function/arithmetic/multiply.js:615 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b241240e39746096218fd69398d45841ad269c732f3b90a97dfe5feb69dc01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:579 \u00B7 src/function/arithmetic/multiply.js:685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"275627648ee2dbdaffcecfee9a3e1bc2f7286085dd402035c816c8257b0c1dac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:728 \u00B7 src/utils/collection.js:161 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4a4a0f4c9cadd1ffe501adb32210cd50e292083b142df22a49c9b5d47b3462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/function/geometry/distance.js:148 \u00B7 src/function/geometry/distance.js:161 \u00B7 src/function/geometry/distance.js:174 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a245a6f8ab93138659ed03e120f45f5c0cd1a6cf54572365e55eb0a5bcd94cd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/function/matrix/subset.js:250 \u00B7 src/function/matrix/subset.js:273 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/subset.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf622d25a0f2da6d3a5f39e9330e4f069af0c8474bc0986035a469b8e964fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/function/set/setMultiplicity.js:34 \u00B7 src/function/set/setSize.js:38 \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":"src/function/set/setMultiplicity.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"89701164a1bd08157e5b2ce174b770dcc5517d169fb0d77a572447efdd4d9241"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/function/string/bin.js:3 \u00B7 src/function/string/hex.js:3 \u00B7 src/function/string/oct.js:3 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/string/bin.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf667a23f39580f68afd70000877660a6e377cea4415e6dd37511218d3fcd0d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/function/trigonometry/cos.js:4 \u00B7 src/function/trigonometry/sin.js:4 \u00B7 src/function/trigonometry/tan.js:4 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/cos.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"894e5982a9e96023a52838a182a1076bd5d910b18ad35e5dd9a03753092b7d67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/utils/is.js:88 \u00B7 src/utils/is.js:100 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/is.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb2ea596289e124f75cebb8c33e2688e0e8425a5ca22678d788485a295a91df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/utils/snapshot.js:37 \u00B7 src/utils/snapshot.js:66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/snapshot.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f02f71dba0014383f13dc3d2a8fdb01ba4011fb8c511d2557b859cbe628f3b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/expression/node/AssignmentNode.js:31 \u00B7 src/expression/node/FunctionAssignmentNode.js:25 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b0fb63a582ff634bb927f3ea326c3f528341ee67820dd69cde1724c35e717"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/expression/node/OperatorNode.js:439 \u00B7 src/expression/node/OperatorNode.js:666 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"240f1edfe32e50747b7064a428ee9d76cf37a368b7710fca1ee646030e97d240"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/expression/transform/bitAnd.transform.js:9 \u00B7 src/expression/transform/bitOr.transform.js: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":"src/expression/transform/bitAnd.transform.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2331d47a20e445670de6a4271288637764b30ddcc3bdfec8f7c7b1134f2bd6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/expression/transform/column.transform.js:17 \u00B7 src/expression/transform/concat.transform.js:10 \u00B7 src/expression/transform/row.transform.js:17 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/column.transform.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26eaab56c8c678b8b68c5d3595fed1d67d936bf6ae22dfd6478d790c63a9b81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/function/arithmetic/abs.js:1 \u00B7 src/function/arithmetic/unaryMinus.js:1 \u00B7 src/function/bitwise/bitNot.js:2 \u00B7 src/function/matrix/getMatrixDataType.js:1 \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":"src/function/arithmetic/abs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874cb9d7df01cda1431293850e8dda32aaec7b6fa02599553a97aa0deb370777"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/function/arithmetic/abs.js:2 \u00B7 src/function/arithmetic/unaryMinus.js:2 \u00B7 src/function/trigonometry/sinh.js: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":"src/function/arithmetic/abs.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d490b422e6a4e52fbd0305d0cf72fe9e7f5716e956bcd997374fb1c083dc0cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/function/arithmetic/addScalar.js:1 \u00B7 src/function/arithmetic/subtractScalar.js:1 \u00B7 src/function/matrix/forEach.js:2 \u00B7 src/function/matrix/map.js:2 \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":"src/function/arithmetic/addScalar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cc741b2cf76c2a551032b5dcc4b06de630f6eaacb87d0fa9ae1cf0362d7ff8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/function/arithmetic/multiply.js:650 \u00B7 src/type/matrix/utils/matAlgo04xSidSid.js:29 \u00B7 src/type/matrix/utils/matAlgo05xSfSf.js:29 \u00B7 src/type/matrix/utils/matAlgo08xS0Sid.js:29 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1adee3918812c277777899e740205acac3230af6ee46652cd2b655e864569ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/function/complex/conj.js:5 \u00B7 src/function/complex/re.js:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/complex/conj.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4dd8d0717a5526bb16fdfcce68651a526a7db3bb66f40eb4b8124d6a6fce3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/function/matrix/eigs.js:215 \u00B7 src/function/matrix/eigs.js:225 \u00B7 src/function/matrix/eigs.js:235 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5dfd2d52c63616308a2050092b0b28b3369330bd3207cd76fd6bb9bb86f5e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/function/matrix/eigs/realSymmetric.js:208 \u00B7 src/function/matrix/eigs/realSymmetric.js:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/realSymmetric.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ab9b56eff6d13402bfd18adb05e4b9c7325cd880637632861296541c90380a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/type/matrix/SparseMatrix.js:864 \u00B7 src/type/matrix/SparseMatrix.js:974 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b12debc8111915558c8f24facc2a02e3144d8073ab76f7818570d0f0cfafa1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/type/matrix/SparseMatrix.js:1451 \u00B7 src/type/matrix/SparseMatrix.js:1464 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdffc02a62f36f3a6ea1c4ed52e7d2a3dda7966373a5678377353199ffec6b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/type/matrix/utils/matrixAlgorithmSuite.js:124 \u00B7 src/type/matrix/utils/matrixAlgorithmSuite.js:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ad1e4fcc0021dfe251e1daae63372f97e107379a4ff0b72008900c9656476"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/type/unit/Unit.js:602 \u00B7 src/type/unit/Unit.js:619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac99accd3519babcdb6eaa68d4962f4ee8222c33197a203af352cea369b138f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/utils/bignumber/bitwise.js:23 \u00B7 src/utils/bignumber/bitwise.js:293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe78100031eb90d5e508a258f350d412de16c1c27dfdde4c9794d2822e5c8fb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/expression/function/compile.js:1 \u00B7 src/expression/function/evaluate.js:2 \u00B7 src/function/probability/factorial.js:1 \u00B7 src/type/unit/function/unit.js:1 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/function/compile.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aad7c68ef32945d4d2e1527070a5915a2b4c90db729aaf49d94721c1a30102f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/expression/transform/bitOr.transform.js:5 \u00B7 src/expression/transform/nullish.transform.js:5 \u00B7 src/expression/transform/or.transform.js:5 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/bitOr.transform.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88d295aadc3cea94abfd80a2e4b779ce5890ea6ecf020961dc88944ca71d601"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/expression/transform/column.transform.js:4 \u00B7 src/expression/transform/row.transform.js:4 \u00B7 src/expression/transform/std.transform.js:4 \u00B7 src/expression/transform/subset.transform.js:3 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/column.transform.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f68f4a118f4eac88348ad2bd098cbbfb069f02368a1b9ec658bebfd7a7cf93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/function/algebra/solver/lsolve.js:11 \u00B7 src/function/algebra/solver/lsolveAll.js:11 \u00B7 src/function/algebra/solver/lusolve.js:13 \u00B7 src/function/algebra/solver/usolve.js:11 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/lsolve.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a44e45f8ead223e88d061ef2d3af92148a2eac3104e7c3ad0287e734821ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/function/arithmetic/dotDivide.js:20 \u00B7 src/function/arithmetic/mod.js:24 \u00B7 src/function/arithmetic/subtract.js:21 \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":"src/function/arithmetic/dotDivide.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef02679d81b9d3a9cdcadc591c359470bbd46b49b6d9d1b4b94e20d572a2b1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): src/function/fraction/den.js:1 \u00B7 src/function/fraction/num.js:1 \u00B7 src/function/matrix/transpose.js:2 \u00B7 src/function/utils/isInteger.js:1 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/fraction/den.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf17443de9e2dea382a4346b7b2e4753407d3dab3ea49a39de79c5d04e888ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/function/logical/and.js:82 \u00B7 src/function/logical/and.js:100 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/logical/and.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7518f419fa580dd449b013319b9dc8aab9c2328bc14333c8a09346089513545a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/function/matrix/dot.js:41 \u00B7 src/function/matrix/dot.js:49 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/dot.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac867957d8ef88ac4ac29b4a44d4946692c6fac1240d73e9d8da220309dc54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/function/matrix/inv.js:19 \u00B7 src/function/matrix/pinv.js: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":"src/function/matrix/inv.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1bee68f17e70a895ba24560d0e3472c9bf14df138c96a15351cbfcd1552718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/function/matrix/mapSlices.js:81 \u00B7 src/function/statistics/cumsum.js:110 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/mapSlices.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576a1f52fd2c90140c8c5c4f501f5f056787519c06fecef20a615064a822948"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/function/relational/compareNatural.js:271 \u00B7 src/type/complex/Complex.js:178 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compareNatural.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d52b475a1461a93d5908208aae6a2e5d84d93f9e77548b57410afaa1ec9c848"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/function/special/erf.js:71 \u00B7 src/function/special/erf.js:90 \u00B7 src/function/special/erf.js:115 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/special/erf.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccddedf3ccd154c3b96bfe65b42bde733f180d8b1b90a1647a111485cad86668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/function/trigonometry/acos.js:1 \u00B7 src/function/trigonometry/acosh.js:2 \u00B7 src/function/trigonometry/asin.js:1 \u00B7 src/function/trigonometry/atanh.js:2 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/acos.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"386f187ab533a7d379719c60370393637fed04841acdaaf8809ef561afb34339"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/type/matrix/MatrixIndex.js:122 \u00B7 src/type/matrix/MatrixIndex.js:138 \u00B7 src/type/matrix/MatrixIndex.js:154 \u00B7 src/type/matrix/MatrixIndex.js:226 \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":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"325a5c5f2a7528dab918e9300a3eadd70425ba0d1f38011d1dc7a2a4ad6bddd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/type/matrix/SparseMatrix.js:609 \u00B7 src/utils/array.js:154 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca64fc9119e497d080e07eedb05ada67ae1eb20d7021da35385321375668b17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): src/type/matrix/utils/matAlgo02xDS0.js:4 \u00B7 src/type/matrix/utils/matAlgo10xSids.js:3 \u00B7 src/type/matrix/utils/matAlgo11xS0s.js:3 \u00B7 src/type/matrix/utils/matAlgo12xSfs.js:3 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bcbd5bf7911bc97747096293bf86f040bed8a64b184125b1e86a6a96127756"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/type/matrix/utils/matAlgo03xDSf.js:79 \u00B7 src/type/matrix/utils/matAlgo10xSids.js:60 \u00B7 src/type/matrix/utils/matAlgo12xSfs.js:60 \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":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9384971d13c798717d8f71ddea71082871a4b1eb6d3c38900f137a6f4cdd655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/type/unit/Unit.js:634 \u00B7 src/type/unit/Unit.js:686 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdfe4fd8b9930e7e5efd13d6bde7ac489b42c7a05fb4f950ad56a940159a82b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): src/utils/is.js:171 \u00B7 src/utils/is.js:183 \u00B7 src/utils/is.js:213 \u00B7 src/utils/is.js:225 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/is.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eb749b8c3a32fcbebcf89ccc694c5e2d403e23ed8a982ee16f026df394e41a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): tools/approx.js:93 \u00B7 tools/approx.js:101 \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":"tools/approx.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"867da91f203a7ed1505c5724d5d4b8a91d6060e8dda27f24916a66bcb20877da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): src/expression/transform/concat.transform.js:3 \u00B7 src/expression/transform/cumsum.transform.js:3 \u00B7 src/expression/transform/mean.transform.js:3 \u00B7 src/function/algebra/sparse/csSqr.js:8 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/concat.transform.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca70a9ecb667d161821cf42626c994aaca8977f836b3c39e33bef9e8a8563c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/algebra/sparse/csSymperm.js:40 \u00B7 src/function/algebra/sparse/csSymperm.js:58 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csSymperm.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f541b0ee105bcb8161bced767bd8f4f850abf610925299f4c0a44790ebffc83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/arithmetic/dotMultiply.js:15 \u00B7 src/function/bitwise/bitAnd.js:16 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/dotMultiply.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df2b2c8cdae7a61b5cfdda2bd38793dd500d056138d7aec3245e09653b1072f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:221 \u00B7 src/function/arithmetic/multiply.js:284 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f3f5f583f357a6baefc1ffc600e52b11a9c23acf132730ed89d80c2ea2f302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/arithmetic/multiply.js:700 \u00B7 src/type/matrix/utils/matAlgo08xS0Sid.js:85 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"16433c3e7a1e70fb55c8e968cc8726b5d13e92cc1dd2d3c8a4264eb1dcc01f8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/function/arithmetic/multiply.js:712 \u00B7 src/function/arithmetic/multiply.js:730 \u00B7 src/utils/collection.js:135 \u00B7 src/utils/collection.js:163 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1aebdc22f5c1767ab448e94462df501860924e9ad2227cbdf98ba55d532bd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/function/matrix/eigs.js:176 \u00B7 src/function/matrix/eigs.js:217 \u00B7 src/function/matrix/eigs.js:227 \u00B7 src/function/matrix/eigs.js:237 \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":"src/function/matrix/eigs.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a440ccb4b41e151654f89f1164224318cc6ae4a03a1481ef1db54df1f0f2f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/relational/compare.js:104 \u00B7 src/function/relational/equalScalar.js:46 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/relational/compare.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8bd1c97520694e3951456ee00189ec5658e22e7b1a378b497d550d73d92f69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/function/set/setIsSubset.js:5 \u00B7 src/function/set/setMultiplicity.js:5 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setIsSubset.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"347cd941ec055a7b738ed02430b74c9511a6cf83c72041582816d55a19b350d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/function/set/setSize.js:4 \u00B7 src/function/string/bin.js:3 \u00B7 src/function/string/hex.js:3 \u00B7 src/function/string/oct.js:3 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setSize.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3481a4b1b354d7fea966700dea854154d4c7f6bae081f4055d88bf0c79da945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/expression/transform/and.transform.js:8 \u00B7 src/expression/transform/bitAnd.transform.js:8 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/and.transform.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"082d5861585515f2dd53ac5c348b2c9412efa4fdca70dbe1579d79800bcf298d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): src/expression/transform/column.transform.js:4 \u00B7 src/expression/transform/print.transform.js:3 \u00B7 src/expression/transform/row.transform.js:4 \u00B7 src/expression/transform/std.transform.js:4 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/column.transform.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2394b7e91d29995506ebf069bcdeabc18ab22a00f62c2ecd1d30da02233e2548"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): src/function/geometry/distance.js:71 \u00B7 src/function/geometry/distance.js:86 \u00B7 src/function/geometry/intersect.js:71 \u00B7 src/function/geometry/intersect.js:78 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"931af69a31f827400f307699d5f82122c1cb503000904222b37128b6738a5a2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/function/set/setCartesian.js:5 \u00B7 src/function/set/setDifference.js:5 \u00B7 src/function/set/setIntersect.js:5 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setCartesian.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee288badc635a13749f9f62e404069feb736a8acf3783ba54f27d69d61401c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/function/signal/zpk2tf.js:59 \u00B7 src/function/signal/zpk2tf.js:64 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/signal/zpk2tf.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c721c7723994d7bb7cc25120f1a785f49239146708ee5cfb6be355be5e282f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/function/trigonometry/asech.js:5 \u00B7 src/function/trigonometry/atanh.js:5 \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":"src/function/trigonometry/asech.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5b401310a96c36c8be050b68018a08b4e7d36a7edb008fbb6004aa4c75d50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/type/matrix/DenseMatrix.js:17 \u00B7 src/type/matrix/ImmutableDenseMatrix.js:11 \u00B7 src/type/matrix/SparseMatrix.js:17 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42e6ae8a2cbbd32f1300ad5d6d9058f996c6f3421890d15dd6f7c89cdb5fc52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/type/matrix/SparseMatrix.js:1039 \u00B7 src/type/matrix/SparseMatrix.js:1118 \u00B7 src/type/matrix/SparseMatrix.js:1197 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929c539792d886b6da96d9303bb2f88364acc407ac8feac3c5724a179696960"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/utils/object.js:126 \u00B7 tools/approx.js:84 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c47d788593cb8b874465764eb788f110c6696f9d0b62f8b5d088f67efd22cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _simplifyCore (cyclomatic 86, cognitive 200): _simplifyCore has cyclomatic complexity 86 and cognitive complexity 200; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyCore.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee18edbbd91a599784004c76fba5c0d99e78473186a8daeb4bb98a7556a07bbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csAmd (cyclomatic 55, cognitive 141): csAmd has cyclomatic complexity 55 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csAmd.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b9b5f2cb330a993fa9f2c66b1c9b528aee1f3a148ede9a181dea29def768e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _ruleMatch (cyclomatic 52, cognitive 110): _ruleMatch has cyclomatic complexity 52 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":"src/function/algebra/simplify.js"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118f79437749cb233ffb8423420619d23fdcd38c57b919ec475325d71f748fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recurPol (cyclomatic 49, cognitive 85): recurPol has cyclomatic complexity 49 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f72662201486f98b48f2fd598d3ebc168a88b1c8a810a60d2939c65db6e2a8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getToken (cyclomatic 48, cognitive 87): getToken has cyclomatic complexity 48 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8219b1e741674c8a14b897d71fb976559887ad68298dbeebf9f752b6e45bc775"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FunctionNode, function (cyclomatic 48, cognitive 19): FunctionNode, function has cyclomatic complexity 48 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f983f971269ad8f7db9ce0c9160275c10577bd11fe012839976b93e4c47a9c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculateNecessaryParentheses (cyclomatic 45, cognitive 73): calculateNecessaryParentheses has cyclomatic complexity 45 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4411e8546882c3e0f97a3ba30465fdc3ebf488a5432512836b2999e98a5c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createUnitSingle (cyclomatic 43, cognitive 71): createUnitSingle has cyclomatic complexity 43 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":3222}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bf151516c4476a49c108354991c4f7b27f71d68e181d44beca19c997f17efc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Object, Object (cyclomatic 40, cognitive 56): Object, Object has cyclomatic complexity 40 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c190adc75c24fd7d6cbbee2c36b711ba2d3bce7b540f3d43d150697caa630a71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldFraction (cyclomatic 38, cognitive 59): foldFraction has cyclomatic complexity 38 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3d5eea3b850334017468331ef63d72435a6b16b3f77e50e770a84761ff428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRule (cyclomatic 34, cognitive 54): applyRule has cyclomatic complexity 34 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb2fc65931eb1fc64a42e300742c2de28ae01149d4995baa7b6cdd7989514a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 42): (anonymous) has cyclomatic complexity 33 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":"src/function/numeric/solveODE.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65f485fb6da96e35b494020a1be9671518010f7e48729286eef01691e44756b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function approxEqual (cyclomatic 33, cognitive 39): approxEqual has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"tools/approx.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"52539fd8711af38c98a5b43cd0478157ef95464268fdb707da54f0d709b32cdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo04xSidSid (cyclomatic 32, cognitive 55): matAlgo04xSidSid has cyclomatic complexity 32 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo04xSidSid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d28533350b0cfabc7df77ce24de73841c224390d04eeaf2b47cee9ccc9d824b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo05xSfSf (cyclomatic 30, cognitive 55): matAlgo05xSfSf has cyclomatic complexity 30 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo05xSfSf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfcdf18ac8bc930e39fb117f4b6731450ff69c8ad006d0c2b957292bd75d94a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 29, cognitive 49): parse has cyclomatic complexity 29 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":"src/type/unit/Unit.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7d7233b6e4a968dc8e6b3add95fe8cec414e65539192ea616038b1f8685982"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toTex (cyclomatic 27, cognitive 36): _toTex has cyclomatic complexity 27 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5516f66f840cc9fb28207c8df95e39d36792da261ce31ce29a0448ebfbbf7ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 46): (anonymous) has cyclomatic complexity 26 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csCounts.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2d36dce7c19da8fc856a2e46be71fb9cfe20a9ebdcbf38f64dc3013fed4ad1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _denseLUP (cyclomatic 25, cognitive 66): _denseLUP has cyclomatic complexity 25 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/lup.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d20a2ec979f9fef42d43ccb70c17bc23af5d76843dadf3abe39fa01ef1f9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAccessors (cyclomatic 25, cognitive 53): parseAccessors has cyclomatic complexity 25 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce17445f1be8727fa672a7dd74e243478700efb79f20061d2730bc0dc1c3193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _swapRows (cyclomatic 25, cognitive 47): _swapRows has cyclomatic complexity 25 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e4f5e67662f5105d8ab9dbe587951066e1088e778793986aea330fddbc455"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function solveValidation (cyclomatic 24, cognitive 58): solveValidation has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/solver/utils/solveValidation.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd43f85df8ca44f7a0afd98c72496882790ed82ff204c7551015da20e8b8d75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _foldAccessor (cyclomatic 24, cognitive 56): _foldAccessor has cyclomatic complexity 24 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb9d12bc7b68bf1a5fd92ddcc86ac1b3d543e9883db6a80b66020e8aaac9d4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplySparseMatrixSparseMatrix (cyclomatic 24, cognitive 43): _multiplySparseMatrixSparseMatrix has cyclomatic complexity 24 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5721379ab15b30b0e7bd0b16646e068483475ea01c258f40313130447b993aec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _denseDot (cyclomatic 24, cognitive 25): _denseDot has cyclomatic complexity 24 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":"src/function/matrix/dot.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb91f11fd4d1251a352c901203338d16862d73ca5ff3f2f745424e94e99ac8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitOrBigNumber (cyclomatic 24, cognitive 25): bitOrBigNumber has cyclomatic complexity 24 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5573901d0512bfa1b53d9abffaf2c9044d670ad23e74a6a946bbd26ec852492f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OperatorNode, function (cyclomatic 23, cognitive 41): OperatorNode, function has cyclomatic complexity 23 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":"src/function/algebra/derivative.js"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"066fbaae40e43c41ee367d56e6fb9e9f82fc7505808ad706f9ae1fd8ad1d31f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iterateUntilTriangular (cyclomatic 23, cognitive 41): iterateUntilTriangular has cyclomatic complexity 23 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":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b38d3b7824f0e250aa25657983acf4e5ffdbc7d4da54e0216b468546394dbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo06xS0S0 (cyclomatic 23, cognitive 40): matAlgo06xS0S0 has cyclomatic complexity 23 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":"src/type/matrix/utils/matAlgo06xS0S0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca3e0355eae2825aa4b54cd967e3f24fef69f737838ac6888940d1eb863a124"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo09xS0Sf (cyclomatic 23, cognitive 34): matAlgo09xS0Sf has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo09xS0Sf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33c35abfa372ec3232d92ea911567f1a2f853bef2201b632cd43e50df96e24f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitAndBigNumber (cyclomatic 23, cognitive 34): bitAndBigNumber has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3a75cc05c63d76d2f9f40433284d2274ea02551790e7dfffb1bf25a9be78b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toString (cyclomatic 23, cognitive 33): _toString 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":"src/expression/node/OperatorNode.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34871dd818d2e6f1654d985aa4e7115a8d4e06d241210e259c9b0090c5e65bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _compareNatural (cyclomatic 23, cognitive 25): _compareNatural has cyclomatic complexity 23 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":"src/function/relational/compareNatural.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db3e2294b6e6af3e65ad8c026867d734f900dd72d9cdf677278d54ffde8f8d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkExpectation (cyclomatic 23, cognitive 25): checkExpectation has cyclomatic complexity 23 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":"test/node-tests/doc.test.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9562f3bcc12b6817e899d2e1c7a5f99477e816c809394ab903782f89ca633d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _pow (cyclomatic 22, cognitive 26): _pow has cyclomatic complexity 22 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":"src/function/arithmetic/pow.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb22c3b8b04a57e25526c35c98f2feff7cb34354dee1d2d8d45f9a18fdd5cb23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Range (cyclomatic 22, cognitive 24): Range 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":"src/type/matrix/Range.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8d0a96ea8d924360d4bd3849e27fd9bf85e43f114765637094e669c08558a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completer (cyclomatic 21, cognitive 71): completer has cyclomatic complexity 21 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/cli.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e128753c0e7d854f2e68ae102fe4fd022d3957b140f47eab04017068c661fa89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matrixAlgorithmSuite (cyclomatic 21, cognitive 34): matrixAlgorithmSuite has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matrixAlgorithmSuite.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab24d303b6b590c2e9cb5cc0a8b35ef43d742a9f1ccb58322e03d3e409ac68b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coerceTypes (cyclomatic 21, cognitive 33): coerceTypes has cyclomatic complexity 21 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57c754085bde5db9a9e0aac893fefbed771a18e9e4f5a6ebacc47acb13e0fda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function number | BigNumber | bigint, number | BigNumber | bigint (cyclomatic 21, cognitive 32): number | BigNumber | bigint, number | BigNumber | bigint has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/combinatorics/stirlingS2.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ef09fda1e02436f648247eb6bac6ce6773726e5572afba76cc201b25f51f93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo08xS0Sid (cyclomatic 21, cognitive 27): matAlgo08xS0Sid has cyclomatic complexity 21 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":"src/type/matrix/utils/matAlgo08xS0Sid.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"135efb0943d9942121f75dc168b15e9ba83eff424cdf770e13e21c31bd7f1a05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDoc (cyclomatic 21, cognitive 27): validateDoc has cyclomatic complexity 21 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":"tools/docgenerator.js"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8d291a373b42071c1205bea279bd655c84d8b3168f377d66e69c1584bf859b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function balance (cyclomatic 20, cognitive 49): balance 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":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"80998856ab4e7e3765cb868a219ad76b61c8404aaf3402eb98e36b3b861326a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _importFactory (cyclomatic 20, cognitive 40): _importFactory has cyclomatic complexity 20 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":"src/core/function/import.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f11727c980c56e0a47ad0b2750c1956f44c363e2caae2ddf30eb51019f12f0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toHTML (cyclomatic 20, cognitive 30): _toHTML has cyclomatic complexity 20 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":"src/expression/node/OperatorNode.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bc6757bac7d2107593ca1d34739a227d909a65f7be25ebbf157d0c76b19c59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagonal (cyclomatic 20, cognitive 28): diagonal has cyclomatic complexity 20 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdb539f706aa89de1d4b22ac8efa9f32d81110c6375d7a329e1cec0fb09683f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo03xDSf (cyclomatic 20, cognitive 28): matAlgo03xDSf has cyclomatic complexity 20 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":"src/type/matrix/utils/matAlgo03xDSf.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d851fde253719394b6985f60da2b81098dbb64a264157467b32529676f15fea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function algorithm1 (cyclomatic 20, cognitive 25): algorithm1 has cyclomatic complexity 20 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":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56f00785a5d36f986f8eab64ab21a9b9b19fdd9c50ff1bcf743ef80ca7309d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _exactMatch (cyclomatic 19, cognitive 30): _exactMatch has cyclomatic complexity 19 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":"src/function/algebra/simplify.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a23237d4e925c461c379a9a3a489454d3aa3beda1f5552c332a95c39136ef20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplyDenseMatrixSparseMatrix (cyclomatic 19, cognitive 30): _multiplyDenseMatrixSparseMatrix has cyclomatic complexity 19 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59e351753cfdb93322eb1993a4f8466b95c6a31c16e30935bfcc29deee2d31c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo07xSSf (cyclomatic 19, cognitive 24): matAlgo07xSSf has cyclomatic complexity 19 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":"src/type/matrix/utils/matAlgo07xSSf.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16d659ea93f0e0fcc3808f8f7f980705ad4c806fd01f55c312d0e0ecd6105a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toString (cyclomatic 19, cognitive 18): _toString 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":"src/expression/node/ConditionalNode.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"298de246b98f77f5dc47b5d000b96e0d192f02efd22b823740ef5a6ba25e43e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toHTML (cyclomatic 19, cognitive 18): _toHTML 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":"src/expression/node/ConditionalNode.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"529c9f5149907fa52d9c0671438b12ae5c0d0b934f40eec95a083d9a74936d73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _inv (cyclomatic 18, cognitive 59): _inv has cyclomatic complexity 18 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/inv.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfd9ec5e36ac8c5085146aceb474a7415778b2a5e9aba64240d0364588971d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 35): (anonymous) has cyclomatic complexity 18 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":"bin/cli.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf2590ee198343214f6ff8a9d1d06cb486a2cbda738cf327b5f9807e0d8351d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csLu (cyclomatic 18, cognitive 29): csLu has cyclomatic complexity 18 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":"src/function/algebra/sparse/csLu.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f77142d2fe6c27b56b5780823223647c50d25c2a83381dd2f6a3eb3f65201a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplySparseMatrixDenseMatrix (cyclomatic 18, cognitive 27): _multiplySparseMatrixDenseMatrix has cyclomatic complexity 18 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83eda6af87564e6ad99ca045fad4000f56913db05ca16ec32322ceef0fa57a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagonal (cyclomatic 18, cognitive 25): diagonal has cyclomatic complexity 18 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":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"225b84989e9101063a3be64afa8f1e7a5dfcecd9ae1d2c75de615e136f0dc59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractValue (cyclomatic 18, cognitive 23): extractValue has cyclomatic complexity 18 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":"test/node-tests/doc.test.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"79485dcd4c1d58a08c8278212c54375adde739960bc2d897687575c9a9bea8bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 43): (anonymous) has cyclomatic complexity 17 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":"test/node-tests/doc.test.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9ef31b03df9e610cc7b9e4c38004da25af24ed6d721175d472ef1f24539d36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceToHessenberg (cyclomatic 17, cognitive 37): reduceToHessenberg 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":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec09660435d23535de96aad852be41857bd77fc90cc1a909ea80b508cb64d2d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resize (cyclomatic 17, cognitive 34): _resize has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a3f8d107220c4c287093265d5e231d3ad1eb127d6bbd317e335ddda07f3f78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandPower (cyclomatic 17, cognitive 30): expandPower has cyclomatic complexity 17 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":"src/function/algebra/rationalize.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d73ec687b0c63da02f3dc72f866211b4c56c9819a1d81530207101d75d4abde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _pickRandom (cyclomatic 17, cognitive 27): _pickRandom 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":"src/function/probability/pickRandom.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5060495638c5165c8942b2718fca3e4d0641974ebeb40659446daffb91efb018"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChars (cyclomatic 17, cognitive 26): validateChars 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":"tools/validateAsciiChars.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318d10ae64b6bee7318b7e377ee7ff5a68a352c53a8f4f35d12c5f007028a89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplySparseMatrixVector (cyclomatic 17, cognitive 21): _multiplySparseMatrixVector has cyclomatic complexity 17 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"705bf59a156d6272057fbbe45bb001050da3dd5bb492c2fd9f4a0cbd62752abb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matAlgo02xDS0 (cyclomatic 17, cognitive 20): matAlgo02xDS0 has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f798f2556f6fdab6f2da4644425b9cc8c6434037d049b0310ec0c0abd84cfb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitXor (cyclomatic 17, cognitive 18): bitXor has cyclomatic complexity 17 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8759cd780b8d08a37dff8a43152ad3aade68b85b2e440d014be27cc828e5776a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createFromArray (cyclomatic 16, cognitive 44): _createFromArray has cyclomatic complexity 16 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e164caf088fac9e35cb1fa9937ceae4278a5b545b0a7cca301f6bba30a3a0c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatUnits (cyclomatic 16, cognitive 29): formatUnits has cyclomatic complexity 16 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":"src/type/unit/Unit.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc93780db3cc5e81b367c0c62f6a7aeae65398f2148b5cb3d8abd225f91d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlock (cyclomatic 16, cognitive 22): parseBlock 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":"src/expression/parse.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b460246ac9bb91d002cc6460ef9746cc1e3c57de98325536bf7027c7adc094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toString (cyclomatic 16, cognitive 21): toString has cyclomatic complexity 16 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":"src/expression/Help.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d75c0fd6029e95bbba19a92b8e023fe60355ee0a4cf9ab56cef905ad676339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _identity (cyclomatic 16, cognitive 17): _identity 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":"src/function/matrix/identity.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ebeb64ddab5615bf22ae13a6cd5a9983e1d28b84bcf056454bdabb3b665838"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simplify (cyclomatic 15, cognitive 35): simplify has cyclomatic complexity 15 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":"src/type/unit/Unit.js"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"788a2cb08001aaf67f84ddfb383e5a7b1385c881d34b95f09995bc9e92d52697"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csSymperm (cyclomatic 15, cognitive 31): csSymperm has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csSymperm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7522cd9e2e698f30bd1e450fe0534fb4a5b7d0cb98a8405f735f7886d8dbec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _set (cyclomatic 15, cognitive 31): _set has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"790c0a76ac2950bfbc7907f0c50dd6ce41298cbbec043c372c558bbea5325c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deepStrictEqual (cyclomatic 15, cognitive 27): deepStrictEqual has cyclomatic complexity 15 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":"src/utils/object.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc218b4ec7fba8333a2d811cb2217522b5af25b8eecfe2351a3e5c9a00e6dce9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimizeCallback (cyclomatic 15, cognitive 27): optimizeCallback has cyclomatic complexity 15 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":"src/utils/optimizeCallback.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"262c0726382c74ea57725688ecfb2673f8bb684187f8f981fcf202aff44c5308"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ...Array | Matrix | number | BigNumber (cyclomatic 15, cognitive 25): ...Array | Matrix | number | BigNumber has cyclomatic complexity 15 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":"src/function/matrix/concat.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c4f2dae377f76546efb11edf674944d167ef4763b90cd2603162ca42d00d29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BigNumber (cyclomatic 15, cognitive 25): BigNumber has cyclomatic complexity 15 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":"src/function/utils/isPrime.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca75e9edab6f2477f7d32a574d6a4de6692938e60d11915d1c1bef90e66576aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decCoefficientToBinaryString (cyclomatic 15, cognitive 25): decCoefficientToBinaryString has cyclomatic complexity 15 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2a26b5b7b445ca417cf540344469019ce3f6badce8e83d29e61e9fbaf5067c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _vcount (cyclomatic 15, cognitive 23): _vcount 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":"src/function/algebra/sparse/csSqr.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477d601725059ac5f17883bd1d7ef290306c94875d83cb8e2d6b3dddc9007c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNumber (cyclomatic 15, cognitive 21): parseNumber 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":"src/type/unit/Unit.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f0c9da87fc9718c92df3c9ba4af594597a085ad48e089d9f63ce1d3fd3f06f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setSubstring (cyclomatic 15, cognitive 20): _setSubstring has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/subset.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b28ba5ea94612b7db3cc3123a163c9378e84a41aef14687cd6fdc79e65531db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _format (cyclomatic 15, cognitive 19): _format 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":"src/utils/string.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e530e7e880e985e45e7d2e8e273eeb92e3965029e637d737920a07c24bbbbfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rightArithShiftBigNumber (cyclomatic 15, cognitive 15): rightArithShiftBigNumber has cyclomatic complexity 15 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f5f924e571d678f399685dd7b61a2d3d0d399468cc0c80698f25f917f9842b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 15, cognitive 13): format has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/formatter.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf05f633bf5433ba54b3350e257d524d80a52362b898131eec8df0477048c96f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function polyToCanonical (cyclomatic 14, cognitive 25): polyToCanonical 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":"src/function/algebra/rationalize.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"e825e4502650733023d7188d095d46bc49c03e08404a3e99c30dc73e6b8cc383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setsubset (cyclomatic 14, cognitive 25): _setsubset 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4e9b635164add127723961843a4e048297d0af7faf1011aa4ddbb58d5d34a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _rationalize (cyclomatic 14, cognitive 23): _rationalize has cyclomatic complexity 14 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":"src/function/algebra/rationalize.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eb834533810ec17c660472b59377bf9155527ba8b31518a86fc7f56f38b658"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _compile (cyclomatic 14, cognitive 22): _compile 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":"src/expression/node/FunctionNode.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"966b678f056c79e50e793f67a62d96e4a3ecfe51a572bc33798dd9d5d7390d73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flattenImports (cyclomatic 14, cognitive 20): flattenImports 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":"src/core/function/import.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd725544be8ada7389bbcc941f80df119038cde4f3a476271f11620499767996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Object, Object, Object (cyclomatic 14, cognitive 19): Object, Object, Object has cyclomatic complexity 14 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":"src/function/geometry/distance.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60078225b7851426b17e6cec86c146fc05c1d971cd8a1e8852e8c20d7bac869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toEngineering (cyclomatic 14, cognitive 16): toEngineering 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":"src/utils/number.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe1850a63875d2ab037d5f0600312d78df465f31d54bb8562f2e0c1a5a484ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DenseMatrix (cyclomatic 14, cognitive 15): DenseMatrix has cyclomatic complexity 14 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":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1a9374065e14f9139998287ffdd40adaefb5220a40356753b9507878a76314"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateMarkdown (cyclomatic 14, cognitive 15): generateMarkdown has cyclomatic complexity 14 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":"tools/docgenerator.js"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36bf8e3024dc1fc6b58fb37f81bf3dee0bfa167da6cfeb86a282ffc14e6c784"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplyDenseMatrixDenseMatrix (cyclomatic 14, cognitive 13): _multiplyDenseMatrixDenseMatrix 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a364b0aadcdeb31b68434012d94559e75dc309337e2cf98fe5618bd6edd4107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leftShiftBigNumber (cyclomatic 14, cognitive 12): leftShiftBigNumber has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/bignumber/bitwise.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dcb192088b6de46109e277149e0bcd9d3b202a75c53d2d85f5992346c369d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPrecedence (cyclomatic 14, cognitive 11): getPrecedence has cyclomatic complexity 14 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":"src/expression/operators.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8267368e94e049f6451aa782bd4b3f32b2b34ecc757a922fa22ee390b7d6f96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseImplicitMultiplication (cyclomatic 14, cognitive 11): parseImplicitMultiplication has cyclomatic complexity 14 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":"src/expression/parse.js"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f51220004b582e125188ed62a9c8d0c24f816b3ff1acf7ceb4c8767c32493"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 13, cognitive 25): format has cyclomatic complexity 13 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":"src/type/complex/Complex.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b861b461ee78c37a6d9ea4a4ae1ab91ad2589030a20b9345236b3841b5f7eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csChol (cyclomatic 13, cognitive 20): csChol 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":"src/function/algebra/sparse/csChol.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8764093dcc45fc72bfdb08e21d2611ec307f29777ae4c599a32a1bb370d16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Array, Array (cyclomatic 13, cognitive 19): Array, Array 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":"src/function/geometry/distance.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fab5758e1cbd0be09d3f1727470dd7261bec80fddfa8b838bb91423fb53bb64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexTransform (cyclomatic 13, cognitive 18): indexTransform 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":"src/expression/transform/index.transform.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e726e2c814baedf0b224e6e464077f9e3a7b5ba55b558778e5d818edbd2edf86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bestPrefix (cyclomatic 13, cognitive 18): _bestPrefix 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":"src/type/unit/Unit.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ed4143e393b217d46bbc1cb05634d6c9da6def5117c539165d832358888ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _nthComplexRoots (cyclomatic 13, cognitive 14): _nthComplexRoots has cyclomatic complexity 13 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":"src/function/arithmetic/nthRoots.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05e59be1ceac5d9fa4b3e10b6e96b40adb631691de49c5196f3a2ac167e55ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clone (cyclomatic 13, cognitive 9): clone has cyclomatic complexity 13 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":"src/utils/object.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7c5fa7974c0935777fc1d2fe3b0e5f183de9e18b7d9f31bc2135f6eebc0fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _det (cyclomatic 12, cognitive 33): _det has cyclomatic complexity 12 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/det.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b789401544bfb1e8b17933b0cd95189bdfc0ed6236af0147ca7fe49dc4a8ed4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _denseQRimpl (cyclomatic 12, cognitive 32): _denseQRimpl has cyclomatic complexity 12 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/decomposition/qr.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7f4d373e6a2d847b7b6caedd5f7f14872e4fdd0c0e8080f9b9eceb7c8f148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _sparseForwardSubstitution (cyclomatic 12, cognitive 29): _sparseForwardSubstitution has cyclomatic complexity 12 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":"src/function/algebra/solver/lsolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ef20ded3b899f2e9dc10ccc9be6eb9435356e5346f542e43c9d08efdcaf11c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _sparseBackwardSubstitution (cyclomatic 12, cognitive 29): _sparseBackwardSubstitution has cyclomatic complexity 12 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":"src/function/algebra/solver/usolveAll.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f2eae97a28f9465879c50dec65b2ffb50712b3286a2fe0000bb4d619352dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseObject (cyclomatic 12, cognitive 24): parseObject has cyclomatic complexity 12 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":"src/expression/parse.js"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea2692cae6a613c1c6a3638abab8ee0ccde3d2967156c226b02fe1c399f2ee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Array | Matrix (cyclomatic 12, cognitive 23): Array | Matrix has cyclomatic complexity 12 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":"src/function/matrix/pinv.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffda79822165673db2efc738e1ee49064b46031e92d56168ab201624482370ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Array | Matrix, Array | Matrix (cyclomatic 12, cognitive 22): Array | Matrix, Array | Matrix has cyclomatic complexity 12 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":"src/function/set/setDifference.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"74910a346ec42c9620cb312cd1803a05265dc159b49cf0b387da935b3b86290d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Index (cyclomatic 12, cognitive 22): Index has cyclomatic complexity 12 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":"src/type/matrix/MatrixIndex.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b654102c26e7f7ffe45b3d2303b915e87459845e57d5969f0d336acd9de0d8b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deepExtend (cyclomatic 12, cognitive 22): deepExtend has cyclomatic complexity 12 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":"src/utils/object.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1c3278e0449fa60c658de4ee923e3909b507349d357d56a080f7ead351cabb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recPoly (cyclomatic 12, cognitive 21): recPoly 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":"src/function/algebra/rationalize.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"199afc5ef041346e31a56c277792b6e6358d074c1bc1c7e1e7a547e9b5453df7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseParameters (cyclomatic 12, cognitive 20): parseParameters has cyclomatic complexity 12 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":"tools/docgenerator.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dc10811912cb34ca124a6a73ae33f713ff356401d91c3aec5d9320f05cf3ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRange (cyclomatic 12, cognitive 18): parseRange 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":"src/expression/parse.js"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c155bda289b3be78d8d0b0c03a3eba7e156a1700592d787ffd95b00e483514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasProperty (cyclomatic 12, cognitive 15): hasProperty has cyclomatic complexity 12 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":"src/function/algebra/simplify/util.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8ec8f822c2516095d469aa34740abab15054cae3497dc173d473a79d042d98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resize (cyclomatic 12, cognitive 15): resize has cyclomatic complexity 12 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":"src/function/matrix/resize.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6619693649be8b41cd91ab1a4f7961905f11327a80580df2b337d83967bb0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 12, cognitive 15): set has cyclomatic complexity 12 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5835d72cc833f325830e1c9dc22e3bb39f1f4cc7f36959b70f424289fa8689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function number|Complex, ...number|Complex (cyclomatic 12, cognitive 14): number|Complex, ...number|Complex 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":"src/function/algebra/polynomialRoot.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b4ec6974f32809157a8f36eb9b6944e6f10368310aa47481c49d7fdc31be5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImmutableDenseMatrix (cyclomatic 12, cognitive 13): ImmutableDenseMatrix has cyclomatic complexity 12 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":"src/type/matrix/ImmutableDenseMatrix.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5c2b80db2289f7467588751d58bf81a1975df8c814319011e90f3e7d228c86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function combinationsNumber (cyclomatic 12, cognitive 12): combinationsNumber 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":"src/plain/number/combinations.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0a17d0f208fa1612bc1ed6e943de00dde0beb729e7a73c4869632c1e3153b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reshape (cyclomatic 12, cognitive 12): reshape 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fcf0537f05f176ce3b22d8827bbdd3b848268446ae38fae7ad8ffd60f41082"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplyVectorDenseMatrix (cyclomatic 12, cognitive 10): _multiplyVectorDenseMatrix 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e784445c079e5ccff3a47a6dea82fb1a9d79f0f256e9a0ea718671d4ad3a5e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _multiplyDenseMatrixVector (cyclomatic 12, cognitive 10): _multiplyDenseMatrixVector 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c3bd3769eec6bd8babf65b46a70f9d6cc3d1be4f9c1921f4676913b68d45e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SparseMatrix (cyclomatic 12, cognitive 10): SparseMatrix 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aedf2828e271aa36448fadd2b3e629159064cda6d5acad4b22ea1ea4ce72a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _toTex (cyclomatic 12, cognitive 9): _toTex has cyclomatic complexity 12 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":"src/expression/node/FunctionNode.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"314bb6bba5d6a5db55a265cf81961012b799efe7d6f2f68e57410b028992e8c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandTemplate (cyclomatic 11, cognitive 28): expandTemplate has cyclomatic complexity 11 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":"src/expression/node/FunctionNode.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab07c0c020709f6efafddbfd33c7de377b0e5551916519a6184f2b057ba2d3d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _map (cyclomatic 11, cognitive 24): _map has cyclomatic complexity 11 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"681391db44ecac374b5ec358a360c3074de9f85997f5c8fa6f4e889c3f28c2b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function csEtree (cyclomatic 11, cognitive 21): csEtree has cyclomatic complexity 11 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":"src/function/algebra/sparse/csEtree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f31e95dc8dc3f28ab657e52ed6cf88fba92aab91177da553144ab85e52b655d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findMinimumNode (cyclomatic 11, cognitive 21): _findMinimumNode has cyclomatic complexity 11 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":"src/type/matrix/FibonacciHeap.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e48d6e9eaa63ca93184c896777e50cc067e884d59dfb4c27c4f649f619454d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simplifyAndCompare (cyclomatic 11, cognitive 20): simplifyAndCompare has cyclomatic complexity 11 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":"test/unit-tests/function/algebra/simplify.test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d9cd4bcb1eb280b5e8aee76a5745c36011396a244639071b602c642ef0046d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _AAAA (cyclomatic 11, cognitive 19): _AAAA 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":"src/function/geometry/intersect.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"682ad9bfd4bdf6348ec6cef3ad58b12694f16e6e993b4e3c75e8de8ea2406ba3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Array | Matrix, Array | Matrix (cyclomatic 11, cognitive 19): Array | Matrix, Array | Matrix 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":"src/function/set/setIntersect.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"011c1c13675bcad700ae07faf35a1911c9e09b1b81995b85e08350e0599a7630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeMatch (cyclomatic 11, cognitive 17): mergeMatch 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":"src/function/algebra/simplify.js"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"83969e12c011a347714e349fee3203347656c0514409e3675b78e8e9c34a1d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _validateMatrixDimensions (cyclomatic 11, cognitive 17): _validateMatrixDimensions 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":"src/function/arithmetic/multiply.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ac0c25944837f8180aa6be9169cae9dfa273502e4f3f2c4067a92f64228af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitwise (cyclomatic 11, cognitive 17): bitwise 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":"src/utils/bignumber/bitwise.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f24588e60ce83bd0bc90ca86f0c56b09b2a29d80c97825a218d9f209d7ca98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _quantileSeq (cyclomatic 11, cognitive 16): _quantileSeq 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":"src/function/statistics/quantileSeq.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c107e016afdf1127389c7dac8ad08ffb380e1c43402b1c9e0190401b85ce418c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagonal (cyclomatic 11, cognitive 16): diagonal 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":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe6e4baaf388831c5404006e3a9866ea0f06a6f44eb34ec401c70cf63a02ac7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleVAandVARUnits (cyclomatic 11, cognitive 16): handleVAandVARUnits 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":"src/type/unit/Unit.js"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f83230a898dd791135b4f1ccab50623f4cea2a98e950cfbfeff1796c09d7af0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) 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":"src/utils/snapshot.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"654913133ba55a345981f3129ac5597fbbcf82425ba0008e836479cd6c42e2c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testCondition (cyclomatic 11, cognitive 13): testCondition 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":"src/expression/node/ConditionalNode.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca79a647cfd40c1d5187dae111acf57bb3754e5748d8b47a0385c36ba8c1686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatBigNumberToBase (cyclomatic 11, cognitive 13): formatBigNumberToBase 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":"src/utils/bignumber/formatter.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"704fec5f33f3cb0b39981b493e4bb875a445b77589526a22411011503b4d5924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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":"tools/docgenerator.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba985ec71d94f3d2d6751c467dedeff11394651a9901760b5ea3003a85f4008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _import (cyclomatic 11, cognitive 12): _import 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":"src/core/function/import.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192c0a47ed5b6794a9b64821098564498ccdf5356320924bcd0425f47bc400f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bigNthRoot (cyclomatic 11, cognitive 12): _bigNthRoot 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":"src/function/arithmetic/nthRoot.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645c38fb20dbb05ea3345458fbaa5c982fd7814a2ad5f6d743341a4565a3397"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nthRootNumber (cyclomatic 11, cognitive 12): nthRootNumber 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":"src/plain/number/arithmetic.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6859921076b7b4cccf274b1aa687c907e635978d14bd8b6962cac707dec2e86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function multiply (cyclomatic 11, cognitive 12): multiply 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":"src/type/unit/Unit.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebae0881bbeb96c32669ae975a12fd0820ebd3e35deaba23e9bac3f7f0d11be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function divide (cyclomatic 11, cognitive 12): divide 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":"src/type/unit/Unit.js"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9fb66428f87c31bce703f7162188bc2ba549d94b9bc255b34c4354cce39858"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function to (cyclomatic 11, cognitive 11): to 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":"src/type/unit/Unit.js"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e4e2be0f0856375487d90ff319543f7fff3a8cc995108299673d19e6a206c5"}},{"ruleId":"R3","level":"warning","message":{"text":"src/type/unit/Unit.js: 3141 lines of code: src/type/unit/Unit.js has 3141 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/unit/Unit.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"349f542092eab5d9c74d57d1cb546ac87d77fad2143032444e58653b9aa6add2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/expression/parse.js: 1602 lines of code: src/expression/parse.js has 1602 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/parse.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98176e8c025eeacbd8409d9eac8ad19a90a9d6d7bfa257e66fe5f3f11fc1a8ec"}},{"ruleId":"R3","level":"warning","message":{"text":"src/type/matrix/SparseMatrix.js: 1346 lines of code: src/type/matrix/SparseMatrix.js has 1346 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b62248956f9fab69c2539ae999b63f5502112e9ede12df53cae863972fcea4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/algebra/simplify.js: 1006 lines of code: src/function/algebra/simplify.js has 1006 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplify.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70aefd840a483475380e71e706df53a51c123cb7522fead9f5a00482c9d11e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/type/matrix/DenseMatrix.js: 939 lines of code: src/type/matrix/DenseMatrix.js has 939 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc54af6b4ad680609ee710ed8a4150b8030f6164d6682184857a9fc0322c11"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils/array.js: 860 lines of code: src/utils/array.js has 860 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/array.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7e5d289b9b28f4ee8f8424e256061c142aa3934d518761d8d38dec8adb4f22"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/arithmetic/multiply.js: 813 lines of code: src/function/arithmetic/multiply.js has 813 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8089f8a77796c4e44080a0b2c35f8ab3b85db9cad0c5891d01319e2bc235778"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/algebra/derivative.js: 711 lines of code: src/function/algebra/derivative.js has 711 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/derivative.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aad7580aed1d05ce485fb50b4732e626a5807679662bd5a9cc4c858aeca65c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils/number.js: 679 lines of code: src/utils/number.js has 679 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/number.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cc05dc4a5f4fb53b1d29ddb6f219b28108794f786015d86d6c474d1f35ea81"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/docgenerator.js: 659 lines of code: tools/docgenerator.js has 659 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":"tools/docgenerator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12735389d238f230d35147ac3c59441d2bf3523b923518af1af13c526f75be03"}},{"ruleId":"R3","level":"warning","message":{"text":"src/expression/node/OperatorNode.js: 636 lines of code: src/expression/node/OperatorNode.js has 636 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/OperatorNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7effd7d77bc76039dc7b7e598b0e0e5109696239ad2f4a4e45111797308bc09c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/matrix/eigs/complexEigs.js: 568 lines of code: src/function/matrix/eigs/complexEigs.js has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78123eeaf3b25ffbf3c01c1f2f0ff31ec793c589152d2d97d59d5ff6868d316c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/algebra/rationalize.js: 564 lines of code: src/function/algebra/rationalize.js has 564 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/rationalize.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a715978b902d7fea64436aecafe0acdd4bec89bf0d746fe471d4f8ea58c326e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/algebra/sparse/csAmd.js: 507 lines of code: src/function/algebra/sparse/csAmd.js has 507 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csAmd.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e92fe3656dae7346046d945ff933982f8c16537eea961e4146c20ce600bc5d4"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/entryGenerator.js: 482 lines of code: tools/entryGenerator.js has 482 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":"tools/entryGenerator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ba4bbc35b3141004b21370b62fbd6aeb74fe51741aa9ea42f8cb8d3bbb1b24"}},{"ruleId":"R3","level":"warning","message":{"text":"src/expression/node/FunctionNode.js: 479 lines of code: src/expression/node/FunctionNode.js has 479 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78df96c9847d7ed722adbf408f75ac34d93f23611de63254dfcf5112fa3706a3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/function/algebra/simplifyConstant.js: 460 lines of code: src/function/algebra/simplifyConstant.js has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe2b9e425a9636e6ccad7f0805aa1f2c54027158e65a7541d984e2c7a1b977"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/function/typed.js: 422 lines of code: src/core/function/typed.js has 422 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function/typed.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1292f18dc89e104d7c4c830106ae0359a463f00df074f7042ca937ba370afc3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/expression/operators.js: 402 lines of code: src/expression/operators.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/operators.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354979b0e42acf5781339ba2e3a1b5e9b2c6854c75cb843d695801ed03dfda78"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csChol.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421167fb9c6882a698e30bb1d46aa607fc8a698564cb754d9017324333dd703d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csSymperm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84724fc87f5f6cfbbcb68a07ac240bddea2ac60725cb6668a92f35334da7cfc7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csEreach.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f8517f131481a857504bba1e1e3ced4ad7b53b6249190bec63ef626f76f7b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/sparse/csCumsum.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1297481b01012d70ab731b33ae480050155c7e9805ce099caa8f6bfb67cd373"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/bignumber/arithmetic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dd6b53330ba075f9c8c751ea009c6d54d11edb96f7c153c3f296e7cb2cdca0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/embeddedDocs/function/probability/distribution.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9972f27932c122941d885c407e950fad2650d38dc6a8c19a41d5e6ed1a7efc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/log.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"488140522edb0d98935ac3c4a2d7b39b41523035d29cd701f7b008a3da71a1fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/bignumber/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19546b9d78c9d987a27ec4c8e1ace0bb267c099dff08072a2f0ffcc19b70403a"}},{"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":"bin/repl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376d477f8397abbcf7c49cf46f9938cc82ad3ed1187cdd848e6a3e3f0e634f15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/entry/allFactoriesAny.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aff124e50f1a3f060102879874b50f77e49a1bd709029aa6b5b3dc0ac74715"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/entry/allFactoriesNumber.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6955e8ccd684846cfdb6cd5b940e3f3d7a845d16064e753f7f8b7f3bfbcec62"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/header.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73c86afb30f4026301bf702afb47dc35d5febf84d3378f4f09c39d69c2f0de"}},{"ruleId":"R5","level":"warning","message":{"text":"Dependency Freshness: 37 outdated package(s); JS/npm CVEs scored in D30"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7de98450603a813bc7a991bc6e60f440c1deac6f9c9bfd4d0da057afed869bcf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027lgammaN\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/plain/number/index.js, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/plain/number/index.js in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plain/number/probability.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f9e1552dc7fd0c3f46ec41504727dc4fc7d9c754b0a8a4652453ea8e91c26a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027last\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/array.js"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9f735b1b902a168603628e857758f2a60699704a403c1ef6ff7c5498bae57c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027initial\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/array.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be6d88dd75789af0b8390513da865b73672bd6068b8379c0a762f69969e6ea1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/factory.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec1d1ceab71df6644d8f804bfad11f9df2ca29f42051f97257b71a63b45762"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027assert\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"54616e937f0ee809304b76b5d5c8f044d72c2745971dd9b81e93444c4a31ab74"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027codecov\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb1b81c2f9a3d7ad45e1522b8dd93924084f123086ab560c7b73fbaf9051d797"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027expr-eval\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1802c46d6cb44949a7f54f805bd4d72659498cfe499f0054ddd4d1c996180d09"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027jsep\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ebb78b342c821aae3d53a7ad0264ea73bd43c2f34b7783733e69f1ca303ab6fa"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ndarray\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"acdd280b49ff14f77e71b9ae853395e7b2947f0a7da6452989bbd41142ddeab3"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): src/utils/customs.js \u2192 src/utils/object.js \u2192 src/utils/is.js \u2192 src/utils/map.js \u2192 src/utils/customs.js"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/customs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b482e79fadf5f75f3b25dd94c92a20919aa3da046d56c3fcc7522abdc8bbb933"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(args) || !args.every(isNode)\u0060 appears character-identically in 2 files \u2014 src/expression/node/FunctionNode.js, src/expression/node/OperatorNode.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b5754953c670f48646341b78fbcb58bd2b5af449648918f240c277a6977e9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)\u0060 appears character-identically in 2 files \u2014 src/type/matrix/DenseMatrix.js, src/type/matrix/SparseMatrix.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a436bfd10d66a9025e2964fbcd18a5c817984ce7273ae072f5da8fda83e63ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isNumber(value) || !isInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 src/type/matrix/SparseMatrix.js, src/utils/array.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/SparseMatrix.js"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"15200f2620a27661ac8aa4d73b93bc95e268f17b7f402a6db28ee70ef3b03fa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isPositiveInteger(n) || !isPositiveInteger(k)\u0060 appears character-identically in 3 files \u2014 src/function/probability/combinations.js, src/function/probability/combinationsWithRep.js, src/function/probability/permutations.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/probability/combinations.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc01f826560b8b4e27ccad8b7936a36553ab8df88f1a37db6f2a454e21422a41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060( x * x \u003C 1 \u0026\u0026 y === Infinity) || (x * x \u003E 1 \u0026\u0026 y === -Infinity)\u0060 appears character-identically in 2 files \u2014 src/function/arithmetic/pow.js, src/plain/number/arithmetic.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/pow.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb42cb669b3377147aa10e4d2252cc497ec0076a37cdb3ced09552f4649c7a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(parenthesis === \u0027all\u0027) || ((exprPrecedence !== null) \u0026\u0026 (exprPrecedence \u003C= precedence))\u0060 appears character-identically in 2 files \u2014 src/expression/node/AssignmentNode.js, src/expression/node/FunctionAssignmentNode.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/AssignmentNode.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ee25d83f82a64845d2e7c4220360c9c8f42c6e3885c03612ce86c6c5d068cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(x \u003C= 1 \u0026\u0026 x \u003E= -1) || config.predictable\u0060 appears character-identically in 2 files \u2014 src/function/trigonometry/asech.js, src/function/trigonometry/atanh.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/asech.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a89fc11b45ecd9d1eed757de0b335d77baea69d391330752611a0b13eba2cd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(x \u003E= -1 \u0026\u0026 x \u003C= 1) || config.predictable\u0060 appears character-identically in 2 files \u2014 src/function/trigonometry/acos.js, src/function/trigonometry/asin.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/trigonometry/acos.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aada437650a7f6c8970359563199e6e6d9bbda90adbf76e449b5539eafa3e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(value) \u0026\u0026 value.length === 1\u0060 appears character-identically in 2 files \u2014 src/type/matrix/DenseMatrix.js, src/type/matrix/SparseMatrix.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2dd6ffb3916ddce896e240f112d1fc4a3472e8cce66b21e1c2f3fb389f202"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adt \u0026\u0026 bdt \u0026\u0026 adt === bdt \u0026\u0026 typeof adt === \u0027string\u0027 \u0026\u0026 adt !== \u0027mixed\u0027\u0060 appears character-identically in 2 files \u2014 src/function/arithmetic/multiply.js, src/function/matrix/dot.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17160906c76f105597bacfd97358bb4e9e57f86ebd3d76a757df95228dcc91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adt === a._datatype \u0026\u0026 bdt === b._datatype\u0060 appears character-identically in 7 files \u2014 src/function/arithmetic/multiply.js, src/type/matrix/utils/matAlgo04xSidSid.js, src/type/matrix/utils/matAlgo05xSfSf.js, src/type/matrix/utils/matAlgo06xS0S0.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/multiply.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"510db325b5c5c698518a818974799a6239fb783fa4d254192ca7d54350308c60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adt === denseMatrix._datatype \u0026\u0026 bdt === sparseMatrix._datatype\u0060 appears character-identically in 3 files \u2014 src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187ae27f5cfce3face44bb278238a6faac2c370a539d575d66acc448d3b4486"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060asize[0] !== bsize[0] || asize[1] !== bsize[1]\u0060 appears character-identically in 9 files \u2014 src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js, src/type/matrix/utils/matAlgo04xSidSid.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce87715a39320a9b3353ed083615cf5e3929a27d5b38bd524e9befab705b5b13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compareNatural(b1[i].value, b2[j].value) === 0 \u0026\u0026 b1[i].identifier === b2[j].identifier\u0060 appears character-identically in 3 files \u2014 src/function/set/setDifference.js, src/function/set/setIntersect.js, src/function/set/setIsSubset.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/set/setDifference.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab17c33915e45ae4a62759ebf66d4d2cab298347644092a35bcb0120904b17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data \u0026\u0026 isArray(data.data) \u0026\u0026 isArray(data.size)\u0060 appears character-identically in 2 files \u2014 src/type/matrix/DenseMatrix.js, src/type/matrix/ImmutableDenseMatrix.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a9496058135888cf686ba3ae23347bdf501945d95d5c59e8a01e281baa92db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060denseMatrix._datatype || denseMatrix.getDataType()\u0060 appears character-identically in 3 files \u2014 src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b5f8477646fbc5d67b60e73d0d59bed51c3f09862fa8dd3b4638a551f6334d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isSymbolNode(callback) || isFunctionAssignmentNode(callback)\u0060 appears character-identically in 3 files \u2014 src/expression/transform/filter.transform.js, src/expression/transform/forEach.transform.js, src/expression/transform/map.transform.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/transform/filter.transform.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcedd6badf512afb1c2decd57b58b93aec9cbdc60aff475dda5305802290f08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060object \u0026\u0026 Object.hasOwnProperty.call(object, property)\u0060 appears character-identically in 2 files \u2014 src/utils/object.js, tools/utils.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daff8dfedf1833b9c6b45dca7cdf05b95377f5e459a839de690d99a03c77930"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060object \u0026\u0026 typeof object.subset === \u0027function\u0027\u0060 appears character-identically in 2 files \u2014 src/expression/node/utils/access.js, src/expression/node/utils/assign.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/utils/access.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd5c59410c06c6b12a0fd2761d31b0483deda0bfc33180179fd2f7762652da0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sparseMatrix._datatype || sparseMatrix._data === undefined\u0060 appears character-identically in 3 files \u2014 src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo01xDSid.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d05c1d8ffc7eb6863e24773b006d7197edd0738af732a55939edbda716fb0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof adt === \u0027string\u0027 \u0026\u0026 adt === bdt \u0026\u0026 adt !== \u0027mixed\u0027\u0060 appears character-identically in 8 files \u2014 src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js, src/type/matrix/utils/matAlgo04xSidSid.js, src/type/matrix/utils/matAlgo05xSfSf.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/utils/matAlgo02xDS0.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"296d0bc67d9be6bf11e8f9ebe57229cf71451215eae1c7dfc2ebfe0ac2acb62e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof fn === \u0027function\u0027 \u0026\u0026 fn.rawArgs === true\u0060 appears character-identically in 2 files \u2014 src/expression/node/FunctionNode.js, src/expression/node/OperatorNode.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expression/node/FunctionNode.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7ce9e99fc7268fb0289e7a9ef9e7cd3f98f179e7e2680bd4aadafdafdd987"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !isInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 src/function/matrix/ones.js, src/function/matrix/zeros.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/ones.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d269073b9a65a4352a32a3725f6e9b89d519fb9b017049d195feedac5c015b4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x.value === null || x.value === undefined\u0060 appears character-identically in 2 files \u2014 src/function/arithmetic/addScalar.js, src/function/arithmetic/subtractScalar.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/addScalar.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b2f371fc6a6131cf87bca6708738898d67da5377388818900f309073323610"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060y.value === null || y.value === undefined\u0060 appears character-identically in 2 files \u2014 src/function/arithmetic/addScalar.js, src/function/arithmetic/subtractScalar.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/addScalar.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a3d3bc32c1351c93715a51465de4961d12d888c36efeffcc92aaea82a38f77"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is exported and takes \u0060x: object\u0060 from its caller, and it calls itself at line 31 (\u0060clone\u0060) with a piece of \u0060x\u0060 (and at line 40) \u2014 and nowhere in \u0060clone\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3871b84a03efba7be59a203147956f97a926f626bc2187216840b97eb478f2fe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deepExtend\u0060 is exported and takes \u0060a: object\u0060 from its caller, and it calls itself at line 105 (\u0060deepExtend\u0060) with a piece of \u0060a\u0060 \u2014 and nowhere in \u0060deepExtend\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060deepExtend\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab904531aa742bdbfc6ac49f1149f54757d34ea12aeeaa4b8ceabf17feb1c7"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060a\u0060, and the statement it guards acts on the element it is on \u2014 \u0060a[j]\u0060. The test deciding whether that statement runs does not: \u0060a[0].length === 2\u0060 reads \u0060a[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"55479d26ac9d8d46c705d36a2801446f1c0f32f1e4c44b92c9dadc59d76347b3"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060a\u0060, and the statement it guards acts on the element it is on \u2014 \u0060a[j]\u0060. The test deciding whether that statement runs does not: \u0060a[0].length === 3\u0060 reads \u0060a[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/geometry/distance.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c5a5c16b22292cd8e302dcde39d1ffea22f613f3769f1fbbd87781c4c0280"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/object.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"264a0dff907d5f51352ca29425e910f002259e06344fac6bb0ffd95742e2ea95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/type/matrix/DenseMatrix.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"697307b3189463fcdaae7de7510ab2c116b11a40cc028cfde85b51b30e3addb3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/matrix/eigs/complexEigs.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"955fc2560992c27488d801b3b2d2ab20288e83fcdc8afdae1a21c962bf58e0ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/arithmetic/pow.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7974d11018b327b410a557fc618f4fd1e0a713e3cafecf975403bc02196fc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function/algebra/simplifyConstant.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e2b7023fadfb5ad588c2d52f2a136ed22e61cd4ffbac322d4a5b9a5ccf1283"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-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-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":76,"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."]}]}