{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Components.componentRule (cyclomatic 200): Components.componentRule has cyclomatic complexity 200 (threshold 15). Of this number, 174 points are the body\u0027s own statements and 26 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70c5e46d40218af935e01502782eb79e793f3380df52ea40519bc34f1617a2"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypes.propTypesInstructions (cyclomatic 73): propTypes.propTypesInstructions has cyclomatic complexity 73 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 21 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":"lib/util/propTypes.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dcda690dab7b0cd837ade93213b7e3db86f21efb63a28ba158e5c8bc81d9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"componentRule::getStatelessComponent (cyclomatic 69): componentRule::getStatelessComponent has cyclomatic complexity 69 (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":"lib/util/Components.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92e6adacb52d35e7c5c6c3743c0fadf335428da76daffd38ea08fe106f932a"}},{"ruleId":"D1","level":"warning","message":{"text":"create.handleJSX (cyclomatic 56): create.handleJSX has cyclomatic complexity 56 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 39 belong to 8 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":"lib/rules/jsx-one-expression-per-line.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bbef61e6698eebf881ef2df92a901fdf9f4c9a146f912f632b94b62af3dd66"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXOpeningElement (cyclomatic 50): create.JSXOpeningElement has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 3 of the 50 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 468, 466). 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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cdf4e6483e36fa7ca77bd3cafb4c2e48b1baa10f4886c688e6c574745617e7"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypes.propTypesInstructions.markPropTypesAsDeclared (cyclomatic 44): propTypes.propTypesInstructions.markPropTypesAsDeclared has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b552634c5b3962370698330644b6921b1a36ae95b02ff355f07673933d532e"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypesInstructions.markPropTypesAsDeclared (cyclomatic 44): propTypesInstructions.markPropTypesAsDeclared has cyclomatic complexity 44 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2f292fc5c550cf6678069d05fe92467a724b3c7ad8934b05b5ce990323a6d"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXOpeningElement (cyclomatic 41): create.JSXOpeningElement has cyclomatic complexity 41 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f11430dd753257369c117bf85f8f240869a3abb0ced301e9198a17ae60c453"}},{"ruleId":"D1","level":"warning","message":{"text":"jsx-sort-props.contextCompare (cyclomatic 39): jsx-sort-props.contextCompare has cyclomatic complexity 39 (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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34f044e8ef656208cc01003b16aeea98a88117910c3cda36424d6376ca5af27"}},{"ruleId":"D1","level":"warning","message":{"text":"usedPropTypes.usedPropTypesInstructions.markPropTypesAsUsed (cyclomatic 38): usedPropTypes.usedPropTypesInstructions.markPropTypesAsUsed has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc378950631167665664a48eb8da6546a5b0333f75ebfac172754f5a93c2a5c0"}},{"ruleId":"D1","level":"warning","message":{"text":"usedPropTypesInstructions.markPropTypesAsUsed (cyclomatic 38): usedPropTypesInstructions.markPropTypesAsUsed has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26b8dac46a7e607fde695572a18b715e219bc4d52d0cd63502a2734b0de4800"}},{"ruleId":"D1","level":"warning","message":{"text":"componentRule::isReactHookCall (cyclomatic 36): componentRule::isReactHookCall has cyclomatic complexity 36 (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":"lib/util/Components.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f1b532d7c3cdcd0930e6bf22e6cf35152e2680cc775574422b4498c01e5f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).CallExpression (cyclomatic 34): (anonymous).CallExpression has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/hook-use-state.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b81c1593565ee69a772dca594c874110ae91fc3677c0a0d744962a583c9ada"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypes.propTypesInstructions.FunctionDeclaration (cyclomatic 30): propTypes.propTypesInstructions.FunctionDeclaration has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"609570ff35b61fee3d652cac6ceb83ffd0ad7f88b1103b6c5d7f61268e1ebf46"}},{"ruleId":"D1","level":"warning","message":{"text":"jsx-no-constructed-context-values.isConstruction (cyclomatic 30): jsx-no-constructed-context-values.isConstruction has cyclomatic complexity 30 (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":"lib/rules/jsx-no-constructed-context-values.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff173ebcfbb0e26cfe135b209c79ff434acbf9b74f41a068e0ea9a11db8ded7e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).VariableDeclarator (cyclomatic 30): (anonymous).VariableDeclarator has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/destructuring-assignment.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d16659d87a418cafc9a93a7ceed0a65322253577391ac0e20e562c857bd4f"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypesInstructions.markAnnotatedFunctionArgumentsAsDeclared (cyclomatic 30): propTypesInstructions.markAnnotatedFunctionArgumentsAsDeclared has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e569b462caa37ee3408f50c0679f21dcc004ec7eab298f14233ab45bdbaa4f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).hasTranspilerName (cyclomatic 27): (anonymous).hasTranspilerName has cyclomatic complexity 27 (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":"lib/rules/display-name.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97654bb854990e4d68ed62e2da6b9b449df3cbe0b84d55fb7ae8f8c4d940a52"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).reportNoArrowFunctionLifecycle (cyclomatic 27): (anonymous).reportNoArrowFunctionLifecycle has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 120, (anonymous)::fix, a function literal at line 162, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d984bdcfbf700bff6abacb94507225208a9be574f2a2499c91f3f3b0f88828"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypes.propTypesInstructions.buildReactDeclarationTypes (cyclomatic 26): propTypes.propTypesInstructions.buildReactDeclarationTypes has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645257c958b475fb50b1c28c9de5b5a140bb1e7235b7235aa1f78e95e75d28a"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypesInstructions.buildReactDeclarationTypes (cyclomatic 26): propTypesInstructions.buildReactDeclarationTypes has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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":"lib/util/propTypes.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c334e9e89237debca70af4b8350a075792ff8aae3920a3a9d146476287c41b05"}},{"ruleId":"D1","level":"warning","message":{"text":"create.validateBraceSpacing (cyclomatic 25): create.validateBraceSpacing has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-spacing.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"311b87ef5b1c7dd0679bc6f0e4703c007f39a79b6c3cf75b22c13ec9771c01b6"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarePropTypesForTSTypeAnnotation.searchDeclarationByName (cyclomatic 23): DeclarePropTypesForTSTypeAnnotation.searchDeclarationByName has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 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":"lib/util/propTypes.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"59882d1a53720bb8dbd55ae6c1e1ffa810bce95be4c1ec82feeeaf9f5e540fb6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).isIdentifierShadowed (cyclomatic 23): (anonymous).isIdentifierShadowed has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/display-name.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88bc32e813af7d52acba3639bad888af10387aa025de33fe09401512fcd7bba"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXOpeningElement:exit (cyclomatic 23): create.JSXOpeningElement:exit has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (fix). 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":"lib/rules/jsx-closing-bracket-location.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6555192aaad8659e51fafe3448f0865621df48b0900a479c2b02eff7a8944d7"}},{"ruleId":"D1","level":"warning","message":{"text":"isDestructuredFromPragmaImport.isDestructuredFromPragmaImport (cyclomatic 22): isDestructuredFromPragmaImport.isDestructuredFromPragmaImport has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/isDestructuredFromPragmaImport.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3891c45db2283b3eebadcbc8859a9b6dbf6a1f4eb44fc32ee907baa19d772d66"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypesSort.fixPropTypesSort (cyclomatic 22): propTypesSort.fixPropTypesSort 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 4 function items inside it that branch (sortInSource, a function literal at line 240, a function literal at line 224, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypesSort.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6619ddc90249918e18782914f15c958d12f9fac0080809657835467207623575"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXAttribute (cyclomatic 22): create.JSXAttribute has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-handler-names.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0679621fa6eb575a90445ab1054f36a196b6194bd523e7c046fdee8a8fdf319"}},{"ruleId":"D1","level":"warning","message":{"text":"create.check (cyclomatic 22): create.check has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-wrap-multilines.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"889b95578b9fd1dbc3820bec8769562a4fcc27bfe038ce2764a138a5d615a3a9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).getRefPropIndexes (cyclomatic 22): (anonymous).getRefPropIndexes has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 145). 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":"lib/rules/sort-comp.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d74eda2d1858bcb6100023d181f06480e3c018a1bf1fce4b2bb5ad984a4165"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarePropTypesForTSTypeAnnotation.convertReturnTypeToPropTypes (cyclomatic 21): DeclarePropTypesForTSTypeAnnotation.convertReturnTypeToPropTypes has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 882, 893, 872). 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":"lib/util/propTypes.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e39d48d77e92540a471bb7a6f722fb64dd8b0e3047206b66d8c8066cbc4e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"usedPropTypes.usedPropTypesInstructions.VariableDeclarator (cyclomatic 21): usedPropTypes.usedPropTypesInstructions.VariableDeclarator has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"lib/util/usedPropTypes.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"675a8b8d47c24b3ad71bf4a20daf2f38a2b84bc5cf494cc23c8bd3c88d0881e8"}},{"ruleId":"D1","level":"warning","message":{"text":"create.lintUnnecessaryCurly (cyclomatic 21): create.lintUnnecessaryCurly has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f0e9f11d5919d51a87b90c460da355d4209b202d0d7c993af6b5d5eb30f83e"}},{"ruleId":"D1","level":"warning","message":{"text":"create.VariableDeclarator (cyclomatic 21): create.VariableDeclarator has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-deprecated.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b62fbdf26b307e4513f239fd9ba455bff7ed2d6d96d577d4d0d9ad9fc4fafc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).checkPropsOrder (cyclomatic 21): (anonymous).checkPropsOrder has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 390, 414, 412). 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":"lib/rules/sort-comp.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3537a77370e033c8413121406e9bce0b8ac2fb92228889e6906db903b624ea"}},{"ruleId":"D1","level":"warning","message":{"text":"propTypesInstructions::searchDeclarationByName (cyclomatic 21): propTypesInstructions::searchDeclarationByName has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0a1fa4c331688dfede027e46223daa93c806c9733d0f3d0098dc91ed805309"}},{"ruleId":"D1","level":"warning","message":{"text":"usedPropTypesInstructions.VariableDeclarator (cyclomatic 21): usedPropTypesInstructions.VariableDeclarator has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"lib/util/usedPropTypes.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0dffe740d967574cfedd1eab39a1ec891e91744d859ae0e3dbb38d11654259"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).validate (cyclomatic 20): (anonymous).validate 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":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ebe13ce0cf6129841de531e4461d5c9196513c459d1a8d97a1c0d3d272b8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"create::handleFunctionComponent (cyclomatic 20): create::handleFunctionComponent has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"944aeb230fabfee97025619d0945526e1b14e475c3040322e45ce351481f5813"}},{"ruleId":"D1","level":"warning","message":{"text":"create (cyclomatic 20): create 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 items inside it that branch (CallExpression, a function literal at line 147, JSXElement, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/void-dom-elements-no-children.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75288fdf015c1e3da0dd6ddbf90ff85190cefcdabbf2c88cbb1864c58a7eee"}},{"ruleId":"D1","level":"warning","message":{"text":"create.handleOpeningElement (cyclomatic 19): create.handleOpeningElement has cyclomatic complexity 19 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-indent.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2911a341549c304c32cb48040eb01700db391860e42be0defbc2ae9ae70910"}},{"ruleId":"D1","level":"warning","message":{"text":"create.Program:exit (cyclomatic 19): create.Program:exit has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 88, a function literal at line 87, (anonymous)::(anonymous)::fix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-newline.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52325eba8be289967f1780a31ca07aaa524c296590df1fad60abf0e609159263"}},{"ruleId":"D1","level":"warning","message":{"text":"create::JSXAttribute (cyclomatic 19): create::JSXAttribute has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"150c2b2078c8e0d7ad617d1d99fd35467bed3b21814312fa67a6614ac4fb355c"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXSpreadAttribute (cyclomatic 19): create.JSXSpreadAttribute has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-props-no-spreading.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c02cad1ba146eb12b646d97cba7560cb0b15ce69050278a55a3641335becd36"}},{"ruleId":"D1","level":"warning","message":{"text":"componentRule::getRelatedComponent (cyclomatic 19): componentRule::getRelatedComponent has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4299b0678d782657114f9a09c8f38d859ab5e39a9cdd829eceda430666233c"}},{"ruleId":"D1","level":"warning","message":{"text":"jsx.isReturningJSX::isJSXValue (cyclomatic 18): jsx.isReturningJSX::isJSXValue has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/jsx.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7261e2843be4e4755db53064fed34d01d673be88c5c845026109d15df63875"}},{"ruleId":"D1","level":"warning","message":{"text":"function-component-definition.getBinding (cyclomatic 18): function-component-definition.getBinding has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/function-component-definition.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c12a123e886203bab78979a1b6d5949d4390518953d0697d6adb8c4066b3c87"}},{"ruleId":"D1","level":"warning","message":{"text":"no-unstable-nested-components.isComponentInRenderProp (cyclomatic 18): no-unstable-nested-components.isComponentInRenderProp has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6138283f18c1d986aba767ddf471f198d365aced3e0f2cecade7a7feb9c0c481"}},{"ruleId":"D1","level":"warning","message":{"text":"create.shouldCheckForUnnecessaryCurly (cyclomatic 18): create.shouldCheckForUnnecessaryCurly has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc382357a19220611de0c471b07eda983f67e900d30a232f746a4214181eedb"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXAttribute (cyclomatic 18): create.JSXAttribute has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unknown-property.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb5e9e6c18447f35dff5cf183b60b527e130cfc0279938cacd02052435a0431"}},{"ruleId":"D1","level":"warning","message":{"text":"isCreateContext.isCreateContext (cyclomatic 17): isCreateContext.isCreateContext has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/isCreateContext.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"382692607be6bf55f2ef70c38bf657698156e951706c53bd01961fb69d52cda6"}},{"ruleId":"D1","level":"warning","message":{"text":"create.JSXOpeningElement (cyclomatic 17): create.JSXOpeningElement has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-first-prop-new-line.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0a03a1fdb23d5850c04c15159e4aa6f671d0bb8d7a10113676e61c6fc9715b"}},{"ruleId":"D1","level":"warning","message":{"text":"generateFixerFunction (cyclomatic 17): generateFixerFunction has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f70386c3ec681b6aa2eecc0617000cc61c1fa1a372e0858152cc17a8b071f07"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).getComponentTypeAnnotation (cyclomatic 16): (anonymous).getComponentTypeAnnotation has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/boolean-prop-naming.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fd9a6ebc0c2591b631eef0661391ef631ec1288f6908545153d06c6c3f8ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"create.getNodeViolationType (cyclomatic 16): create.getNodeViolationType has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-bind.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51a75d0a87d6a1c7aff614680bd0caadf91f294b0f3394cd42b843f50ead4de"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).reportUnusedPropType (cyclomatic 16): (anonymous).reportUnusedPropType has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 117). 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":"lib/rules/no-unused-prop-types.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7111020cc2c73d60574996d8bd47c385816f71c35b09aa4d8937dab38e00d2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).ReturnStatement (cyclomatic 16): (anonymous).ReturnStatement has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/prefer-stateless-function.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f8132dff62a6f7c8d667882b3e60aa3bf33bd37b5cb7f72f0e2880174e7741"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).reportFunctionComponent (cyclomatic 16): (anonymous).reportFunctionComponent has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 145, 157, 137, \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":"lib/rules/require-default-props.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4686b5a9f2c0049561ad3b0b10ca2218fcd66131a5ebb73759d1ca418dbc272f"}},{"ruleId":"D2","level":"warning","message":{"text":"Components.componentRule (cognitive 205): Components.componentRule has cognitive complexity 205 (threshold 15). Drivers by points: if/else 72 (120 pts), boolean chains 74, loops 6 (7 pts), ternaries 1 (3 pts), match/switch 1 (nesting depth added 51). Of this number, 186 points are the body\u0027s own statements and 19 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c222f5498da1a6315b53e7066d78e81cbff2e1082d313dc4f91d74b0435effa"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypes.propTypesInstructions (cognitive 156): propTypes.propTypesInstructions has cognitive complexity 156 (threshold 15). Drivers by points: if/else 61 (133 pts), boolean chains 13, match/switch 1 (6 pts), ternaries 2 (4 pts) (nesting depth added 79). Of this number, 84 points are the body\u0027s own statements and 72 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":"lib/util/propTypes.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a160fd0acc7967602d5b16136efe03c24bc5f15e1f20a91c27d579e7eba8507"}},{"ruleId":"D2","level":"warning","message":{"text":"componentRule::getStatelessComponent (cognitive 96): componentRule::getStatelessComponent has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (69 pts), boolean chains 24, ternaries 1 (3 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"49360051e16e6d62c17d8e63e15e486307ce78aa07fdfbc574f2760e57b66379"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarePropTypesForTSTypeAnnotation.convertReturnTypeToPropTypes (cognitive 86): DeclarePropTypesForTSTypeAnnotation.convertReturnTypeToPropTypes has cognitive complexity 86 (threshold 15). Drivers by points: if/else 18 (78 pts), match/switch 1 (6 pts), boolean chains 2 (nesting depth added 65). Of this number, 29 points are the body\u0027s own statements and 57 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff11c0fce7169c89c1893010e20bc3ceffb086cbf5ef10bccef6d3086c3c82e"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXOpeningElement (cognitive 72): create.JSXOpeningElement has cognitive complexity 72 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 16, ternaries 4 (12 pts) (nesting depth added 34). Of this number, 41 points are the body\u0027s own statements and 31 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"72163ea6980e317ee594df87bfec47a6f9fc1a34851d49316b4c11c12fe3d915"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXOpeningElement (cognitive 69): create.JSXOpeningElement has cognitive complexity 69 (threshold 15). Drivers by points: if/else 27 (45 pts), boolean chains 19, ternaries 3 (5 pts) (nesting depth added 20). Most of this is not in the body itself: 2 of the 69 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 468, 466). 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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3412ca0d54820aadafa54a6fec8cc45a2cbcff4d8195c173b04568647d79b61b"}},{"ruleId":"D2","level":"warning","message":{"text":"create.handleJSX (cognitive 62): create.handleJSX has cognitive complexity 62 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 25, ternaries 4 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 46 belong to 8 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-one-expression-per-line.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56843f97d9fdc4ec0bfcb5b3e1846cffbafd57cfff13e60867980233c420e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"usedPropTypesInstructions.markPropTypesAsUsed (cognitive 62): usedPropTypesInstructions.markPropTypesAsUsed has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 13, ternaries 4 (10 pts), loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657eee36dab6552640679ef1315ff5b4e7964df5c908d9a11237555de532f48"}},{"ruleId":"D2","level":"warning","message":{"text":"usedPropTypes.usedPropTypesInstructions.markPropTypesAsUsed (cognitive 55): usedPropTypes.usedPropTypesInstructions.markPropTypesAsUsed has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 12, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"98013917f67cc5f095bddfc3de7b85a5290486ab6675d70e52aad7dfbe341007"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-sort-props.contextCompare (cognitive 54): jsx-sort-props.contextCompare has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 13, ternaries 4 (7 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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"256463ea694ea7d591c2bdece11fdf9d87581d9f860d33cb0fe412f9ac172e27"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypes.propTypesInstructions.markPropTypesAsDeclared (cognitive 48): propTypes.propTypesInstructions.markPropTypesAsDeclared has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 15, loops 3 (6 pts), match/switch 1 (nesting depth added 17). Of this number, 46 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"196e90063bbd1574907db14d446d66decba581c7e3369c711e77b7023e8455b4"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesInstructions.markPropTypesAsDeclared (cognitive 47): propTypesInstructions.markPropTypesAsDeclared has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 14, loops 3 (6 pts), match/switch 1 (nesting depth added 17). Of this number, 45 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7233143c279588eb208a89c38f23a0732d5c1ff48db0011c01c8c1b903970a45"}},{"ruleId":"D2","level":"warning","message":{"text":"create.check (cognitive 43): create.check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 3 (12 pts), boolean chains 9 (nesting depth added 20). Of this number, 21 points are the body\u0027s own statements and 22 belong to 5 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":"lib/rules/jsx-wrap-multilines.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5418ef3def2481a9ebbd21dd1881b8c649628cf69dad7da7e130154dfc94949c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).reportNoArrowFunctionLifecycle (cognitive 41): (anonymous).reportNoArrowFunctionLifecycle has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 10 (22 pts), if/else 6 (10 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 17). None of this is in the body itself: all 41 points belong to 4 function items inside it that branch (a function literal at line 120, (anonymous)::fix, a function literal at line 162, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"867ee34194a5cec1e697f2f2e190189182359230f0ed6189b287838a461a71df"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).CallExpression (cognitive 39): (anonymous).CallExpression has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 12, ternaries 9 (12 pts) (nesting depth added 8). Of this number, 34 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/hook-use-state.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79efd51e76c6855cbe2f4af7121831eac1ffaed7f8b4b99bcf35d9374a914a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"isDestructuredFromPragmaImport.isDestructuredFromPragmaImport (cognitive 35): isDestructuredFromPragmaImport.isDestructuredFromPragmaImport has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 6 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/isDestructuredFromPragmaImport.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d86059c6873f99e4613dc51c14ed44cb66ab539c600ffd9ce39a044cb5421"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).getRefPropIndexes (cognitive 35): (anonymous).getRefPropIndexes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (35 pts) (nesting depth added 12). Most of this is not in the body itself: 4 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 145). 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":"lib/rules/sort-comp.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164a13c79cceaa7cc7c24b8fb4e942aa6a6ae61689538e8dbb65f04ee0e81c4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).isIdentifierShadowed (cognitive 33): (anonymous).isIdentifierShadowed has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 8, loops 1 (nesting depth added 15). Of this number, 21 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/display-name.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdccdeb38ff06087b30c22748871e1751c52d6383538a1613e7d3fc4cc5d13e"}},{"ruleId":"D2","level":"warning","message":{"text":"create::JSXAttribute (cognitive 32): create::JSXAttribute has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 3 (13 pts), if/else 5 (12 pts), boolean chains 7 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6349d7643f9769cee1822a2862d53b1e3fd4feb81d039454fe10eaa53ac65df6"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarePropTypesForTSTypeAnnotation.searchDeclarationByName (cognitive 31): DeclarePropTypesForTSTypeAnnotation.searchDeclarationByName has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 9). Of this number, 29 points are the body\u0027s own statements and 2 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":"lib/util/propTypes.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6842e5465e2ae45b1ac3c970495c37af2a9d5c5de3109fe6982fd8acf25b8"}},{"ruleId":"D2","level":"warning","message":{"text":"create.validateBraceSpacing (cognitive 31): create.validateBraceSpacing has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 3 (5 pts), boolean chains 2, match/switch 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":"lib/rules/jsx-curly-spacing.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"778958c7539ddedfcd05a67d3fc28707a904c1a76cc2612c38bb0296e02b3925"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypes.propTypesInstructions.FunctionDeclaration (cognitive 30): propTypes.propTypesInstructions.FunctionDeclaration has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11 (nesting depth added 5). Of this number, 26 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aff721b10ba65ff7b92c7a4b2e1762cdbc138b3e0bc8f28ba402640a0a266a"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesInstructions.markAnnotatedFunctionArgumentsAsDeclared (cognitive 30): propTypesInstructions.markAnnotatedFunctionArgumentsAsDeclared has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11 (nesting depth added 5). Of this number, 26 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acdccabee0c41722a8c35bba711911b4e2c87c5964c02b9303b7aa92dbffa23"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesInstructions::searchDeclarationByName (cognitive 29): propTypesInstructions::searchDeclarationByName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b2ba31bdca1415087954f32edbfdfdedcc0a7c144a5781b20f0264040d3ca"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesInstructions::convertReturnTypeToPropTypes (cognitive 29): propTypesInstructions::convertReturnTypeToPropTypes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (29 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af4f7ce260aae0482f90081c9fd60ce3161ea0643514553cab3fea01ff60f86"}},{"ruleId":"D2","level":"warning","message":{"text":"create.MemberExpression (cognitive 28): create.MemberExpression has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 5 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-access-state-in-setstate.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e2305633806eca2908ae857273cb9552c63aba0fac03b1b6d657c2e0a550b"}},{"ruleId":"D2","level":"warning","message":{"text":"create.reportInvalidEntity (cognitive 27): create.reportInvalidEntity has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 16). Of this number, 22 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unescaped-entities.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d7113b77b7cbeb1bfea4ade69738c5d49106de76e1c1da53672ccae757b746"}},{"ruleId":"D2","level":"warning","message":{"text":"fixPropTypesSort (cognitive 27): fixPropTypesSort has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 4 (7 pts), error handling 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 7 function items inside it that branch (sortInSource, a function literal at line 240, a function literal at line 224, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypesSort.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"32452b61304f5a5613afff12c3b5d816c5a73c2a8d039fba58c0985c4b8b2041"}},{"ruleId":"D2","level":"warning","message":{"text":"create.Program:exit (cognitive 26): create.Program:exit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, ternaries 3 (6 pts) (nesting depth added 9). None of this is in the body itself: all 26 points belong to 4 function items inside it that branch (a function literal at line 88, a function literal at line 87, (anonymous)::(anonymous)::fix, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-newline.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b4c9efdd6d28978b1f312a6bdb93ad8986144dd84042f9ffd538019dffb36"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).internalIsDeclaredInComponent (cognitive 25): (anonymous).internalIsDeclaredInComponent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/prop-types.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b18b545d46e89621790b2dc3918659b4e9c4c532850a043152541896bccbb5"}},{"ruleId":"D2","level":"warning","message":{"text":"componentRule::getRelatedComponent (cognitive 25): componentRule::getRelatedComponent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e9369c915073ad669930e37e018eba70ae5f982210904fa53123da2ed74a2"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-no-leaked-render.ruleFixer (cognitive 23): jsx-no-leaked-render.ruleFixer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-leaked-render.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a226aab065bcd2b6689506549ab4ec2c1b31607f1d9f8f8f2a003b2c1deb198b"}},{"ruleId":"D2","level":"warning","message":{"text":"create::getOverrideConfig (cognitive 23): create::getOverrideConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3640d1fb1b52ee6de48dd03d573f2e76508d7daf075c6a813115104266d04aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"componentRule::isReactHookCall (cognitive 23): componentRule::isReactHookCall has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, if/else 3. 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":"lib/util/Components.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a00528452ebc0406d997453fab044deb9fc99dacc775d05948896bdf08e719"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypes.propTypesInstructions.buildReactDeclarationTypes (cognitive 22): propTypes.propTypesInstructions.buildReactDeclarationTypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884e3a96d04bc7eb40deede128add750678448359de7302c2901eb69c2eee4b"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-no-target-blank.getStringFromValue (cognitive 22): jsx-no-target-blank.getStringFromValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a702d498ff0f5c01437ddd68ffa28f275efff41c598636224ee47ed589b556"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).VariableDeclarator (cognitive 22): (anonymous).VariableDeclarator has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/destructuring-assignment.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dc93f26d812a5560d203b2ed779c9d7b1ee87023fdbd5b59141df3f4fde68d"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesInstructions.buildReactDeclarationTypes (cognitive 22): propTypesInstructions.buildReactDeclarationTypes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 3 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":"lib/util/propTypes.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa1621447558774a45d6ae560dcf2becdc6729054bf6aef646828b35372340e"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-no-constructed-context-values.isConstruction (cognitive 21): jsx-no-constructed-context-values.isConstruction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-constructed-context-values.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf5468e48861c3e9cc507d4a4cd49f6bdf7f990ddcfa8676ca903350d7a6372"}},{"ruleId":"D2","level":"warning","message":{"text":"propTypesSort.sorter (cognitive 21): propTypesSort.sorter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4 (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":"lib/util/propTypesSort.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d07b1c1e784a7b206dc9c8af27505de0914fed02b2e660d0d8358946fb28cc"}},{"ruleId":"D2","level":"warning","message":{"text":"no-invalid-html-attribute.checkLiteralValueNode (cognitive 21): no-invalid-html-attribute.checkLiteralValueNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (8 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 338, 363, 292). 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":"lib/rules/no-invalid-html-attribute.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd14f5d004faa5d52f066a67682613642cb618a6b83ff060413637e5b64fc0ec"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXAttribute (cognitive 21): create.JSXAttribute has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 4, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-handler-names.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26048d702e1f73b93a148e5b866953d5bcd3e93a6ae20e69849100839d39f9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"create.CallExpression (cognitive 21): create.CallExpression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 76, 98). 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":"lib/rules/no-access-state-in-setstate.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d303d3fe9ba3cb9e88b930b3a811a739a4b205c4a661529e5ea282cc302818"}},{"ruleId":"D2","level":"warning","message":{"text":"create::handleFunctionComponent (cognitive 21): create::handleFunctionComponent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739f73f855d87268cae61f4860483e22ffff6f3bb32266bef88b082728e14a5"}},{"ruleId":"D2","level":"warning","message":{"text":"create.CallExpression (cognitive 21): create.CallExpression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"lib/rules/style-prop-object.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6955611bfbfeab7c1b66c2048654d8a1418d59e5fa28386a61641d9fb259de"}},{"ruleId":"D2","level":"warning","message":{"text":"create.handleOpeningElement (cognitive 20): create.handleOpeningElement has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, loops 3 (6 pts), ternaries 3 (4 pts), if/else 3 (nesting depth added 4). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-indent.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"072a8d1555f601dffe74d63b7d9503d41e992afe3747c26c4dd05651d9497296"}},{"ruleId":"D2","level":"warning","message":{"text":"create.ArrayExpression, JSXElement \u003E JSXElement (cognitive 20): create.ArrayExpression, JSXElement \u003E JSXElement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 235, 224, 218, \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":"lib/rules/jsx-key.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0152ab9ca93c46d296340ef2ba2d60cb7696a15211db1eb3c5500cfb0df9736d"}},{"ruleId":"D2","level":"warning","message":{"text":"create::getJSXElementName (cognitive 20): create::getJSXElementName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a4d1e57068b6632b6c267999f553b1cff86db83177e0f3e36c97872902196c"}},{"ruleId":"D2","level":"warning","message":{"text":"usedPropTypes.getPropertyName (cognitive 19): usedPropTypes.getPropertyName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"657af0978e86c9fea5959cdf48c7bdf310a58551af8c9396637c7d61fab737d2"}},{"ruleId":"D2","level":"warning","message":{"text":"create.checkProperties (cognitive 19): create.checkProperties has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 124, 142). 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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3cf00dfa35ddb8cc474ab5cd4327caccf496eec7f1c02792c5d1d5f983b37d"}},{"ruleId":"D2","level":"warning","message":{"text":"create.reportUnnecessaryCurly::fix (cognitive 19): create.reportUnnecessaryCurly::fix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (7 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":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"758ef39baf6bd1819a45167ad95345de5beba566575eead433b99e859e329893"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXAttribute (cognitive 19): create.JSXAttribute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unknown-property.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c260bae463ed179dafa06bf5673e9449f8a539ec777037ffa8b3c8f534ee24"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-no-target-blank.attributeValuePossiblyBlank (cognitive 18): jsx-no-target-blank.attributeValuePossiblyBlank has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d3eeb3876ef943c159c00819a4eb1b9ee53d66a7083a1692e74d08f349db2"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-tag-spacing.validateBeforeClosing (cognitive 18): jsx-tag-spacing.validateBeforeClosing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c0f6af48932ffae4984c673e10086f52f61565c632228eadd2ff8dc2b93701"}},{"ruleId":"D2","level":"warning","message":{"text":"create.ImportDeclaration (cognitive 18): create.ImportDeclaration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/forbid-prop-types.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"147a0cac2b5b1a3dc67a0ccf9ef4535d471bb0d1f7312f76fbd02c07cff9a69d"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXOpeningElement:exit::fix (cognitive 18): create.JSXOpeningElement:exit::fix has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 4 (7 pts), match/switch 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":"lib/rules/jsx-closing-bracket-location.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"55235b937f274a85b5183437d39fefe0e1231d3d823ab4606d2a642e0c58de0d"}},{"ruleId":"D2","level":"warning","message":{"text":"create.checkFunctionsBlockStatement (cognitive 18): create.checkFunctionsBlockStatement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 149, 148). 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":"lib/rules/jsx-key.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f62eda212d85bb59bc5d2763dc4c556274fa57cc190f4453d029f22d8a388a"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXOpeningElement (cognitive 18): create.JSXOpeningElement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (5 pts), boolean chains 4, 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":"lib/rules/jsx-pascal-case.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0776f8c2240f56a5eb5803ca121e6f48da015f9423cd7c69a65bb06138df4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"create.CallExpression (cognitive 18): create.CallExpression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4 (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":"lib/rules/no-danger-with-children.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c76a03524d9fef0412ee1bfd5c9aa1ae5fd996f2996ef0471e25547533e46"}},{"ruleId":"D2","level":"warning","message":{"text":"create (cognitive 18): create has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, ternaries 1. None of this is in the body itself: all 18 points belong to 4 function items inside it that branch (CallExpression, JSXElement, a function literal at line 147, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/void-dom-elements-no-children.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f983c53fafb0e0f2ee8a35d12f0473b592ca526a1963c08bafe0e002ffb7a1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"usedPropTypes.usedPropTypesInstructions.VariableDeclarator (cognitive 17): usedPropTypes.usedPropTypesInstructions.VariableDeclarator has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"lib/util/usedPropTypes.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45e4cb2d697acb02c755fbf9d250ff0854cbd88052021103b4e5d84abc199fc"}},{"ruleId":"D2","level":"warning","message":{"text":"function-component-definition.getBinding (cognitive 17): function-component-definition.getBinding has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (5 pts), if/else 3 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/function-component-definition.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96c438f20776b3da333fa2e04ee1a03a0c59499573c37fd954f39ad2f9a326d"}},{"ruleId":"D2","level":"warning","message":{"text":"no-invalid-html-attribute.checkCreateProps (cognitive 17): no-invalid-html-attribute.checkCreateProps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-invalid-html-attribute.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ed86635402b3fe2c9c24fea18f8e3c38fe409ecedac835d13c3f0c116348c7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).validate (cognitive 17): (anonymous).validate has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"20740ef69a2ff9bd3e71c6e8c822e593ca6707d92f0b0afa84280018ec277c75"}},{"ruleId":"D2","level":"warning","message":{"text":"create.handleAssignment (cognitive 17): create.handleAssignment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 208). 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":"lib/rules/no-unused-state.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7550c7882e6e65810c896178ce7623ffbbe43e748166e79cfc83601942c2d832"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).checkPropsOrder (cognitive 17): (anonymous).checkPropsOrder has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 2. None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 390, 414, 412). 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":"lib/rules/sort-comp.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e6b78e6468ef84ccd8d59ef49dafa71b3ac2b752fed34f34b8dd90d83489be"}},{"ruleId":"D2","level":"warning","message":{"text":"usedPropTypesInstructions.VariableDeclarator (cognitive 17): usedPropTypesInstructions.VariableDeclarator has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, 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":"lib/util/usedPropTypes.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0977f61942fa5f269c0af0960411a07795a5623baab94154a05837a6b738b16"}},{"ruleId":"D2","level":"warning","message":{"text":"jsx-tag-spacing.validateClosingSlash (cognitive 16): jsx-tag-spacing.validateClosingSlash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"923552c4cfeb60e884339e528e47c9e0fa722326e9049eb14185d50432bb391d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).Program:exit (cognitive 16): (anonymous).Program:exit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 4). 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 424, 436, 444). 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":"lib/rules/boolean-prop-naming.js"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1a01cc19c3bbe7e55c9e762f699067fbc88eb906a1f88210aa456763bbe1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXOpeningElement (cognitive 16): create.JSXOpeningElement has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (6 pts) (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-first-prop-new-line.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ef6b6c96b4d1516363fc994ff10507d4f804d2af2adf9328432aa16f593d99"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).JSXOpeningElement (cognitive 16): (anonymous).JSXOpeningElement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"lib/rules/jsx-no-constructed-context-values.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c0c1594d3eb789e106f83bc3357b07ea81ac25c664cf803d842bdb5721a851"}},{"ruleId":"D2","level":"warning","message":{"text":"create.JSXSpreadAttribute (cognitive 16): create.JSXSpreadAttribute has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 6. 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":"lib/rules/jsx-props-no-spreading.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3277ca5d2408e970267eedde728ac38e5a3efbe10bb605a229aba805019ceff0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).ImportDeclaration (cognitive 16): (anonymous).ImportDeclaration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-typos.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef23f92450894a34ef4de2e114aa9bb3699965cfcdc0c524addabb985f778b24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Components.componentRule: FunctionTooLong \u2014 componentRule runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9066cf89d63a4c1a0aa3fd597c3d9a1c57d7a20e0209730d95de37b7c00f9f77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usedPropTypes.usedPropTypesInstructions: FunctionTooLong \u2014 usedPropTypesInstructions runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a99eecb1ec395f54eb2d7bf888b27ece26c09db141f23630bf7ee290c5ba1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/propTypes.js: FileTooLong \u2014 771 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 271 over it, 1.54\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":"lib/util/propTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e012fe161b3b271d0baedeab8b62a00b1a3fb0d4a36e167a3a1543ed507dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: propTypes.propTypesInstructions.markPropTypesAsDeclared: FunctionTooLong \u2014 propTypesInstructions.markPropTypesAsDeclared runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84d61b8f26d031947f510ebad0a353ad7f8cab5f0689cb909ec6c51fbcfe98c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/Components.js: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 73% of them inside a single declaration: componentRule (287-967). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f56da614d35eec0fcb1e3aa369124cf00cf44a8168defa03a255c846cf00d"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs mocha but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060c8\u0060 (or \u0060nyc\u0060) as a devDependency so the suite can be wrapped for coverage. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: glob: glob 10.3.7, declared in package.json, is marked deprecated by its publisher: \u0022Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting [e-mail redacted]\u0022. Replace it with the package or version that message names, or record why this one must stay."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dfa8364448a636dde7d466403280de05e962b7d69e34ec0d3707ec14687871"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/util/Components.js: lib/util/Components.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 200 in Components.componentRule at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/util/Components.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b13e21391ad0310e9c7cd0c105352f2bcce74d9c4d094a918be7f51123cb5fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/util/propTypesSort.js: lib/util/propTypesSort.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in propTypesSort.fixPropTypesSort at line 181. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/util/propTypesSort.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypesSort.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b710ecd420a9b3bc2dfb269227dde05260f8d6c832b201e3c10f394dcbf0fc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/rules/no-arrow-function-lifecycle.js: lib/rules/no-arrow-function-lifecycle.js changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is no-arrow-function-lifecycle.getRuleText at line 34), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C[Fix] \u0060no-arrow-function-lifecycle\u0060: avoid a stray paren in autofix\u201D; \u201C[Fix] \u0060no-arrow-function-lifecycle\u0060: keep comments before the body in autofix\u201D; \u201C[Fix] \u0060no-arrow-function-lifecycle\u0060: keep \u0060async\u0060, type parameters, the parameter list, and the return type in autofix\u201D; \u201C[Fix] \u0060no-arrow-function-lifecycle\u0060: remove the closing parens of a parenthesized arrow function in autofix\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/rules/no-arrow-function-lifecycle.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf664920688a5db00cfa7fe28d733547bf2a134a6cfc7761629a4a80d693edb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/rules/forbid-dom-props.js: lib/rules/forbid-dom-props.js changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is forbid-dom-props.getStaticPropValue at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C[Fix] \u0060forbid-dom-props\u0060: treat a prop with no value as \u0060true\u0060 for \u0060disallowedValues\u0060\u201D; \u201C[Fix] \u0060forbid-dom-props\u0060: allow forbidding namespaced props\u201D; \u201C[Fix] \u0060forbid-dom-props\u0060: match \u0060disallowedValues\u0060 against literal values in braces\u201D; \u201C[Fix] \u0060forbid-dom-props\u0060: avoid crash on attributes without a value\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/rules/forbid-dom-props.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/forbid-dom-props.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"687e3d6421020ac5649099ee355e96a3ba2865f53abecbc46dd83479697f66f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/rules/boolean-prop-naming.js: lib/rules/boolean-prop-naming.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is boolean-prop-naming.nestedPropTypes at line 33), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C[Fix] \u0060boolean-prop-naming\u0060: check props typed with a \u0060memo\u0060/\u0060forwardRef\u0060 type argument\u201D; \u201C[Fix] \u0060boolean-prop-naming\u0060: report a prop once, when components share its props type\u201D; \u201C[Fix] \u0060boolean-prop-naming\u0060: check type-annotated props of wrapped function components\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/rules/boolean-prop-naming.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/boolean-prop-naming.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af525747ce61403cf09d49d9c20296f106a1349fcc9b4a0036b6ecfd871be4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/rules/jsx-closing-bracket-location.js: lib/rules/jsx-closing-bracket-location.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is jsx-closing-bracket-location.getTagEnd at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C[Fix] \u0060jsx-closing-bracket-location\u0060: say \u0022on the next line\u0022 when a comment shares the closing bracket\u0027s line\u201D; \u201C[Fix] \u0060jsx-closing-bracket-location\u0060: keep TS type arguments when autofixing\u201D; \u201C[Fix] \u0060jsx-closing-bracket-location\u0060: preserve comments in autofix\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 01:08:52 \u002B07:00\u0027 --until=\u00272026-10-23 01:08:52 \u002B07:00\u0027 --full-history --no-merges -- lib/rules/jsx-closing-bracket-location.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-closing-bracket-location.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3340810ca4b56f8ef46034fd35c210f5434b1f01e885dcc58894cac4579abe1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: lib/util/Components.js, lib/rules/no-unused-state.js, lib/rules/jsx-curly-spacing.js, lib/rules/display-name.js, lib/rules/require-default-props.js, lib/rules/static-property-placement.js, lib/util/jsx.js, lib/rules/no-danger-with-children.js (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fbb00217dcc6812656b9f01049897d76fce47a2f6f30c2eab4dc00829a53e740"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (12 single-owned of 99 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 99 of the 137 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: lib/rules/jsx-fragments.js, lib/rules/no-children-prop.js, lib/util/props.js."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022the index of the props type in a wrapper\u0027s type arguments, e.g. \u0060memo\u003CProps\u003E\u0060, \u0060forwardRef\u003CRef, Props\u003E\u0060\u0022 repeats the code it sits on: 8 of its 8 words (index, props, type, wrapper, arguments, memo, forward, ref) are already in \u0060const WRAPPER_PROPS_TYPE_ARGUMENT_INDEX = new Map([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/boolean-prop-naming.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c3e252a37209b3df248ec2052b42ff2d08a6cbe35776b4e89753c58afd0050"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022props.aProp || context.aProp\u0022 repeats the code it sits on: 3 of its 3 words (props, prop, context) are already in \u0060const isPropUsed = (\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/destructuring-assignment.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b236e25f39e604e90d662fc8103b4ed26789146a9f8ad9d17ec104201179c4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022this.props.Aprop || this.context.aProp || this.state.aState\u0022 repeats the code it sits on: 4 of its 5 words (props, context, prop, state) are already in \u0060const isPropUsed = (\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/destructuring-assignment.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dd139385e2cb0d5566b631b5765f3c2f902a5e243cae112e8c5b8d2df5662b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Report missing display name for all context objects\u0022 repeats the code it sits on: 6 of its 6 words (report, missing, display, name, context, objects) are already in \u0060forEach(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/display-name.js"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0a931e2631681cb9266fc0c239730dac128ec28f368746e329fca31bcdd46"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060dangerouslySetInnerHTML\u0060 is only \u0022reserved\u0022 on DOM components\u0022 repeats the code it sits on: 7 of its 8 words (dangerously, set, inner, html, reserved, dom, components) are already in \u0060const nodeReservedList = reservedFirst \u0026\u0026 !jsxUtil.isDOMComponent(node) ? reservedList.filter((prop) =\u003E prop !== \u0027danger \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"285c3d6197cdfd18e35c90f4245821e8c630a5ba0cf7fa4241935ea55cf8b7a0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the closest parent component\u0022 repeats the code it sits on: 4 of its 4 words (get, closest, parent, component) are already in \u0060const parentComponent = getClosestMatchingParent(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03ea66abf1d945b275e283a039541af3ad1bb0dc4e07624680446d8e0f751cb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Increment the prop score\u0022 repeats the code it sits on: 3 of its 3 words (increment, prop, score) are already in \u0060errors[propA.index].score \u002B= 1;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-comp.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a407929b7e02229acb08e35522e7f2477e948fdeaeed852cca809dbac80a06"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Compare the properties order\u0022 repeats the code it sits on: 3 of its 3 words (compare, properties, order) are already in \u0060const order = comparePropsOrder(propertiesInfos, propA, propB);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-comp.js"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"59058838fb185c64be7f991081fdefcc8dcc6e1c46ad864312fc2d3ff7ee6a4f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the related component\u0022 repeats the code it sits on: 3 of its 3 words (get, related, component) are already in \u0060const relatedComponent = utils.getRelatedComponent(node);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/static-property-placement.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"198138c369a0ad273b07eeca7255eddb3ee2c3068124e1f073c69c25be5baba2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022parent element is a JSXOpeningElement\u0022 repeats the code it sits on: 4 of its 4 words (parent, element, jsx, opening) are already in \u0060if (parentElement \u0026\u0026 parentElement.type === \u0027JSXOpeningElement\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/style-prop-object.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08b661331c5f0cc2e4daacc6a820f0d0557ee2549ef6a62dc4f56f625c6dbb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022this.setState((_, props) =\u003E props.*))\u0022 repeats the code it sits on: 3 of its 3 words (set, state, props) are already in \u0060if (isPropArgumentInSetStateUpdater(context, node, unwrappedObjectNode.name))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e4a9fa21d63fe20b3ee66331330f6fa678487f95daf144c627284b0fdedde"}},{"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":"76e9e8d7f365fbaa7fb4693250d331c1019c0f37bef3fce68f3e29e6434c9640"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7b4178faec08b10d171a40adab30f2be1bc7070c35c3b14fe63fec22d0b4554"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e8efad1cd098e9e3c2a338e21b56951d65581331b24dfc6a508247ff2128e5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c72a00c1140ea570c6e2d1329254584a2cddbe9edd6deab1b81546c7df862a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"788941e6a15aba9b74d250e46a391a879fd4def927c2b3273252085d55848ded"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd47a80e59a3f2641d429e213ef29938881ba2310c8765da1199c39dee429eec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e94d3971bf2b59b66d3bd4025efd7c1a7fd5196d21c142aaf99c05a5d68804b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e734f5860084f5ddf1cfbd9d54c6464b8666884deeecd7dfc36a003f4c78a804"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bba2d9665bde393a0cdfbec03a91927c28b3d27dc5a58a1744a6682d7c473cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3089657a9b9b71bd0917a1ac5380a49c108c9aefdd87fb2e044fd1d058790645"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"944c9e15a6c41afc9725513e8c68bf0313e2f0b3ea9b207bfb0f857d427fc5de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"addd60fc8825241f1d4c1a459ea4146cf48e684bb35f8550220337fb2a5f7e1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d6f387511f3c0e0704917ea626c9ac4d26d2cbd2c11dc93ef19d28c373c0e81"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80bfc37602506aa4221a3526a101ae7ece78cd8445589f0d3d0b0db5196f87cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"812d471fded1dda34a9bfbf9f668bb26d3f9336d0f8606df356dac44b3648c7d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f699ae6b293bab14956baad4b5041e49cd8bf0bab67ec3c81088603613dea34"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ed360fdca912ad90c594243dcb677c496be0e313f147b98864fea73aa2ee48a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d7f1856a0a18be760f25b01c2e036dbff9cc4c020e9188a75a5ccc5f410ffe4"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"102297e6723bbb05be4d31cca85053040e168008649a97627ddb6d36906c0e6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62e4b6934177ebd9319f4d44215a3575a361dd5196e371e1a08ee26d927a7578"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1219c60fa80c41d254baed3d2c54d547f5ce25819297efa981529aef9f57abaa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1a09ac57926699ff6535b45efd17217fd57d1872f33cc8ffaf11640f77eb849"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06509984c051af61f744cddb84189e296a84053a0e9a3324139eaf2d78833a78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77ffa01462c0e11caf8bb4550963952990f1b28b6289c30e7664032c71d261d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f9620fbbb8bf1cf94ac701210723b2f74e09203b6726fd3c340c4d8355b26d2"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"674573f0e802a6d7df484b7a9f8a927630bd6bb59a3db12498c329bb9326611a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a387492acaf6c216d24083f22363244ebf0c15a077146aa16051ba0919468376"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bb095b60e1b8eb7998e9cc81ee900ed7fb849c097b74f1037cc42b94f6776ae"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f42940591b2fd3a584718a5cb525ff4456bc245235b9a7aa26b87ce37e7c9ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b120fc4197a16ef66e67aba533764ec201fc7b3423cbd6818fa485fc4dbc333"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3569a32170072e14e15af408275874e6c32eb652067a9bf63f79c70b25b8255"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"324594e377be9e262800216e11a8aa6914d1a0fb6e7cb45e617822a14bf3ab67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42e9d6301c053362bf0ce37242fc71d90cc3de86ff5d08eaaf6a8b1b31766102"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e4a3da4814ee729ffa982efe94b2ac690a35309d3581b74bc43540424fc620e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b973b7348943596fc832712a044bcbae367e2509e64241736044800cc7164b7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77c2db66395c52bc7f70e211ef90b48727019d4259a2fc33dc2fc6924fa2e689"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"102b8fa4896513df0d65a5a7e654146905bc88d283a4b6976ea241ffcf981450"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4d8ffb584158259b92e537c40e268340fdba00704a7f9e51493faeab2f4ff50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdc08c284bf3d64e2757b5df1aec9ccfb9e7f71d465c97bc4f4379deb1415c00"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e2be387476a2da4ceb246a496c5eaf6e51395fec98798ab47bf4f63419cb5746"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2073088bf2ac2d69ba42e20a04d222711c06d330e73922c48e2afc9678f739c2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0f685ddf827e1e2dc3da01fba4390e7543e6c9c836f3468633291098c82a2fc"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5c7c333261d8054a8dd29f290a82ca243d012048f47e4021c4e4889c9a2d99b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b82af18f58781e3ef3bf7dbdb6bddcec1424b60b668a9a21167d6fb80eaeabe1"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"c63267c7c301d788973330a6c333ea38b67173b3cef1529a15e5329050a8fc13"}},{"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":"0ab62b839885d3a5587d6bdfc585847ecb685ebc1a704471a5d6d53393f9ec14"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"667ab476ca78fa265c8a1fd6cf5fc0cf39cac88d7e350d0490dda56694f3cf57"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b57e7c5c141034e4cd7154db390bfd171feaf06f168f7f0002e7581505b8ab1"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08b642e1a95671b4db0d3d1d906da5d3f680821d5cd360cffed9b595d73bb33c"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"046153fdc2850b8bfa1a81d3d8b8805fc88531c5180ad5c82f14384db4ecb662"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"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 10 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/eslint-8-.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (74 identical lines \u00D7 2 files): lib/rules/jsx-sort-default-props.js:9 \u00B7 lib/rules/sort-default-props.js:9 \u2014 these 2 files are line-for-line copies of one another \u2014 74 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7236e939fc9c297915c80f8685615cf611c7c777be7688dc51aced9a7bc02e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): lib/rules/jsx-tag-spacing.js:41 \u00B7 lib/rules/jsx-tag-spacing.js:71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fdf84c50b518c2aa9119c9be62a795b13c8dee9b45aa4b18914994bfb0e776"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): lib/rules/no-multi-comp.js:29 \u00B7 lib/rules/prefer-stateless-function.js:38 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-multi-comp.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8368a66ec9d605b51268ed92d766eb364b582a13d00e5237257f4b58e35a04b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): lib/rules/jsx-curly-newline.js:133 \u00B7 lib/rules/jsx-curly-newline.js:151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-newline.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"194bc7b69bf1190709ec04fa5408db7f4f7161dc4218cc4b4e0ddb7b32624b36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): lib/rules/jsx-no-undef.js:28 \u00B7 lib/rules/jsx-sort-default-props.js:37 \u00B7 lib/rules/sort-default-props.js:32 \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":"lib/rules/jsx-no-undef.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f28bef7c5760e60887136d1f103cb927db8998537606fce238e7d1519687e9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): lib/rules/jsx-tag-spacing.js:108 \u00B7 lib/rules/jsx-tag-spacing.js:195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a559a0f968615a2f4e7f0c91324a67ea8887ccbdf130049ab8998acd285058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): lib/rules/jsx-no-duplicate-props.js:27 \u00B7 lib/rules/jsx-no-undef.js:28 \u00B7 lib/rules/jsx-sort-default-props.js:37 \u00B7 lib/rules/sort-default-props.js:32 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-duplicate-props.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"738919e293987316683b95b1ca5b7f0fec176aad63b430db4e6d09de7dbf6bd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): lib/rules/forbid-prop-types.js:159 \u00B7 lib/rules/sort-prop-types.js:185 \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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c696bba7d5c238ac3d1c92fb3a09235a399705ade9c361a3e87cdeac7b2fa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): lib/rules/no-unused-class-component-methods.js:62 \u00B7 lib/rules/no-unused-state.js:33 \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":"lib/rules/no-unused-class-component-methods.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0104a80b4c8dd12355ff965d93a5d96b46c2bb007386e8b7a2ee50f62d3f01fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): lib/rules/no-arrow-function-lifecycle.js:200 \u00B7 lib/rules/sort-comp.js:429 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4020045bb75a0748a4a7c45ea22188fc9a2840747cb84a55617b32eb1c0b415c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): lib/rules/void-dom-elements-no-children.js:89 \u00B7 lib/rules/void-dom-elements-no-children.js:148 \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":"lib/rules/void-dom-elements-no-children.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c594e5202fcd6e3f220acc92855744ad6e08c08a6bc4b6b4bff21010101797fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/rules/display-name.js:46 \u00B7 lib/rules/require-default-props.js:55 \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":"lib/rules/display-name.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe20230886b3e451c350e1f51ff3fc38becdc0238129eb2d4771d9302a406b08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): lib/rules/iframe-missing-sandbox.js:75 \u00B7 lib/rules/iframe-missing-sandbox.js:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/iframe-missing-sandbox.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e62258c4d410d90623f71d6d5035114d1fd35db477ceff585893e1933db8b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/rules/jsx-curly-spacing.js:208 \u00B7 lib/rules/jsx-curly-spacing.js:229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-spacing.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f96e0cf78503b1cdcfcbb38f3196c1b01d5fb55509bdf36cd67d4cbb7b27f1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): lib/util/defaultProps.js:169 \u00B7 lib/util/defaultProps.js:212 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"lib/util/defaultProps.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8208db78bf54a5caac29c584c8d2a0bdfb480ea89cc2ac08fd459a08aba00f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): lib/rules/jsx-pascal-case.js:111 \u00B7 lib/rules/jsx-sort-props.js:438 \u00B7 lib/rules/sort-prop-types.js:72 \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":"lib/rules/jsx-pascal-case.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b5e796331b1cf19c029a17f8fd00d6d80160f4db2e4a18c64e118bd2b0e821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/rules/require-optimization.js:159 \u00B7 lib/rules/static-property-placement.js:105 \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":"lib/rules/require-optimization.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a2066091c3a6a0c5fe4939a2abfc9224aa26876b850345a241387da745dc1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/util/linkComponents.js:20 \u00B7 lib/util/linkComponents.js:33 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/linkComponents.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf8e7c86db0270835eb6cdbb81ab0cd824204c6ff1118c8b678b498a7bd8ad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/rules/function-component-definition.js:206 \u00B7 lib/rules/function-component-definition.js:316 \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":"lib/rules/function-component-definition.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eaa62ee565a2694c2aa8bd763c67646f10980aa534b8d1b4efe12c834c9a8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/rules/jsx-tag-spacing.js:225 \u00B7 lib/rules/jsx-tag-spacing.js:236 \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":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d62370c6b8035e6d82308fe71cbb3d50c08797a3ad1fe5be44f7b6732f51f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): lib/rules/no-is-mounted.js:36 \u00B7 lib/util/makeNoMethodSetStateRule.js:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-is-mounted.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d76259750e94b792ca93028e7cc3556354af9173dd385474aceb35b69d9476a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): lib/rules/sort-prop-types.js:249 \u00B7 lib/util/propTypes.js:1280 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"lib/rules/sort-prop-types.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1027bff4234d9b142b46d6def224a984b48cb9c1d687561d466f21432cf423b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/util/Components.js:883 \u00B7 lib/util/Components.js:896 \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":"lib/util/Components.js"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"580592243cfa4f6371f494c51a41f764479d8d06f144381df6c5defb07ebbddd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): lib/rules/destructuring-assignment.js:196 \u00B7 lib/rules/destructuring-assignment.js:286 \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":"lib/rules/destructuring-assignment.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"707e531bbc7be84fe77795cd8152fea913305412135cfddad273c22ef92b7d15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/rules/jsx-wrap-multilines.js:215 \u00B7 lib/rules/jsx-wrap-multilines.js:228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-wrap-multilines.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45ce7e3485c419c334021747d33e0fb2933fb5ea619b5f0e2a1a5f3f56471f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): lib/rules/jsx-no-literals.js:424 \u00B7 lib/rules/jsx-no-literals.js:502 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"lib/rules/jsx-no-literals.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24148e306a0e41bae92e328a8af2f8ea52d2c1908cff25ff5d01bd1362295f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/rules/jsx-sort-props.js:232 \u00B7 lib/rules/jsx-sort-props.js:446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d58089b99f3f86f4f78191628d88196912f5e6ee5414e031a57e5c852effc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/rules/prefer-stateless-function.js:383 \u00B7 lib/rules/require-render-return.js:92 \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":"lib/rules/prefer-stateless-function.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f057c09a2982a24cc8ca060a92bb1e80dfa4d7121c2779f8fe36c16fd88714c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/rules/sort-prop-types.js:214 \u00B7 lib/rules/sort-prop-types.js:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5a7bb384c55dd4f10b51061d3023cf76f400ad6fae1cc55ed21f3a458ac3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/rules/sort-prop-types.js:293 \u00B7 lib/rules/sort-prop-types.js:303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a905287b01730a5fe3764a08f0f16688dc4c026c1294b0e3aff9ccaa616c0f5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/util/Components.js:563 \u00B7 lib/util/Components.js:574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37d9130786c3c77a0cfd42ffbb66d969d2e0605d2a5654b8d8052fe739ade85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/rules/jsx-boolean-value.js:138 \u00B7 lib/rules/jsx-boolean-value.js:155 \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":"lib/rules/jsx-boolean-value.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eee5bad50cc330e2212012408f12d43114c3de187e0e35e2de5b83cecfe58eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/rules/jsx-curly-brace-presence.js:383 \u00B7 lib/rules/jsx-curly-brace-presence.js:393 \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":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddd0944b1f5d90bc34015451505b9bd2d571fa367c398d567bb6b7c26b08f46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/rules/jsx-no-target-blank.js:188 \u00B7 lib/rules/jsx-no-target-blank.js:251 \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":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2805999c2ef5babfc29bcf6618b3dc3054b7ed2a5b087ff78a03eab8cb81e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/rules/no-typos.js:180 \u00B7 lib/rules/no-typos.js:188 \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":"lib/rules/no-typos.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f9383e0eff3705b092659b2f193b6fb93f8cf4a8a195821a489feb3bc8d122"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): configs/all.js:5 \u00B7 configs/recommended.js:5 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configs/all.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"77444cc374a528997f44bdd8504a9172628925e3f7d558089d757145da4d449e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/rules/forbid-component-props.js:133 \u00B7 lib/rules/forbid-dom-props.js:128 \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":"lib/rules/forbid-component-props.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a79274477ad1f6a102695b50143703b9da4befbe6118b1e7297f7fb5b18d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): lib/rules/jsx-sort-default-props.js:101 \u00B7 lib/rules/sort-default-props.js:95 \u00B7 lib/util/variable.js:68 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8cb0c105fbca3ce05426a71815e7117540ab8caae91414d21f1e6647a919cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/util/Components.js:537 \u00B7 lib/util/Components.js:545 \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":"lib/util/Components.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"839d5b70f3edadbb583cfed2f41d34a4394d33e2447dd64223e5f0b1d8dd1615"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/rules/jsx-props-no-multi-spaces.js:61 \u00B7 lib/rules/jsx-props-no-multi-spaces.js:85 \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":"lib/rules/jsx-props-no-multi-spaces.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee3475fde9952c870b49c1ade1588a45f416ba5a4015f5e65e93f6f6d496c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStatelessComponent (cyclomatic 69, cognitive 96): getStatelessComponent has cyclomatic complexity 69 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc3fbd48dd081340530f135bf0915e6341d92f8c540dd7bda046b74b9945a5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 48, cognitive 67): (anonymous) has cyclomatic complexity 48 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccca43f2bb723af798f598d4eb38384ce71dbf97074221d9c64895294512d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markPropTypesAsDeclared (cyclomatic 43, cognitive 45): markPropTypesAsDeclared has cyclomatic complexity 43 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5c425b4808eff201788646b797dd627d09ee65903ea4bedd54fb310ced63f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contextCompare (cyclomatic 39, cognitive 54): contextCompare has cyclomatic complexity 39 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"67843a51e9a66986fa0192a75c10e37d0816179c3a42fd41fa1b39e29c867756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markPropTypesAsUsed (cyclomatic 38, cognitive 62): markPropTypesAsUsed has cyclomatic complexity 38 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21f8b1639cd9b8a36a01798ecf4b48e8fe522468d763da33b2205cca810a442"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 20): (anonymous) has cyclomatic complexity 38 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/helpers/parsers.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4768c2b87bcbfb53edd8d199b12464359bf39cbd0abf8135dae8836fab592a74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReactHookCall (cyclomatic 36, cognitive 23): isReactHookCall has cyclomatic complexity 36 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74777e0554af09a973f5f1508494cafdfa849a8d7af5292d094b097a602395d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 30, cognitive 34): CallExpression has cyclomatic complexity 30 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":"lib/rules/hook-use-state.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"051f57b6c1c152985a2ad0b920793135e40e8d832016028ece05fa09322d8482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isConstruction (cyclomatic 30, cognitive 21): isConstruction has cyclomatic complexity 30 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-constructed-context-values.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"466aaa98ca7df746fd32d3c09fd0f608587955280cf657c3cdf97a2e39568645"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXOpeningElement (cyclomatic 29, cognitive 41): JSXOpeningElement has cyclomatic complexity 29 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d95171b8219117519e12e4086c06a32f4abaadc39cae7d84ccad6e8bf2bde8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markAnnotatedFunctionArgumentsAsDeclared (cyclomatic 29, cognitive 26): markAnnotatedFunctionArgumentsAsDeclared has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"lib/util/propTypes.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf95ce15f31a48ffbb5ab7cf26d796199699ec7ebe0acb7cb3213a11c7e39eab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VariableDeclarator (cyclomatic 28, cognitive 18): VariableDeclarator has cyclomatic complexity 28 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":"lib/rules/destructuring-assignment.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f55526c024cea07eddeef56e21caf0ff91f0e1ddb079eeca6490ef1b94bab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasTranspilerName (cyclomatic 27, cognitive 13): hasTranspilerName has cyclomatic complexity 27 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/display-name.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d23fb67d4bcf96f447bed340095e60c6b9d7d849f588635ad30decc3a73b35e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBraceSpacing (cyclomatic 25, cognitive 31): validateBraceSpacing has cyclomatic complexity 25 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":"lib/rules/jsx-curly-spacing.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d13b25945a923121198d47797127d7f769c127dd995d34c8df2613561b7482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReactDeclarationTypes (cyclomatic 25, cognitive 19): buildReactDeclarationTypes has cyclomatic complexity 25 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":"lib/util/propTypes.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bab77a7dc4e0adebd967f7994e118b83b7de6c900a325bad0c5dd09fceb9de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isDestructuredFromPragmaImport (cyclomatic 22, cognitive 35): isDestructuredFromPragmaImport has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/isDestructuredFromPragmaImport.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39f66adeb3d6261f1bd65f5dd555df2d33e01e8b4a3ea246158730ef5d05d7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 33): (anonymous) has cyclomatic complexity 22 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":"lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3286c8771cb8ad9f3b1b63bea21b6882c25b502a9e6488e5f8b00b23c888c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXAttribute (cyclomatic 22, cognitive 21): JSXAttribute has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-handler-names.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6b0ed57bfac863660cf0ae1673932c3ece128397eb869e05d9bacbf68b09df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchDeclarationByName (cyclomatic 21, cognitive 29): searchDeclarationByName has cyclomatic complexity 21 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":"lib/util/propTypes.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"0610124dce4b0d35a00dcced4bd18567e47fd0f95b0d1a4461efa71fb4d75806"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintUnnecessaryCurly (cyclomatic 21, cognitive 14): lintUnnecessaryCurly has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94949fe1f8f3e1e57c5f80cecb6c046f6e10650a467b9b3aa70aebf0d9dafac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 31): (anonymous) 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":"lib/rules/sort-comp.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"21218036de142a48152faa659d6f3dce9ce0a034af0a12a7d376b0b435ed60ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFunctionComponent (cyclomatic 20, cognitive 21): handleFunctionComponent has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bd11398ba3d3169b311bb42536fde15a1a4e80a7892f95bc7803fe137a8cf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 20, cognitive 17): validate has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc57aec3a9977353564c6e2ca806ac90618a2a4e7c8d7609ede760b61cd29f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXAttribute (cyclomatic 19, cognitive 32): JSXAttribute has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5ccce3270e9638a804db4afd605d0fccf9bcd4b096f70be43d81390e2dad53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 27): (anonymous) has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-prop-types.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"949efdf6f9ab4588e94e1a1c3ec76368797b974a063e2d3d9ca2b748726677d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 26): (anonymous) has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-newline.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ccc99ee5d6f2b50f280c8fda7e08659d5361512dbbf631b9488a0a4bc1c68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRelatedComponent (cyclomatic 19, cognitive 25): getRelatedComponent has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b06def86d729d0509bfb9d7dd5f44f48ed47ab301da8354554145561b32ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleOpeningElement (cyclomatic 19, cognitive 20): handleOpeningElement has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-indent.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1948cb1601954269466df0c0643c03a653dc9933a3720af9139d00f6b905a0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 19, cognitive 18): (top-level) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lib/rules/no-arrow-function-lifecycle.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b05901f900ac518a936d6af9022ece494b5ea09c0085c1e6e17ce403a0ff83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXSpreadAttribute (cyclomatic 19, cognitive 16): JSXSpreadAttribute has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"lib/rules/jsx-props-no-spreading.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b4bbe7c234ab5910b32f95d8bd1e190ef8643a1077bc1ffc0b6e66a44c1b84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 15): (anonymous) has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-comp.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8083d340589ffb3d9032ccc3d9b4585c0a4e24afc0d3b073adfb3b21b49b599"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VariableDeclarator (cyclomatic 19, cognitive 15): VariableDeclarator has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd61109080028975e26935a0f1cd7aeb9462f968d0e7792abb3510c8364df95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXAttribute (cyclomatic 18, cognitive 19): JSXAttribute has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unknown-property.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8f0a445f7125787439ca1973ae5b1552444b649336bc339084ea982fe5f73d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBinding (cyclomatic 18, cognitive 15): getBinding has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/function-component-definition.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c3ae3d5dcfbeef24d4a658d0afd7e47d83035aafff9a3899927eef8c6fb77b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isJSXValue (cyclomatic 18, cognitive 13): isJSXValue has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/jsx.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9698bb605431bd7726df5db85a1ff75d52328e137f6a348969204fe29218b90b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldCheckForUnnecessaryCurly (cyclomatic 18, cognitive 10): shouldCheckForUnnecessaryCurly has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a333c0bbf851f0a40b1cf5d6d044cbf0d471ff1e4dfab9f8cd6f5393eade84a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isComponentInRenderProp (cyclomatic 18, cognitive 10): isComponentInRenderProp has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e52eab50b09a525687694409f0019d576a3d79ebfc3361fb97e4f5434168e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleJSX (cyclomatic 17, cognitive 16): handleJSX has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"lib/rules/jsx-one-expression-per-line.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3e9a0e3f5ece9a5077ddf4ba051fe05b0dd59c453799a8230c8589faf61dcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCreateContext (cyclomatic 17, cognitive 15): isCreateContext has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/isCreateContext.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f5097aca6c8d40cc29176766a2dfa6223467e781b1e9c4f4ef5980052fc259"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VariableDeclarator (cyclomatic 17, cognitive 10): VariableDeclarator has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-deprecated.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b3ced8e49d21ce28b21cc91e8f2db5f51e9eb1f42af56c2964954183eae5d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReturnStatement (cyclomatic 16, cognitive 14): ReturnStatement has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/prefer-stateless-function.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88fc5ae041caf0bb6a555efda4f8d8d6e594ee46fe83a2b788306b2228d7ca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNodeViolationType (cyclomatic 16, cognitive 11): getNodeViolationType has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-bind.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4a36a2d4de6b7e195d4c72cb24cfa03281289c70d6469187598429ca78b6f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MemberExpression (cyclomatic 15, cognitive 28): MemberExpression has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-access-state-in-setstate.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce836235404099e0ef470bedba11277034548f79768e4402115cf0eca085c18b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function internalIsDeclaredInComponent (cyclomatic 15, cognitive 25): internalIsDeclaredInComponent has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/prop-types.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5176cc6619798f4c8883847cef543f3c36ac9f801b54248b7e84943dad5073d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isIdentifierShadowed (cyclomatic 15, cognitive 21): isIdentifierShadowed has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/display-name.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebce2152fb61717b58eb754371dad6a03e934cf11c13c3c1c161ff533666979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 15, cognitive 21): check has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-wrap-multilines.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4d477e3c4afed757de7525d0cec0a2f48dd08363dd09f8351f3346abf21154"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sorter (cyclomatic 15, cognitive 21): sorter has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypesSort.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542a971682c1510b5b8ecca35cf24ca4706d0975fc0c377acbd9c60f5aa4e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fix (cyclomatic 15, cognitive 18): fix has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-closing-bracket-location.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b5b07fdeabe0e06d7e00d934bc28acfe4853c12b32f0f929a97b830f6d957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeValuePossiblyBlank (cyclomatic 15, cognitive 18): attributeValuePossiblyBlank has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"46074ed4c4d564b0fb91008554845a9454fd8837ba9a35209472e7aad989617c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXOpeningElement (cyclomatic 15, cognitive 18): JSXOpeningElement has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-pascal-case.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"593dbc999524c1dd5f1d8d3ba0aa0c2109f68060acb984f46f5c6524954be384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-child-element-spacing.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"65317070a3708f394a590e7dcbdbe0c376c29715fba941dc2aff9efd1fa090ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXOpeningElement (cyclomatic 15, cognitive 13): JSXOpeningElement has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-first-prop-new-line.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21df48c15351f7f8d2a655ee6eaf7e637b207c4a3acd0ed293d8da638f3df28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isParamOfInlineCallback (cyclomatic 15, cognitive 12): isParamOfInlineCallback has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"137923f5f2a4ef504348e969ad1748c5ba63180488430b056a4e5e5943fdfb0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBeforeClosing (cyclomatic 14, cognitive 18): validateBeforeClosing has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-tag-spacing.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fec0d29c50e4a0250a979907c114adf0bdf26c3fc1e04180643d5975cc56e93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 14, cognitive 18): CallExpression has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-danger-with-children.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bfb4a14e897ee5ff068fec99a6c75c1470d07a7191bb06c3a0c22f2eecc125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-one-expression-per-line.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf11f0d84176b99bfdcad38d146b851281d20d369ab56b0f0cd8b871076e887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unused-prop-types.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc3d673350353e694a92f2ea81232991f9e03f6231173dbe1e785aa04b5c4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXOpeningElement (cyclomatic 13, cognitive 15): JSXOpeningElement has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-constructed-context-values.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"839aab22de45085ba119522b3512cf6613ae5d3b858c914fd0f3873914b4c81e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXExpressionContainer \u003E LogicalExpression[operator=\u0022\u0026\u0026\u0022] (cyclomatic 13, cognitive 13): JSXExpressionContainer \u003E LogicalExpression[operator=\u0022\u0026\u0026\u0022] has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-leaked-render.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86e6fd9b202a9e789a6354cb306a79043ff6b380dd7f0d2726b26e91c773929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateFixerFunction (cyclomatic 13, cognitive 12): generateFixerFunction has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"430fe7f18873fde08d7b068023b8679370e14846e18932cfb53a43a77f364d2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCreateProps (cyclomatic 12, cognitive 17): checkCreateProps has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-invalid-html-attribute.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"01edb8af697056756ecfbf31af4dc7aa13d039ff8a1e0b8cd25d169b89b256fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 12, cognitive 14): CallExpression has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unused-state.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a4b2e6c41b44875b10b5291987c23583c2d998f759dedf4d953b04d630e29a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFixer (cyclomatic 12, cognitive 11): getFixer has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/function-component-definition.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2e7e22a574b9241bc40af6f833bc82f5cede7bf7df3abfba2c00c7e6dee741"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 12, cognitive 11): create has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"793f8fb3824bbf49e6d7b1b1bca4a864490117e1fd25410b2cbeb09481b9f644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOverrideConfig (cyclomatic 11, cognitive 23): getOverrideConfig has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743f6459eeb20f34c685e7931c896fb26af0a99fd05ce1013696ac7e72e70d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStringFromValue (cyclomatic 11, cognitive 22): getStringFromValue has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"174279bc7973567a3ccf15858084f76d1e6ebda7dd51cb4584667cde87de9a6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportInvalidEntity (cyclomatic 11, cognitive 22): reportInvalidEntity has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unescaped-entities.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c9c532d78651b12971287504b82e78fd5d230fc6a629fce158d076c530555b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 11, cognitive 19): CallExpression has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/style-prop-object.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e307822c15e13e1146a1672bdabac7ed5d88a304beeddcff83fa539286f303b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ruleFixer (cyclomatic 11, cognitive 17): ruleFixer has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-leaked-render.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a063f27bc602acc141f4309a35834e6080589d6c0992f1389caf537b43903"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fix (cyclomatic 11, cognitive 13): fix has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-target-blank.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"458e6db7c3ad11de8d96ce2e3914cd2d30ce1e92e0095cc64bd1a21ded48f3fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitTSNode (cyclomatic 11, cognitive 13): visitTSNode has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e5e594e9019c8b22eff573ab2517e99ae01ec138d0dcd86f6a422d885ac93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkValidProp (cyclomatic 11, cognitive 11): checkValidProp has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-typos.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de5404039cd50b8fc3fee1884fde8cbca886e1b078a40a1d024727ffe99d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AssignmentExpression (cyclomatic 11, cognitive 10): AssignmentExpression has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unused-state.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf35561adbb4446281310b98ee5870dd1ade6aea44845433e1b22874d616d11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 11, cognitive 10): CallExpression has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/void-dom-elements-no-children.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d9698ae1b554a6a3450a014057e636953949689a56e96ac00acbc81d2ea325"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f679986c321c7045c1263dceed7abac251d69992c966ac9dd8697de3a94a2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSXAttribute (cyclomatic 11, cognitive 9): JSXAttribute has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/forbid-dom-props.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40f6747677520bbe592677d1f5294ab10bb69e4fadd6b04e0215e7cbe489693"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/forbid-prop-types.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f2f0195d90275ac372b58ac81aaf9944334a0460dcdd5a9acbb8494dce1e9b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/util/propTypes.js: 1288 lines of code: lib/util/propTypes.js has 1288 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa8a8f39510a4c579a8a36a35862a7faa9b53976d326bc4e98c480b4c4503fa"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/util/Components.js: 868 lines of code: lib/util/Components.js has 868 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/Components.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97000daa355ecc55b91890962000199c9a3acacfad0cdf2cd9a0c65b49ae55e7"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/no-unknown-property.js: 648 lines of code: lib/rules/no-unknown-property.js has 648 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unknown-property.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5edd907eed779d4d08c9d9851e79ff657d123243e9c4ff9aa6eaf41a2a1bfa"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/no-invalid-html-attribute.js: 586 lines of code: lib/rules/no-invalid-html-attribute.js has 586 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-invalid-html-attribute.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd97f754970cd1d40c2bd967f5d041cf5cf57b735be9e5a2e0139610a2c4022"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/util/usedPropTypes.js: 568 lines of code: lib/util/usedPropTypes.js has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/usedPropTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f6e6e7aa3f56d318e7d554350c1e7c4154abd8ce736925b37900a4d42e346"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/jsx-sort-props.js: 538 lines of code: lib/rules/jsx-sort-props.js has 538 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-sort-props.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821b89fe9536c4aed76ff8ed5cb194fb10fd7984f4413afd67baf61734974b9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/function-component-definition.js: 491 lines of code: lib/rules/function-component-definition.js has 491 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/function-component-definition.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1493de7c90e82d62dc1396a00dcbd1f6b749918b3e43f6a78c386e1cffc1f7b8"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/jsx-no-literals.js: 485 lines of code: lib/rules/jsx-no-literals.js has 485 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-no-literals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa81be3ed0619e5f5121c1122fd4b904bcda96a6526aead7f3e7f7e72e32256c"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/no-unused-state.js: 458 lines of code: lib/rules/no-unused-state.js has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unused-state.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"520b69778c2b264506e2955bf7349afc8effb05aaa69949642eeb35cdd239c08"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/util/ast.js: 438 lines of code: lib/util/ast.js has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/ast.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b8c4b349b1f77ae1aed12dbb5292fc558151cf092dd06500f77379d57e579e"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/no-unstable-nested-components.js: 429 lines of code: lib/rules/no-unstable-nested-components.js has 429 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/no-unstable-nested-components.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9e1ddf5cc3d4441650f50cadef94974f20f53d99d16c4b24ce2f33ff4f9322"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/jsx-curly-brace-presence.js: 425 lines of code: lib/rules/jsx-curly-brace-presence.js has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-curly-brace-presence.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1c16919fa454c1fc1f0308c1903313e33646bd6bb3d4492af273c557b548c"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/boolean-prop-naming.js: 417 lines of code: lib/rules/boolean-prop-naming.js has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/boolean-prop-naming.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b63ac0660f8aa9ba359478cabfbcc1527c73a7fe0fad5e622b43d2a496df51f"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/sort-comp.js: 405 lines of code: lib/rules/sort-comp.js has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/sort-comp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93452c8c6b5b09027d68dba8b1bd49ba95ea7f253d7704f39de803bebdfbf86d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/rules/jsx-indent.js: 402 lines of code: lib/rules/jsx-indent.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/rules/jsx-indent.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae49d7f85c81b88893d30f5ef65b172c496e2dd2355d34f18848cd0c48b833f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027glob\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"70383cf03107da7b95199f32558be143fecec5ce4ab29af9b166270952e6c145"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027jackspeak\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"495f30bca1ada5d46074722bdc2b24d30c910647f8efcf4a3b95386ddfc91583"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test-published-types/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-published-types/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"579930d0e582f8fed4f04543d9ba979abf56ae9e0fbf2f5347fd838598cf982f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jsxUtil.isLineBreak(child) \u0026\u0026 !jsxUtil.isEmptyExpressionContainer(child)\u0060 appears character-identically in 2 files \u2014 lib/rules/no-children-prop.js, lib/rules/no-danger-with-children.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":"lib/rules/no-children-prop.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4b186a57dc2d76c1f88f012d3425be1abd5deabb19138cffd29d888eaf6c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!previousIsCallback \u0026\u0026 currentIsCallback\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-sort-props.js, lib/rules/sort-prop-types.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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f4626debff83d56a4cf663cc4c5e358ea1f6c1535371b0f23e0c1873c5e597"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!variable || !variable.defs[0] || !variable.defs[0].node\u0060 appears character-identically in 3 files \u2014 lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.js, lib/util/variable.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":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb092a1074bc5d21187c6e14a6c992959cf83250cb857fa0539e53b5cbe778"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027right\u0027 in node.parent \u0026\u0026 node.parent.right\u0060 appears character-identically in 3 files \u2014 lib/rules/forbid-prop-types.js, lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ddd8f497bc11425bb0508c4ba81be51b5c3f9f3342915c2dd9fbe2c7c6cc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060blockNode \u0026\u0026 blockNode.type === \u0027ClassDeclaration\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/require-optimization.js, lib/rules/static-property-placement.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":"lib/rules/require-optimization.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747dde5a18132c09daac46c6711a9d8efc8404e7306688b1069ae226f012527"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060children \u0026\u0026 children.length === 1 \u0026\u0026 children[0].type === \u0027JSXExpressionContainer\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-no-useless-fragment.js, lib/rules/no-children-prop.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":"lib/rules/jsx-no-useless-fragment.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbecdacdb085b8590c9c5280fe7145bd7c6d140a121bc7d96d5a25061d7ae90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060componentUtil.getParentES6Component(context, node) || componentUtil.getParentES5Component(context, node)\u0060 appears character-identically in 2 files \u2014 lib/rules/no-access-state-in-setstate.js, lib/util/usedPropTypes.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":"lib/rules/no-access-state-in-setstate.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0202aa16dfe345a45819725f9b62934c45f18ee616675b86df1311781fdeec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060componentUtil.isES5Component(node, context) \u0026\u0026 components.get(node)\u0060 appears character-identically in 2 files \u2014 lib/rules/no-typos.js, lib/util/defaultProps.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":"lib/rules/no-typos.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f1f49e6c27fea4a42709d48de004130ed8cb15e703c7685883a8e0dd3cfc3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060componentUtil.isES5Component(node, context) || componentUtil.isES6Component(node, context)\u0060 appears character-identically in 2 files \u2014 lib/rules/no-deprecated.js, lib/rules/no-unsafe.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":"lib/rules/no-deprecated.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d0a214f428a2adf4334b2c195a95966d85eade61d3f08a8ca11d4533c660ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configuration.noSortAlphabetically || false\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-sort-props.js, lib/rules/sort-prop-types.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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c0e7c33b6cc15155272b2d8a1be707ba2fc9fbe8d0b9913e8e1d7a826472a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060curr.type === \u0027ExperimentalSpreadProperty\u0027 || curr.type === \u0027SpreadElement\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/sort-prop-types.js, lib/util/propTypesSort.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":"lib/rules/sort-prop-types.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48fd7514cca4127fdc5efea95a7ae93b2ba271d57c28b0ff7ca94a81eb5b2a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.type === \u0027TemplateLiteral\u0027 \u0026\u0026 expression.expressions.length === 0\u0060 appears character-identically in 2 files \u2014 lib/rules/forbid-dom-props.js, lib/rules/jsx-curly-brace-presence.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":"lib/rules/forbid-dom-props.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7cf41133bf1fb809d2c4dcc8097dad3a96f0b7ad4d243e622ed4109b6422b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node \u0026\u0026 (node.type === \u0027ClassProperty\u0027 || node.type === \u0027PropertyDefinition\u0027)\u0060 appears character-identically in 2 files \u2014 lib/util/propTypes.js, lib/util/props.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":"lib/util/propTypes.js"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f710ea9aa93e33ce2e1f4455614c4b1f808a55d45b7ca771ff605e814e1ed809"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node \u0026\u0026 node.type === \u0027ObjectExpression\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/no-typos.js, lib/rules/no-unstable-nested-components.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":"lib/rules/no-typos.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b736798848c1b9477c8c86fc883bc81f2d978a709f770888c9ea5c81eed6ffe5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.arguments.length \u003E 0 \u0026\u0026 astUtil.isFunctionLikeExpression(node.arguments[0])\u0060 appears character-identically in 2 files \u2014 lib/rules/display-name.js, lib/util/Components.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":"lib/rules/display-name.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13149c5ba65a3fcbc803407dce3a818ed7c514a35a53cc49eb44d84120529f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.decorators \u0026\u0026 node.decorators.length\u0060 appears character-identically in 2 files \u2014 lib/rules/prefer-stateless-function.js, lib/rules/require-optimization.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":"lib/rules/prefer-stateless-function.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"44849f884595d862b8ff4127e39f12def7e6da430736bb6005eae356ac685fb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.key || [\u0027MethodDefinition\u0027, \u0027Property\u0027].indexOf(node.type) !== -1\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.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":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd01b326e857d44ecadcfa35cd145aa6faed6f5222390dad68d15d34eb85f9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.parent.openingElement || node.parent.openingFragment\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-closing-tag-location.js, lib/rules/jsx-indent.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":"lib/rules/jsx-closing-tag-location.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fe70816e0a3d40e35da22a846cc389f9a411abc33cb9a1b0c0e20c7846354b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.source \u0026\u0026 node.source.value === \u0027prop-types\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/forbid-prop-types.js, lib/rules/no-typos.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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ee20a2a00ec9c977de3e6428848cef9105846dc14d67c755c3127812d175a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.source \u0026\u0026 node.source.value === \u0027react\u0027\u0060 appears character-identically in 3 files \u2014 lib/rules/forbid-prop-types.js, lib/rules/jsx-fragments.js, lib/rules/no-typos.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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec04ead27534c494ca454829add3b50f2bd4b9adcc8fe323471abf80af1caef9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0027FunctionExpression\u0027 || node.type === \u0027ArrowFunctionExpression\u0027\u0060 appears character-identically in 2 files \u2014 lib/util/Components.js, lib/util/ast.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":"lib/util/Components.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdde84411bcb5ed32868ffe8b650edeaf54efe9319731d1b8f543f20b216c4e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0027MemberExpression\u0027 || node.type === \u0027OptionalMemberExpression\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/no-array-index-key.js, lib/util/ast.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":"lib/rules/no-array-index-key.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"51af23792ce29249680345c51f8f16be8c2c45dc5ac312f3306f6a0d342087ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousIsCallback \u0026\u0026 !currentIsCallback\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-sort-props.js, lib/rules/sort-prop-types.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":"lib/rules/jsx-sort-props.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afc7b3c6ea7f35a1cc13d2780953a5137951674200c934c0eefd5beb06d07c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060propName === \u0027defaultProps\u0027 || propName === \u0027getDefaultProps\u0027\u0060 appears character-identically in 4 files \u2014 lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.js, lib/util/defaultProps.js, lib/util/props.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":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d311869113cf77bf38f6b15a6c12fe2cbfebc7a1f17f1bd361dc96ac09b82413"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060propTypesObject \u0026\u0026 propTypesObject.properties\u0060 appears character-identically in 4 files \u2014 lib/rules/forbid-prop-types.js, lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.js, lib/rules/sort-prop-types.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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dc04b0d3a7d634972d0bc21457627a27eae1c748eb0359df8a49d8de419506"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060returnStatement \u0026\u0026 returnStatement.argument\u0060 appears character-identically in 2 files \u2014 lib/rules/forbid-prop-types.js, lib/rules/jsx-key.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":"lib/rules/forbid-prop-types.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df6034a8e633af6339903b16a673501c4fefbb06330824be41c2207a947cfd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokens[1] \u0026\u0026 tokens[1].type === \u0027Identifier\u0027\u0060 appears character-identically in 2 files \u2014 lib/rules/jsx-sort-default-props.js, lib/rules/sort-default-props.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":"lib/rules/jsx-sort-default-props.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50817b4dae1376a094a47c1894d0739e06aecc654ecfdd76d32345856b52d93"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/util/propTypesSort.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bf2901b072454d6887b8e04e99843ce1e2c4b1f3bf022df28038e0c1dc5378"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":58,"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."]}]}