{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.get_type (cyclomatic 49): EntriesFilter.get_type has cyclomatic complexity 49 (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/docs/filters/tensorflow/entries.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f3a3091829e066223ec34cc1db8abc30626fad63d029066b1af32435dfb9b"}},{"ruleId":"D1","level":"warning","message":{"text":"handleKeydownEvent (cyclomatic 34): handleKeydownEvent has cyclomatic complexity 34 (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":"assets/javascripts/app/shortcuts.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d21bcbcb3a9dfccae1322bae3f51d1c445b6f149b0bd16bbf486fe67d791dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.get_type (cyclomatic 31): EntriesFilter.get_type has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/numpy/entries.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbde372ea237a927cc9458af6a12b0125a1cb2b94850137b19e3d3e4f70bb32"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanHtmlFilter.call (cyclomatic 28): CleanHtmlFilter.call has cyclomatic complexity 28 (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/docs/filters/rust/clean_html.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3691cdf8bf0f8328f707adb34dbc641fbd3af8de4c89bdcb7aebb77f9c570693"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanHtmlFilter.call (cyclomatic 26): CleanHtmlFilter.call has cyclomatic complexity 26 (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/docs/filters/sphinx/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1129236ecab2ec4d7c2cb61eb9927e3a8afbf6b0fc347af9ce7466f481030124"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.additional_entries (cyclomatic 23): EntriesFilter.additional_entries has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/eigen3/entries.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeeddd5e40c41040448934c9586df4d570b6efb7e4ccec790af3f54634139af"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.get_type (cyclomatic 20): EntriesFilter.get_type has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/ansible/entries.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed19c5345f8babddb7beea2ff9259dd6b880538a5633a1534d001d5e1cc4192"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanHtmlFilter.call (cyclomatic 19): CleanHtmlFilter.call has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/rxjs/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"df689ceaa22dec7af961bb3bf8011f348fa29ae03b9bd16c9616d9a2d5e8508c"}},{"ruleId":"D1","level":"warning","message":{"text":"viewTree (cyclomatic 19): viewTree has cyclomatic complexity 19 (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":"assets/javascripts/debug.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed7e54135a29577e2c79d0c59c39c81ea38c42638114e368c96a590898c21c2"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanHtmlFilter.call (cyclomatic 18): CleanHtmlFilter.call 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/docs/filters/sqlite/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab7c2ca559eaa4f65c3599ce2c70d09ef94a27b0c4d3b503ef949fdf27b7f2"}},{"ruleId":"D1","level":"warning","message":{"text":"scrollTo (cyclomatic 18): scrollTo 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":"assets/javascripts/lib/util.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb2d2ee31ed23977f2351fbec9af7a592a5b7ffb5971b5b7ba7b8ad9b07a86a"}},{"ruleId":"D1","level":"warning","message":{"text":"ImagesFilter.call (cyclomatic 17): ImagesFilter.call has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/core/images.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5e339cc1cc29bc20288f5e33eba08a726fba330d73883fa87d0e664b021a02"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanHtmlFilter.call (cyclomatic 17): CleanHtmlFilter.call has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/cppref/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c4778d501ec37193726c7de19a7d201089323721be18fb817729d496cd645"}},{"ruleId":"D1","level":"warning","message":{"text":"OldEntriesFilter.additional_entries (cyclomatic 17): OldEntriesFilter.additional_entries has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/node/old_entries.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd4824da08d0d34c2b6dfc8d501039b4d670bd009445a545d1001ad85ec0adf"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesV3Filter.get_type (cyclomatic 17): EntriesV3Filter.get_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/python/entries_v3.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee74ef1789d7d55321320df2391dda9e556ed93d27f533f4a75e6f467b89fad"}},{"ruleId":"D1","level":"warning","message":{"text":"Doc.outdated_state (cyclomatic 16): Doc.outdated_state 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/docs/core/doc.rb"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"39529ee5b0bf7068ea36d6fd27265f8c19ad5cd8418cf05ac5d8d6d81fa8438d"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.get_type (cyclomatic 16): EntriesFilter.get_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/css/entries.rb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"098ff1d0d8345eedacfc0bda9f2d0b7c959986780f67c479bbf5a3256815089a"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.get_type (cyclomatic 16): EntriesFilter.get_type has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/elixir/entries.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa901ba87a574c46cdc0f8190140307b341fcb0121e1c9dfa78620e3976219ba"}},{"ruleId":"D1","level":"warning","message":{"text":"EntriesFilter.additional_entries (cyclomatic 16): EntriesFilter.additional_entries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/http/entries.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25e567895dadb1f3e02dee300532df30d515c585cf5746f31f42681f08c11a"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 49): EntriesFilter.get_type has cognitive complexity 49 (threshold 15). Drivers by points: if/else 49. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/tensorflow/entries.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"63382596d7653c061c00e432bf56cb235af7d5a5882a6ddfc52fd576aa8f73c0"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 36): EntriesFilter.get_type has cognitive complexity 36 (threshold 15). Drivers by points: if/else 25, boolean chains 11 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/numpy/entries.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42e4e86742abc47e0733e76f9af2cbeb67eefad1bb8f2dcfa74f4bfe028853e"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 30): CleanHtmlFilter.call has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20, boolean chains 9, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/sphinx/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d710a702f38d7cc2e023f6b88c386bbc06ce7c75f2a43d66af873bd72dcb85e3"}},{"ruleId":"D2","level":"warning","message":{"text":"onDOMFocus (cognitive 30): onDOMFocus has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/views/sidebar/doc_picker.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a860a0d2fa64b52056b20c08a7e44b988546d8cde6004d1051c8cdad8a5e4cd"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 29): EntriesFilter.get_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/ansible/entries.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a12264bbef958b49424c67b1fc23bb44d7bbc97446298b9367fcc776818315"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 29): CleanHtmlFilter.call has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, boolean chains 8, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/rust/clean_html.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"94941acd83b0949ad1cfd8a53ffa90fa25fefd7b9787770b006f246f5198f1b5"}},{"ruleId":"D2","level":"warning","message":{"text":"handleKeydownEvent (cognitive 29): handleKeydownEvent has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/app/shortcuts.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"645526ae3188b0ddaa343baba08f305b039dd85ebf70f22d7d6e46f8bd0eff79"}},{"ruleId":"D2","level":"warning","message":{"text":"viewTree (cognitive 28): viewTree has cognitive complexity 28 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/debug.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2360f5a09781fe1ca1ccb94d2b20fcb433841a8646b6780e90d291236cce9d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 23): EntriesFilter.get_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/css/entries.rb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28d86fcac26e51906f52b7b7d1f89170852d6f5b3abfa388416d0e21508b7be"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.additional_entries (cognitive 22): EntriesFilter.additional_entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, boolean chains 8, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/eigen3/entries.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd86ff888e6869e7c88507700c200978df6bd15ab1204fb09a1568e58f9eccd5"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_name (cognitive 22): EntriesFilter.get_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/rust/entries.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4ba88eecebc60331bc81e2cf37c4806f89c977f6ef53f2bdd0b0c0580d0e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 22): CleanHtmlFilter.call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/sqlite/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa84d47ea490e1ecefcdf350399e30d2b8712b7c15413f9a299720c2e826ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 21): EntriesFilter.get_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/crystal/entries.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad86c2cf5f94ff7808c1f3a1981a89776d49b4ea497c88541e628e391d677ea"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.additional_entries (cognitive 21): EntriesFilter.additional_entries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/gnuplot/entries.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5e2ed218d1fd19f852c63cd0f3098b2830111a0030a9c7e32a954bb7d2922"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.additional_entries (cognitive 21): EntriesFilter.additional_entries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 5 (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/docs/filters/http/entries.rb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6617804892eea8b1ab162fe4a9b6253293dc1df6faaf9e9e58634d2093773b14"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_name (cognitive 21): EntriesFilter.get_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 5 (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/docs/filters/javascript/entries.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b87cb0e57aaf083bbcd85f15f255ecec3f22d40fa1b1d188f4a12efd484447"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 21): CleanHtmlFilter.call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/rxjs/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7cd506d74b7adb46f39c61780ac142b82bf826658cdd43a639a46b4d39835b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompatTablesFilter.add_data_to_entry (cognitive 20): CompatTablesFilter.add_data_to_entry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/mdn/compat_tables.rb"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6509499743aa0a2943782e93803997c9445e787cbe6bef6d7acde7661ee2768b"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryIndex.sort_fn (cognitive 19): EntryIndex.sort_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 4 (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/docs/core/entry_index.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cde0b60999c8aaa74e8e419c25d162e7f482c4212dc82e8da1fd51b9655eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"migrateDocs (cognitive 19): migrateDocs has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/app/app.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d111d0f76a551016d4e8de677241ca3a22ec0b16eb9b6405f733b62de4873a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 18): CleanHtmlFilter.call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 7, loops 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/cppref/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9afee96b0f346b162b91b11d6bce4fbb5f247c03b5dfdb9ec2071c90d16365"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanHtmlFilter.call (cognitive 18): CleanHtmlFilter.call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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/docs/filters/nix/clean_html.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631042b36a829e7c5b8ae896c6f235885558c1d8b86f71782c827c25d01cee4"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.additional_entries (cognitive 17): EntriesFilter.additional_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 3 (nesting depth added 9). 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/docs/filters/cordova/entries.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c475571d348750dbe6aa6af0221615349924754a0fad510eb472ea928b53a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ImagesFilter.call (cognitive 17): ImagesFilter.call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 4, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/core/images.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04924a831420877f637e7b5aa183c601bf893cb8f84d3629c068dcec833f87"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 17): EntriesFilter.get_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/eigen3/entries.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8362d9012a2aede3a76ba59146ebc7c329fc5cd664032154576fed2f6f96c71a"}},{"ruleId":"D2","level":"warning","message":{"text":"OldEntriesFilter.additional_entries (cognitive 17): OldEntriesFilter.additional_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/node/old_entries.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e7f15e5e67cdfa8cf43c7f4d8525dbbd52670017908cea9e77bf6188fe65a7"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 17): EntriesFilter.get_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 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/docs/filters/postgresql/entries.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a778dec1e2d5c51eb2ad5f74758465fe88be573599e68f8f5e59809d7ae87"}},{"ruleId":"D2","level":"warning","message":{"text":"scrollTo (cognitive 17): scrollTo has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/lib/util.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7a7d885d79c6da717fb4cd551c329a384f68d451cd06be388a84ef3ea1f4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"onClick (cognitive 17): onClick has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/views/list/list_fold.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed32d0e7aebc7337d39e7b4bafe88bdc41ce451057964c0f8d26a274a7e73d5"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 16): EntriesFilter.get_type has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6, if/else 5, match/switch 3, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/elixir/entries.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd218a41ed5f1dd8b758489d71804956e79ea04f3fb736745ffb74dc855a3c7"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.get_type (cognitive 16): EntriesFilter.get_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/javascript/entries.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ada47bd3edb18b070df13cf78dc3c24f2d74d4e0721eef3a8f3dc4ad9e4781"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesV3Filter.get_type (cognitive 16): EntriesV3Filter.get_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/python/entries_v3.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"51addd0f53b1d06390d2f8281da5620241160abb45430df5a39481f420813db1"}},{"ruleId":"D2","level":"warning","message":{"text":"EntriesFilter.additional_entries (cognitive 16): EntriesFilter.additional_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 4, boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/zsh/entries.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9bdc895f0b2e51bba9def16bdfa8ca5856b104e432bba60439c7a3c94f3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"scoreExactMatch (cognitive 16): scoreExactMatch has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/app/searcher.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"33294a6b6fd5d133744e63f4a071a1bfcacad73a6bd68081893fa3f0eb364e12"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractStore: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/storage/abstract_store.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6609e0b1d25d798bbabd86b662712a51c507b6a0025223640da3311eed0961c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/docs/filters/apache/entries.rb:26-43 | lib/docs/filters/tensorflow/entries.rb:99-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/apache/entries.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82528eca36800a31b92b67126e1dce6091dd4be035cf5202ee0da7f07372aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/docs/filters/nextjs/entries.rb:18-33 | lib/docs/filters/tensorflow/entries.rb:19-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/nextjs/entries.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d041ecdb79f705a8f9e79d9211a125cf84347c33313b1562a93f82c4007ec6be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/docs/filters/angular/clean_html.rb:34-47 | lib/docs/filters/rxjs/clean_html.rb:39-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/angular/clean_html.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf5b165e8e796c7d4c35002e7f80b20ea4ccc8ab70e7de3c1788c75f4ea9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/docs/filters/bootstrap/clean_html_v3.rb:31-44 | lib/docs/filters/bootstrap/clean_html_v4.rb:27-40 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/bootstrap/clean_html_v3.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a2df74f6c7a13f79bd932a1cc002872710d1d0c71415e61359580c702f6376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/docs/filters/prettier/clean_html.rb:62-75 | lib/docs/filters/react_native/clean_html.rb:62-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/prettier/clean_html.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4742a7f1d0daec01728551127b558a85c1070202ec71b4606275089ea3e399c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/docs/filters/cakephp/clean_html.rb:8-19 | lib/docs/filters/gnu/clean_html.rb:34-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/cakephp/clean_html.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8725616bffc836b197119ef8f2e7830a87ab7a6b7612eebdda2bf4a2e05dc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/docs/filters/godot/clean_html_v2.rb:12-23 | lib/docs/filters/godot/clean_html_v3.rb:12-23 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/godot/clean_html_v2.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e5390853f411f4003c2a5820aca020b9cfbb70dd889b634b1516b2d0de0a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/docs/filters/laravel/clean_html.rb:42-55 | lib/docs/filters/symfony/clean_html.rb:12-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/laravel/clean_html.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea81d6612a2975201338301aece5db8fceedbe0776ea60e75ddccf99b8214c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/docs/filters/scala/entries_v2.rb:14-25 | lib/docs/filters/scala/entries_v3.rb:15-26 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/scala/entries_v2.rb:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/scala/entries_v2.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"be69a0a186d1b115448c8a7900602d15c0457d8ff50a8ba2256d051b445cc281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/docs/filters/bottle/entries.rb:34-44 | lib/docs/filters/codeigniter/entries.rb:31-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/bottle/entries.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91c3d3427095e19ff0c7992233dcaf0de360a5090e4ff6d64819f5a5ee6ce1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/docs/filters/prettier/clean_html.rb:10-20 | lib/docs/filters/react_native/clean_html.rb:25-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/prettier/clean_html.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7bc5da85014a930640cddf1942f5c24bcb1563d8eb93e4b94ef282337fd5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/docs/filters/eigen3/clean_html.rb:7-16 | lib/docs/filters/man/clean_html.rb:5-14 | lib/docs/filters/odin/clean_html.rb:7-16 | lib/docs/filters/powershell/clean_html.rb:6-16 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/eigen3/clean_html.rb:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/eigen3/clean_html.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5196fd695690c126d015e7669e748b392347e5938fbc40c12fc270d59fe161f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/bootstrap/entries_v3.rb:36-45 | lib/docs/filters/bootstrap/entries_v4.rb:31-40 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/bootstrap/entries_v3.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a730c4488000c98f9ecd5ba1b544d88ffcb6bb0baa1047daa84de5e644787698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/cakephp/clean_html.rb:30-39 | lib/docs/filters/cakephp/clean_html_39_plus.rb:21-30 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/cakephp/clean_html.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a432fb7d016b16e0e597a192ec0ad89ca294c600028b1121b85fbaad77ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/electron/clean_html.rb:9-20 | lib/docs/filters/npm/clean_html.rb:9-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/electron/clean_html.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a75be884111e5db25e997c05ce154ba3e6d5746eed6cf17bf079e247150f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/flow/clean_html.rb:37-46 | lib/docs/filters/yarn/clean_html.rb:35-44 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/flow/clean_html.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"be163d78c6622c6546bd7d84e05e31ed9fa7cc874aec0445e0b245d54b11b24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/scikit_image/entries.rb:33-42 | lib/docs/filters/scikit_learn/entries.rb:47-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/scikit_image/entries.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a434c3e67ef911cbcf8225927e98e4a8d738877f599e813816496358390d0e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/docs/filters/terraform/clean_html.rb:5-14 | lib/docs/filters/vagrant/clean_html.rb:5-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/terraform/clean_html.rb:5\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/terraform/clean_html.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020bc68b6e6bd12c7a1fdce1aaf0d79ed86eeee12ad70c28b7f8d57f1060be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/docs/filters/flask/entries.rb:60-68 | lib/docs/filters/requests/entries.rb:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/flask/entries.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf34093b0f0fef90a039035a365d6554fe9642bfc5d5f18fa389486cf0ced0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/docs/filters/flow/clean_html.rb:56-64 | lib/docs/filters/yarn/clean_html.rb:47-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/flow/clean_html.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"491b409aeb42469b10997ea582b8f1d48ad2268543a1d7d4be7d22819c5ca608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/docs/filters/marionette/entries_v2.rb:19-27 | lib/docs/filters/marionette/entries_v3.rb:19-27 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/marionette/entries_v2.rb:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/marionette/entries_v2.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a49c5f2af8994c75352dcba3a39682bc3780bf17ef825f6c01a445e6dc0f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/docs/scrapers/angular.rb:40-48 | lib/docs/scrapers/rxjs.rb:48-56 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/scrapers/angular.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e2660bf763c38fc7df3d436eba854e0bf3cbb8d06b62f40b41a2382b29eeee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): lib/docs/filters/flask/entries.rb:9-16 | lib/docs/filters/requests/entries.rb:9-16 | lib/docs/filters/varnish/entries.rb:9-16 | lib/docs/filters/werkzeug/entries.rb:9-16 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/flask/entries.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"27086952c449ec1117ea5ff911b431968e25b68aff025028db6c9ede9f1a30f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/docs/filters/godot/entries.rb:22-30 | lib/docs/filters/godot/entries_v2.rb:27-34 | lib/docs/filters/godot/entries_v3.rb:21-28 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/godot/entries.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d4a090885981b65d0afb1ccd532161e271d705bf2794a339b112ba5f8e70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/docs/filters/jinja/entries.rb:21-28 | lib/docs/filters/jinja/entries.rb:29-36 | lib/docs/filters/jinja/entries.rb:37-44 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/jinja/entries.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"19051df47e81bda30907a9b7359161abf9c23a609ea25463202e4a0af0bffe22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/docs/filters/babel/clean_html.rb:10-21 | lib/docs/filters/npm/clean_html.rb:7-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/babel/clean_html.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e7f6aca17313a58b5dab2015848c8bc34ea04bde798bd0d6c20c3672f0887a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/docs/filters/elisp/clean_html.rb:24-33 | lib/docs/filters/gnu_make/clean_html.rb:20-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/elisp/clean_html.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827459756b5fd2c7287515af34a22b60dbc23f1797ea41dc0dcaa32eb54dc5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/docs/filters/chef/clean_html_old.rb:10-16 | lib/docs/filters/twig/clean_html.rb:9-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/chef/clean_html_old.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"126690e85e5b93fdcd20b9c29967aec7b5217aac3ae9a5b10f5520f13c36da98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/docs/filters/crystal/entries.rb:59-65 | lib/docs/filters/crystal/entries.rb:66-72 \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/docs/filters/crystal/entries.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a8af0af0094ad86879e9a074f2b2ba901abf4958bb3cf6540129bc9d38b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/docs/filters/angular/clean_html.rb:61-66 | lib/docs/filters/rxjs/clean_html.rb:66-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/angular/clean_html.rb:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/angular/clean_html.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d35878d47381d635d09b3550ea54a39e1261e1a0cf119b50f83fd42482ade2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/docs/filters/playwright/clean_html.rb:19-24 | lib/docs/filters/socketio/clean_html.rb:20-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/playwright/clean_html.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc90a517663e85c8ef8454c22905a1d841d9eb1dd4cd5f656a9f1534ccb2011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): lib/docs/filters/fluture/entries.rb:6-10 | lib/docs/filters/hapi/entries.rb:19-23 | lib/docs/filters/joi/entries.rb:19-23 | lib/docs/filters/nushell/entries.rb:8-12 | lib/docs/filters/sanctuary/entries.rb:19-23 | lib/docs/filters/sanctuary_def/entries.rb:19-23 | lib/docs/filters/sanctuary_type_classes/entries.rb:19-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/fluture/entries.rb:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/fluture/entries.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821322f91f229768a1749e6d0433ce7690825c8eb85e91bbf01cc0d9dc24587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): lib/docs/filters/hapi/entries.rb:7-11 | lib/docs/filters/joi/entries.rb:7-11 | lib/docs/filters/sanctuary/entries.rb:7-11 | lib/docs/filters/sanctuary_def/entries.rb:7-11 | lib/docs/filters/sanctuary_type_classes/entries.rb:7-11 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/docs/filters/hapi/entries.rb:7\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/hapi/entries.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"652eb0f908ee32ea997992ebfd8154aeefc3890c9356ba1151de2a4bfa208643"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/docs/filters/elixir/entries.rb: lib/docs/filters/elixir/entries.rb changed 2 times in last 90 days, max complexity 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs/filters/elixir/entries.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0082711dabb365f39b09c5db6ca6da32fb11b1dd46a55aba5fe0dc79fd99897f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: lib/app.rb, assets/javascripts/app/app.js, assets/javascripts/templates/pages/about_tmpl.js, assets/javascripts/views/content/entry_page.js, assets/javascripts/app/router.js, assets/javascripts/models/doc.js, assets/javascripts/templates/error_tmpl.js, lib/docs.rb. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"123c86b962b5d9ea95cb3ad14e96f4b5e55f15e54938587fa6c0d2b2105e8ce2"}},{"ruleId":"D28","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":"581882a917e3be04d16cc3bc0d168f74d72b3f5d19b58df270aca58efdc72470"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"cb8e8d8a900ecbc60c6accde9af00bfe2bbebdca5ac41981a491693d2a799aac"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15c7465bba61a67c0da3c6c58d53f94cf08d20cd00688e6ac12379a83ebc61c1"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15fd8f92e584d8ef4c8a299d212ee04ac6ffa32b41a22bc85c224bb5c40844a8"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8750074d2e20406a4b90093c70a4940c4512a95b88c1d3eed37c4040efe3573d"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c9bd328f1425e4185802e2cb388fc5dec17b2da92bc5227fa43622d89e747d7"}},{"ruleId":"D31","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":"b67787f58bbdcde79a43cc08af597219f8bc8ccd5a82b8588a8f7af6b62ec402"}},{"ruleId":"D31","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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D34","level":"note","message":{"text":"knowledge concentrated in recent work \u2014 freshness signal contradicted by repo activity: File-level freshness contradicts repo activity: 132 commits in the last 90 days, yet 22 of 35 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e461071eb7c3d0d8a5f27dee27c23fcaef1256b0b0ff28c50eb743e940dbe9d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: license.js \u2194 about_tmpl.js: \u0060assets/javascripts/lib/license.js\u0060 and \u0060assets/javascripts/templates/pages/about_tmpl.js\u0060 change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/lib/license.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c513899d1ca529b01b56df2c0d9f194eaca906fd37e3a93294b204d7d19476c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: settings.js, settings_tmpl.js, settings_page.js: 3 files \u2014 \u0060assets/javascripts/app/settings.js\u0060, \u0060assets/javascripts/templates/pages/settings_tmpl.js\u0060, \u0060assets/javascripts/views/content/settings_page.js\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/javascripts/app/settings.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f3410d6f4089b953ed4902921bce7865f223b95550414d5f5c0d56a560b304"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"}},{"ruleId":"D38","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":"10eb09819b13f97baca437cf62e19ae710cdb6cba4ab6895dd0c5704b0e08bec"}},{"ruleId":"D38","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":"7d45b234d9b8dace498a371a74dd9f00521661a404186984e2351f5e750a6773"}},{"ruleId":"D38","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":"88b967aaa4d6662a643f45209a8d1d3d45a5d13e87e6c5df00ecccbe521bb8d0"}},{"ruleId":"D38","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":"e6de7e94fecfa3363bd9be95a390120f2c98c061bcf995d8fa7ee68948517121"}},{"ruleId":"D38","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":"85a46127b47277768d6429ed13186e3f7be0f5590026e1a72f997b897032f849"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"CWE-328","shortDescription":{"text":"CWE-328"},"helpUri":"https://cwe.mitre.org/data/definitions/328.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":20,"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."]}]}