{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"parse (cyclomatic 196): parse has cyclomatic complexity 196 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"270a699b9b270d9a0249b99db66f088cf4a723c8a4cab3c8d5ee8ee8ef7b204b"}},{"ruleId":"D1","level":"warning","message":{"text":"web.structured-clone.structuredCloneInternal (cyclomatic 98): web.structured-clone.structuredCloneInternal has cyclomatic complexity 98 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d395a242d4dfbda189a63a66fecf3efa5a2281e3b5036240f71f7350c7b9cb"}},{"ruleId":"D1","level":"warning","message":{"text":"sumPrecise (cyclomatic 52): sumPrecise has cyclomatic complexity 52 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 12 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.math.sum-precise.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e620676e66969092468234ca31e10773326f9e05aa0cc30451df8599a75b17"}},{"ruleId":"D1","level":"warning","message":{"text":"playground.init (cyclomatic 48): playground.init has cyclomatic complexity 48 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 10 belong to 5 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":"website/src/js/playground.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6171979c46e91b02608c90d5f5bd26dcaee4fa94b64e7edb0ea8b86975efa00f"}},{"ruleId":"D1","level":"warning","message":{"text":"iterator-define.default (cyclomatic 41): iterator-define.default has cyclomatic complexity 41 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-define.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780d139c0166aae803d286646fd0748179c48b94e8b65ee615586a95af5e833"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 41): exports has cyclomatic complexity 41 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 8 belong to 6 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":"packages/core-js/internals/iterator-define.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ec517033cd5f9130c62a845c99a50b73fd597b563af4e484567bfc21699584"}},{"ruleId":"D1","level":"warning","message":{"text":"export.default (cyclomatic 36): export.default has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7433e48c8855e3f1b21afb9d9e63ee91087a0909fd42bb94a401455091229bf"}},{"ruleId":"D1","level":"warning","message":{"text":"collection.default (cyclomatic 36): collection.default has cyclomatic complexity 36 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 17 belong to 8 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7843be72b6a44c7771742833911510a4eae60d3d49926e2a66fa4f33bc63490c"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 36): exports has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aba3b6c1f2a7eabcfb6d6e765ddf75958168dd6acf7e93d37ebbd899aa59e33"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 36): exports has cyclomatic complexity 36 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 17 belong to 11 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":"packages/core-js/internals/collection.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9084149fa353af2f9e6abbf8b14fca68df3c5fdc3805e11f8a2c7c0d51f54d80"}},{"ruleId":"D1","level":"warning","message":{"text":"main.init (cyclomatic 32): main.init has cyclomatic complexity 32 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/js/main.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdf135bd7e42883b0554d9ee9b982d830e680090c60511a2251b61198b543a8"}},{"ruleId":"D1","level":"warning","message":{"text":"uint8-from-base64.default (cyclomatic 31): uint8-from-base64.default has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/uint8-from-base64.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"96438f2d5dc8b59905bd74985ee9dbf1469dcb1bcce78e13f817aa40ad2e8e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"web.url.constructor.parseIPv6 (cyclomatic 31): web.url.constructor.parseIPv6 has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c04ad1f586e92687cc964bb1236e1863ce2fd487a1d4f280f10f1e38c2c4de9"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 31): exports has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/uint8-from-base64.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e4fccd2c0e4b633da419f63cd663b147d06076a38c2bfcfd60a0a077327940"}},{"ruleId":"D1","level":"warning","message":{"text":"getConstructor (cyclomatic 30): getConstructor has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 11 function items inside it that branch (delete, define, forEach, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection-strong.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1fedff6105331a08aeb327da68d66c7cda328aeaec7a67b2182f953602a128"}},{"ruleId":"D1","level":"warning","message":{"text":"RegExp (cyclomatic 30): RegExp has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"421f8ca313ddf96b6a152eea7949100ff4b1e8135b5a3c1855029005517a4747"}},{"ruleId":"D1","level":"warning","message":{"text":"exec (cyclomatic 30): exec has cyclomatic complexity 30 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/regexp-exec.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad146ae122c457c240c1d1145d41c4ad61fc055dd4900c09ce8d0bd4c49db29a"}},{"ruleId":"D1","level":"warning","message":{"text":"url-percent-coding.decode (cyclomatic 27): url-percent-coding.decode 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":"packages/core-js/internals/url-percent-coding.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f24bd3e0fe4c01b3d8e41c7905767002dec1e7481171908a64f52c56d987e"}},{"ruleId":"D1","level":"warning","message":{"text":"web.structured-clone.tryToTransfer (cyclomatic 26): web.structured-clone.tryToTransfer has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b17a73fdc30a37242ae3698ffd4a7ed939860566726c08e15f62fe2cba45b1"}},{"ruleId":"D1","level":"warning","message":{"text":"string-parse.default (cyclomatic 26): string-parse.default has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-parse.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa64210fc8babcece4337f443c09716465f16d9beb9f4c96649fc30e6ff8022b"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 26): exports has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to 9 function items inside it that branch ((anonymous), (anonymous)::(anonymous), setter, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/typed-array-constructor.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1e87c2f3e5ff531e81d8b3883a64bf339094f3c3319f4563fc5c260127a78c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 26): (anonymous) has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch ((anonymous), (anonymous), split). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.split.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdca8f96621525227ad2c12b86b4021e8093509b55ba174a9295dca465292853"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 26): exports has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-parse.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fb5690743d71724be96115f7b1c43653addea530a8576703396cd03cbee591"}},{"ruleId":"D1","level":"warning","message":{"text":"iterate.default (cyclomatic 24): iterate.default has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterate.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aacddd5ce6b961868df20ec3ffaf166880f575da4ed194ce66f2ce4996f8fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"stringify (cyclomatic 24): stringify has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 192). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.json.stringify.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d789b1e232fbacc0f6eb97bf96482e7957ded78d0ada920b64848dd8f209754"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 24): exports has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 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":"packages/core-js/internals/iterate.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfea15095403b8513106e38dcd550516548bca9031b8346943a7ac71a49f7249"}},{"ruleId":"D1","level":"warning","message":{"text":"targets-parser.default (cyclomatic 22): targets-parser.default has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/targets-parser.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"54112bc677b33eeafe7b052f2aa1f7dc41b0cb84d1e11f4d3f45f3ac324351f9"}},{"ruleId":"D1","level":"warning","message":{"text":"collection.default (cyclomatic 22): collection.default has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 53, 50, 38). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/collection.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdd3c627a6f6ddbf261e0552753b2acc9374ca7c1d35da23035e3180b653160"}},{"ruleId":"D1","level":"warning","message":{"text":"async-iterator-create-proxy.createAsyncIteratorProxyPrototype (cyclomatic 22): async-iterator-create-proxy.createAsyncIteratorProxyPrototype has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 63, 27, 41, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-create-proxy.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"36548d59e67f162db22491754ad2bff5f9f8dedce93ed57e0b2766e1a1679553"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 22): exports has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous)::(anonymous), (anonymous), (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/collection.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b527f60ddd6a253d9d4cfa2f7551ed3db43cee9086ebd2bdaef5b17bf5e7480d"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 22): exports has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/targets-parser.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fdeb4deb9ae8b25470a392cf48722f3c6889a193c1e57f3a4d2ecd45926f38"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 22): exports has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/make-built-in.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"21305a6a7344b598f8b298108e504727a11e88e2142d483bd2724d39950885cf"}},{"ruleId":"D1","level":"warning","message":{"text":"numeric-range-iterator.$RangeIterator (cyclomatic 21): numeric-range-iterator.$RangeIterator has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/numeric-range-iterator.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f6d44a1a02eef4d1806fe6a6ba40b6da8b9fd9f6588214651eb2e024bdbb47"}},{"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: 2 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch ((anonymous), replace). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.replace.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"da969e9e50ca0be5e54d849ff778322a1fbfdae0f92243e2c9df14dd0f956ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericRangeIterator (cyclomatic 21): NumericRangeIterator has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/numeric-range-iterator.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf01c1d52ddf987645d1fb24a3a933d2305656b22357d9240468c066d2fb8acb"}},{"ruleId":"D1","level":"warning","message":{"text":"array-iteration.createMethod (cyclomatic 20): array-iteration.createMethod has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 18). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-iteration.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c57ff88f967a714de05cd708195c283ef7fe93b04619361cc05faa3c7138c1"}},{"ruleId":"D1","level":"warning","message":{"text":"async-iterator-iteration.createMethod (cyclomatic 20): async-iterator-iteration.createMethod 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 4 function literals inside it that branch (lines 42, 56, 20, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-iteration.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c50b5823c0ba146909977f80801dc54319cf5eaa04ccf627a8dcb36c023cba1"}},{"ruleId":"D1","level":"warning","message":{"text":"web.url.constructor.isDisallowedCodePoint (cyclomatic 20): web.url.constructor.isDisallowedCodePoint has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f3de3112a721ad3730481030c74eab8ffbd663770311bfb10f8fab40646aef"}},{"ruleId":"D1","level":"warning","message":{"text":"isIgnoredCodePoint (cyclomatic 20): isIgnoredCodePoint has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5106f781bfc7262c1b84ed0717bf89d8849cf6d577a5dcec9532cd41f066a4"}},{"ruleId":"D1","level":"warning","message":{"text":"wrap-error-constructor-with-cause.default (cyclomatic 19): wrap-error-constructor-with-cause.default has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/wrap-error-constructor-with-cause.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8811824e53655cc60699576c072cd317add9c200bdbcb5dfa376e43a6fe2925"}},{"ruleId":"D1","level":"warning","message":{"text":"web.url.constructor.parseIPv4 (cyclomatic 19): web.url.constructor.parseIPv4 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 is NOT this file\u0027s highest cyclomatic complexity: web.url.constructor.isIgnoredCodePoint (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f93dd1b7384c1b946686c551090e88c1bb15fe79307353053f1a37a9b3ee16"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 19): exports has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/wrap-error-constructor-with-cause.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb397bda5b78cb257e599ba36d795254a0318ad7057f43d91d1b940269faf7"}},{"ruleId":"D1","level":"warning","message":{"text":"array-buffer-view-core.exportTypedArrayStaticMethod (cyclomatic 18): array-buffer-view-core.exportTypedArrayStaticMethod has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-buffer-view-core.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeae3c9134c7817743e2c379e93590ec4fc59776403c5e9f8443f3ad83b6ecd"}},{"ruleId":"D1","level":"warning","message":{"text":"es.regexp.constructor.handleNCG (cyclomatic 18): es.regexp.constructor.handleNCG has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"653cd2e071809dc839d0b4e41d93e3dfc5d954572837baef05e1c014f9facb5f"}},{"ruleId":"D1","level":"warning","message":{"text":"esnext.string.dedent.dedentStringsArray (cyclomatic 18): esnext.string.dedent.dedentStringsArray has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.string.dedent.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8994dcca7af2c99d3f62d0c321c41b43fe9729885197c12ad961f69d5395d"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 18): exports has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to 3 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":"packages/core-js-builder/index.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4793a6dc1d220b7a4aff5a2d1255a7b3861397bba5bf9fb4cbc522a996853a06"}},{"ruleId":"D1","level":"warning","message":{"text":"zip (cyclomatic 18): zip has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.zip.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de1d905d6a498ca58f9cfb6b75f00283c0e57b516880a526c9f0649624eb5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"export.default (cyclomatic 17): export.default has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/export.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7282f435ee0565bb873e6578c62188e7462cac842d45086571544fcd88bf12d7"}},{"ruleId":"D1","level":"warning","message":{"text":"string-punycode-to-ascii.encode (cyclomatic 17): string-punycode-to-ascii.encode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-punycode-to-ascii.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0934844a2ef8320e171328eab3d3f88e35e890cb339acd319eef578e71a70e"}},{"ruleId":"D1","level":"warning","message":{"text":"exports (cyclomatic 17): exports has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/export.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c26d9ecf64c9060b2fa14adac877d6495ce306139dbca081e0d7fd1c055b068"}},{"ruleId":"D1","level":"warning","message":{"text":"fromString (cyclomatic 17): fromString has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.number.from-string.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f79c0a2a4656b990790f47ba4545927965be9facb72737c51515dcf55ce9002"}},{"ruleId":"D1","level":"warning","message":{"text":"iterator-create-proxy.createIteratorProxyPrototype (cyclomatic 16): iterator-create-proxy.createIteratorProxyPrototype has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 43, 26). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-create-proxy.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31250e8bbce1963e9859ec29099de58a2d85f29b496b7d182be51e1ec2a8d9"}},{"ruleId":"D1","level":"warning","message":{"text":"es.number.constructor.toNumber (cyclomatic 16): es.number.constructor.toNumber has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.number.constructor.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8145babc487df079c6519bd296c6ed971f526df9449b550e8f711e9fc1d7cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.sort.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"960a3d347918a0297b248fb8183b033064b069d81d7b9cde8aecae91f71bfb32"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 364): parse has cognitive complexity 364 (threshold 15). Drivers by points: if/else 102 (271 pts), boolean chains 60, ternaries 4 (17 pts), loops 3 (10 pts), match/switch 2 (6 pts) (nesting depth added 193). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"226029857be5c69d68a62fd1349c1afeab951160dc6090ccc3433abf2a3cad7d"}},{"ruleId":"D2","level":"warning","message":{"text":"structuredCloneInternal (cognitive 86): structuredCloneInternal has cognitive complexity 86 (threshold 15). Drivers by points: if/else 18 (32 pts), error handling 9 (28 pts), ternaries 4 (14 pts), match/switch 4 (7 pts), loops 2 (5 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e05eac83548d564ba2cf3b2da120ded6d8a25ba088adfbdf7fd892891e5349"}},{"ruleId":"D2","level":"warning","message":{"text":"uint8-from-base64.default (cognitive 82): uint8-from-base64.default has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (73 pts), boolean chains 5, loops 1 (2 pts), ternaries 2 (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/uint8-from-base64.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56976853cc9430970591aa98883eaae9e73e40dbe467b894695baf91d319272"}},{"ruleId":"D2","level":"warning","message":{"text":"url-percent-coding.decode (cognitive 82): url-percent-coding.decode has cognitive complexity 82 (threshold 15). Drivers by points: if/else 16 (64 pts), loops 3 (10 pts), boolean chains 8 (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/url-percent-coding.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2daf28c8a1d98e0b292620b588ce5a2a0175b60a8ceeff7151d343cc59762e"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 82): exports has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (73 pts), boolean chains 5, loops 1 (2 pts), ternaries 2 (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/uint8-from-base64.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb776d3a6e9d929385be14e7cc31b8343c9a6cc9901cdaae58f9fe9a09c99f"}},{"ruleId":"D2","level":"warning","message":{"text":"sumPrecise (cognitive 77): sumPrecise has cognitive complexity 77 (threshold 15). Drivers by points: if/else 20 (38 pts), ternaries 7 (22 pts), boolean chains 12, loops 3 (4 pts), match/switch 1 (nesting depth added 34). Of this number, 60 points are the body\u0027s own statements and 17 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":"packages/core-js/modules/es.math.sum-precise.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae368926f455db17bb4cc80397d38f8fa3331806d1f69c47510c95f706c51d5"}},{"ruleId":"D2","level":"warning","message":{"text":"web.url.constructor.parseIPv6 (cognitive 74): web.url.constructor.parseIPv6 has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (58 pts), loops 5 (12 pts), boolean chains 4 (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":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5644f08f4f0ccb6fba37a24a2a297951e7197e8aa3a9a93037a518fcf4d27a97"}},{"ruleId":"D2","level":"warning","message":{"text":"collection.default (cognitive 68): collection.default has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 13 (45 pts), boolean chains 12, if/else 7 (11 pts) (nesting depth added 36). Of this number, 21 points are the body\u0027s own statements and 47 belong to 8 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"295037c80eeb02a2729bf2c4362e7ceda388e843a8f7197e14aadb1beb1c69f4"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 51): exports has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 15, loops 1 (3 pts), ternaries 2 (3 pts), match/switch 1 (nesting depth added 16). Of this number, 46 points are the body\u0027s own statements and 5 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-define.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f051200fde8318be0f6a9a6e277fcc603a53e0012d1155398cef3966291c6"}},{"ruleId":"D2","level":"warning","message":{"text":"iterator-define.default (cognitive 49): iterator-define.default has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 15, loops 1 (3 pts), match/switch 1, ternaries 1 (nesting depth added 15). Of this number, 44 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-define.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4871f52ac61d5be3f4baf9d9addf29c5990062e501e5322cfa7812105959c23c"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 48): exports has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (39 pts), ternaries 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 21). Most of this is not in the body itself: 12 of the 48 points are its own statements and the rest belongs to 9 function items inside it that branch ((anonymous), (anonymous)::(anonymous), setter, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/typed-array-constructor.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3835627b848fb13baa4c911dcacf2fc3b6747193818734fc925b2243491862"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 48): exports has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 15, ternaries 6 (9 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"628cf147221636c84f7f72df2aeef035017fdc7ca6b1f75ea4c8751a8fe02993"}},{"ruleId":"D2","level":"warning","message":{"text":"iterator-zip.IteratorProxy (cognitive 47): iterator-zip.IteratorProxy has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (31 pts), error handling 2 (9 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-zip.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f45707ff5c67a89849d9cdeba3a123bb53a01429c2d432327226d852924632"}},{"ruleId":"D2","level":"warning","message":{"text":"zip (cognitive 47): zip has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 5 (17 pts), loops 3 (7 pts), ternaries 2, boolean chains 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":"packages/core-js/modules/es.iterator.zip.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a18acb0cdf34001855734d9d03bf8974b7eaebfb7c0f261f75b9f62a8c9b93a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 47): (anonymous) has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (31 pts), error handling 2 (9 pts), loops 2 (6 pts), ternaries 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-zip.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cc64b61f9c80420d73501eece73e5ead3fb42fad96a18fb97087abe40a33e3"}},{"ruleId":"D2","level":"warning","message":{"text":"playground.init (cognitive 46): playground.init has cognitive complexity 46 (threshold 15). Drivers by points: if/else 29 (30 pts), boolean chains 12, error handling 2, ternaries 2 (nesting depth added 1). Of this number, 36 points are the body\u0027s own statements and 10 belong to 5 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":"website/src/js/playground.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2005235fae1d8ecd45820a731cab9bd481e409b448b44bcea0817207fd33052"}},{"ruleId":"D2","level":"warning","message":{"text":"getConstructor (cognitive 46): getConstructor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (33 pts), ternaries 5 (6 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 13). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 11 function items inside it that branch (delete, define, forEach, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection-strong.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e7411dc019d552c51c3aeb2d373e4868a2d6bde47a05db8b1f12da983a8883"}},{"ruleId":"D2","level":"warning","message":{"text":"export.default (cognitive 42): export.default has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 14, ternaries 3 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f896e738ce14f8ec82b57ffda03d00cfd73c333cc6129b9a602bc682ce09770"}},{"ruleId":"D2","level":"warning","message":{"text":"async-iterator-iteration.createMethod (cognitive 42): async-iterator-iteration.createMethod has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 3 (11 pts), error handling 5 (9 pts), boolean chains 3 (nesting depth added 18). Most of this is not in the body itself: 0 of the 42 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 42, 56, 20, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-iteration.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"934071059da3824fb514388a51a7739aa65951cb8ded182a74c6f3a09bef958a"}},{"ruleId":"D2","level":"warning","message":{"text":"string-punycode-to-ascii.encode (cognitive 42): string-punycode-to-ascii.encode has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (11 pts), loops 5 (10 pts), boolean chains 2 (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":"packages/core-js/internals/string-punycode-to-ascii.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0931ba19a8580171c9bd54740e30e059b65f52f100f6df287bd7bfd27aee0dee"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 42): exports has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 14 (15 pts), if/else 8 (14 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 20 belong to 11 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a27c1873db9e382292e5b45737cf9e38258b33e9fbe69bf7aabbcfa5818811"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 41): (anonymous) has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 10 (15 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 3 function items inside it that branch ((anonymous), (anonymous), split). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.split.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffeb2abd1e19c3e6dd175a2d7651713865c7e8cef462a22cdbbe95202c38c79"}},{"ruleId":"D2","level":"warning","message":{"text":"parseIPv4 (cognitive 37): parseIPv4 has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (14 pts), loops 3, boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c091c33cc675c9fc7c5bb402caf2bbe1a50bf56bec658a752810ed087cfff1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 36): exports has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, loops 2 (4 pts), ternaries 3 (4 pts), error handling 1 (2 pts) (nesting depth added 12). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterate.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6635e9f490c4d906257b196b923cc2da06f80133b4f1a9b0b0d52c8e9adbc48"}},{"ruleId":"D2","level":"warning","message":{"text":"iterate.default (cognitive 35): iterate.default has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterate.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565aca319cf386f50880d35c53236e011e79b68df3844d128b07c419869039f"}},{"ruleId":"D2","level":"warning","message":{"text":"array-buffer-view-core.exportTypedArrayStaticMethod (cognitive 34): array-buffer-view-core.exportTypedArrayStaticMethod has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (8 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-buffer-view-core.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e343de820c3ac5d1653cd4679382a3a789e187d45e619a581212470e787a34"}},{"ruleId":"D2","level":"warning","message":{"text":"tryToTransfer (cognitive 34): tryToTransfer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 2 (8 pts), match/switch 1 (3 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb05cf6f416cf404eb82ec1cd36b88fafbe2d23f45a8e41bbb603f0984effe0"}},{"ruleId":"D2","level":"warning","message":{"text":"exec (cognitive 34): exec has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 9, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/regexp-exec.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0259bf793962e930e21dac2d333269a23abbcfed9da1e008d0fc2668f98869e4"}},{"ruleId":"D2","level":"warning","message":{"text":"targets-parser.default (cognitive 33): targets-parser.default has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 5 (7 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). Of this number, 28 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/targets-parser.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c4e52153a8dd54a4340f9e414eae77175e11ca63d149b7f182b4059d34ce26"}},{"ruleId":"D2","level":"warning","message":{"text":"stringify (cognitive 33): stringify has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 8). Most of this is not in the body itself: 15 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 192). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.json.stringify.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd0b20c217052fafb6180f4ac61f3ee567fad0c2438494e489e306545109e3"}},{"ruleId":"D2","level":"warning","message":{"text":"RegExp (cognitive 33): RegExp has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, ternaries 4 (5 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca0ff0d3638db4d9051d3e41e96cc1135659c79bb0028bccc14e3f59e1bd6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"collection.default (cognitive 32): collection.default has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 9, if/else 5 (8 pts) (nesting depth added 13). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 53, 50, 38). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/collection.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"df70ea2d27d9ef5c66caf6f43f4f628d077f1ae8c470a633f7f94777be842c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"array-iteration.createMethod (cognitive 32): array-iteration.createMethod has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (10 pts), ternaries 4 (6 pts), boolean chains 4, loops 1 (nesting depth added 16). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to one function literal inside it that branches (line 18). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-iteration.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"48de1d0690bfded5e45f562aad78ff0b6edc7c10607e01dfbad36e07fdb1358e"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 32): exports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, ternaries 2 (6 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/export.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedd56a75ea01f5f90238fa66ca2b882ee219145dd6d8fd90f9fdb5e3a6d9a07"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 32): exports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 5 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/targets-parser.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"911a0a8d3f8b8ef6e5d854ae8163eb19864dddfef5b691ac01b11aae21b85a76"}},{"ruleId":"D2","level":"warning","message":{"text":"string-parse.default (cognitive 31): string-parse.default has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-parse.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"308eebd8c212ec2dcb8d73c100aa5ea53eb3f17ad8f9df244b42feefa28dd89f"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 31): exports has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-parse.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b2fde99a60af7bd3f3a8d370f98ac727f09bc79272de335e6f4ba47258812f"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 31): exports has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 6 (10 pts), boolean chains 7 (nesting depth added 13). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous)::(anonymous), (anonymous), (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/collection.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb2cd5af77bd38afa9175d8ee176ce519046c87fc8f922fac35a8435c4aebd0"}},{"ruleId":"D2","level":"warning","message":{"text":"main.init (cognitive 30): main.init has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 12, loops 3, ternaries 1 (nesting depth added 3). Of this number, 29 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/js/main.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b275a3dedcb61bb4ddd6166d9ed78c30df404ad0e219dd95ca3769b6558cf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 30): (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 3 (4 pts), ternaries 3 (nesting depth added 9). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 2 function items inside it that branch ((anonymous), replace). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.replace.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"694a4404c97a83493e545e3f79b75212cc35d86db9b809bfe089f6d5cb0e9422"}},{"ruleId":"D2","level":"warning","message":{"text":"async-iterator-create-proxy.createAsyncIteratorProxyPrototype (cognitive 29): async-iterator-create-proxy.createAsyncIteratorProxyPrototype has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 4 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 63, 27, 41, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-create-proxy.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"264587f6dacfc6fb4c081bcf9814c9ac91516659813e38000ed80f233ac0179f"}},{"ruleId":"D2","level":"warning","message":{"text":"es.regexp.constructor.handleNCG (cognitive 29): es.regexp.constructor.handleNCG has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b4b02c8d04eeb0aa7ee514ac652a78b1b2210fb076adb1da882876f18da24a"}},{"ruleId":"D2","level":"warning","message":{"text":"esnext.string.dedent.dedentStringsArray (cognitive 29): esnext.string.dedent.dedentStringsArray has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (7 pts), boolean chains 4, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.string.dedent.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9e986109a6cc0b59b2019478ea6ca9a825e9eb8ad30844c94c2d970a7adb3b"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 28): exports has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 3 (8 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 9). Of this number, 25 points are the body\u0027s own statements and 3 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":"packages/core-js-builder/index.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"07be90bbe9eb6f4c613f6875e39ece03dac687f842d03f87b31b1d6f87315e94"}},{"ruleId":"D2","level":"warning","message":{"text":"from (cognitive 28): from has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (13 pts), error handling 2 (6 pts), loops 2 (4 pts), if/else 3, 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":"packages/core-js/internals/array-from.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4e03d944b9eec54c6efee79c7ee816c3fe38d2a08976954462a375a018ac36"}},{"ruleId":"D2","level":"warning","message":{"text":"export.default (cognitive 26): export.default has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/export.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"697cf3171b9eaed46747504e960e38e9c3d47fd66dc1ca82be7d1f06ab12a079"}},{"ruleId":"D2","level":"warning","message":{"text":"es.json.parse.internalize (cognitive 26): es.json.parse.internalize has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (14 pts), loops 2 (6 pts), if/else 3 (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":"packages/core-js/modules/es.json.parse.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be315d77c4927895f95da227312facb6339de690ba27ce819bdb63fb45410a"}},{"ruleId":"D2","level":"warning","message":{"text":"es.promise.constructor.callReaction (cognitive 25): es.promise.constructor.callReaction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, error handling 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":"packages/core-js/modules/es.promise.constructor.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"642573dcda66c9df46a23e5e042eac642e235d3673c85a87001fa5f7d55310b5"}},{"ruleId":"D2","level":"warning","message":{"text":"serializeHost (cognitive 25): serializeHost has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b7e7a53505d83ed2356af506c137b5bca9126260738700807eec636c4966a"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 24): exports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, ternaries 1 (2 pts), error handling 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":"packages/core-js/internals/make-built-in.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2edc1792dd68d1ac64783337ccc723ab716116b37bf20161d8b59f9b5af3891"}},{"ruleId":"D2","level":"warning","message":{"text":"zipKeyed (cognitive 24): zipKeyed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts), error handling 2 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 10). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.zip-keyed.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ccceda670bc38ceae212219f97b69781305f89119567c13919eb9f210b7fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"array-buffer-view-core.exportTypedArrayMethod (cognitive 23): array-buffer-view-core.exportTypedArrayMethod has cognitive complexity 23 (threshold 15). Drivers by points: error handling 2 (9 pts), if/else 4 (6 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-buffer-view-core.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e0da32eea024b1944b3eef11bcac3ad13eb0e6259e69dc02a5c0d0bb78d92f"}},{"ruleId":"D2","level":"warning","message":{"text":"splice (cognitive 23): splice has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.splice.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58b573905fa36e50a83f0fa0e60ffbe3b9d18eaab40dc45f9949c35d736025"}},{"ruleId":"D2","level":"warning","message":{"text":"fromString (cognitive 23): fromString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.number.from-string.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e864d8b7e161faeede16eb8fc5807ea830f263e5090527fe83c80595dbcbfe"}},{"ruleId":"D2","level":"warning","message":{"text":"wrap-error-constructor-with-cause.default (cognitive 22): wrap-error-constructor-with-cause.default has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 3, error handling 1 (2 pts) (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/wrap-error-constructor-with-cause.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32e0cb4a480b9244a46df07000cb9600172cbbded538bbb3ecbf65a75850264"}},{"ruleId":"D2","level":"warning","message":{"text":"es.number.constructor.toNumber (cognitive 22): es.number.constructor.toNumber has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.number.constructor.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e697f4249cbea2ac07289e80871eef3c0340410fd890294569b230c83c9b54b"}},{"ruleId":"D2","level":"warning","message":{"text":"cloneBuffer (cognitive 22): cloneBuffer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (3 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":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a4e20f4994c1f6471b56f2aeeb8823d8f829d218d8dd6f47c8c6cab3140616"}},{"ruleId":"D2","level":"warning","message":{"text":"toFixed (cognitive 22): toFixed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.number.to-fixed.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69aa17c572c956d0534315eb1fe0994329b60e540441839d5991466bb633315"}},{"ruleId":"D2","level":"warning","message":{"text":"pack (cognitive 22): pack has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/ieee754.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b3b70c8e4ca6b7edc96c265ccf58388c05f788e4ce41c8118022acffe231d"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 21): exports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 3, error handling 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/wrap-error-constructor-with-cause.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"225eb30377dfa22847399a38b79b87195cc9b593a3df3ad4116d6c126c879f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"web.dom-collections.iterator.handlePrototype (cognitive 20): web.dom-collections.iterator.handlePrototype has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (8 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.dom-collections.iterator.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b631968c293faf5e32bf56f6f02d9015f6c6ecfd6a750cc6b71b320cdb28f899"}},{"ruleId":"D2","level":"warning","message":{"text":"esnext.async-iterator.flat-map.AsyncIteratorProxy (cognitive 20): esnext.async-iterator.flat-map.AsyncIteratorProxy has cognitive complexity 20 (threshold 15). Drivers by points: error handling 6 (10 pts), if/else 8 (10 pts) (nesting depth added 6). Most of this is not in the body itself: 0 of the 20 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 30, 56, 60, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.flat-map.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd42210fe367919d49b9427d1879962d3de8a53bb7a68d14205aa4191d2d93"}},{"ruleId":"D2","level":"warning","message":{"text":"iterator-create-proxy.createIteratorProxyPrototype (cognitive 20): iterator-create-proxy.createIteratorProxyPrototype has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 5). 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 literals inside it that branch (lines 43, 26). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-create-proxy.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a8917dcaa7bd84e922201cfd38d4f24c0724da6112e8299edd4a068f8eca5a"}},{"ruleId":"D2","level":"warning","message":{"text":"es.reflect.set.$set (cognitive 20): es.reflect.set.$set has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.reflect.set.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"21268a22bcd3194a2fd0a1d89d28f9fe18d159b577b3727a5df7941678d2bc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"check-dependencies.checkPackage (cognitive 20): check-dependencies.checkPackage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-dependencies/check-dependencies.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8803053c1a1bcab3401da4b7e4c15f6b2e85f28b1b37e7d4bf647e5f44658f63"}},{"ruleId":"D2","level":"warning","message":{"text":"parseHost (cognitive 20): parseHost 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371896964cb9ad2e1c651ee945220160bb4e67351e1e7dad6309b7387f84156"}},{"ruleId":"D2","level":"warning","message":{"text":"toExponential (cognitive 20): toExponential has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 1 (2 pts), boolean chains 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":"packages/core-js/modules/es.number.to-exponential.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"008650c7e1961fc44f447414bbb8bb14c6006fe314751567dddba831291e3558"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: error handling 6 (10 pts), if/else 8 (10 pts) (nesting depth added 6). Most of this is not in the body itself: 0 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch ((anonymous)::outerLoop::(anonymous), (anonymous)::innerLoop, (anonymous)::innerLoop::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.flat-map.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06b51213036ab5f3817e7b0e0126f44b407634a59f44ff6fe31ba2865cc3de9"}},{"ruleId":"D2","level":"warning","message":{"text":"array-includes.createMethod (cognitive 19): array-includes.createMethod has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 0 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 8). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-includes.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3920f7692a8df0ad4da45001750caa965cc1bb402ae8f0fd5f602981413794"}},{"ruleId":"D2","level":"warning","message":{"text":"es.typed-array.sort.getSortCompare (cognitive 19): es.typed-array.sort.getSortCompare has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 4, boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 0 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 52). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.typed-array.sort.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"406959e7fd00f241371d11b1a5f73d2bd6db51e2743402aee06f2e23d93fcc62"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericRangeIterator (cognitive 19): NumericRangeIterator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/numeric-range-iterator.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0fd25edb12260430720612cb8b8ef55246fd1474c07aff12afe66c5e8827be"}},{"ruleId":"D2","level":"warning","message":{"text":"array-reduce.createMethod (cognitive 18): array-reduce.createMethod has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 0 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 13). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-reduce.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1241891853b4698de66bdfe9ae3a99c079e7a4b78c089eb7b8ae6f42b4e118a7"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-json-string.default (cognitive 18): parse-json-string.default has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/parse-json-string.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0816c0f0ee1603d6723c0ffc69f57a30c3f0e0dc90884daaeb98d7859697e66c"}},{"ruleId":"D2","level":"warning","message":{"text":"isDisallowedCodePoint (cognitive 18): isDisallowedCodePoint has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ab1fc8a2e181429b13af516a392fc2e0934401f3c5916500fa7eb364978da0"}},{"ruleId":"D2","level":"warning","message":{"text":"replaceAll (cognitive 18): replaceAll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), boolean chains 1, 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":"packages/core-js/modules/es.string.replace-all.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17e0f4d220837a5c487d3c1c164e98452f7ee4b7ea343ce148aff59a78cbdc8"}},{"ruleId":"D2","level":"warning","message":{"text":"allSettledKeyed (cognitive 18): allSettledKeyed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function items inside it that branch ((anonymous)::(anonymous)::createElementResolver::(anonymous), (anonymous), (anonymous)::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.promise.all-settled-keyed.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48259ec72b388e9c6af59c8e0c726c86686ba0b61789b10ceae5fd4e8a91167"}},{"ruleId":"D2","level":"warning","message":{"text":"array-buffer-transfer.default (cognitive 17): array-buffer-transfer.default has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 2 (3 pts), loops 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":"packages/core-js/internals/array-buffer-transfer.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2138b07f65b690fa68d3bd4ce080a8173a507f78cbac91ea399b7b881b68da"}},{"ruleId":"D2","level":"warning","message":{"text":"get-substitution.default (cognitive 17): get-substitution.default has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (5 pts), match/switch 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 23). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/get-substitution.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"453782093b2f6b1f5f50485121d3c440c7143d35e733b9e2f9377909dc44aac8"}},{"ruleId":"D2","level":"warning","message":{"text":"numeric-range-iterator.$RangeIterator (cognitive 17): numeric-range-iterator.$RangeIterator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/numeric-range-iterator.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"305fd6d56acb456a946ffaa7b515de480657854a483cb4298a3adafbc06fc9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"defineProperty (cognitive 17): defineProperty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.symbol.constructor.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e63c7e0335c7e27ded988af1d6260088bdf0759eb623d33825628f958fdc6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 2 (3 pts), loops 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":"packages/core-js/internals/array-buffer-transfer.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b0503d4ed114d1d0c5094029523b51d45f8158b2fb2a842f9b6a2bce6eb95"}},{"ruleId":"D2","level":"warning","message":{"text":"slice (cognitive 17): slice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.slice.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0badf0df37738f0788f7f4abadd9bf74757bb501471e609c26f0fa491e97c0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"define-built-in.default (cognitive 16): define-built-in.default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 1 (2 pts), 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":"packages/core-js/internals/define-built-in.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a693fbf8bd56fd64dcbb8264ac08e5dd1c6118f22b6d63c09a60cb86de0599"}},{"ruleId":"D2","level":"warning","message":{"text":"getConstructor (cognitive 16): getConstructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 7 function items inside it that branch (get, delete, has, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/collection-weak.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f0ccc52cf2eb1457b0073d4d32a9c3c8e5769eb0047406a9ccf0e2deffc74"}},{"ruleId":"D2","level":"warning","message":{"text":"reduce (cognitive 16): reduce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 5). 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 ((anonymous)::loop::(anonymous), (anonymous)::loop, (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.reduce.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff68dc744e6a93a6db567d6d5d656719749cf76ca4ee00f08bad855a8d481d8"}},{"ruleId":"D2","level":"warning","message":{"text":"allKeyed (cognitive 16): allKeyed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 8). 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 literals inside it that branch (lines 38, 23, 30). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.promise.all-keyed.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76fe5a351e99c87b1a7ce744ae77ac9b906e59fd7ac1f84ab6fcb07daed9204"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: playground.init: FunctionTooLong \u2014 init runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/js/playground.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f27dc50b4253ec6c8d4b172500f9222f873310625c1442c77c3f7f148a2e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/web.url.constructor.js: FileTooLong \u2014 879 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 379 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"773904f7706ceb9d6477b35d5946c112bb2abc59fa89ad60d7f0e876480657a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.init: FunctionTooLong \u2014 init runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/js/main.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1fc6667e51c2980d08c3581c1cbf32873d4ce90f9a297514794060301b1998"}},{"ruleId":"D12","level":"warning","message":{"text":"Floating npm dependency: mkdirp: \u0060mkdirp\u0060 is declared as \u0060\u003E=0.5.6 \u003C1\u0060 in packages/core-js-builder/package.json, which names no releasable version: \u0060\u003E=0.5.6 \u003C1\u0060 is an open range with no upper bound on the major. A production dependency that cannot be resolved to one immutable release makes the build non-reproducible \u2014 two installs a day apart can ship different code \u2014 and leaves nothing for a vulnerability scanner to match against."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dd665cd8b7e6660dfa984ead3d2cfa4e48a8b1d1c9bc5301a80e86855420715e"}},{"ruleId":"D12","level":"warning","message":{"text":"Floating npm dependency: webpack: \u0060webpack\u0060 is declared as \u0060\u003E=4.47.0 \u003C5\u0060 in packages/core-js-builder/package.json, which names no releasable version: \u0060\u003E=4.47.0 \u003C5\u0060 is an open range with no upper bound on the major. A production dependency that cannot be resolved to one immutable release makes the build non-reproducible \u2014 two installs a day apart can ship different code \u2014 and leaves nothing for a vulnerability scanner to match against."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c116c20643eff2d2a89421d23c2433b12e07d94bd7120114cc2b08771f8f5dd8"}},{"ruleId":"D26","level":"note","message":{"text":"Split packages/core-js: A huge bundler/dependency project whose namespaces are all modules of the core JS API (internals, stable, es/instance, etc.) and whose types sit overwhelmingly in one cohesive namespace. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d1858b95b5fe7a54b4659576c75f5fcafeb7d6af24076f4280949824ca1675a6"}},{"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":"158d8d67d6377c8f458c0e066bef5406ebc9fdd267ff9eefec3f2eddb76e286f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e490bed7dcb0301b9abe0ae949e218f0f8c32b71ab22b60e9dc261c429104be9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94ec2ea016ab6d35a393c2ffe138833ecf81800fcfb7e6806f17d0c94e550a79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"315c38f41067c8e24a845a7d9f315ce1e81b2e87cb4ac178a4e9633aed9298d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9e7ab55dc6ebab9c3898fa77744406cb00a6f8f9240e30bdc8b7077728d1f1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eea30643c240c792248b979c24e54920ce096519398d4411005aa7d0fffd9e45"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68e6be7d90ab377dc74ac20996dd7e699ad4b88d263546ca6912259392bb9b0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87528f4683c127e7da288dd00055dcc7057539c9b11eacc095771f508caca880"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccc959241b5a30b9aa1b96cd4a313c5ab613909e6800090c956279f445b929ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a22e263840aa842392ca0e1147fc7f55180c5a493c399a4840494ba8082b00f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0e6913e78e204c35f297586eea1759e25e3d25ad91519f967d2539ba1578996"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5843f6edaeb18792f891b2b6ef5428db3cf77ce5fa90186b3f212b9dc8adc60d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01245399797954b2b4300457344855c8e0ddec0372c556cbff63bfccfbdcc541"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c094401469bd0358424bc6178c266ea31ba585e90ae6b0b834fa068040149ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3153c568b3274d76be1c4235d4206f7fb168dd071a572716d09939e76a5e5b56"},"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"}}]},{"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":"7649f0316d9df72f7a16ea158bc9bec43c52b6ed1421dfdc71f56136ea3b16ca"},"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"}}]},{"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":"039cbbf1d2c9dc4a5db3825174de49aa951de7e780fda51274a8af93d01cb516"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a139aab4df2ce5db365413f0eab36a81fc0f0d26beaffe43c0765482514a6bc"},"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"}}]},{"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":"53067ef47a251ba60ab61764de2efefceed0fde8b8872fef90e597dc2c9de92c"},"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"}}]},{"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":"d1ab1f3087151a0151d2975c220d03086622e0c66d7ba0123a86bd4eee7ff84d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dab0bb8284787ea3bf01315107d62fcc588f52eba769d096341337a3f9471eee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"560e40d285b00020e612052af5cac0267ddce584376f1746dc3172739fb29813"},"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"}}]},{"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":"7007c9eebf718cf5b749715f65a9d3960930ea96c3e5f20d528c9338afe365b7"},"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"}}]},{"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":"511265b28271d56887a1abde09d75569bb6fa1b3e6e07c0c942e84e8b042b29e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09fff2edeef9175daac1a93e82f1534633ab0a0cee274c1760d2266b359b0a1c"},"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"}}]},{"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":"e85a47865e641a286fcb808ccd1dbe16fd7cb157e4b7bafa29bf772a3883fe20"},"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"}}]},{"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":"aed1dccd98fe84d6dde44de079a07fd0569d11e6267ed55b9f0549c3ddbfb813"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c49acde5db25c80072c8407af9dd8dbbf11e0b335d3908ff115c52807d1f8f5"},"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"}}]},{"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":"d40a6aed071e440400b5cac91f1daabcd8ef0b73cc9dd7929a3590347ce50d73"},"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"}}]},{"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":"5d59dbf828fe03bd18ffd9d6b8d782dfeccd43346372d0d4a3a839b14b953ff2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45a1cbb7bd542d9c0c2f4679b3c3f835e6925015a7af957ee8d7ca48d49d6be5"},"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"}}]},{"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":"379ed9529db2511d03df9b70f7c570526bd00de55c52f195c78dab4cd772114d"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f63089aa143b2530222e22c4b2f0e3b9185b1d4742833dd48487e4ac7a4f6895"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0ea6f962d98a5a3edb99f9682067b26b981b10fd8217c3829771ad1641bd2d26"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96b0acd85b86d2ec31835173b11a4b9f7359a47be1d1110bdcf34b3fb2b87ef5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ddfbd6eb25ca803491c7f957ec3f9531e10025fdd0b18fc570c5c84f3679806"},"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"}}]},{"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":"f7e291ae165b205806480ecfbb873f76b5a22b240125efff80e850034cc71ce9"},"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"}}]},{"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":"896f4dcdd73e01a26a7161922867f1dda6c578306ae4afc252e6a3165004798d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a887b0fdd1a2dc1cfa12bad2c616d0518a1e6eb94a466eb515b4456ceb0c4cc"},"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"}}]},{"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":"ae9a7659cb0636370997e9aa128cf1c54a086d6ab00c70053027b4c6e8cb77fc"},"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"}}]},{"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":"a593ee616db3fd28c5256f553f15ee53434f66ece95825c49f600eb4e0e1cc4d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24dac5ea0f8062a5a25b9270389212cee04aceb0bfc4fa0b8d6efbecf4032549"},"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"}}]},{"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":"a04062143e75b1937be549c4365d328755a10cf760bc3b80546b53e43e371a6f"},"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"}}]},{"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":"a440876c43ddc311a9dd0cc901ba945d106d6a54837e36333cb4462d3083c106"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffcb8728d7045ee1e1623d9933602314cafcb7e912367fc0aa861e56cc8a62f2"},"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"}}]},{"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":"e3f3045eee9daf6654dcd7b5abdb4c94898cd7f2890903da1bfcb57fe9a82d43"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1d1ee58da2f9423e4403f4c670b556d263aa7e2af1e6851d2955dc9da9db9a1b"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"594ba20856faebb900e8f635978e37e019356a968254d953432a089b831a6265"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a02061a85b317c44abbb431933da8bd61c6f33417c729cd0eade79448b4127e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a6d49203805cdb679d421a8043ac39e7b032144f8312d45a17e6946daaafca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6d03968fc85e3b70aa38629b34d3aebc97a4ca68581403e212296887a8fccb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d20d5484e3d8277d58c5e682057bd6b1904f0e084c9ee1d8b57c31e441c0f02f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54641d69f9fd310e1e6e109eb8c8c7bbf100e9cca02deb9ddcf89f516439975c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4b84274ded7e6b21af20f24c3c1abbd7c2623cc940e96b12bd49088aeb7e024"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e73750243298fbca474523806f671234613c12d5396318495711aaefac9d44b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e8a38a547fbcb36d40d6b636f424331ac3f99faa67fed9e3f9e36364c737971"},"properties":{"dependency":{"package":"braces","version":"2.3.2","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":"598353545fc9667ded02e77e915b22f37544d4c9ffc919a86fe64e095b8cac05"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.18","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":"87839f7289af0999d94a99db6eefa4a0c9cb8f6ea36e8599abd5bd35ced532c8"},"properties":{"dependency":{"package":"serialize-javascript","version":"4.0.0","advisory":"[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":"82ff8cfb7d777eeee1cd9352fbb505b09f68adf4548c033e1348fd45932882eb"},"properties":{"dependency":{"package":"micromatch","version":"3.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"844ee9e41fa9ce4fe620c46bcd8caf24250b0825270972aba151cf6ffecb8920"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"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":"eb5055b3709072c66d00624be2b6e901d3e4f1bc2f0978ff3fe5e49d1c0155eb"},"properties":{"dependency":{"package":"elliptic","version":"6.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data.mjs \u2194 index.js: \u0060packages/core-js-compat/src/data.mjs\u0060 (context core-js-compat) and \u0060packages/core-js/web/index.js\u0060 (context core-js) sit in DIFFERENT parts of the tree yet change together 67% of the time (10 of the 15 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00606dd0aa78\u0060 add \u0060URL.parse\u0060; \u0060a6a0e29e\u0060 add \u0060value\u0060 argument of \u0060URLSearchParams.prototype.{ has, delete }\u0060; \u006032fcbab6\u0060 add \u0060URL.canParse\u0060 method \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/src/data.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d12151e27168b73bea56932146427655e8eb207e4baf2c8231f5bb273895d80"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: modules-by-versions.mjs \u2194 index.js: \u0060packages/core-js-compat/src/modules-by-versions.mjs\u0060 (context core-js-compat) and \u0060packages/core-js/web/index.js\u0060 (context core-js) sit in DIFFERENT parts of the tree yet change together 67% of the time (10 of the 15 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00606dd0aa78\u0060 add \u0060URL.parse\u0060; \u0060a6a0e29e\u0060 add \u0060value\u0060 argument of \u0060URLSearchParams.prototype.{ has, delete }\u0060; \u006032fcbab6\u0060 add \u0060URL.canParse\u0060 method \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-compat/src/modules-by-versions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4defa570baff2cbf79c7557e1c7b5499b895628d02d6b327c7702154895f771c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: export.js \u2194 export.js: \u0060packages/core-js-pure/override/internals/export.js\u0060 (context core-js-pure) and \u0060packages/core-js/internals/export.js\u0060 (context core-js) sit in DIFFERENT parts of the tree yet change together 61% of the time (14 of the 23 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u006082ab7962\u0060 minor fix of prototype methods export logic in the pure version; \u00604d45cfab\u0060 rename \u0060noTargetGet\u0060 -\u003E \u0060dontCallGetSet\u0060 option; \u0060ef0aac76\u0060 improve polyfilled functions \u0060.name\u0060 and \u0060.toString()\u0060 in many differ\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03abad09aa6833650172ac9fe1b7d5ce5aa4e4b2ff7d15cabf6873ce2609c949"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: es.string.match.js \u2192 es.string.replace.js, es.string.search.js, es.string.split.js: \u0060packages/core-js/modules/es.string.match.js\u0060 changes together with 3 other files \u2014 \u0060packages/core-js/modules/es.string.replace.js\u0060, \u0060packages/core-js/modules/es.string.search.js\u0060, \u0060packages/core-js/modules/es.string.split.js\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.match.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcbc4bf1b67b6c3c47492dfa407b7d5fd5952db4bc913102631233d2d669063"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.string.search.js \u2194 es.string.split.js: \u0060packages/core-js/modules/es.string.search.js\u0060 and \u0060packages/core-js/modules/es.string.split.js\u0060 change together 94% of the time (16 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 16 shared commits counted here, the most recent 3 are \u0060f99ddfa6\u0060 Don\u0027t call well-known Symbol methods for RegExp on primitive values (\u2026; \u0060ae1c6609\u0060 consider \u0060document.all\u0060 as an object in some missed cases; \u00601ca8fb72\u0060 some simplification \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.search.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e98402a8413ef963948e340e75c1a5d0d4e6fa931f4e9927c196270da76b9b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.string.replace.js \u2194 es.string.search.js: \u0060packages/core-js/modules/es.string.replace.js\u0060 and \u0060packages/core-js/modules/es.string.search.js\u0060 change together 94% of the time (16 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 16 shared commits counted here, the most recent 3 are \u0060f99ddfa6\u0060 Don\u0027t call well-known Symbol methods for RegExp on primitive values (\u2026; \u0060ae1c6609\u0060 consider \u0060document.all\u0060 as an object in some missed cases; \u00601ca8fb72\u0060 some simplification \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.replace.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6557c5fd8d94d1d3fa36891c46e94dfa25cb166f1b6092c7fb787da958c7818"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: esnext.async-disposable-stack.constructor.js \u2194 esnext.disposable-stack.constructor.js: \u0060packages/core-js/modules/esnext.async-disposable-stack.constructor.js\u0060 and \u0060packages/core-js/modules/esnext.disposable-stack.constructor.js\u0060 change together 91% of the time (10 of the 11 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). Neither file is a module \u2014 they declare no import/export and are loaded together into one shared scope by a script tag or a bundle \u2014 so there is no dependency edge that COULD be declared between them, and this pass cannot tell a real relationship from a coincidence of release. Read the pair before acting: if one defines what the other uses through the shared global, that is the coupling, and making it explicit (a module boundary, or one named object they both go through) is what removes it; if they duplicate structure, extract the common part; if neither holds, the co-change is incidental and there is nothing to do. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00605b69af04\u0060 use \u0060null\u0060 instead of \u0060undefined\u0060 as an empty placeholder in some cases; \u0060d1fd92bb\u0060 use \u0060undefined\u0060 insted of \u0060null\u0060 for cleaning internal \u0060(Async)Dispos\u2026; \u0060096cb451\u0060 move validation of pending stacks to helper \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-disposable-stack.constructor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322897e9ca3f826b95b398fd9368b28e42d06fe1bf318635c21336e83bd0c296"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.string.ends-with.js \u2194 es.string.starts-with.js: \u0060packages/core-js/modules/es.string.ends-with.js\u0060 and \u0060packages/core-js/modules/es.string.starts-with.js\u0060 change together 88% of the time (14 of the 16 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 14 shared commits counted here, the most recent 3 are \u00606d687424\u0060 drop fallbacks to native buggy \u0060endsWith\u0060 / \u0060startsWith\u0060 as useless -\u2026; \u00603bcbad2d\u0060 avoid a check of the target in the internal \u0060function-uncurry-this\u0060 h\u2026; \u00600400deaa\u0060 some stylistic changes and minor fixes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.ends-with.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1b7dd72d5da614e729ef8abfd2f912b91ee909f9edd06072f94b2fb55cc641"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: get-iterator-method.js \u2194 is-iterable.js: \u0060packages/core-js/internals/get-iterator-method.js\u0060 and \u0060packages/core-js/internals/is-iterable.js\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060508e6d7e\u0060 some get-iterator fixes; \u0060ae1c6609\u0060 consider \u0060document.all\u0060 as an object in some missed cases; \u00605c9f9559\u0060 remove special cases for native prototypes from iterator helpers, rev\u2026 (at that commit the files were still \u0060modules/core.get-iterator-method.js\u0060 and \u0060modules/core.is-iterable.js\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/get-iterator-method.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c6c6cfb882bc1a1b18adf32cd0603dd58b64ed9f8e44709e80d9d2d69a6027"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.array.sort.js \u2194 es.typed-array.sort.js: \u0060packages/core-js/modules/es.array.sort.js\u0060 and \u0060packages/core-js/modules/es.typed-array.sort.js\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006013d56107\u0060 align default sort comparators with the spec text; \u00600400deaa\u0060 some stylistic changes and minor fixes; \u0060d07fee6d\u0060 reuse \u0060internals/array-sort\u0060 in \u0060URLSearchParams\u0060, simplify it \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.sort.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfadf3e8d13f0de729dcae617cfea27673332ba2cbe4a1c1741167ba7cfa2521"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.array.concat.js \u2194 es.array.splice.js: \u0060packages/core-js/modules/es.array.concat.js\u0060 and \u0060packages/core-js/modules/es.array.splice.js\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00605454a5d2\u0060 add some more workarounds for a Safari \u003C 13 bug with silent ignore of\u2026; \u0060c04e4e15\u0060 fix a helper name; \u0060373e276b\u0060 extract \u0060doesNonExceededSafeInteger\u0060 helper \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.concat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60280c006c2f37e4d92f537f00e406b1b6e09e539c6d39f477bc3b6bf15d34a5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.array.slice.js \u2194 es.array.splice.js: \u0060packages/core-js/modules/es.array.slice.js\u0060 and \u0060packages/core-js/modules/es.array.splice.js\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00605454a5d2\u0060 add some more workarounds for a Safari \u003C 13 bug with silent ignore of\u2026; \u0060405b93e7\u0060 update per the current spec draft; \u0060f793cc3a\u0060 add \u0022change Array by copy\u0022 stage 0 proposal \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.slice.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18554d53125a23d1cf6ce4731b25fb474fecaf785dd6a8a1a50cb94472456716"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.regexp.to-string.js \u2194 es.string.match-all.js: \u0060packages/core-js/modules/es.regexp.to-string.js\u0060 and \u0060packages/core-js/modules/es.string.match-all.js\u0060 change together 55% of the time (6 of the 11 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 6 shared commits counted here, the most recent 3 are \u006093aee471\u0060 refactoring; \u00604b764e90\u0060 Refactoring; \u00600cdb1245\u0060 Use regexp flags via helper \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.to-string.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb405ee97ca0030a0a19b810ab2b5d93a1f7978edcc1a6801fa3c4c6419196c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.string.replace-all.js \u2194 es.string.replace.js: \u0060packages/core-js/modules/es.string.replace-all.js\u0060 and \u0060packages/core-js/modules/es.string.replace.js\u0060 change together 50% of the time (7 of the 14 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 7 shared commits counted here, the most recent 3 are \u006093aee471\u0060 refactoring; \u00604b764e90\u0060 Refactoring; \u0060f99ddfa6\u0060 Don\u0027t call well-known Symbol methods for RegExp on primitive values (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.replace-all.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bcc6fc6c52e1bb016619a8506a9fadb1197dbc8b112ea7854f7b39dc0f5102"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: es.string.match-all.js \u2194 es.string.replace-all.js: \u0060packages/core-js/modules/es.string.match-all.js\u0060 and \u0060packages/core-js/modules/es.string.replace-all.js\u0060 change together 50% of the time (7 of the 14 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 7 shared commits counted here, the most recent 3 are \u006093aee471\u0060 refactoring; \u00604b764e90\u0060 Refactoring; \u00600cdb1245\u0060 Use regexp flags via helper \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.match-all.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7a0e01c0f1befae77c0f5b56141f1347174688d6931da823df7973580c0d14"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: array-buffer.js \u2194 object-get-own-property-names-external.js: \u0060packages/core-js/internals/array-buffer.js\u0060 and \u0060packages/core-js/internals/object-get-own-property-names-external.js\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060ff68fa63\u0060 drop \u0060array-slice-simple\u0060 since in all current cases of usage it can\u0027\u2026; \u00607f6670ff\u0060 prevent some theoretical cases of breaking / observing the internal s\u2026; \u0060584b0064\u0060 some cases related to \u0060Array#slice\u0060, \u0060.apply\u0060 and \u0060arguments\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-buffer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796b5f30c794b8ec98e80dc79e159eae962295370d3a8a58d6f33cb1a1da1b2"}},{"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"}},{"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"}},{"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"}},{"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"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an a11y linter that can read your UI \u2014 no component framework was detected, so the JSX/Vue ESLint plugins would have nothing to lint; use an HTML-template a11y linter (html-eslint, htmlhint) or run axe/pa11y over the rendered pages) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 3 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"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 11259 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 2 typed \u00B7 4124 plain JS \u2014 the untyped files are packages/core-js-builder/config.js, packages/core-js-builder/index.js, packages/core-js-compat/compat.js, packages/core-js-compat/get-modules-list-for-target-version.js, packages/core-js-compat/helpers.js, packages/core-js-compat/index.js (\u002B4118 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (27 clone groups): 27 duplicated blocks under packages/core-js/ have copies in at least two of the sibling directories actual, es, full, internals, modules \u2014 10 of them are reported below, and 17 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 27 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 27 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 27 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-map.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f215498b81a2bbcd2c691f31550dc368deeb35be1cb1329dcbc8b0e53121fd6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (78 matched lines \u00D7 2 locations): packages/core-js/modules/es.async-disposable-stack.constructor.js:17 \u00B7 packages/core-js/modules/es.disposable-stack.constructor.js:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 496 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.async-disposable-stack.constructor.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df1f1e37f939484a6b18166411bbea81ada8f94e1fdbede0968641da1c9e453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): packages/core-js/modules/es.iterator.drop.js:14 \u00B7 packages/core-js/modules/es.iterator.take.js:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 239 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.drop.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a0bbc47b66efe33bbbdd50b57a80eeeb429a2a758283e813646b106ea71672"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): packages/core-js/modules/esnext.promise.all-keyed.js:12 \u00B7 packages/core-js/modules/esnext.promise.all-settled-keyed.js:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 285 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.promise.all-keyed.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"454cf3c7dcd55cab7d2f44dbf4e08c0f64dcc24d665c7750b6ab950de28ee443"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/core-js/modules/esnext.async-iterator.filter.js:12 \u00B7 packages/core-js/modules/esnext.async-iterator.flat-map.js:13 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.filter.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"289485fa6c812b12b3fabc6aeff588a773f591d6a2b2cb0ddfc636573efa00e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): packages/core-js/modules/es.iterator.filter.js:14 \u00B7 packages/core-js/modules/es.iterator.map.js:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 154 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.filter.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d3583d429e62e5bd76ff43ac5b868a57633e930916425f69ac7956ac6ea09b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/core-js/internals/async-iterator-map.js:26 \u00B7 packages/core-js/modules/esnext.async-iterator.filter.js:28 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-map.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a9cbea51f44e9a33f7f76e6ebaab087b88f63297429c968701bf1d0c0972e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/core-js/internals/async-iterator-iteration.js:24 \u00B7 packages/core-js/modules/esnext.async-iterator.reduce.js:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-iterator-iteration.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e7c3a0ff99fdeb9d808e3770fdb33daea539a086a3f49f3d8a2467d3cf6598"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/core-js/modules/es.promise.all-settled.js:12 \u00B7 packages/core-js/modules/es.promise.all.js:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.promise.all-settled.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc715c389d8c41bdf3005399401691e8d692e2753b061ce344160a2980fb15f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): packages/core-js/modules/es.iterator.every.js:16 \u00B7 packages/core-js/modules/es.iterator.find.js:16 \u00B7 packages/core-js/modules/es.iterator.for-each.js:16 \u00B7 packages/core-js/modules/es.iterator.some.js:16 \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":"packages/core-js/modules/es.iterator.every.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea91291eeb9f68cb496386901eca5c335e19be5a00c61f3e8237ee8ae1fe3c18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/core-js/modules/es.iterator.find.js:16 \u00B7 packages/core-js/modules/es.iterator.some.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":"packages/core-js/modules/es.iterator.find.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8997f4a6d19b2fc0bb1547b5c6f6493ddda6855b6bd39d8955318c306009bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/core-js/modules/esnext.map.reduce.js:12 \u00B7 packages/core-js/modules/esnext.set.reduce.js:12 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.map.reduce.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0476cdf3ae1eba3e4298c0920ac88b51ea9a15a1226e5bcd2705b1f668dfc38e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/core-js/modules/web.atob.js:16 \u00B7 packages/core-js/modules/web.btoa.js:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.atob.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb46a1cc74bcc9c1411943cf1a4dd5dec2ab90ad602717f29dfae81ee79a420"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): packages/core-js/internals/string-cooked.js:7 \u00B7 packages/core-js/modules/es.string.raw.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/string-cooked.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21f84bf1e6fe5945deb7b00b766cd3b8d692868dcaf9e1e5a0e24a91cd2cd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/core-js/modules/es.array.push.js:11 \u00B7 packages/core-js/modules/es.array.unshift.js:10 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.push.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec572355abdca67944654836dc72e5456d3532a83087e28f9be5ad1abfd0f09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/core-js/modules/es.regexp.dot-all.js:8 \u00B7 packages/core-js/modules/es.regexp.sticky.js:8 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.dot-all.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4095ab0abe477c9c9d935d2d9ddf94a6819cef6563d0baef71e60d6762f517d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/core-js/modules/esnext.map.emplace.js:13 \u00B7 packages/core-js/modules/esnext.weak-map.emplace.js:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.map.emplace.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3690a9b82fade15d1a95437f0d516a170a122a652dd882ca0196fc9e0e27e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/core-js/modules/es.array.with.js:15 \u00B7 packages/core-js/modules/es.typed-array.with.js:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.with.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2f5c86a100f3e27715948c035cefc3fb085bc51ef14e0343e80bb82984ca77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/core-js/modules/es.regexp.constructor.js:53 \u00B7 packages/core-js/modules/es.regexp.constructor.js:77 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cda35ecd28f939b3fc96fb6508d270c3e184928edfc11d7fb3be5d708742889"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/core-js/modules/es.string.ends-with.js:12 \u00B7 packages/core-js/modules/es.string.starts-with.js:12 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.string.ends-with.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"14096a7b81bad62d921077666375ef493344a09bf90ce40d34ca3a4e0d1df540"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/core-js/modules/esnext.async-iterator.filter.js:40 \u00B7 packages/core-js/modules/esnext.async-iterator.reduce.js:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.filter.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bafb8668c0a59dc85cd3b0599679a07a6a14b10bc4b85094faa61c36c40af0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/core-js/modules/esnext.observable.constructor.js:88 \u00B7 packages/core-js/modules/esnext.observable.constructor.js:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.observable.constructor.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d485bb492b365e03915e9b8879196a9e926fa8d710cefaa2d2c0962b2370e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/core-js/internals/async-iterator-map.js:11 \u00B7 packages/core-js/modules/esnext.async-iterator.filter.js:12 \u00B7 packages/core-js/modules/esnext.async-iterator.flat-map.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":"packages/core-js/internals/async-iterator-map.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"920aff5d81fbdefcec00e149cab2eff3a0e35edef1b2249b4af81b6d0c2ed598"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/core-js/modules/es.iterator.filter.js:32 \u00B7 packages/core-js/modules/es.iterator.flat-map.js:53 \u00B7 packages/core-js/modules/es.iterator.map.js:25 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.filter.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"179721d16ac462903ddc5b0a8a0b5a56ca98f528dd65a10321a18a3fec18969e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/core-js/modules/esnext.async-iterator.drop.js:36 \u00B7 packages/core-js/modules/esnext.async-iterator.take.js:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.async-iterator.drop.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73696045e303d430d7f4e03bf741df8069ac3867108463d2cf390238f5e354b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/core-js/internals/async-from-sync-iterator.js:48 \u00B7 packages/core-js/internals/async-from-sync-iterator.js:60 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/async-from-sync-iterator.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"131e714c2b85405298cc80947cdab6fc3a6a34522803215fec23d4e65635d781"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/core-js/modules/es.array.splice.js:28 \u00B7 packages/core-js/modules/es.array.to-spliced.js:24 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.array.splice.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"271ded16444d191a3d0b4080ade6407096dee17f4117b5e8e8c3b336b41b89e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/core-js/modules/es.iterator.zip-keyed.js:16 \u00B7 packages/core-js/modules/es.iterator.zip.js:15 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.iterator.zip-keyed.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae09a19b6307903b2edbcedb7c2bed238bd5e120d62dd3179e3118e643b79ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/core-js/modules/esnext.math.imulh.js:8 \u00B7 packages/core-js/modules/esnext.math.umulh.js:8 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/esnext.math.imulh.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1623a86c33ad5f84712b8b70c7e508dbbbc4a9312231c30826b99e6f5adbfc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/core-js/modules/es.map.get-or-insert-computed.js:13 \u00B7 packages/core-js/modules/es.weak-map.get-or-insert-computed.js:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.map.get-or-insert-computed.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7429c05e7d05ea11d03b453913cb723fdeeded5a5d231c4a06d0aae383cf799a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/core-js/modules/es.map.get-or-insert.js:6 \u00B7 packages/core-js/modules/es.weak-map.get-or-insert.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":"packages/core-js/modules/es.map.get-or-insert.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ede46f892f1cda51d2ed35f55a646d1f94b7eed4eda0bb5a310cc01a510939"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/core-js/modules/es.promise.any.js:11 \u00B7 packages/core-js/modules/es.promise.race.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.promise.any.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8b9e002d50b88cb4b5455dc729a4db5c09dc0566f333ce0b0dd5344709c3e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/core-js/modules/es.uint8-array.from-base64.js:5 \u00B7 packages/core-js/modules/es.uint8-array.to-base64.js:17 \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":"packages/core-js/modules/es.uint8-array.from-base64.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f9c9d633ed792b07cdc110e31981651bfe914666c49e7d59d40561ff1e6c9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/core-js/modules/es.uint8-array.to-base64.js:20 \u00B7 packages/core-js/modules/es.uint8-array.to-hex.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.uint8-array.to-base64.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb1679026c5208ea20ab09df2876bb71f9c24f7e0773c28512bd374a101eaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/core-js/modules/web.url.can-parse.js:26 \u00B7 packages/core-js/modules/web.url.parse.js:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.can-parse.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a40b350f50c29c9e183296d4abeb3ffc3b379cd032b34bd6676d82a1fa9f15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/core-js/modules/web.url.constructor.js:1021 \u00B7 packages/core-js/modules/web.url.constructor.js:1041 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ff7170cd46ffd2f8196dae4a4fe141ef770c5318d6d6dd82c0edb1110ab1a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/core-js/stable/instance/entries.js:8 \u00B7 packages/core-js/stable/instance/for-each.js:8 \u00B7 packages/core-js/stable/instance/keys.js:8 \u00B7 packages/core-js/stable/instance/values.js:8 \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":"packages/core-js/stable/instance/entries.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e31068505a2587616a25ab1969923606c90c39f8c439f018242c6b956a6b9e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/core-js/internals/array-iteration-from-last.js:5 \u00B7 packages/core-js/internals/array-iteration.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/array-iteration-from-last.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6212eb4559abcdf2133dbbd6e983cac4a46cda89afc8cb0642c9b2ce3689601c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/core-js/internals/set-is-disjoint-from.js:12 \u00B7 packages/core-js/internals/set-is-superset-of.js:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/set-is-disjoint-from.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c7615f52d42f9258f500acbbb63e304d5b7150dc5fbbb44700cd1007a76606"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/core-js/modules/es.array.find-index.js:6 \u00B7 packages/core-js/modules/es.array.find.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":"packages/core-js/modules/es.array.find-index.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5c5d84507a0e5d578ec042247987f3f86b02eb0a7c47503ac8c3e680991cbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 196, cognitive 364): parse has cyclomatic complexity 196 and cognitive complexity 364; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d1932d8f58c77b47cb4df5595ba2dc4c1dd653bba986cb1bb8df501c7d732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredCloneInternal (cyclomatic 98, cognitive 86): structuredCloneInternal has cyclomatic complexity 98 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56200db2e7b1e3bd526a7ebb3c2246fa05cdbcef21c2d61fed362d99bd39426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sumPrecise (cyclomatic 40, cognitive 60): sumPrecise has cyclomatic complexity 40 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.math.sum-precise.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc06467ea689d79088cbde67d5d1db8368cb949191e6f92024c1b71271105f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 36, cognitive 48): exports has cyclomatic complexity 36 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js-pure/override/internals/export.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3952c333ed5b1b992a2bf2a930cd809e337fbe18b110faeb47ce17f9f5db5e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 36, cognitive 39): run has cyclomatic complexity 36 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":"tests/unit-global/es.string.split.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8a6c067c31dad1e9f514378d1c1170ce084f208a5f517099db4ae8241dedaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 33, cognitive 46): exports has cyclomatic complexity 33 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/iterator-define.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a617ff34fbeaf88535657ae4feb576b58eeb98a9034471c0188609f7cd204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 31, cognitive 82): exports has cyclomatic complexity 31 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/uint8-from-base64.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c512fe266e0ae8de9417a0913e371c2efffe15afa9c22c48dc8913a969606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIPv6 (cyclomatic 31, cognitive 74): parseIPv6 has cyclomatic complexity 31 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4995ac1beae625b01bbaed196faaad0ea7944e3535e58d80c1e2ae9d4b83d97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RegExp (cyclomatic 30, cognitive 33): RegExp has cyclomatic complexity 30 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.regexp.constructor.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4cfe972cda68e450888897a6ac19eba164857ac0c660f7a12b1d57b8ca3c1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 28, cognitive 29): exec has cyclomatic complexity 28 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/regexp-exec.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c9b47e518949cdf997d1eab25a1b63d64131d996d3dbe8f8009daf2028c107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 27, cognitive 82): decode has cyclomatic complexity 27 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/url-percent-coding.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"042fac6b49549b9109de5f16a12db6bb39f647040a18050db196b2b06f17d0f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryToTransfer (cyclomatic 26, cognitive 34): tryToTransfer has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.structured-clone.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca0c6a696791539cdacbcf99e11f9f25006f85ad9bd15fea55735f921db7a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 26, cognitive 31): exports has cyclomatic complexity 26 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":"packages/core-js/internals/string-parse.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"835311cbb77abe9f33b2a606cf60abb91b4771f8d1ee8463c62f9084e3f1f42c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) has cyclomatic complexity 25 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":"tests/unit-global/web.structured-clone.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7547a6d71cf9e1c55d1945de86013a912a1fc8b42702dd6d06ca6616aabd97f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) has cyclomatic complexity 25 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":"tests/unit-pure/web.structured-clone.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"50907da349b2dc006292d9ea9ba20700704fd21a7336d1404a7122c6e4228269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 22, cognitive 24): exports has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/make-built-in.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a2410bbfe2405ab736cdccb7d9ef9d9de617b0ce8b5537202e347e5d22b5c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 36): (anonymous) has cyclomatic complexity 21 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":"packages/core-js/modules/es.string.split.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d86b77857ad2afb8afbfa535cdd609531c1d6ca2224cde84d3b7b4f53927656"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NumericRangeIterator (cyclomatic 21, cognitive 19): NumericRangeIterator has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/numeric-range-iterator.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"df87fcb517f9cadfa74b4a0d93561864e88326b7601f99a65a2163e959000f19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 20, cognitive 31): exports has cyclomatic complexity 20 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":"packages/core-js/internals/iterate.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3437fcb2103f66e2d42eb440c9669c2db923e2237725a6062f31f19bf688e4fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDisallowedCodePoint (cyclomatic 20, cognitive 18): isDisallowedCodePoint has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/web.url.constructor.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaebc07ad92b93c2a582dc9967cea9e8893680fe2da0ed4d7fe2f42057dfa66"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-compat/data.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9fefa7f9290027db706f675df3251e69d48bd4b3c09318e9cb6789d79c55ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/usage/usage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa428c9ed682e242d671c943c0208b0e41937f3a8e1a506c423f0404f790986"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e7e7b50d85e9c6eb2371e528793c9a52dfddda4186dc4840247a5c5e24bb13"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bundle-package/bundle-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d345409858881e694491003ddf0c75c261a45355466e8657af00039a26c4d1bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-dependencies/check-dependencies.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526ab2856c2d4600a93f62f7430a0c00105bf65be49c1cf81ce556128871ec98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-compat-data-mapping.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682b0cdc8dbefd4c2369ff8ae48db61f3b926b40a08fa3e36b92270ed3ff44b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/clean-and-copy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67efdaa38a3b330b2eaa718fa7903f2b91d814e8face6febadf508bde93422"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-unused-modules.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef0a757311fd8ef8f2e9a7df2e1077ef94b09ff26113d6ac6fd04f85bf07708"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/downloads-by-versions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ade640e0eb68e94247e64402072565ae04f8c311e10fa3872ab7dcee4f1826"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-compat/entries.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"414b64bc80dba9f6a90307668dad2652fc6a5560b97ce74167644ab1c0a782c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/zxi.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60ea5bfc68401af97dc82b3f5c5b5a2396ec940185990780162f2150d43df1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare-monorepo.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0618aaf5241aef5a3e6c24c545b662deb77bd8e9a6324b267a388b2c646ff9bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-indexes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f198887e9da2ae50dafe9f6672fe325c0d121d3661a02033ceed50172d9dbcaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-compat/modules-by-versions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a931b1bd2d919e8c80de058b7dd71e6d5dcdd0e77f69d115656b07049e09020"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-compat/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69353fcce7fd7ae8c3355f064c1c4cb0a8d21ef4f73b2e4fc0c1d59429290ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-actions/check-actions.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddee569bbafbf13e6867f334524ac9a7d955ab7a137cd8b97e29dde4e1c142d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/prepare.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fd9001b471e867e28c80c236a9cdefcaaa91ad441ca435274f00a6e22b648c"}},{"ruleId":"R6","level":"warning","message":{"text":"No typecheck script: test \u2713 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"912edc7f1fd20bf80ef68c3293e3048565115e48707dc5f9d492201598794658"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027actions-up\u0027: Declared in scripts/check-actions/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":"8aba3ee0e9da9691b2f3ed35ebebd2530d392635068c35077a1dfc4c48b22bbf"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027updates\u0027: Declared in scripts/check-dependencies/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":"1f7170d41e3553a83ac3fb1077d91baad742c4caed89edf198a3a7c7a2f2daa7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027moon-unit\u0027: Declared in tests/observables/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":"e39d8ec38bfa8b889f4bc1ea948168e4f0511aaab562fe24c27eaec703ebc00b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ARRAY_BUFFER_NON_EXTENSIBLE \u0026\u0026 classof(it) === \u0027ArrayBuffer\u0027\u0060 appears character-identically in 3 files \u2014 packages/core-js/internals/object-is-extensible.js, packages/core-js/modules/es.object.is-frozen.js, packages/core-js/modules/es.object.is-sealed.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":"packages/core-js/internals/object-is-extensible.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59627040ec99fa26402db653f6318790a065e3ba13ef81215fd94fa8ecf73f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it === ArrayPrototype || (isPrototypeOf(ArrayPrototype, it) \u0026\u0026 own === ArrayPrototype[\u0027with\u0027])\u0060 appears character-identically in 2 files \u2014 packages/core-js/actual/instance/with.js, packages/core-js/es/instance/with.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":"packages/core-js/actual/instance/with.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbf7ae1f463ed2299aae07f6feba1a6910d6a9c26994b18a4738948cabfca1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof it == \u0027string\u0027 || it === StringPrototype || (isPrototypeOf(StringPrototype, it) \u0026\u0026 own === StringPrototype.at)\u0060 appears character-identically in 2 files \u2014 packages/core-js/es/instance/at.js, packages/core-js/full/instance/at.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":"packages/core-js/es/instance/at.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a784b6d7bf5a1f4f64f5c623391640ab79574f0eab16c6d16b8187a6b098d4e9"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/build.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"930ac110954b310e2530b2c10460cd9c8313283bfb5264c0562c42e38c523106"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060default\u0060 swallows every exception into \u0060return \u0027Object\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/try-to-string.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e846f73b5aa62f526267e361543232fa1448edb31076431f0af4aa4a20a2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060default\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/internals/set-method-accept-set-like.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb42eeeb33d23f5b8b3be9c43c55216e8b331a151c8d30ecb9b8b723652f80e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060$set\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/core-js/modules/es.reflect.set.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b1fc2f134a17fbbfcddda2a3619a58870599c2e10a1e21555a70b9b8e04c1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createSetMethodTest\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compat/tests.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e02a0d51976b018729b611c1eb3e410472432cf19f59f0e20b5ffbcdd790a75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060iteratorHelperThrowsErrorOnInvalidIterator\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compat/tests.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e233b5340bdb40215b96047b7fd909c17c6e85b08e52d3144972a6efc882157"}}],"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":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"CWE-532","shortDescription":{"text":"CWE-532"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":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."]}]}