{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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":"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"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":"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":"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":"Constraint.match (cyclomatic 46): Constraint.match has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbee65735adcc7af4038f58d77814d8578d6b3898b841f1d28032b6c43d0391e"}},{"ruleId":"D1","level":"warning","message":{"text":"tree.parse_xml (cyclomatic 44): tree.parse_xml has cyclomatic complexity 44 (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":"pattern/text/tree.py"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd8a197f4d2f0a09f8dcf0330f1dc8892e1ba9f69c5b22765b28ce89fdccbe"}},{"ruleId":"D1","level":"warning","message":{"text":"Query.SQL (cyclomatic 43): Query.SQL has cyclomatic complexity 43 (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":"pattern/db/__init__.py"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"762a4965933af643db3aec8b5b38345982f6e87ff2278345ab64706b18738444"}},{"ruleId":"D1","level":"warning","message":{"text":"canvas.widget (cyclomatic 39): canvas.widget has cyclomatic complexity 39 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d61519588a7b9649b7ef8df0d4f1ebaef7de290d61bcfa26690dc6f6c0ea4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Sentiment.assessments (cyclomatic 38): Sentiment.assessments 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":"pattern/text/__init__.py"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d041a82f4620bfd40be73e4e6a54f931aac31ec772c67c8e499ca914fbb0bc2"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.singularize (cyclomatic 36): inflect.singularize has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"282da8c1dac1199609fded30896f1370108ff4a5e11e93c48f4227935649725d"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.apply (cyclomatic 34): Context.apply has cyclomatic complexity 34 (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":"pattern/text/__init__.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb1acc326dd15ff143f9d68ee8ef17d3d1b34c36b50e0cfd81a074b9676d62b"}},{"ruleId":"D1","level":"warning","message":{"text":"Pattern._match (cyclomatic 34): Pattern._match has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"305335441d4a2a2d224c90ccafb6e5f699758af9d91ed632bdaeb8b6f6394b82"}},{"ruleId":"D1","level":"warning","message":{"text":"init (cyclomatic 33): init has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"05366e9a93ec12f6b49a082fe3fa00922417b169758704a3f37b03b701be2cc1"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lemma (cyclomatic 31): Verbs.find_lemma has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"32973d16c874da84e50b45b4dc52fa6cfccf25375a9fbb687de1ed5cefac50be"}},{"ruleId":"D1","level":"warning","message":{"text":"db.date (cyclomatic 30): db.date 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":"pattern/db/__init__.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"517036808bb1c446ec79fafd279d230ca5e84adcc4e4e6c7d037f9e4e8993df1"}},{"ruleId":"D1","level":"warning","message":{"text":"HTMLCanvasRenderer._data (cyclomatic 30): HTMLCanvasRenderer._data has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe33028a4388b0e46c1dc16c894c1fc19e0849ed186b250fb4ea0e44bc897fef"}},{"ruleId":"D1","level":"warning","message":{"text":"text.find_tokens (cyclomatic 29): text.find_tokens has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f69f0a921491cc93b1f4faa83f21c570771e3a4aad00f196c1e42920c9639a9"}},{"ruleId":"D1","level":"warning","message":{"text":"text.find_keywords (cyclomatic 29): text.find_keywords has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e5f90d403699ed7a0db708268d8294d947f74940d55fceb3a4de3c79aa145"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.pluralize (cyclomatic 29): inflect.pluralize has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1250c40dfe06c7b3e76ea96c71750231113cc34307e8a4a2df2dbb56a3106"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lemma (cyclomatic 28): Verbs.find_lemma 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":"pattern/text/nl/inflect.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5061eb038556374fcd66fa111038087f7e17481585dcea14a586339a6ee757f7"}},{"ruleId":"D1","level":"warning","message":{"text":"liblinearutil.predict (cyclomatic 26): liblinearutil.predict 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":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7448aa37515eb55e847eda4061b6309c895e75fd2783f7756fcbe7f2c88561"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.predicative (cyclomatic 25): inflect.predicative has cyclomatic complexity 25 (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":"pattern/text/fr/inflect.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af59bfc1c9fd0676685f14893affa0b18d648c6973a5cf70e3fa877db0a2b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"parameter.parse_options (cyclomatic 25): parameter.parse_options has cyclomatic complexity 25 (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":"pattern/vector/svm/liblinear.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce7db878e326dd0e6c3ef5b4e0abe828173cdb8744acb3c6a34abc0292e05ef"}},{"ruleId":"D1","level":"warning","message":{"text":"URL.open (cyclomatic 25): URL.open 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":"pattern/web/__init__.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7a0283e2b2a5ea6047694540f49ebb7777bb1392b4a334a1b1fbf8680fa68b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::stroke (cyclomatic 25): (anonymous)::stroke 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":"pattern/canvas.js"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8171611ddc24aa3fcef7d315a31d7e46fe7ab67999c716bc3fcd9c68eeb26ac"}},{"ruleId":"D1","level":"warning","message":{"text":"text.find_relations (cyclomatic 24): text.find_relations has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a11b2f5cc11ba74d7a50ecaedc459d65b161b1a662d78fac1f83aaea90270cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Word.tags (cyclomatic 24): Word.tags has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc6a422544fdf28bc95c89cf1cf8ebd20b504ba3bc81be4173f4aa84c4743b2"}},{"ruleId":"D1","level":"warning","message":{"text":"image (cyclomatic 24): image has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd61b1d20459be7f2cc2850c2319cb020314cfe504105936da4cd42f579a39"}},{"ruleId":"D1","level":"warning","message":{"text":"CSV.load (cyclomatic 23): CSV.load 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":"pattern/db/__init__.py"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6b428017b71e02abc297203d98d10e99963f44c6d80385907f57cd6c6f421c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parse (cyclomatic 23): Parser.parse has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d5e9c1f6f3ee17937c5a08735c47804d2470df075042ac4be5d7735182f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"text.tense_id (cyclomatic 23): text.tense_id 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":"pattern/text/__init__.py"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e3081aca00c48fbb4d8054a810373726e22e2a34e3a3585eba790532700517"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.pluralize (cyclomatic 23): inflect.pluralize has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b93691e392d3a8109657148e3b444703f2961b25d8e1cf7d742a11e48dd18"}},{"ruleId":"D1","level":"warning","message":{"text":"modality.modality (cyclomatic 23): modality.modality has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/modality.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7d162d95c37cdd2574e63527737a2adde44559d10e304abd14ed467f988322"}},{"ruleId":"D1","level":"warning","message":{"text":"canvas.derive (cyclomatic 23): canvas.derive 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":"pattern/canvas.js"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd873eca2b696223fa73482ed6ff5f4e8fb3d6f3106b387d0b1f059c7831a13"}},{"ruleId":"D1","level":"warning","message":{"text":"canvas.blend (cyclomatic 23): canvas.blend has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"pattern/canvas.js"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e578b951901f53c3f2410786847db42a0ea7e652fee14ff5e82080f25a04519"}},{"ruleId":"D1","level":"warning","message":{"text":"text.find_tags (cyclomatic 22): text.find_tags 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":"pattern/text/__init__.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8520cf1c40a41d820997e4e20f7cd47eda2ab6d4701c844e2a67cdb277439fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lemma (cyclomatic 22): Verbs.find_lemma 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":"pattern/text/de/inflect.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2c55d176f39a1f27e1911fb06be8a1ff34e242d5e160375917e658f2ccc208"}},{"ruleId":"D1","level":"warning","message":{"text":"modality.subjunctive (cyclomatic 22): modality.subjunctive 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":"pattern/text/en/modality.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ef3208ebf2949a5192cdcf9c1aa1b3838912012fd23e0160654eca0656fa10"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.Graph.brandesBetweennessCentrality (cyclomatic 22): graph.Graph.brandesBetweennessCentrality has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec51a45061519e516b6658f5e1ce52ad369787e2c714428d76b28a01e99879"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.Graph.eigenvectorCentrality (cyclomatic 22): graph.Graph.eigenvectorCentrality has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d494d6b8cc5651ae389fbdd1cd3491b5cf91b38ea4e5f646160c8ec1b8e96914"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.__init__ (cyclomatic 21): Schema.__init__ has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"a531dca90b4bda1a0c750296eccc533049ffce25179c57f5678992a64bb5c523"}},{"ruleId":"D1","level":"warning","message":{"text":"modality.conditional (cyclomatic 21): modality.conditional 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":"pattern/text/en/modality.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6479bc576797bff742966c9a560ee674e8cd6408ecdfdeaf6052cb381e4e1781"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.singularize (cyclomatic 21): inflect.singularize 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":"pattern/text/fr/inflect.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cacdbdfb09673bf7e17f3ced49ec47113e1e5786581accee9ced615b872d742"}},{"ruleId":"D1","level":"warning","message":{"text":"Sentence.slice (cyclomatic 21): Sentence.slice 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":"pattern/text/tree.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ef4202ecc30f1cabb1e7226da4f581899283325f323241ab5ad7ff0ddd0c29"}},{"ruleId":"D1","level":"warning","message":{"text":"svm_parameter.parse_options (cyclomatic 21): svm_parameter.parse_options has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/libsvm.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b266e9592ccec61d18f1b724b639e42f0ccc3b97cc7dd7664cb52567f770fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"db.cmp (cyclomatic 20): db.cmp 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":"pattern/db/__init__.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6933c883fee5619cfa600e226b966c8fdb33f46623bd6ab9e6928459990420bf"}},{"ruleId":"D1","level":"warning","message":{"text":"NGrammer.frequentPhraseMining (cyclomatic 20): NGrammer.frequentPhraseMining 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":"pattern/text/__init__.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa4ddd931e45a976176ef1ee9c4fdef03988d4682a1bcd298f2eb0e7d8e93d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lexeme (cyclomatic 20): Verbs.find_lexeme 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":"pattern/text/de/inflect.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d5910057d100447c63e76235cab41df1800cf7dc050584d6f507d171c0731"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.singularize (cyclomatic 20): inflect.singularize 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":"pattern/text/en/inflect.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e3db724f9191d6c696769832b516b962871acfee1c996c224e48cbdfb1cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect_quantify.numerals (cyclomatic 20): inflect_quantify.numerals 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":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d8a23ab1dd269f412617a938887e8a3146d751b20114b40cf00254b2faf03d"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lexeme (cyclomatic 20): Verbs.find_lexeme 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":"pattern/text/nl/inflect.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3f33346fc86ec47792d238ab8a95b06b5c4a66af3a5bc13662eba9534cca7"}},{"ruleId":"D1","level":"warning","message":{"text":"problem.__init__ (cyclomatic 20): problem.__init__ 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":"pattern/vector/svm/liblinear.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"be711cbef10734a3a451ee99664901ea1caf40b90e2763a32872eecb594ede04"}},{"ruleId":"D1","level":"warning","message":{"text":"Bing.search (cyclomatic 20): Bing.search 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":"pattern/web/__init__.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"543756e9753e43c95be54b09a6e27bc22f289b6c8014368e33999e0885cc3099"}},{"ruleId":"D1","level":"warning","message":{"text":"Twitter.search (cyclomatic 20): Twitter.search 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":"pattern/web/__init__.py"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5294dd2a73147c7266e8fa03c5c480e9eb7941173b8b1e18cb8b9b24db0849"}},{"ruleId":"D1","level":"warning","message":{"text":"metrics.cooccurrence (cyclomatic 19): metrics.cooccurrence 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":"pattern/metrics.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0bd8b79ec18095efb4c0ad540c3a298f45b301ac2bd564ddcd448f7073f77d"}},{"ruleId":"D1","level":"warning","message":{"text":"text.find_chunks (cyclomatic 19): text.find_chunks 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":"pattern/text/__init__.py"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"50de874acf07740d65517466a8ecca7536bb0779e9c6cf27b4f077eb3d0616c5"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.pluralize (cyclomatic 19): inflect.pluralize 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":"pattern/text/de/inflect.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1266b2436ba19b46c86d155a9c5f916dbfeef8ac652dab4b602cdc8fa26bb36"}},{"ruleId":"D1","level":"warning","message":{"text":"modality.imperative (cyclomatic 19): modality.imperative 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":"pattern/text/en/modality.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4037ebeda21b6168ff1f198314678a6e69da56193432688c9abd8284b2ffbc"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.predicative (cyclomatic 19): inflect.predicative 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":"pattern/text/nl/inflect.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b65d57ef3c9ad7039bfd00bbc0d545f7f8d75053e0ecba40f916b51271f21"}},{"ruleId":"D1","level":"warning","message":{"text":"canvas._stackblur::stackBlurCanvasRGBA (cyclomatic 19): canvas._stackblur::stackBlurCanvasRGBA 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":"pattern/canvas.js"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a20b4b1beb0bdbdc6a38aab163ac595d27548ea7abd4c12a2bf567f59aeaf74"}},{"ruleId":"D1","level":"warning","message":{"text":"Database._field_SQL (cyclomatic 18): Database._field_SQL 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":"pattern/db/__init__.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"134d0450bffdeb3cf572ac405436d3a352b4371d770f0cf7d55c3410e88f5551"}},{"ruleId":"D1","level":"warning","message":{"text":"db.xml (cyclomatic 18): db.xml 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":"pattern/db/__init__.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e155b4f7ad4810e49478b77ddfc733ba0755e1f2e116daf3ff09db799796693b"}},{"ruleId":"D1","level":"warning","message":{"text":"Morphology.apply (cyclomatic 18): Morphology.apply 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":"pattern/text/__init__.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5054d5434e896962b61dc695cea69b1fa7bde61fc8a25b61946d55a4d89444ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lemma (cyclomatic 18): Verbs.find_lemma has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/inflect.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec92a6e9089f26258ecbf6714e866ecc0278c5f414ec6cffa1f292e61bab372"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.attributive (cyclomatic 18): inflect.attributive 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":"pattern/text/nl/inflect.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a54237732184f51e6be1aa02ffbfa09f926a7e87647e02218c7bba757877f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Pattern.match (cyclomatic 18): Pattern.match has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f07a55cdf6d3c00d7e3982ce6f2db11af9f3dd6239ce81338e5b47e036a8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"tree._parse_tokens (cyclomatic 18): tree._parse_tokens 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":"pattern/text/tree.py"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"482e872bff53736825ab1148aa23676e33de87044bfbb93091ac331441c4d6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.resample (cyclomatic 18): Model.resample has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"035db5a0badb2af5044d4b23ae2c0c52ecd331398e19ea01fc72879b17093ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"Yahoo.search (cyclomatic 18): Yahoo.search 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":"pattern/web/__init__.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bc3b6e84f195a9d970df67cd36a3852dac3ac5318aee553888adf27087a687"}},{"ruleId":"D1","level":"warning","message":{"text":"Facebook.search (cyclomatic 18): Facebook.search 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":"pattern/web/__init__.py"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9ab4e488e726cdc8a7a3f9708ca57b3c30916ed47f15d12a51ed4e8ab41a49"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.grade (cyclomatic 17): inflect.grade 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":"pattern/text/en/inflect.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0149b3e5a4152f60041ec329e765f07e05e750c3cf518daa67ac28b435e246"}},{"ruleId":"D1","level":"warning","message":{"text":"liblinear.gen_feature_nodearray (cyclomatic 17): liblinear.gen_feature_nodearray 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":"pattern/vector/svm/liblinear.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b440c4c948bd640c753b030da86a60e1b001435da10eb160db10bba58fdbd0ab"}},{"ruleId":"D1","level":"warning","message":{"text":"init (cyclomatic 17): init has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8895ff6662ea4f98c4e1078d17b464bee563f844902f5c8914b91c2ac52d5b80"}},{"ruleId":"D1","level":"warning","message":{"text":"_addNodeCopy (cyclomatic 17): _addNodeCopy 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":"pattern/graph/graph.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b99957dddbf209bbd67a0413872145a713b8f055e0c6f823339f1284c05bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Datasheet.group (cyclomatic 16): Datasheet.group 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":"pattern/db/__init__.py"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ee0360abfc6add598ccdee71bb28b0ea653d8dd1fa467a93d812e394c343db"}},{"ruleId":"D1","level":"warning","message":{"text":"db.parse_xml (cyclomatic 16): db.parse_xml 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":"pattern/db/__init__.py"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01c649e7374bd91b712e246db21958463a31413d9fa47491970774ead216949"}},{"ruleId":"D1","level":"warning","message":{"text":"Template._compile (cyclomatic 16): Template._compile 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":"pattern/server/__init__.py"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bc478d92df645436065eff9dee7b4eedf61457506793ef1558df183e0945b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Verbs.find_lexeme (cyclomatic 16): Verbs.find_lexeme 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":"pattern/text/en/inflect.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10258a3e2ea7884ff4be605214d0af76977736d5bc25dc75126d3a62b74f5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect_quantify.approximate (cyclomatic 16): inflect_quantify.approximate 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":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a613a3b04dd7f63ba714bbd333f73c700c410fa72adcee841b331193ccde7c0"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect_quantify.count (cyclomatic 16): inflect_quantify.count has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dea038c8b3f28d43982f74985c9d5f1f679cc7c0b1a46b9d07a0e8686a70c19"}},{"ruleId":"D1","level":"warning","message":{"text":"inflect.singularize (cyclomatic 16): inflect.singularize 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":"pattern/text/it/inflect.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e99a9aa417b5f12a47c9f902cb8102237f8a887d6525c28f415cc348771006"}},{"ruleId":"D1","level":"warning","message":{"text":"tree.graphviz_dot (cyclomatic 16): tree.graphviz_dot has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f3725300990ed78646bd100da6be7d1b7e64312c783a0058b6004092f2352"}},{"ruleId":"D1","level":"warning","message":{"text":"vector.k_means (cyclomatic 16): vector.k_means 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":"pattern/vector/__init__.py"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccd688a61dfd67ca9f9772b5aea16470353f947ec3e71bedcac88256931267e"}},{"ruleId":"D1","level":"warning","message":{"text":"stemmer.step_1b (cyclomatic 16): stemmer.step_1b has cyclomatic complexity 16 (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":"pattern/vector/stemmer.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"27853642036dbc9128c6d7d02c76066d260c6c262deb1050d418750f5f11f499"}},{"ruleId":"D1","level":"warning","message":{"text":"libsvmutil.svm_train (cyclomatic 16): libsvmutil.svm_train 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":"pattern/vector/svm/libsvmutil.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e23b4d45bfe94670e8db62abbcdb0d4f08d9e683ca99942ea9d8e57c5233435"}},{"ruleId":"D1","level":"warning","message":{"text":"DuckDuckGo.search (cyclomatic 16): DuckDuckGo.search 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":"pattern/web/__init__.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba91f2c1ebe64296977ee1b37a4a4639130a6a7a35341d90c9f8809e743cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"draw (cyclomatic 16): draw 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":"pattern/canvas.js"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7521cd463c402174ff36d57d87d66947c3917e1958e83348fe19512aa4a82be3"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern._match (cognitive 88): Pattern._match has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (70 pts), boolean chains 11, loops 3 (7 pts) (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a7fc2fd7de1393461507f683ca95471c1d2a44b4b2169c72ece6cd70046bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Sentiment.assessments (cognitive 77): Sentiment.assessments has cognitive complexity 77 (threshold 15). Drivers by points: if/else 16 (48 pts), boolean chains 13, loops 5 (13 pts), ternaries 2 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"57be4e675cb155a066549a934cd98e2573a7dda96360c7b53c39dcb99a092006"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_tokens (cognitive 72): text.find_tokens has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 6 (14 pts), boolean chains 7 (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":"pattern/text/__init__.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeca9986827a4323bce9ae3799110440bda19929ba26e1251b7e442f9429be1"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.match (cognitive 70): Constraint.match has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 24, loops 3 (8 pts), error handling 1 (3 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":"pattern/text/search.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"de895a0d8b287945532808e0821c548a68f695dbd326107d491d9f3d9102620b"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.singularize (cognitive 69): inflect.singularize has cognitive complexity 69 (threshold 15). Drivers by points: if/else 25 (59 pts), boolean chains 10 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a35b0403b8655613fd874cdb80923f1c0c202e25a704209151e81b1d0d2bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.cooccurrence (cognitive 66): metrics.cooccurrence has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (59 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 48). 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":"pattern/metrics.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3081ca6230f043e8288ac263389d9b62ed7d0c6513843181d4d237f218d7b5f1"}},{"ruleId":"D2","level":"warning","message":{"text":"NGrammer.frequentPhraseMining (cognitive 64): NGrammer.frequentPhraseMining has cognitive complexity 64 (threshold 15). Drivers by points: if/else 11 (43 pts), loops 8 (20 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5ed1e57025540203ed624a01cd9fd0fc556ad6bed3d6f2f858ff5ffef4e0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_keywords (cognitive 60): text.find_keywords has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 5 (15 pts), loops 7 (11 pts), boolean chains 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3fc66e69a780c14ba577f288b462135d8115024affd573baf3cb40ca3e89d0"}},{"ruleId":"D2","level":"warning","message":{"text":"modality.modality (cognitive 55): modality.modality has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 5 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 33). 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":"pattern/text/en/modality.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"86847ae198ca309070c17e466b451e816eb14acd2c2e220559ccd4c81794e482"}},{"ruleId":"D2","level":"warning","message":{"text":"tree.parse_xml (cognitive 53): tree.parse_xml has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 32, if/else 9 (19 pts), loops 2 (nesting depth added 10). 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":"pattern/text/tree.py"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d358b99ca739bb06cadd02c5545175402773d9c37322326bf98d13954a78a6"}},{"ruleId":"D2","level":"warning","message":{"text":"widget (cognitive 51): widget has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 13, ternaries 4 (11 pts), loops 1 (3 pts) (nesting depth added 17). Of this number, 36 points are the body\u0027s own statements and 15 belong to 7 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":"pattern/canvas.js"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacbc7094c29a6885c3103b4925b178ac3987a37c18f0559bb434b83260c58f1"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLCanvasRenderer._data (cognitive 49): HTMLCanvasRenderer._data has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 5, loops 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d0740f091909564af2b7c849d922f2795c1ba87925374ec0ed0804955fae5"}},{"ruleId":"D2","level":"warning","message":{"text":"Query.SQL (cognitive 48): Query.SQL has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 23, if/else 11 (19 pts), loops 5 (6 pts) (nesting depth added 9). 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":"pattern/db/__init__.py"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bda7fd212b5cbefe006ccc385dc1deb2a47a8edea39b4b7bfd373ef90f8dd65"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.pluralize (cognitive 48): inflect.pluralize has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ed80930372f58b1a6182b8ea6795d5d9f2a7d812e272ed754cdb29b8f6d0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_relations (cognitive 47): text.find_relations has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 7 (15 pts), boolean chains 7 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9965e86991e5c5b34b62de7995d1e9f0c05d98abb8dc730c9cf120b7197eca28"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.pluralize (cognitive 44): inflect.pluralize has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 7, loops 2 (3 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":"pattern/text/en/inflect.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26e15da1f21085c5e3bbf4e6815c70dde6e17941747d661ab0e1dc42f010b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::stroke (cognitive 44): (anonymous)::stroke has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts), ternaries 1 (nesting depth added 22). 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":"pattern/canvas.js"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"732d48a4e4873a37fc61cad5047d49772608dbbd2ce2b4a31b51323cb988d188"}},{"ruleId":"D2","level":"warning","message":{"text":"init (cognitive 43): init has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 13 (16 pts), boolean chains 9 (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":"pattern/canvas.js"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5088289b8bbc8926c28b37fd9452c6332c659617b98fd1322a93862ea8f00e"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.apply (cognitive 42): Context.apply has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 27, if/else 3 (9 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). 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":"pattern/text/__init__.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00f95ccf62f03dd84392822d3e42f14e137af04aa3db47cf94f0a088473f2aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lemma (cognitive 42): Verbs.find_lemma has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 10 (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":"pattern/text/en/inflect.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbd28253d4105dcb04d838749bdb09445c7adfd679d70e4b0611a5205fc944b"}},{"ruleId":"D2","level":"warning","message":{"text":"liblinearutil.predict (cognitive 39): liblinearutil.predict has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 7, loops 3 (5 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":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bd6ea581496ae6e142578a44091d1ddff427ef82cef032bc8bcbad830be2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_stackblur::stackBlurCanvasRGBA (cognitive 39): _stackblur::stackBlurCanvasRGBA has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 7 (14 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"61359693e8544c7f0881e88c90eeb6ef757459348510eaa0ae9ca3ab940bd78b"}},{"ruleId":"D2","level":"warning","message":{"text":"Entities.apply (cognitive 38): Entities.apply has cognitive complexity 38 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (13 pts), ternaries 2 (10 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa898718a38f16d42589754ddf8d4176686980f2c36217b0d4ce0b40d7fdafc9"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_chunks (cognitive 38): text.find_chunks has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"161fcca38c092c9a3e867d898ceab7d22d453c46be8726477c01837b57f5d4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"modality.conditional (cognitive 38): modality.conditional has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/modality.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e0bf4d86f80429e9914f4ade7e623ea66f9bc8912089badbd2cc322f33b805"}},{"ruleId":"D2","level":"warning","message":{"text":"vector.k_means (cognitive 38): vector.k_means has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 7 (17 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6c8b9728bd0d1817ba5ccfa81a9b06a60ea87c4d65f7b5b964d662f987b869"}},{"ruleId":"D2","level":"warning","message":{"text":"Crawler.crawl (cognitive 38): Crawler.crawl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":4167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b608b67f51947f87a10ee5e24231f47527e9bd1e300fdaa7ef554289665846"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.Graph.brandesBetweennessCentrality (cognitive 37): graph.Graph.brandesBetweennessCentrality has cognitive complexity 37 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 7 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae3c0826e70a63c1a91459e2a11806d3c7611a4957624530b91e493482fed4d"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.pluralize (cognitive 36): inflect.pluralize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/inflect.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf09131b69b830232e4671fb37f4f0d98ab67d1698c757857ea1477271c2337"}},{"ruleId":"D2","level":"warning","message":{"text":"URL.open (cognitive 36): URL.open has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 pts), error handling 6, boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d7974cab79f764d4b581976a2e11d51e096fbd238c721e196998a46b789124"}},{"ruleId":"D2","level":"warning","message":{"text":"eigenvectorCentrality (cognitive 34): eigenvectorCentrality has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 8 (9 pts), ternaries 2 (7 pts), boolean chains 2 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1d04f9696fe22d035515552982e9cff29c3350096cd5ecd15da24cc5321e3"}},{"ruleId":"D2","level":"warning","message":{"text":"db.date (cognitive 33): db.date has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 6 (10 pts), error handling 2 (6 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c871dc3406d442f3811e4549f92830685a8ccd6d026fa6c76a0373cdcd1892"}},{"ruleId":"D2","level":"warning","message":{"text":"modality.subjunctive (cognitive 33): modality.subjunctive has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/modality.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca7a83ae91870a53ea206911c55e53835452a3291c8ad173d292e1c1cc1f9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse (cognitive 31): Parser.parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (6 pts), 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":"pattern/text/__init__.py"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aa55ea3aed5bd1765385c3723e644c3762130cf11a88041f159fadfbf55882"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_prepositions (cognitive 31): text.find_prepositions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122164cd496da7f7c1b0593e3e479fe1453bd081ef8581feeab3808483a34b9"}},{"ruleId":"D2","level":"warning","message":{"text":"db.cmp (cognitive 30): db.cmp has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c857b187f9e736f80e277ec82cd02cc3c177600a2214a2e99a34c9ead07b8b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.singularize (cognitive 30): inflect.singularize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b748a1d04d5422ba1c60d658df9c83a8c5ed65ad58b3714f6665e768d40659"}},{"ruleId":"D2","level":"warning","message":{"text":"modality.imperative (cognitive 30): modality.imperative has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/modality.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662c2c1111a8edf36d8e72807298663f4fad90f6ba757209b1c39e300ab5fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.singularize (cognitive 30): inflect.singularize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (30 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/fr/inflect.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0a06e55c3b96474e8b769594cad14e9d88c97be93ace0bebc664328dbed1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.resample (cognitive 29): Model.resample has cognitive complexity 29 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0438a09fdab9240e230da8d105350dab7d924867599846225f3dd5e60a0387"}},{"ruleId":"D2","level":"warning","message":{"text":"stemmer.step_1b (cognitive 29): stemmer.step_1b has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 14). 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":"pattern/vector/stemmer.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e958ae953c32d5910d294714948009d77a15cb05623fc054671c4526c3302d63"}},{"ruleId":"D2","level":"warning","message":{"text":"problem.__init__ (cognitive 29): problem.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6432603ecdff7e7428bba6d6f0115e4d93ab07835ee1a647b038fbcac97f677a"}},{"ruleId":"D2","level":"warning","message":{"text":"Twitter.search (cognitive 29): Twitter.search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 2 (5 pts), boolean chains 4, error handling 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d39d5673f6a90f760fc7281a8e74a7554d5f54eafd0cdf67f818dad31639d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.information_gain (cognitive 28): Model.information_gain has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d9d9817d9b7ed7b9e565fae37d77dd0f30d954b4b95ccdaf8e983f0fdb2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"canvas._colorMixin (cognitive 28): canvas._colorMixin has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 10 (25 pts), if/else 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b516777335585569f209e1d53c45a159449f348f1d58a8ed3a257aea9a7584b"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.brandes_betweenness_centrality (cognitive 27): graph.brandes_betweenness_centrality has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (10 pts), boolean chains 4 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f209a8ea2e2937bfddfd695b6fb99f0e7ea14847eb2fa8bdf0cc4b3e840966"}},{"ruleId":"D2","level":"warning","message":{"text":"Router.__call__ (cognitive 26): Router.__call__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2c2457befd091e16d7f4d1d861b72efdad8920f713529c881b8f64cfcf34b"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lemma (cognitive 26): Verbs.find_lemma has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/inflect.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"908ec279296f8c63e4a428794b4211772e8acd5ef7334f906c51baac8577d139"}},{"ruleId":"D2","level":"warning","message":{"text":"Datasheet.group (cognitive 25): Datasheet.group has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"864961bd56ac695bab05c9f6d9b5395627771cc7f339846e8d2ecd1de7033e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"commonsense.download (cognitive 25): commonsense.download has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/commonsense.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5818e70099b256b444c4910b0af41977e649082202a0ed4f58b9aff3cf305b"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.tenses (cognitive 25): Verbs.tenses has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (10 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":"pattern/text/__init__.py"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b69d6e67eb0bf2de99ae882cf028318f8a7ba663967c7fe09407b8105c7de"}},{"ruleId":"D2","level":"warning","message":{"text":"tree.parse_string (cognitive 25): tree.parse_string has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9f8dc855ccdf667ccdf0016eb2e288ca2e9a1104305b8e4eb1f5c0b6e7ab29"}},{"ruleId":"D2","level":"warning","message":{"text":"vector.stem (cognitive 25): vector.stem has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d31894abafa0815b28ee8be8936f2556229a4f38f2f600b22fa40e202158a"}},{"ruleId":"D2","level":"warning","message":{"text":"libsvmutil.svm_predict (cognitive 25): libsvmutil.svm_predict has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (5 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":"pattern/vector/svm/libsvmutil.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9086de5f8a8e2f063a3caed46e6f9097b29e7113873eba69ce92027eadf7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"CSV.load (cognitive 24): CSV.load has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (5 pts), ternaries 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21db913a60613899033f97de60f9613b4d16a1b48e04c54a8121ac263b3a88d"}},{"ruleId":"D2","level":"warning","message":{"text":"text.tense_id (cognitive 24): text.tense_id has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 6, boolean chains 4 (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":"pattern/text/__init__.py"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa10349aef6880625ae46054f0c260dd48f2246be619f2575cf7f0e108dc34"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect_quantify.numerals (cognitive 24): inflect_quantify.numerals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8563db49c50a426d7b1fc3f0e60b0053747e75aa8fde90c06e8644c05160ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lemma (cognitive 24): Verbs.find_lemma has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 6 (7 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":"pattern/text/es/inflect.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"67224f92acf48c5c802b6fe3d7f927f5e135faece914c330dd5480e978d255e5"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.predicative (cognitive 24): inflect.predicative has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24. 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":"pattern/text/fr/inflect.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a81e157618709ca11a655523d60b72bf6beed4fbf388bda6f1b389e44f152df"}},{"ruleId":"D2","level":"warning","message":{"text":"tree.graphviz_dot (cognitive 24): tree.graphviz_dot has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 6 (10 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"164eb4c1447846f3e841aa57e3e1b48ac9ce59f7651592e96a45169077c7cf8b"}},{"ruleId":"D2","level":"warning","message":{"text":"libsvmutil.svm_train (cognitive 24): libsvmutil.svm_train has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/libsvmutil.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"047158938601adebc207c8199134f9d74a84ef8126fac1f1f886be14f50e86e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.__init__ (cognitive 23): Schema.__init__ has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5 (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":"pattern/db/__init__.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa47c36f34b505d9afe3b7e5ccdae5b14b0cce58d1c36a03551f4b266654ae34"}},{"ruleId":"D2","level":"warning","message":{"text":"text.find_tags (cognitive 23): text.find_tags has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, 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":"pattern/text/__init__.py"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5510ae597fac081c2cd5126adc680f32ad8846d4e2b01f99fc07194dc0ffbc3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Sentence.slice (cognitive 23): Sentence.slice has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 16, if/else 3 (6 pts), loops 1 (nesting depth added 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":"pattern/text/tree.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"63129ec9be9c12f25c677131aa8651ad99af4654edf697b76aa6c4ca4a119f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"tree._parse_tokens (cognitive 23): tree._parse_tokens has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), boolean chains 7 (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":"pattern/text/tree.py"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"08649ca15c0f7b5dad9ef04d240e6058445bd0423a713d4e6c01f5fc5684c52c"}},{"ruleId":"D2","level":"warning","message":{"text":"liblinearutil.svm_read_problem (cognitive 23): liblinearutil.svm_read_problem has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0284fa099872072c07a2b64f72d51eca40c78d84b684c11e4d70727649f9bf14"}},{"ruleId":"D2","level":"warning","message":{"text":"image (cognitive 23): image has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, loops 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc2e8240bea29e5ac02f59759d2e0cf9be74876612ed3989e181f8bcc341532"}},{"ruleId":"D2","level":"warning","message":{"text":"db.pprint (cognitive 22): db.pprint has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (16 pts), boolean chains 3, if/else 1 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"11123270aed5a40582217499c8050fe3415a11d680e22c1c7291bca370f84016"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.intertextuality (cognitive 22): metrics.intertextuality has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 6 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/metrics.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afdf16cd4fadf1be94c4ff5690bb9c8a0e8dcf87d082ccbd20b11d1ba5fd1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect_quantify.reflect (cognitive 22): inflect_quantify.reflect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"457121c083b05112ca7d2aeae8ad7b40a011c27358f0b027bbe32f79d834a1d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Sentence.parse_token (cognitive 22): Sentence.parse_token has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6f322ecf101ca625666317e20aa69bf3161b5e1718a6b5f2316b25866d4c20"}},{"ruleId":"D2","level":"warning","message":{"text":"init (cognitive 22): init has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6, 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":"pattern/graph/graph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faf56494f98fbe502bc938dc82c9b4fcab9edd7232f7701523836edc3c54fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Morphology.apply (cognitive 21): Morphology.apply has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (8 pts), loops 1 (nesting depth added 4). 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":"pattern/text/__init__.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d8224db2a8f86db16c3d2f0ed374911012f5443f3096ff93646470ac357df1"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lemma (cognitive 21): Verbs.find_lemma has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, loops 1 (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":"pattern/text/nl/inflect.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1853f282252deba871ac268372d7d654a2a8e0a6f68baf43f2ebdd0003acc18"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lexeme (cognitive 21): Verbs.find_lexeme has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (8 pts), loops 1 (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":"pattern/text/nl/inflect.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd4dc0b2982c4a2b46be7a43333135863de3a6ed337384553f0b39b466b9ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"liblinear.gen_feature_nodearray (cognitive 21): liblinear.gen_feature_nodearray has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bf5721547de83e660946c84c91e43486586c2850437ee3553a5b90c49970e6"}},{"ruleId":"D2","level":"warning","message":{"text":"canvas.Math.smoothrange (cognitive 21): canvas.Math.smoothrange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (_multiple). 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":"pattern/canvas.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"47591c2e9e204c5dff87ae9867de3fe1ca873c4ca332acbe7080570d7b10f83c"}},{"ruleId":"D2","level":"warning","message":{"text":"derive (cognitive 21): derive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 2 (4 pts), 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":"pattern/canvas.js"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56de58e1b00b00bd17dea6ea3c4e584d7489de3043328ef5ac50e1a4d548fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"db.parse_xml (cognitive 20): db.parse_xml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76a453105096786cf6d56c987a45358ab817d5920dae22da33ffbe56400917"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lexeme (cognitive 20): Verbs.find_lexeme has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 2 (3 pts), loops 1 (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":"pattern/text/de/inflect.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5a07e72a5e9a1202ea7dc66fd65720b8db57f42d5dc42c7214a864835c340"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.predicative (cognitive 20): inflect.predicative has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6 (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":"pattern/text/nl/inflect.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6fe9c4f83891c7cf1b6019a17538e0c2a818ebc34d06c1cea284ea3ff0681"}},{"ruleId":"D2","level":"warning","message":{"text":"Bing.search (cognitive 20): Bing.search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0802a021861f79703a25cfac3ed03eb61e948a6b2058f07e8f5dfbe1e8ab239"}},{"ruleId":"D2","level":"warning","message":{"text":"Facebook.search (cognitive 20): Facebook.search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, error handling 1, 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":"pattern/web/__init__.py"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"db696288a9254bcd71402e6a41415c3108ebfe7e5dfcb1559ff90f9d7073f637"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.Graph.adjacency (cognitive 20): graph.Graph.adjacency has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (7 pts), ternaries 2 (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":"pattern/graph/graph.js"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cd6719f70e9f00e4aef2a772d9b6af5fa3831623545071410976c4eecc6d52"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 1 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 4 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b070b3de01a0569ec9f453672f444e109f1a1c56ebeeaeca10ed11d76cf0e54"}},{"ruleId":"D2","level":"warning","message":{"text":"remove (cognitive 20): remove has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb6f800cdc76cc911f487fb43102a98b401001cb41e74b4369d250aeb717223"}},{"ruleId":"D2","level":"warning","message":{"text":"db.xml (cognitive 19): db.xml has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (5 pts), loops 2 (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":"pattern/db/__init__.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af07deaa06dc67eae819d84c0e18dcc382abbf3c469b9ecd34f8f01f4027f70"}},{"ruleId":"D2","level":"warning","message":{"text":"Sentiment.load (cognitive 19): Sentiment.load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4, 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":"pattern/text/__init__.py"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"31acb645f0ab4505ad2654deccfc7c05044f4eb6c7c231199c4145404c9b8d20"}},{"ruleId":"D2","level":"warning","message":{"text":"text.commandline (cognitive 19): text.commandline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"19480d3cfef7c3b94bb8ebb82646d6c96bd825794fc605818b50c332725ad75e"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect_quantify.number (cognitive 19): inflect_quantify.number has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f1e6eea8d1d34313d5c39aee03925e4980040f0e6687974bee12fdc94ccc1"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.attributive (cognitive 19): inflect.attributive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6 (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":"pattern/text/nl/inflect.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae83dfbca85235825e052f873602fbd4f6c8cda69581ab26e5e1912c30047930"}},{"ruleId":"D2","level":"warning","message":{"text":"Word.tags (cognitive 19): Word.tags has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 2 (5 pts), loops 1 (nesting depth added 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":"pattern/text/tree.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d6721d34ad0f474d0b29846ef2ef04f2520b9c585a2c3147565d488c899b66"}},{"ruleId":"D2","level":"warning","message":{"text":"vector.count (cognitive 19): vector.count has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 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":"pattern/vector/__init__.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"722ef0072e46bbd52419f5ae68542451e02fdc9b6603e463f4c4322eeb5a712c"}},{"ruleId":"D2","level":"warning","message":{"text":"liblinearutil.train (cognitive 19): liblinearutil.train has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (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":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0532214dc049e44a2ac5d9ca1de990d4f2cabaa1ab8dba1c7bde81fc0665a70b"}},{"ruleId":"D2","level":"warning","message":{"text":"canvas._fontMixin (cognitive 19): canvas._fontMixin has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d122db483c213ccd35e873a663690f9cf215fbe4c2c3de8f68e78dd5fd5a65b"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.adjacency (cognitive 18): graph.adjacency has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 4 (6 pts), boolean chains 5 (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":"pattern/graph/__init__.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85b7d222fc64dbf9048209cf8592f407aa18ddebc41c1a8b16ecfe84ba9d50f"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect_quantify.count (cognitive 18): inflect_quantify.count has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 4, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86dccd96cae08ff388a39c98ed02972185a008059f896e32c066d66280fdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"inflect.singularize (cognitive 18): inflect.singularize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), 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":"pattern/text/it/inflect.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"552e9da4f1eeaffc8ea2a1727192105c8d829b94d73513bec8f5af3e159d1a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern.match (cognitive 18): Pattern.match has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 1 (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":"pattern/text/search.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba00fb906e92279be6bf0949ad331efa0b559ea49a56e27dad6b208bce9e6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Sentence._parse_relation (cognitive 18): Sentence._parse_relation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60451881c538d48788869713b6ebcfd5f7aee38bf631e0f312e7d53b328987a"}},{"ruleId":"D2","level":"warning","message":{"text":"parameter.parse_options (cognitive 18): parameter.parse_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 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":"pattern/vector/svm/liblinear.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bf609e1f0fe20481dec47f229dbb2e1e8f7f6764f8fd6f3677ece15d7509ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Yahoo.search (cognitive 18): Yahoo.search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, error handling 2, loops 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"be884014d04966dc2a74946c1ddc9dc05f72b40e1cc4cb5def758732a42b0d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector._parse_attribute (cognitive 18): Selector._parse_attribute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"219007080e87d1fef1f1e5fa97f96cf66592e5e0e220a7e7b91bbab371dfede6"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.Graph.cut (cognitive 18): graph.Graph.cut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbed9391a27b00aad91a54f9c169f69a9d279172d1e498fbae7072174a194c38"}},{"ruleId":"D2","level":"warning","message":{"text":"Database._field_SQL (cognitive 17): Database._field_SQL has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 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":"pattern/db/__init__.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc8ed3c984c97f712d8fd4b63c12b5d9365b8a6b4306b040cd126d9ce29928"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.floyd_warshall_all_pairs_distance (cognitive 17): graph.floyd_warshall_all_pairs_distance has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c5f166e0ffaa4515609a19b6a3d0f93c479982f4e548cceef6beb39e12a98"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.cut (cognitive 17): graph.cut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), 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":"pattern/graph/__init__.py"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7940a33f2774f6957275409c193f5a3bc869327881ce80f00cd8a79c5fc8825"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lexeme (cognitive 17): Verbs.find_lexeme has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), 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":"pattern/text/fr/inflect.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10a2965326505f2524a174085ac7eb71e702bbf5acf4f921dcf6fc016d7b8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Verbs.find_lemma (cognitive 17): Verbs.find_lemma has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5c07ec4d1daf59061219c3026f543a5c0e78cf95fc0e410220df69b0dd8ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"NB.classify (cognitive 17): NB.classify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 2, ternaries 1 (2 pts), error handling 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":"pattern/vector/__init__.py"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cec978f53c178e0605a94e5b5def77acab838344dc2cc3bc9cd1826b60b5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"vector.hierarchical (cognitive 17): vector.hierarchical has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ad538b5793a4619f0418fb8eb4a75c34baf139fb02a51b234a537463f793e"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDuckGo.search (cognitive 17): DuckDuckGo.search has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (4 pts), loops 3 (4 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":"pattern/web/__init__.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"267d8dd5012dcede219225b666139b5cb7228bac2474174dba73a6e922232361"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaWikiSection.tables (cognitive 17): MediaWikiSection.tables has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d131d4029124261b14685a232635406a7a861ca38ea33c57126526b1c8a0910"}},{"ruleId":"D2","level":"warning","message":{"text":"Wikia.articles (cognitive 17): Wikia.articles has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914d3a6c1279a6a8f5529450206f941295f8cb6b0e2c811da6d5c80babfa598"}},{"ruleId":"D2","level":"warning","message":{"text":"DBPedia.search (cognitive 17): DBPedia.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"84da8b74fec1c3d7c2c7b8a8990771c9e43d4a7807bf6e882f239ab124f1e256"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.remove (cognitive 16): Graph.remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07145ac3a2c711661179d06b44413b44638c97ead14ba6d79ae1edea34248d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NGrammer.ngramm (cognitive 16): NGrammer.ngramm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 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":"pattern/text/__init__.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d754c7a65dbe86a9dffe6196e6a52e5a75635a3e274f424f06a05edac557142"}},{"ruleId":"D2","level":"warning","message":{"text":"text._read (cognitive 16): text._read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970234906d9c799acaa94171e92dded7e297ac9044265cf56b474f5eaac41ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.fromstring (cognitive 16): Constraint.fromstring has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 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":"pattern/text/search.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa9a7462a1158ac680ccb0e352b72207aaffe36590ddcf1ea339c6e47a6b43"}},{"ruleId":"D2","level":"warning","message":{"text":"URL.download (cognitive 16): URL.download has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6734b465a28c40f644f0158be05169ce8ecfc3fbdfce9d79e9856fa3f156ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.Graph.breadthFirstSearch (cognitive 16): graph.Graph.breadthFirstSearch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7584ff2e01eab57790b7c955c078cea52a3d95028d3a28fdc9ad0521620530e0"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.Graph.partition (cognitive 16): graph.Graph.partition has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8996ceb6e1dd84c6a13c437fa7e1b80c40c856ccc3aaa91d163058e9b0fd8b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"blend (cognitive 16): blend has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 5, boolean chains 3, match/switch 1 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 6 belong to 15 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":"pattern/canvas.js"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5c479eedcf13859d9fb8b47f70602d225e17911273adc1e4a952989d9cdb6"}},{"ruleId":"D2","level":"warning","message":{"text":"_addNodeCopy (cognitive 16): _addNodeCopy has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 6, if/else 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":"pattern/graph/graph.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7957e2531e73a87d38780d6124ca21709fed51e79d5a3980e911d2c89e7f2bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/__init__.py: FileTooLong \u2014 2707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2207 over it, 5.41\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":"pattern/web/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d81b9d221f7b041b34c20bf5e6fc7d338697b14f1ec6d7a3d85633bfa8a1853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pattern/canvas.js: FileTooLong \u2014 2359 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 1859 over it, 4.72\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":"pattern/canvas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33408f1e2018cac8ac3188e775beafb88f14febf6db1ee8732831eb8f8cf4582"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vector/__init__.py: FileTooLong \u2014 2266 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1766 over it, 4.53\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":"pattern/vector/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487aa2774f996844990613c78c03864f57ad4529d72c12942d08e742815899f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/__init__.py: FileTooLong \u2014 1784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1284 over it, 3.57\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":"pattern/text/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d7e08a9e9e7492a78c42dfbf2849897f219f5d8bbb249b42cad4b284f65504"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/__init__.py: FileTooLong \u2014 1718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1218 over it, 3.44\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":"pattern/db/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160fc30cbf717029b753314c528fd0b22ed24f976b8ec975dc26c8cd41eb5903"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/__init__.py: FileTooLong \u2014 1129 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 629 over it, 2.26\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":"pattern/graph/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccba6be7ce5c3836ec48d16dc5dcf55e78f082ff3aeaeefca6eaa675f27d612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/tree.py: FileTooLong \u2014 1123 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 623 over it, 2.25\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":"pattern/text/tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c325b02240cfb35e1413241f9cbe6157f4b1c46b6f3da6d5c8940bc96651b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/graph.js: FileTooLong \u2014 962 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 462 over it, 1.92\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":"pattern/graph/graph.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd694fe0a0a83793e8f84a62b04e4b36341b8dd24886e2dd15834be943b1f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/search.py: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\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":"pattern/text/search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c3155374e6c7a18805cf9c2dfad920bbd3b6644ce473ec351d16d66da724b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Model: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb177864aaf57a41f9b17e296150b55577576591d0208a05dae7b358df393e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pattern/metrics.py: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 129 over it, 1.26\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":"pattern/metrics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"745c3ba92c0fdf1711c913fadaed31fb43d1cdf52a10e5f49368886198545109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: en/inflect.py: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40df69a027f7075af01294a713f5234c406bd805ea18149b5be1f2b7ae963a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): pattern/vector/svm/liblinear.py:283-360 | pattern/vector/svm/libsvm.py:176-247 \u2014 These two members are variants of one another: 28 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2859106e3402fe376927cfd7d7df1b9b1a3fcd727bd31f2b22bda75d8f4c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pattern/vector/svm/liblinearutil.py:121-151 | pattern/vector/svm/libsvmutil.py:71-97 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ee5e931983d02e7c2caba01cfc03af5d027901b7a30c4c0c4a9d422469fe17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pattern/text/it/inflect.py:227-268 | pattern/text/it/inflect.py:444-463 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eed572839b564544bb1b622c4ba346adb02be177fa20fc743dec675c74ef23"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): pattern/text/en/__init__.py:110-114 | pattern/text/fr/__init__.py:159-163 | pattern/text/it/__init__.py:155-159 | pattern/text/ru/__init__.py:58-62 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/__init__.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a803c19acd9f21c452db244e6207fbcd09de5a4d17edcc0cf1ccb5c9f5184"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): pattern/vector/__init__.py:2680-2720 | pattern/vector/__init__.py:2746-2772 | pattern/vector/__init__.py:3075-3108 | pattern/vector/__init__.py:3829-3846 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1297227ce1eea9c4b33b3599ff6af217bf05d20bf3e93cb951d476db29754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): pattern/web/__init__.py:2151-2182 | pattern/web/__init__.py:3260-3285 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f01574b8db8b388cf435c25db17895280315db9afe6f1f9f5d123fb1339a9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): pattern/metrics.py:927-955 | pattern/metrics.py:973-992 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/metrics.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a076481b999573c285b50917275ed3ea1eb98b4250899c040ca04b1a90e2222b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): pattern/text/search.py:361-376 | pattern/text/search.py:379-394 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f52cc663afb049187f82c7fac95831da50a145d036560c6dcc9aefa3527ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): pattern/db/__init__.py:379-394 | pattern/server/__init__.py:131-146 | pattern/web/__init__.py:1006-1021 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f184e70a62b0b4be21c74a1eb33e224f74266277ec10b8a9ed72ed3a6281c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pattern/vector/__init__.py:1515-1536 | pattern/vector/__init__.py:1541-1564 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c7b2d97e88d032680a9b5b6893d47a763c868f95bf723249878b3fedc2a54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pattern/web/__init__.py:1306-1327 | pattern/web/__init__.py:1330-1347 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"091935a70ea9d0bf0be5cf14eca76e94abd203fcef66a8cce66b0047e40009b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pattern/graph/__init__.py:1192-1204 | pattern/graph/__init__.py:1208-1220 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff1f93dc2e2747a8370b725fb00e379a25d0ff1bf9ef640fb2d4728d114246"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pattern/text/es/__init__.py:203-209 | pattern/text/nl/__init__.py:156-162 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/__init__.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8634acebe13b2b3f174216ee29d2a41f73858fdf62a262f4fbadd2b1506e8a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): pattern/text/de/__init__.py:194-206 | pattern/text/es/__init__.py:175-189 | pattern/text/it/__init__.py:123-137 | pattern/text/nl/__init__.py:127-139 | pattern/text/xx/__init__.py:103-115 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/__init__.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14c23b95f23e82751b679449f865e846aad7af88d2e4ca2aacb9f2e5432d448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pattern/text/en/wordnet/__init__.py:270-291 | pattern/text/en/wordnet/__init__.py:294-305 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0540baf1657d2ae0ee5123b2d650119036bf490d9d78ab73cac35ab7f31d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): pattern/text/en/inflect.py:644-656 | pattern/text/xx/inflect.py:113-118 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6548d5527cb37de11a8423f14e4fddf368580d601af4ee2d62cfaa051d71f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pattern/db/__init__.py:330-341 | pattern/db/__init__.py:345-358 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"25405a9680f634e30a11bca7bf8f90cdc051f508c2dbbef6f0092f56b218c335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pattern/vector/svm/liblinear.py:256-263 | pattern/vector/svm/libsvm.py:146-153 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b710ae1b4fb18a199ede0a9274a7e037ffe641ebf3ac21746d66b739e79aff31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pattern/vector/__init__.py:729-735 | pattern/vector/__init__.py:1214-1221 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24eae5801c614d4820573676daa486248a35815ccd0eb13185dd9f3c571e3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pattern/vector/__init__.py:1173-1184 | pattern/vector/__init__.py:1187-1198 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5775013ef4e5540d9dc515b056a8aef60fb1a229d5a0078c815f8ef7e7b3d239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pattern/web/__init__.py:1036-1044 | pattern/web/__init__.py:1048-1056 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f0caea65f26747814789936b6890aadf264f8f8021d0276098fd13ff87cdcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): pattern/helpers.py:16-27 | pattern/helpers.py:31-42 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/helpers.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee0597e948d980f8129b26da964457e935a5c897a3d1ab6e93a6673f06aa65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): pattern/graph/commonsense.py:70-78 | pattern/graph/commonsense.py:86-89 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/commonsense.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a66f64a74658acda30f41f74f803de5f764786c682ca2c9ac56554ddea1116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): pattern/server/__init__.py:857-858 | pattern/text/search.py:294-294 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b31393beb7f24214a595c3122d22882760727396efff3b84a589d2e8de6255a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201326 lines \u00D7 2): pattern/metrics.py:927-952 | pattern/metrics.py:973-988 \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":"pattern/metrics.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b006db1b211b0b4acf03ac5025ab0a316c15360fd739e7f42296a83601119b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): pattern/vector/svm/liblinearutil.py:131-150 | pattern/vector/svm/libsvmutil.py:77-96 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinearutil.py\u0060 and \u0060pattern/vector/svm/libsvmutil.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pattern/vector/svm/liblinearutil.py:130\u0060 calls \u0060evaluations_scipy\u0060, \u0060asarray\u0060 and \u0060pattern/vector/svm/libsvmutil.py:75\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aacf68faf4f397754185c993d8edfb6d4733b359cb8bd75adea62741db5245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): pattern/text/it/inflect.py:248-263 | pattern/text/it/inflect.py:451-461 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a229bde07304f61e0c8b54df3222cd2030aeb7dba69bde305beae46130a015d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): pattern/vector/svm/liblinear.py:283-297 | pattern/vector/svm/libsvm.py:176-190 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinear.py\u0060 and \u0060pattern/vector/svm/libsvm.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4c7e62b9d97a5abf641c38fbe92f841a0d3dd63731176dc8f1cf512e5e48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pattern/vector/svm/liblinearutil.py:308-319 | pattern/vector/svm/libsvmutil.py:214-225 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinearutil.py\u0060 and \u0060pattern/vector/svm/libsvmutil.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"601cbdb8ad128b9e049825664fa798c0ea66db3db9df550fb123dead048daa5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): pattern/db/__init__.py:365-375 | pattern/server/__init__.py:117-127 | pattern/web/__init__.py:992-1002 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc5383146190fbdc5cb5cdc5fae0b6c20f50d9105ea86d0b1b8f04a8be1877d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pattern/server/__init__.py:131-141 | pattern/web/__init__.py:1006-1016 \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":"pattern/server/__init__.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba239b616f064d66118cedc77c7026b9a3d2189b43bcc4452014fdccb740eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): pattern/text/it/inflect.py:186-195 | pattern/text/it/inflect.py:255-264 | pattern/text/it/inflect.py:456-462 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77e34f69123e39119d06109bf716409f9bcb5e1f25eaf9c451001af48e07d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pattern/text/search.py:361-370 | pattern/text/search.py:379-388 \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":"pattern/text/search.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc52720eb6bfba08f04464f6dda559fd7ecca56b788ad95c876912c31f4dfd62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pattern/text/es/__init__.py:182-189 | pattern/text/fr/__init__.py:136-143 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/__init__.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"287e5d87607ccbe2208c9c30da7983a6a58cabc1147ee015bd0f2387ab0c73a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pattern/vector/__init__.py:1522-1529 | pattern/vector/__init__.py:1551-1558 \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":"pattern/vector/__init__.py"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"93abe140ff082780e9731140be21613b30636c275ab4c6eb2464b28d5d276428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pattern/vector/svm/liblinear.py:316-323 | pattern/vector/svm/libsvm.py:230-237 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinear.py\u0060 and \u0060pattern/vector/svm/libsvm.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211dc4ec4385b9a72fedcedc43d3f5d6c175475c2f7d20f52aeb4562a3c08dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): pattern/vector/__init__.py:2710-2720 | pattern/vector/__init__.py:2762-2772 | pattern/vector/__init__.py:3098-3108 | pattern/vector/__init__.py:3836-3846 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1388459b22c0b3e71e6f969d512fd102407914ea3929db6a7d3d99f6747b57aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pattern/web/__init__.py:2115-2128 | pattern/web/__init__.py:2229-2242 \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":"pattern/web/__init__.py"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda2149227410974d82c36819d9e595147540f95e72939a2c7f1e8c07cf56adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pattern/text/nl/inflect.py:295-300 | pattern/text/nl/inflect.py:386-391 \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":"pattern/text/nl/inflect.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd826f2f556d462e502665aae232ee22db96b1129b4c06a3cbe1aae534c0e8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pattern/vector/svm/liblinear.py:258-263 | pattern/vector/svm/libsvm.py:148-153 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinear.py\u0060 and \u0060pattern/vector/svm/libsvm.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aaed05b7ea96df89b731c73e3d36152c1268aae7cf04195bbb341b13ce6f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): pattern/text/en/inflect.py:645-656 | pattern/text/nl/inflect.py:232-243 | pattern/text/xx/inflect.py:114-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pattern/text/en/inflect.py:645\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. 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":"pattern/text/en/inflect.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"44433b160282c63060d462e9c7a11887e8da6bf941d88187fe830979fc6fae4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pattern/vector/svm/liblinear.py:334-338 | pattern/vector/svm/libsvm.py:243-247 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinear.py\u0060 and \u0060pattern/vector/svm/libsvm.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b05edd6e6909d62562d7e9a55e6134f76442b27d8fc348d1791094b0971bb50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): pattern/text/en/wordlist/__init__.py:29-76 | pattern/text/ru/wordlist/__init__.py:29-76 \u2014 before extracting anything, compare \u0060pattern/text/en/wordlist/__init__.py\u0060 and \u0060pattern/text/ru/wordlist/__init__.py\u0060 as WHOLE FILES: 96% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordlist/__init__.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"80adec02b644e25979103627ae870bedf0b734441957d9cca001265ff5e2a868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): pattern/text/de/__init__.py:273-279 | pattern/text/en/__init__.py:185-191 | pattern/text/es/__init__.py:252-258 | pattern/text/fr/__init__.py:235-241 | pattern/text/it/__init__.py:218-224 | pattern/text/nl/__init__.py:227-233 | pattern/text/xx/__init__.py:200-206 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/__init__.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad369cda16f987b61eeedd5d087482cfad55f916e2e20127efef270ffb0e1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): pattern/text/es/inflect.py:265-277 | pattern/text/fr/inflect.py:165-177 | pattern/text/it/inflect.py:294-306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/inflect.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a41ad1c5553258d38348ae4d761abb6363b615194caa6e2b4d25fcba32c2ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pattern/vector/svm/liblinearutil.py:70-80 | pattern/vector/svm/libsvmutil.py:48-58 \u2014 before extracting anything, compare \u0060pattern/vector/svm/liblinearutil.py\u0060 and \u0060pattern/vector/svm/libsvmutil.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"044776700162ed4898cc7ae256f40a07fa789d916e488d75d343b371ed7720e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): pattern/text/en/__init__.py:110-114 | pattern/text/fr/__init__.py:159-163 | pattern/text/it/__init__.py:155-159 | pattern/text/ru/__init__.py:58-62 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pattern/text/it/__init__.py:162\u0060 calls \u0060Sentiment\u0060, \u0060load\u0060 and \u0060pattern/text/ru/__init__.py:64\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/__init__.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28855203e237b0ea1e76d5ef0b9a7ca9a7a368fc74f176d34b62756b21f628b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pattern/vector/svm/liblinearutil.py:341-348 | pattern/vector/svm/liblinearutil.py:358-365 \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":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"454a2f55d0f88e482a73099e631e556c25c1b4c62f282aded6f86da2fce5390b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Classifier (LCOM4 4): Classifier\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"da019c584065e3f30d20f4ec199257247108cad190658b8f51ce7893a429c3ad"}},{"ruleId":"D13","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":"ec883ea3abdfcaf89b4195a22f4355315cb4e3bb631b27e127ead412f06160e6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"9fb317cb28dd8875eab96c17281905fd6ee8b5f2e6ea76a83611bc7cbe923750"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"49b7ac8aac7349205dd3d320a963ec1056aeed3161cba4a16d80a3c1a3c554c3"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX - shouldn\u0027t \u0022se\u0022 be part of the verb phrase? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/test_es.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f9414568cbbf014a6c341ed0d13195fcca830902211ceaa25211ec940ea75b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX should test \u003Ctd colspan=\u0022x\u0022\u003E more thoroughly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/test_web.py"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"870b3e0faf6328ff11b9f37168bd12e2cc5ecab91a30118b439a06748c4aa666"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX doesn\u0027t work with spaces. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b77208dc6a9e46b4cd62029a7ec3788e7e7ab401da6e084c655f20877a2cff2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX - We can probably rewrite all of this using (faster) regular expressions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0a8168e4c224c5a38397f405db68d81767c30d1df74f0b1c55508a9eaf98c2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: #Query.cache[self._id] = q # XXX cache is not updated when properties change. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acb91f53b1966e684166d9e89ddf310514c6e72f5d160bd4de7f67cd430737b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Returns the node in the graph with the given id.\u0022 repeats the code it sits on: 4 of its 5 words (returns, node, graph, id) are already in \u0060if (id instanceof Node \u0026\u0026 id.graph == this) return id;\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":"pattern/graph/graph.js"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524a20e0223e9b50bf2c2acd5918cee75950cd8ab2d9d078cf0629a4e82a067"}},{"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":"e66b351c9389548b41b98718ff543f23d9cb5152dc5133c18443262e466e8184"},"properties":{"commitSha":"6a6bc557626b1a0fe8115f44b364139379b28905"}},{"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":"8aaea72dc49a14a139c81d43d491d6c2a380e2bfadb169b91d35a87235a3972b"},"properties":{"commitSha":"18c11097b6b0afe65dae1a8722d4756b85e15a28"}},{"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":"9d067ea577fa6e704b9b79602af1384828de0d6fd295492fa00116430e6d0050"},"properties":{"commitSha":"aab4e0a46ea08f6409d110559fe6b02b0431966a"}},{"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":"bb898a8d9e80059bc3339ad7696c9bac78d37af692b224b62c6de565c3469f86"},"properties":{"commitSha":"18c11097b6b0afe65dae1a8722d4756b85e15a28"}},{"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":"9223649c610bf431766f05245ad1c7a0b303f68affc1d9b845bfb41e81549513"},"taxa":[{"id":"CWE-95","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":"f38d0f37befac681beb12b2800109815100fdad60e42345ce35dfd39a940b24a"},"taxa":[{"id":"CWE-95","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":"5a4f7cec4c820ce1e194606ae404d4116983c445ff8a56894fe3b7ddd76d90c0"},"taxa":[{"id":"CWE-95","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":"8027a3170b2a5172fdc6a896db6c814af521154990f4c6f8b7bd761f475dec47"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a9eead2405e778a8a92d03a654da448482c975b6fae72a8308f75cb979b12ba"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4585fc5a4244d7b136101b04f9ac9cc197f0c7ec3c2d420592d211257f7621ed"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"030eaa4b4aae8ffb9b131a6c72a8224bd97ce3745f89d06ca474f753aba3845a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7eeea0dcb565075c26b16dce68449e42fddd31f54a809de13c0b3a7dd0fa077c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a508f5262847d41d5169219a57052c5804f51349ed780168aa9987992307816"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"595544d59bdff3fb59be9947c9968f1d0103b13d8176188db0533a0ad2664d5f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e794fde46be8f168c9f3101f9f9ca7ebbd02942bd818df273957a475c0ba898"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e143ba2b161725a5add742e984df340f337af51b46b7cd6d479b7185912cc3d"},"taxa":[{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"7ee5f423ac73c53bc4f4a002b5f5d3773da71f75bc4a1e39df7cdb407071b990"},"taxa":[{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"55eae5a8e966180e26cfd8aad5457f843b206f530eb448ce29d5edf1be2ffbe9"},"taxa":[{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"964ecb5d28e1988280b30aefdc27baab95abcfaf3915bcd9018e74a1f03fea0c"},"taxa":[{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d0175512ccaff6a27db81250a698f579c1351670447b126fda73806615198201"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03e732d5764ccdb81292e7fd20ebeeba1b240ed2599321b809cf52159e6aaaa8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"785b675483d5be8ad4062c4b889d771e2229f3516246c542137dc878c515f2c4"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a9bbd10e8c9b55574f5695df66f00745e908636fa6ba9a2bfe22ee45838570b"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08d9511d623063754772278e9eb3c01d1548d7124e430b9cfb5e738dba5a3d7c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18e3c661331599414fc62205b0cbc90748cdbda50644ad282a68fda113e752af"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e0e4aab39561cb09873be36444e1842dc2c6022249e2925807ecfacaae13b07"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59f9ae448e0e7b2076f1e0dcfcdd0d43b79f0976c2abcd69e255ecd1e07a6eee"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8e1d7a71dae7495a3389e75642b4142c74862e344bbb8c7e08a2b201db0e8eb"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07bdc715fd7db2814d7420daeffcb96104289406371ba486964cea76b2ae58b8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa0dd01471840a30351ca0f147b1dc3e84532e8d98f41dbb9ce4ea1da2cd218b"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4105e5233b0a367d63ff19342124614e46235a32e9d5cb355f6cbcc4588c665d"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e8e817744404080875b4470e360c3fee145c116b2978010f34d60fe83aca974"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc3c4cbf1dead55076a2432b27ea5f324918fb58d90c9d14891f7dfd0b45d439"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"903b264b85ca4e802bb65a448edbfd12c00d14bc2c45f6b2792eb2c30978b0fc"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bac49bf2a05052ca153272ca6973b1c915b25d885ec101d0cbc0e65d8d8d046"},"taxa":[{"id":"CWE-611","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":"0e806d35698d474a25b076d289277726d0fa7c4e5c5b05d0531031501ea90192"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57a1713aa2869e10471a5c1f4f5c4b82e342b80225d520505c29d9fc75e9f5da"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd9f3be0e69bcf1ce4de3ff18835c94c7e7ba48dc447a223f0490dbcfd88e1c6"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97bd89ece7e345e4b1737e336987c7ff6dd70562b1415ae2fc7ec011ba9894af"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc285727eb7f890004ca22671f239b4b974d545a9bb35561fe688f58569728e8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"114537a2370720b7fbb41416bcd40d7131a560c15ea814ff37a810dc8918e8db"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd57e91c41e6b7862ce3a4dbdbc0569e2fe3f911b581cc59408a5406e5bc867e"},"taxa":[{"id":"CWE-502","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":"c1167ed59808dcf2e97a7c08068befc7c577cb6e503ba20b4ec67c0911434b6f"},"taxa":[{"id":"CWE-502","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":"2670f46463543ccfd115996c2ceabdbbb92ed213a65a30b22739b541e88ef1a9"},"taxa":[{"id":"CWE-611","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":"c5b5113df37e0c67c1521b2682cfa47f5c2ba43bf8b653151d5538c7cb42940c"},"taxa":[{"id":"CWE-611","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":"2a598b2289e0478934a8256af85e4c0921d36938d6db11db275fd387c61c6f83"},"taxa":[{"id":"CWE-502","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":"fb9faa0fd5fee5c307202919125903ef4796d3fc074efcd3cb501913286b7881"},"taxa":[{"id":"CWE-502","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":"71f69b9ad781ff31ffb31fcb8b4f30f3491568dd9f2d7a804942bca97ae9e021"},"taxa":[{"id":"CWE-502","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":"15074b04326c1836d271389346eb69f933d00f56b04e14c12a7b3070780c5073"},"taxa":[{"id":"CWE-502","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":"30a99cb423c82030bef20df493410bc0c5a7cc4ef56e0b7e4ecf531804ff8306"},"taxa":[{"id":"CWE-502","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":"cea6b9c49f4effa4b1b2d57bee1e45c8492e3089c2fa54087c7d5f748f83dd4a"},"taxa":[{"id":"CWE-502","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":"e5c49e60c2619401c757b4c572f93decd0734a678bee3f2111831698a6d0c03a"},"taxa":[{"id":"CWE-502","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":"49f7634c9865eaecb4efd679454dea36d3599ec970bcf67444ab5a14a8ae383d"},"taxa":[{"id":"CWE-502","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":"270425371f9b57f3c9a3968502bcb201cb20c2ba40ccbcb8a4da71205a720ac3"},"taxa":[{"id":"CWE-611","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":"5cffbf7ec8d57f8402255adf0fadd053fe9afb503a433b0ea4a8651bb49749ac"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 40 of 40 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 40 separate risks. Counted over 40 of the 54 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99bb856be62e8301d555229dd197370ca77566debd2d80d6f4549397aab98a3"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2176ef136a9ba25665c80182699b4996fc3f313c41538d33a36b2200bc76a0"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff99bd1249345bf239ffa4b78e0bd5bdfeeea8efafeb49b84bc4811feed149b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33208b55a9c9a772dbcc6aef8f645e234f13dfefe6449e3fe1f3221fa372d8e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8362e5e363535e1d5b21edfec66f8e3a5c018f6730d8d3b5ccc55c40f4d33f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c71ae28c9f64c15f1750ba55aaea3a53a28d14dac0ef6878edadb73489520"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763f20c3ce38b36c785d08aff6643834c95813d2a5af542f20ecaebe1d7b46db"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd845062336d81cc54592db3848e4da42c1d828f3bda55b339575baabb68c2c9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/metrics.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f95ab77d7839cf394898c949f9ac42589f37ab1d5b82d771b457dd1d781faf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5fec56a4c17f9010feaaed21cfafeea852b20148e0d98c04c10245f0693317"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2974d558a2341a70f28539433d02d3561f8ddfa47105b7a9e4020fcce3e99e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/modality.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92182f162e7d5433567ed2759aa91c4e966425b6f347ce76478aee12c518f394"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/locale/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e963901b34628931bcb6238a899f424b0e3f03c83db6dd4d7f1ce411000724d7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"071408579a06e4e565c8d17b3d5d2c1a1d5dc15842397a31bac215df022b213b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd0629a19dd7f30f548459be78dae02316f86b9942f3758caaeef0dfcb7c0e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14f7d56676ac4e29984cc16be4203c0791f3f941af6c82d8dd0decc6378df9d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e4509a6482c661c2317f87ff2560f43b5fdad93dc03e599e17e90a815d751"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af31ee3b3568e8962ee783f8fb894b577a9bb7208629d5f334edad669470569a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinearutil.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a638be8a43452b7ec391d2ce2c16c5d4b400b1f3dc3497890a825d9629fc84"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f589deb892a802f17e966c1341d7598f39504d16dc8dbdc89e0e62346d5d45e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/fr/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e2d6819a7e9e6c35f4151dec8790f915f02053a3f65cdb49a83d505d99abae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/stemmer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e20224698bb2ca9ed40fe41e165b1d5691698be2289045fd375e3155e523e1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/commonsense.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0736d821c3950d555026773760b94e1547a56c1f51169c983080101dcdb17"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a3d4217e3f55600c7480b9239d5c9bc14fdf7b01c142df17a83526cff43b8c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/libsvmutil.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"787ffbf462e77ed3b1a133edd8bf47528d8bcbaf22e3af54d45ff187312c0147"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/libsvm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c443eedcb4ae1ede4ed0282d041954ed95cdeaf9cfc3fbe9627f172372268"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/imap/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5572c5a7ca21b7a376c749ef56112c83e275c39c3fcb57956c783ed118b10813"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/fr/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f8a67019907029cd8fde61d25395a19f80010611375f008739c696eb58f072"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"028df6db6fe8787e81926713a1f920f20c5ad35a9cdc9d8d34f4655c207b7e9f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30dbb44bc07edc06f1b8fa855d330287e01a0686ee78f90f4bb2d915036aaf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25bde7ab2947243ec7d14d8445e3010573c5d8bc79baf72a6e0aa9112f99206"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/xx/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaff83afcaaf083ed19080fe12b004b3edd9954dce2f3aecdda3f8018e741fc8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4110950a41d8a6d19d8aed5c39829a39a68880529e2337e8e502c5a0c0a35a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7350905534832be734b65ede2f1f6e4eed767a85bcf7759ec3c0518b0ce72a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/xx/inflect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db463b9ca5a6807490c84ae97b2446dc25df96b32f701b54985425d10c6f8a0e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/cache/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44c8a919e7a9c10ce56c0785aab5ed442d75d430c45bd2b120657e385ac3c0d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/oauth/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee21abbc108ad3b44fcf1333a8d31f90686b74fd18d24496bf17b22f31edfef9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/ru/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab0e91867b84c43d965a822e78921504444c1d8163ccc5cd4e2f3ffa3c0c18"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a4736f58ec6f33c46c0910088aac28515ea64b02289bce858b41622c5dfbde"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordlist/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d414b250087851617f502cbbc614bff97837153e5183dccb478ed1050614d756"}},{"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":"M1","level":"warning","message":{"text":"Repository declared end-of-life: This repository declares its own end of life: \u0060README.md\u0060 line 1 reads \u201C# WARNING: This repository is no longer maintained.\u201D. That is a first-party statement of intent, not an inference \u2014 the Maturity and Knowledge lenses otherwise approximate the same fact from decayed commit history (D16 reports a dormant codebase, D34 orphaned files), and this row says the maintainer already told you. It does NOT change any score: an honest end-of-life notice is the README doing its job, and every dimension below still measures the code as it stands. Read the whole report as an assessment of software the author has stopped working on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e004c35cfb0f545005a1751b408088865c81b7248bb65240c7771e85dff66d9"}},{"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":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (\u0060__init__.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P1","level":"warning","message":{"text":"CI pipeline targets a decommissioned service: The pipeline is well-formed, but the only CI definition is \u0060.travis.yml\u0060, and its \u0060README.md\u0060 build badge still points at \u0060travis-ci.org\u0060 \u2014 a service shut down in June 2021. No other CI is configured in this repository, so nothing has been building or testing changes here since that shutdown \u2014 the steps below describe a gate that is not running. Porting it is mostly mechanical: the build and test commands already written here are what a replacement pipeline would run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94fa49939f4e75dfcbfaabad72be66184852fe80bd9db87538e6e15223919a47"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 5 plain JS \u2014 the untyped files are pattern/canvas.js, pattern/graph/graph.js, test/test.js, test/test_canvas.js, test/test_graph.js."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): pattern/canvas.js:338 \u00B7 pattern/graph/graph.js:151 \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":"pattern/canvas.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db25fbf6efb706213272dd2337d46296102607ac27856658a7955ebf18f70b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): pattern/canvas.js:21 \u00B7 pattern/graph/graph.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 190 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":"pattern/canvas.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f94643878ef3bda6c8c6d15392c3bcae6d1c8cd38f7695c5f305b3bcde6b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): pattern/canvas.js:3920 \u00B7 pattern/canvas.js:3934 \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":"pattern/canvas.js"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d5a6f26ad95c4e2976562748fd60bc9f1dc1e83d6b1632b18c4dc9fc14672"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): pattern/canvas.js:185 \u00B7 pattern/graph/graph.js:60 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"99727deca17287391357ab831473eb9417a82db14a249791b5eea054d191e6c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pattern/canvas.js:94 \u00B7 pattern/canvas.js:103 \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":"pattern/canvas.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fafa624ab886ff61d3ab7775a84de6c6cbdf11bc39d782374478473bd174bc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pattern/canvas.js:132 \u00B7 pattern/canvas.js:141 \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":"pattern/canvas.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5507eeaf6e9fe66486133db5a021c23b6a997d087da9c4b3f36e5ed866df3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pattern/canvas.js:699 \u00B7 pattern/canvas.js:710 \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":"pattern/canvas.js"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9c8eadc828c320991e5dfac5178cb2271aab8e9e5e2565b563a5b24cfd1d3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pattern/canvas.js:1173 \u00B7 pattern/canvas.js:1182 \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":"pattern/canvas.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0799e03d77ad90981fd7a9db08132db600c469b7dc5df93ac7e55e92b92d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): pattern/canvas.js:205 \u00B7 pattern/graph/graph.js:53 \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":"pattern/canvas.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5c16333c2718762ed9c419c409de5ce0354b1d3d40b848fb030f12e623f97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): pattern/canvas.js:1987 \u00B7 pattern/canvas.js:1997 \u00B7 pattern/canvas.js:2008 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b5654316ca2a0eded57c6381f32628f53ac0267fb9a813d57092dbdd2b66fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): pattern/canvas.js:463 \u00B7 pattern/canvas.js:577 \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":"pattern/canvas.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd601a4b499ef67afc1892c12e2ccd35f631af2a04827677635268ec0d022a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): pattern/canvas.js:1249 \u00B7 pattern/canvas.js:1259 \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":"pattern/canvas.js"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719a55cbbfa6e5e9629275e29cad24090882460c4a526a4b58200fe862a7931"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): pattern/canvas.js:3828 \u00B7 pattern/canvas.js:3834 \u00B7 pattern/canvas.js:3840 \u00B7 pattern/canvas.js:3846 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1049fc7ca67b2ffd757bc726b638b2d2016785ff110c1a76aa05e62d7530de18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/canvas.js:88 \u00B7 pattern/graph/graph.js:43 \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":"pattern/canvas.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8b9b17eeef078e3b0f1f646e34ffaece576be5a89b9d765045b44934bca4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/canvas.js:1707 \u00B7 pattern/graph/graph.js:1579 \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":"pattern/canvas.js"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9107ea1b8941ad3ff41312f62b9e9c1bc6e7aadc58d1f6ca9297c9ee7543a0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/canvas.js:3711 \u00B7 pattern/canvas.js:3900 \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":"pattern/canvas.js"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a760c9bfebbdccb9ffa6bc76c149e0d067d836a313739785430d27150b4440"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/canvas.js:3804 \u00B7 pattern/canvas.js:3809 \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":"pattern/canvas.js"},"region":{"startLine":3804}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc5e2ebe17572917fe0e460f2ddeb6bfbde9935c27f3e05315ad0ca97b092ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/graph/graph.js:1140 \u00B7 pattern/graph/graph.js:1171 \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":"pattern/graph/graph.js"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1888224458843fe6f41327695deeaa81a5de5f06ad144cc18d0693009ba635f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): pattern/graph/graph.js:1622 \u00B7 pattern/graph/graph.js:1665 \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":"pattern/graph/graph.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c0ea268fc89b0dd8eb9ff1debe29f22d1128a6568f65a5ea5d081a1df9bc3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function init (cyclomatic 33, cognitive 43): init has cyclomatic complexity 33 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afc234fad2f9f7adf8344261a98033670a2b86b3da4e23a0222400ef3a21881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function widget (cyclomatic 26, cognitive 36): widget has cyclomatic complexity 26 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4027}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd89da4c2a45c02d73e6c019ea5f6058fe329dff01f61ac78edc0042484972"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stroke (cyclomatic 25, cognitive 44): stroke has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c6f518a687454b2b81d7c0cfa2d81c5ea59f76ba34a6120dc76f9e8603ec3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function derive (cyclomatic 23, cognitive 21): derive has cyclomatic complexity 23 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":"pattern/canvas.js"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33b26f13672727f4a0b9e1bb088dca3629b65d5cab6706c53923f576680f643"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function brandesBetweennessCentrality (cyclomatic 22, cognitive 37): brandesBetweennessCentrality has cyclomatic complexity 22 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b16abb9f2fb2303f9110028ed260ed3fad55086babe95746405b97ccdd373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eigenvectorCentrality (cyclomatic 20, cognitive 32): eigenvectorCentrality has cyclomatic complexity 20 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":"pattern/graph/graph.js"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"70099cddb32b880478c8b5196415298652e9be9d37f4f270eb51fbb74b72acf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blend (cyclomatic 20, cognitive 10): blend has cyclomatic complexity 20 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":"pattern/canvas.js"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f29534d8b8bc4c84721b61ca7af6f7ee2ff35d736733ffb1e35286d18e7160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stackBlurCanvasRGBA (cyclomatic 19, cognitive 39): stackBlurCanvasRGBA has cyclomatic complexity 19 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa429b1fbd490c59f8b35953d51d6c96e201add2c73d2c9e45ec93712a5bae14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function image (cyclomatic 19, cognitive 16): image 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":"pattern/canvas.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"67abd2bc9c1012db09b9615a6bc9fac0f0365bb60b074a4f6c9a52d22af71c4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function init (cyclomatic 17, cognitive 22): init has cyclomatic complexity 17 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":"pattern/graph/graph.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d4d71a99d296d7a93ab279392fa2b6de18f74c1454173a12a2f9d118380894"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _addNodeCopy (cyclomatic 17, cognitive 16): _addNodeCopy 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":"pattern/graph/graph.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a896a0a7a6e7ee4829f24358ffd2370c4e1af864d3a57900ebf79e3a8d22f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 16, cognitive 15): draw has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dcd14c6e5881e10af3955459ba3ad1d4b211a0347ddcac6c66cfc1140c85a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adjacency (cyclomatic 14, cognitive 20): adjacency has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7f266189af381136ba2c5a50e0671ea7dcdd92de3936fa6f5fe730d86a53af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cb (cyclomatic 14, cognitive 10): cb 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":"pattern/canvas.js"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc1d767939d47e63ad62f026e9d0c1d28cf6ae0b698a46a4dab5bba9ec93f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _colorMixin (cyclomatic 13, cognitive 23): _colorMixin has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7248cb4556feeaaa00c8c3e6d0fdd81f634215a4d87ac8a0c65597b944a65204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPath (cyclomatic 13, cognitive 14): findPath has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec1ca554a609e48fad40233930fbde672fca108c109ff0fa7c7b31cdd51cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function init (cyclomatic 13, cognitive 12): init 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":"pattern/canvas.js"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c8316824f4691eef1bd9441d135bc411dd3d163f9e57198dc7812551c7c50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partition (cyclomatic 12, cognitive 16): partition has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdafd44db421cb7758b7b8e02d71948393937688247f8ba41d242963a2277200"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function segmentLengths (cyclomatic 11, cognitive 14): segmentLengths has cyclomatic complexity 11 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":"pattern/canvas.js"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922640dd648e94d8bdcab9d38b14a0eace14ddcf26c2340fff227170c12cf19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addNode (cyclomatic 11, cognitive 11): addNode 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":"pattern/graph/graph.js"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac23eebbcde7a3b178cadd05d312ba8ad6789e5aab4aeab03f4d9693e6d16e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _addEdgeCopy (cyclomatic 11, cognitive 10): _addEdgeCopy 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":"pattern/graph/graph.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"97379391478a3fd08df7af1ef1bce094093212996d379a329c0b011b4241cac3"}},{"ruleId":"R3","level":"warning","message":{"text":"pattern/canvas.js: 3832 lines of code: pattern/canvas.js has 3832 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":"pattern/canvas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f00ba1afc9ec0720e754d17c19e82dc2b2f8d7b4f7b08e1000a3d7b01a25a0"}},{"ruleId":"R3","level":"warning","message":{"text":"pattern/graph/graph.js: 1553 lines of code: pattern/graph/graph.js has 1553 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":"pattern/graph/graph.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0dcc1461ef3a2f766aed36d7f50bc8413dc325819caf504304ee7b37faa542"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch in word.endswith(\u0022e\u0022) and word[:-1] or word\u0060 appears character-identically in 2 files \u2014 pattern/metrics.py, pattern/text/en/inflect.py. 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":"pattern/metrics.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fabacaa2b79510a87968c9259de7425530fe1cd88151fefe138da38a3e7aa1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060function == DEFINITE and definite_article(word) or indefinite_article(word)\u0060 appears character-identically in 2 files \u2014 pattern/text/en/inflect.py, pattern/text/xx/inflect.py. 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":"pattern/text/en/inflect.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e37856ac73562b8413acabc2f21029f5d6d6a46bf179676f43cdd43251278d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060function == DEFINITE and definite_article(word, gender) or indefinite_article(word, gender)\u0060 appears character-identically in 2 files \u2014 pattern/text/es/inflect.py, pattern/text/it/inflect.py. 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":"pattern/text/es/inflect.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faa11d4478b9895c2a75f2f4613e9b1545f9255145f0a5b4675a4966907d414"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self, \u0027__createfrom__\u0027) and self.__createfrom__ == \u0027C\u0027\u0060 appears character-identically in 2 files \u2014 pattern/vector/svm/liblinear.py, pattern/vector/svm/libsvm.py. 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":"pattern/vector/svm/liblinear.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4456856d2860d5941142d881417ebb48ed3390ef4aa5eab09a21117c7c992fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(path, str) and os.path.exists(path)\u0060 appears character-identically in 2 files \u2014 pattern/text/__init__.py, pattern/web/__init__.py. 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":"pattern/text/__init__.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde61b2401b59f6e53150d616dfa585f5d522760a30411454cc58897073796a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(string, str) and hasattr(string, \u0022tags\u0022)\u0060 appears character-identically in 2 files \u2014 pattern/text/__init__.py, pattern/text/tree.py. 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":"pattern/text/__init__.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e9af613f42f62fec29c17f7f3deb03beb088bbbbc770a05bc1d3d3cf8cb1a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(args) == 1 and isinstance(args[0], (list, tuple))\u0060 appears character-identically in 3 files \u2014 pattern/db/__init__.py, pattern/text/__init__.py, pattern/text/en/inflect_quantify.py. 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":"pattern/db/__init__.py"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"447b27657089b5cdf1021887b7848eaa3f30779ed4fb3d78815439c23ec5d5cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(args) == 1 and isinstance(args[0], dict)\u0060 appears character-identically in 2 files \u2014 pattern/db/__init__.py, pattern/text/en/inflect_quantify.py. 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":"pattern/db/__init__.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b0771f7251fe266fe3d5e41ac50c68c7a5f875f63cc89c6a0385d6cac33729"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tag == \u0022IN\u0022 and token.lower() in _subordinating_conjunctions\u0060 appears character-identically in 2 files \u2014 pattern/text/fr/__init__.py, pattern/text/it/__init__.py. 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":"pattern/text/fr/__init__.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e61f639deed7c08d84c5dfbf22e0bfb87c0a2e81d55f864e447eb9d2b3b1af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.startswith(prefix) and v[len(prefix):] in self.inflections\u0060 appears character-identically in 2 files \u2014 pattern/text/de/inflect.py, pattern/text/nl/inflect.py. 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":"pattern/text/de/inflect.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4bb4843ca3cd8a6b29c2a32ef2117cb4a58cf55a1b81cc16d31edbb9391cd7"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060v\u0060 is text this program did not author, and it is written into a quoted attribute value through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5c3ba6abf0f5a3e314d458b210e69c226526766dbab87203e458b3e39d036f"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060((type==FUNCTION)?\u0022\u0026nbsp;\u0022:v.replace(\u0022_\u0022,\u0022 \u0022))\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/canvas.js"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"759417776141e0b5c72af7054a44df2b7e7b8e1d8e3f66579a8cef4c307cf356"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060((a.label||id)\u002B\u0022\u0022).replace(\u0022\\\\\\\u0022\u0022,\u0022\\\u0022\u0022)\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd5275f1a5531856707f03635d4507d20aad6ef8b343e4e452409d369562c0f"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060a.href\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/graph.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a8b28f1836a3e953c0d13301fa12c808c8c738568c14368122b118f5a1ddeb"}},{"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":"pattern/__init__.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7128e3e3cff7990f0388c8f59c18250bf6a4486f314160078becd56b80c7e704"}},{"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":"pattern/helpers.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e03b83b6bf3ee00459c03a757ea104fd18e765ef407e06bdc8f901c538e892"}},{"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":"pattern/helpers.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613eb0e563da5e8960ba0b66c92816325d2ccd0200b550b0f7e017bec51ce9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/metrics.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04acef6fb64ee414f8829572057cf0b3d0004bff8927e7d2cc29b4df136b8d2"}},{"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":"pattern/canvas.js"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b06d9e5f70dee72a86c0ec68ecffc80d7347233b47d9c5dedde80caf0db10d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"642474ac914b5683afe8bb591a84951bab3bb5782c2426f994e9465a556eb989"}},{"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":"pattern/web/__init__.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"580491009408d77453b4805e60fca4723fc9d74a01953c770d2d715c0b696dad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"291c72d9e66b8d1ea6a3e730c4a0568861dfac1809734233f3a67c0191a28844"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7cf7172ed5db1c18059514e5c6156763fff5aa5ffca29c6b9ee9ad85e8e869"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1c0d36cee2e58caa59b8e753c6e45b1c92fb604b1662ec5ddbb58cb9e9b6e7"}},{"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":"pattern/web/__init__.py"},"region":{"startLine":4456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb09952047f0817a1535fa59923857f3855e0b20d90adcae51fe112be3e2e16b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/oauth/__init__.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f218bed2cd76d42b62d7da69b19a0fc5df59c39beaca8b506c7d7cb601cc749f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/imap/__init__.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25eacf6bcdcff5ca67172bbcf886208449cef15543834dd2c4f61a4cb972e6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/imap/__init__.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ba9fb16fed81a47de3e2a2c8612ffa900831b910279f598c188ec6dddb1fed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/imap/__init__.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e551418dad892ade6b4c43b3f83e76fc747bce0679974bf63f720fb5eee15fee"}},{"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":"pattern/web/imap/__init__.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"534faba7f68e6f62a56c44063d9a2df9844527c85dece06750b1e2c9fb49b0ab"}},{"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":"pattern/web/imap/__init__.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed073f5c673286d0302a09d8dc7a26aaff3ff5c90a6dcd21f02a10a6a3b7dada"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/cache/__init__.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c754fe4ba47dcb9e18c17a948564059d7bd818a51ade50d553e6c537564af8f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/cache/__init__.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c565447983b9a2139593cd49bfa052cdd2dc3c29edded6d7b249f2ca51fbef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b38e1a7c5a88224391d016ee5961a5fd06acd822e50ee1bd1e925b1bd4fd31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcc711664b7aeeab832b270b3d6809a5178c7f8b37259956f93df109d9ab9ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"872f86070fd72aa697370ff429c73122a0ae685dd1deaf29e57da89206a4c23f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4738915987b033f83e2fdbe87ca78d7bdb23b010de7f5b6e4cab6984739295d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":3107}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d458c677c1fbef7bdc0ae8fb7c22bb21d14419df64ee79104c0f9b6b779b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":3760}}}],"partialFingerprints":{"codehealthFindingId/v1":"62897df6ec130366b6f7527f456f1c0be585e34d483f74429eb86d8a237b70bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/__init__.py"},"region":{"startLine":3845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2c3a639aaff4458020ff41303c8648029d3ad93d4cea0ac65c3326a5ea8536"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/__init__.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d7f381a3000072ebd7e0f783b0861c14d56187c62288849e195565b697c82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9a9026fa3e6166bda49f984819e0825af7975c256f2c2e2b8f50432ab05d56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/vector/svm/liblinear.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e7b91cf99309c94da2f46093fc480deb9049945b94a1f73d0c20e6268897da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/__init__.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3d4748ad1c420d05c75ed8d38892554d182c0205128678570e04ec49f10a15"}},{"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":"pattern/text/search.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da5b1633c4ecd3dc0030655f4943e6cca710f0cbe083c0696ae84dbaee136a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"884bc6d3dfb0cf5390f59f5cadc1e3900bbc3b2570fe28c033f80d7964f3050a"}},{"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":"pattern/text/search.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c77927a9ba68ccdcd50f986431869c250ca32b52314bc3d2417d14bc94e041c"}},{"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":"pattern/text/search.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2470a79a40bdeefb5f6ed10fde1e2d67f6fd252ed74417fcac399271ceb03a0"}},{"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":"pattern/text/search.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e6b8e9b6a0a1ed993eb18e3e09db1dfa6ebbffcf68dbd0d02204c2c9a88ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/search.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02744b697a250940fedcc6f241a16af7c50e5151658c25d2cd1dea2ffee20eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/tree.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca7661ed23375ac02eeb6eeb5d11adff9ce5876380d1da8f8abc0aa3da6f77d"}},{"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":"pattern/text/tree.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2611d5d1cac2ab1dbf1d4635eb4b8f8993716774aff8df0afe3536dd9a448876"}},{"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":"pattern/text/tree.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"162546a574ad8802fb86ec1185c2448a554039b5cab99709adb39d938c1a0003"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/xx/__init__.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5f33b3388a29f05e9193b4997003884d73fa61eaa415d4117685609096a3b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/xx/inflect.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d22dd7008445f71d4aa606c686550bc4d571547e938cd4c915aa63129336e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/ru/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd2eec1f444cb80003b75f0b2639c318f581bd7c152b9977988fe74bcbaf88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/ru/wordlist/__init__.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9777a54b29a547aa107dba099a353c3b13a1a38bab55ee0f408c0bfc79ddff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dec43075ae50ed5ed756bff5ac561ad31369d4b024b368e73b39613341a8d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/nl/inflect.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"152c4a0d0958194345896be479a8b11710110406fff73260e9b78095add2e421"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6eed3e1f4c3453d396220ba080c2e3816adc768e1572649ca50aba59ab39ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/it/inflect.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"703a50e7784cf2803ffc6fc89f0310b96c673a6854681ecdc5410b7f82cbb66c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/fr/__init__.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a08c90c88ee120948122346feccf1c43f6ba474942a532da62021fa1fa3cb51"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/fr/inflect.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb04da6a3f69add2efdabb09df3681dfbbab9511627a30fe87432e99612670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9bb54cfa1863212c5ce8373997a00888c8871e463d0f4ea063c14f1cf8ed5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/es/inflect.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"092db24770ef4c699be479d92d51f364d931f10c08a304669e57ced3867d53d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58ef083713aad69eade38efecc7afd326c8560709967a64ca7b1e48772cb5a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b01a115daf26349d77fbf384c544f67937965230eda61f0d3f2f556341ab740"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3b3121dd23358722afafb7471497cb2a5bd5492b3012361c5493b6e5473ec9"}},{"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":"pattern/text/en/inflect_quantify.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"92509b7e260da4fde6b57d65c2660bda8fe94a5ca9681c6ac0a30f9615cf37a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa808828e9e0608126e9d90d77cab07412398bb2596586f406d19358cbcdd1c6"}},{"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":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616d87cacd066777f3ffcaa098313e7816cf447a539ed9feda957a1c05fad3d"}},{"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":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c712ea828fea3365e676c3d39c76c568f9444a535ac431a86e299bcc3155b"}},{"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":"pattern/text/en/wordnet/__init__.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6ad62f94ad65d70771aeec26b58e9ac5b544b1dc2a8915bbfbe1ec221f8e76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/en/wordlist/__init__.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f6f35990f4ab66ac765e38033507c3db14af60c8108898ccd2573e33cb4d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/__init__.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497f5dc98f1980c5ab72d1b6bab9cf2858194109fbf1457aec13e4ad0c263e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/text/de/inflect.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9608f437fc9424aa21af5d31851f426884e0e3f56033ef579bfb181c091e06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaf484454bf39d1b2bc2339e717650c265c6bcd63ccbfdb31a6507af2e146a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddf738692cec5bbc68dabe90c17968008c98a10eaaaf86dd26256e2f606288e"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/server/__init__.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b9806a81aa127a266ca1bd2d004341fcbfad737501b56b8059b750d2055628"}},{"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":"pattern/server/__init__.py"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78eaa0e8e5f4e2f64ce5db100f1e8ba443b05637b40e844e1328edd851fe0e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/__init__.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af18d6dc87f7259588e9da7e7ccab6a5dbfa280ed756314d597c12129b2da1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/graph/commonsense.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d1e31acee88734af59875b3161226c6a24906159da776fb9a8455ef3c04d62"}},{"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":"pattern/graph/graph.js"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3bc870a011ba8c76df2202f8573ec0227ebde0232ea7f93a594a5102298bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff66f2cf8b1ea618f8780a4272acc80117ed00096cc3219afed9b54a525666cc"}},{"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":"pattern/db/__init__.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"821d7370e32373bd70818edf5d415e63aef3bb469e4d483a162f9eed853c73ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/db/__init__.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"569bfa756a498df9b22dfef5d562eaac4edcdb30ff00150162fc8adb7249dd75"}},{"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":"pattern/db/__init__.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8cbec84ce37706bf27e38c13c326c150f91e3d9b12a6bad2b5a7166329d203"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pattern/web/__init__.py"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bb709a4566ea383c5ad26458954a83fb3a5e95626b14824699584f41cc7289"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-668","guid":"e2cb99db-6d24-b056-b0d0-885a733ec403","name":"Exposure of Resource to Wrong Sphere","shortDescription":{"text":"Exposure of Resource to Wrong Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/668.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-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-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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":60,"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."]}]}