{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"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":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"slit_combine.extract_spectra (cyclomatic 84): slit_combine.extract_spectra has cyclomatic complexity 84 (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":"msaexp/slit_combine.py"},"region":{"startLine":5420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f36d84c03fffa83e3e36c542ef6f228ed95f467afc6eff3fe126d9d261d955"}},{"ruleId":"D1","level":"warning","message":{"text":"combine.combine_spectra_pipeline (cyclomatic 64): combine.combine_spectra_pipeline has cyclomatic complexity 64 (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":"msaexp/cloud/combine.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e451df9a2633956ff45e281582acd50f3a7868a3e0aa0a6b618aa46e7747262"}},{"ruleId":"D1","level":"warning","message":{"text":"SlitGroup.parse_data (cyclomatic 61): SlitGroup.parse_data has cyclomatic complexity 61 (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":"msaexp/slit_combine.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752e5a53fa682e4060bd1af28bb79b0f7e460f26e42060e0c0d9b1124ba7216"}},{"ruleId":"D1","level":"warning","message":{"text":"NirspecPipeline.extract_spectrum (cyclomatic 57): NirspecPipeline.extract_spectrum has cyclomatic complexity 57 (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":"msaexp/pipeline.py"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b368d8f73f3d6542ee81f146789b8f825399e02bf44745bc7f7f2181d40d665"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline_extended.run_pipeline (cyclomatic 46): pipeline_extended.run_pipeline 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":"msaexp/pipeline_extended.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf8d363c9e12d0d950f03b5bb2f81816b5c2d1ddcfde02c74ef702348b6c23"}},{"ruleId":"D1","level":"warning","message":{"text":"drizzle.drizzle_slitlets (cyclomatic 44): drizzle.drizzle_slitlets has cyclomatic complexity 44 (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":"msaexp/drizzle.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0515444e180475dbb0ef889e623be0c463938084ed08119f9a58bf223150d747"}},{"ruleId":"D1","level":"warning","message":{"text":"general.drizzled_hdu_figure (cyclomatic 43): general.drizzled_hdu_figure has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/general.py"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"53439f61f595e6d0f53101cde8db7693d80aff29e2d3d8bdea8a141097352d7a"}},{"ruleId":"D1","level":"warning","message":{"text":"spectrum.plot_spectrum (cyclomatic 41): spectrum.plot_spectrum has cyclomatic complexity 41 (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":"msaexp/spectrum.py"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c115637bd328c03d1d026db091b0b9d483d8cf4d0d2072f5681bb64a91ab83"}},{"ruleId":"D1","level":"warning","message":{"text":"LineList.add_to_axis (cyclomatic 40): LineList.add_to_axis has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/lines.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c10e87ea243ddb83c4043477e564f6f228dd7ce649abcd8032440260b878ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"redshift.run_fit (cyclomatic 37): redshift.run_fit has cyclomatic complexity 37 (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":"msaexp/cloud/redshift.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2a9a504bc04ce3ca61ba590e7b68bbeb13046a0b02380847e71be770f6603b"}},{"ruleId":"D1","level":"warning","message":{"text":"combine.get_extraction_info (cyclomatic 35): combine.get_extraction_info has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/combine.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c4e96fc1fbf2a82f97348edf223e4e956e5fcb1976888c1bdddb79a0fed51f"}},{"ruleId":"D1","level":"warning","message":{"text":"fixed_slit.reduce_fixed_slit_obsid (cyclomatic 34): fixed_slit.reduce_fixed_slit_obsid 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"81315ffd2821e5dc92cbe1036f10af03e2ebaf9d04bd0a235b63cb5065542a58"}},{"ruleId":"D1","level":"warning","message":{"text":"spectrum.make_templates (cyclomatic 34): spectrum.make_templates 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":"msaexp/spectrum.py"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"211127e23d0cd26226db7ff8d66765b5943c178ec160a30761b673e23cdbe60b"}},{"ruleId":"D1","level":"warning","message":{"text":"ReducedCube.line_fit_pipeline (cyclomatic 32): ReducedCube.line_fit_pipeline has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e3055c847bf7e594158f40604acd7eb35ca7133e4447d4b615d9f4945410c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ifu.ifu_pipeline (cyclomatic 31): ifu.ifu_pipeline 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":"msaexp/ifu.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4477c3879fd8274124ad20edcbeedde7387a944ad99603018af84c051706891"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.full_lrs_pipeline (cyclomatic 30): lrs.full_lrs_pipeline 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":"msaexp/cloud/lrs.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60079ac58d01afb6149acecdd65a52cc2b397c9180624b8925c1e3d5318d932"}},{"ruleId":"D1","level":"warning","message":{"text":"slit_combine.objfun_prof_trace (cyclomatic 28): slit_combine.objfun_prof_trace 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":"msaexp/slit_combine.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab8a38f6f3a832cd0463716efdef5c7945128b5dac463b4fdf090736caa5205"}},{"ruleId":"D1","level":"warning","message":{"text":"SlitGroup.__init__ (cyclomatic 25): SlitGroup.__init__ 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":"msaexp/slit_combine.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a517863e00a51a5331bab60268ce9c4fd86252fb0a93ef8b0daa2095fa07d048"}},{"ruleId":"D1","level":"warning","message":{"text":"spectrum.read_spectrum (cyclomatic 25): spectrum.read_spectrum 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":"msaexp/spectrum.py"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53212f36ec1ae1208c726f919171056820b6c2e35adfe448310434a8f59b6c9"}},{"ruleId":"D1","level":"warning","message":{"text":"combine.handle_spectrum_extraction (cyclomatic 24): combine.handle_spectrum_extraction 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":"msaexp/cloud/combine.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3246dfa10f4e5a3e8e88217eb2a6655859192c0e6a346994a3c4164e18def"}},{"ruleId":"D1","level":"warning","message":{"text":"spectrum.multiplot_spectra (cyclomatic 24): spectrum.multiplot_spectra has cyclomatic complexity 24 (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":"msaexp/spectrum.py"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cb5764a2f3084497c21405bb34a7ebea94541f6c1fc0bec6a2b0e3a25277f3"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.rate_group_regions (cyclomatic 23): lrs.rate_group_regions 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6e7f76cddc825deded20773ded6399f9cd99eb8d1366e4e4d36a21e8ee6e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.cutout_pixel_table (cyclomatic 23): lrs.cutout_pixel_table 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e275b0e4826954c7223d6ca89acbb87bd751d4dc92e63d5668e775f2c3d37d"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.make_summary_tables (cyclomatic 23): pipeline.make_summary_tables 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":"msaexp/pipeline.py"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1fdbaf0c27a1625bdf1e12285397a62f8702b452722506c3fb8d7fb292bcda"}},{"ruleId":"D1","level":"warning","message":{"text":"drizzle.make_optimal_extraction (cyclomatic 22): drizzle.make_optimal_extraction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/drizzle.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a99b485e3a9a5bbed6c5d85d939242110226ce55e92a746c11e36943f07da46"}},{"ruleId":"D1","level":"warning","message":{"text":"LinefitData.line_figure_2d (cyclomatic 22): LinefitData.line_figure_2d has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":4600}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e611ac4ab8c91844569f61af631a2448a8420bc32842d89d77cd7645aca85b"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline_fs.reduce_fixed_slit_obsid (cyclomatic 22): pipeline_fs.reduce_fixed_slit_obsid has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_fs.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea5998422cc2c4f8bffe92317e9507cf02044d415c182f7293a66a85ac1df01"}},{"ruleId":"D1","level":"warning","message":{"text":"SlitGroup.estimate_sky (cyclomatic 22): SlitGroup.estimate_sky has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_combine.py"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"314573e7cbaf0fbb651c82249913805fc6d967626512fbb77b5e82bab55714f7"}},{"ruleId":"D1","level":"warning","message":{"text":"SpectrumSampler.smooth_velocity (cyclomatic 22): SpectrumSampler.smooth_velocity 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":"msaexp/spectrum.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5339bc18efa89d6756a65618768ff4d19d10ecdd72d4c3e1e74f64660ed0cb"}},{"ruleId":"D1","level":"warning","message":{"text":"general.build_regular_wavelength_wcs (cyclomatic 22): general.build_regular_wavelength_wcs has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/general.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78068c1fc5b6e1608eaf356ce6cfc23851b7bcddf14ee3c9a0773ad4e29493"}},{"ruleId":"D1","level":"warning","message":{"text":"ReducedCube.fit_emission_lines (cyclomatic 21): ReducedCube.fit_emission_lines 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":"msaexp/ifu.py"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb1a393f8de3344b575985401a388be4c6f2a2870759ecfb5deef9d12d5c870"}},{"ruleId":"D1","level":"warning","message":{"text":"msa.pad_msa_metafile (cyclomatic 21): msa.pad_msa_metafile has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/msa.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"391afac0ad965547abf35d7f60025f12aa3134d9f217a150b94045b29fd42b99"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.simple_trace_fit (cyclomatic 20): lrs.simple_trace_fit 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":"msaexp/cloud/lrs.py"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e5b468efa7fa4fe22e1b1bdcb86514637fddf081bef5434643e986c6436673"}},{"ruleId":"D1","level":"warning","message":{"text":"SpectrumSampler.bspline_array (cyclomatic 20): SpectrumSampler.bspline_array 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":"msaexp/spectrum.py"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f90b85c0f13c606e4f2288202145004f66953b57d88ac99f3640447d60991c"}},{"ruleId":"D1","level":"warning","message":{"text":"spectrum.fit_redshift (cyclomatic 20): spectrum.fit_redshift 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":"msaexp/spectrum.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e371d1454ea88f5a441961d04517a4252ff55b01d6bc0aa520d3af4def76a4"}},{"ruleId":"D1","level":"warning","message":{"text":"assign_wcs.load_wcs (cyclomatic 19): assign_wcs.load_wcs 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":"msaexp/fork/assign_wcs/assign_wcs.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f0e2ac58723b5a6ad33b5a300f650e0c6e67c0fe673a275af540bd078f2ad"}},{"ruleId":"D1","level":"warning","message":{"text":"slit_combine.drizzle_grating_group (cyclomatic 19): slit_combine.drizzle_grating_group 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":"msaexp/slit_combine.py"},"region":{"startLine":4804}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d912681b2c7bb2a9967a1c7ff0e772aff191f89f2c7f051563805bc12192db0"}},{"ruleId":"D1","level":"warning","message":{"text":"SpectrumSampler.multiplot (cyclomatic 19): SpectrumSampler.multiplot 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":"msaexp/spectrum.py"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"719429c61a3f839b8d7992b857765dc1bd86feb72714e2a73093c85822103457"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.process_2d_products (cyclomatic 18): lrs.process_2d_products 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":"msaexp/cloud/lrs.py"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a692024d262815ad91d0586516c854c1b0588c088f644c90898190c7523f7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ifu.query_obsid_exposures (cyclomatic 18): ifu.query_obsid_exposures 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":"msaexp/ifu.py"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7100e373b4a8a85e8213de0e81614c68c0387b368f6b01ec76bed441ec12d02"}},{"ruleId":"D1","level":"warning","message":{"text":"resample_numba.compute_igm (cyclomatic 18): resample_numba.compute_igm 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":"msaexp/resample_numba.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd406ef9b4ea6865f67a3fa9e6007e3b07678b4f71ab3dd73eca202ef2db7d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"general.slit_extended_flux_calibration (cyclomatic 18): general.slit_extended_flux_calibration 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":"msaexp/utils/general.py"},"region":{"startLine":3563}}}],"partialFingerprints":{"codehealthFindingId/v1":"437dc4243bae682fe68309cb9306af9df645ee534eca217553522e43cce2c87b"}},{"ruleId":"D1","level":"warning","message":{"text":"fixed_slit.run_one_fixed_slit (cyclomatic 17): fixed_slit.run_one_fixed_slit 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b211285739d4121f1fdc3861a12f949909295b99f616c9ed955a63d12d0c63"}},{"ruleId":"D1","level":"warning","message":{"text":"lrs.nod_sky_subtraction (cyclomatic 17): lrs.nod_sky_subtraction 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":"msaexp/cloud/lrs.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21c100cc214ab42d7a0f6b33806fe4bf711d8afcda814fe8a773bdd842ccf6a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinefitData.plot_pixel_spectra (cyclomatic 17): LinefitData.plot_pixel_spectra 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":"msaexp/ifu.py"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5e87a8fdebfcae12bdd772de86261bee94d2ac008dae3565387545da21dbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"NirspecPipeline.run_jwst_pipeline (cyclomatic 17): NirspecPipeline.run_jwst_pipeline has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbfdcb26c81857a1a166e294f7a20d60b86bbc4401725e349a43a024defa6c1"}},{"ruleId":"D1","level":"warning","message":{"text":"slit_combine.obj_header (cyclomatic 17): slit_combine.obj_header 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":"msaexp/slit_combine.py"},"region":{"startLine":4466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd077396f918d3e5a2d4b5b6897496659794415133f1086f487c636eac32f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"lines.get_atom_colors (cyclomatic 17): lines.get_atom_colors has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/lines.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7826c6c4bd914c69b8cc9c92697662f7489ab0c3ebc96a786690ac1c49ea6842"}},{"ruleId":"D1","level":"warning","message":{"text":"ifu.pixel_table_background (cyclomatic 16): ifu.pixel_table_background 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":"msaexp/ifu.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a2d76e299ce05d05126711c95bb595cde9941a89a0856a0d77918f4719dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"ifu.cube_make_diagnostics (cyclomatic 16): ifu.cube_make_diagnostics 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":"msaexp/ifu.py"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cba114777809899e9ef1e36b8f3572812d420a337250b12455a1167846504f1"}},{"ruleId":"D1","level":"warning","message":{"text":"MSAMetafile.regions_from_metafile_siaf (cyclomatic 16): MSAMetafile.regions_from_metafile_siaf 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":"msaexp/msa.py"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"639b038cbd0c097000de4a843c2388c0c2392ef9ff1aceb743dba75601b2ee96"}},{"ruleId":"D1","level":"warning","message":{"text":"NirspecPipeline.initialize_slit_metadata (cyclomatic 16): NirspecPipeline.initialize_slit_metadata 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":"msaexp/pipeline.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8293f61d6d5f9a4f04d7e729db35befce058e360c154e58c1d4f856b07e669"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline_fs.run_one_fixed_slit (cyclomatic 16): pipeline_fs.run_one_fixed_slit 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":"msaexp/pipeline_fs.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c3b4f087e9c15bf5166c674ff0c66a0898de369a0f174e88ce9f99122fccc0"}},{"ruleId":"D1","level":"warning","message":{"text":"resample_numba.resample_template_numba (cyclomatic 16): resample_numba.resample_template_numba 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":"msaexp/resample_numba.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a072bc8939b090281a0b01b400814a81c9e20bc6534086675a71e2813950cd"}},{"ruleId":"D1","level":"warning","message":{"text":"SlitGroup.fit_all_traces (cyclomatic 16): SlitGroup.fit_all_traces 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":"msaexp/slit_combine.py"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"618b3e24329c2e7a7c33b5038e2ae8aa1fee5a7c1abc8c4906dcc5805fa4bb99"}},{"ruleId":"D1","level":"warning","message":{"text":"NirspecCalibrated.slits_to_full_frame (cyclomatic 16): NirspecCalibrated.slits_to_full_frame 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":"msaexp/slit_group.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"82482a7f2f2e3e844dd1e6053914946ce5c82343e6ff0c1e0642d5c71eb87d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.extract_spectra (cognitive 161): slit_combine.extract_spectra has cognitive complexity 161 (threshold 15). Drivers by points: if/else 69 (124 pts), loops 16 (28 pts), error handling 3 (9 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_combine.py"},"region":{"startLine":5420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5289a409713af4bf1eb4f0cda096c4fe0777b83f66f2235df992553f03445b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecPipeline.extract_spectrum (cognitive 133): NirspecPipeline.extract_spectrum has cognitive complexity 133 (threshold 15). Drivers by points: if/else 55 (108 pts), loops 11 (16 pts), error handling 3 (9 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5b44a2d4a8253fa146f90aa119f7d292f33ffe5c0d6dda3965610df4e19047"}},{"ruleId":"D2","level":"warning","message":{"text":"ReducedCube.line_fit_pipeline (cognitive 112): ReducedCube.line_fit_pipeline has cognitive complexity 112 (threshold 15). Drivers by points: if/else 22 (63 pts), loops 14 (49 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc86b387403daf9ce145b8a9886cb529493f8e32313080d09c9fbf72eb73a73"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.parse_data (cognitive 108): SlitGroup.parse_data has cognitive complexity 108 (threshold 15). Drivers by points: if/else 50 (86 pts), loops 12 (20 pts), error handling 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_combine.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d658f5c34adef6d81f59c7c27eff6fe293809bfac2e0ead58c18929fe172a069"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline_extended.run_pipeline (cognitive 99): pipeline_extended.run_pipeline has cognitive complexity 99 (threshold 15). Drivers by points: if/else 53 (84 pts), loops 4 (10 pts), error handling 2 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_extended.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ade5aca85053890f3f4cf5815ab6182d626a1706c7eb75fc87c0f05b7d8b31d"}},{"ruleId":"D2","level":"warning","message":{"text":"drizzle.drizzle_slitlets (cognitive 96): drizzle.drizzle_slitlets has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (59 pts), loops 14 (27 pts), error handling 3 (10 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/drizzle.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7261eecb32000c572b1c7a78f564ce8aef4cdeb2cbfe21f39b8f92c55acf4486"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.make_templates (cognitive 88): spectrum.make_templates has cognitive complexity 88 (threshold 15). Drivers by points: if/else 27 (64 pts), loops 10 (24 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/spectrum.py"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544b8d8603c9b74d12a88cbb5e41b3894c60549f74efdbc98e77826a023a6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"LineList.add_to_axis (cognitive 84): LineList.add_to_axis has cognitive complexity 84 (threshold 15). Drivers by points: if/else 43 (79 pts), loops 2 (5 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/lines.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a226164d9944482b3536b57f86af8ea4f21546746ca1d3d9bc797e2ec80413"}},{"ruleId":"D2","level":"warning","message":{"text":"combine.combine_spectra_pipeline (cognitive 82): combine.combine_spectra_pipeline has cognitive complexity 82 (threshold 15). Drivers by points: if/else 53 (71 pts), loops 7 (10 pts), error handling 1 (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":"msaexp/cloud/combine.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"df46e7c7450f8ff33f4039b2e7df9128cb98cf0b2857de29f134341a88073d95"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.make_summary_tables (cognitive 81): pipeline.make_summary_tables has cognitive complexity 81 (threshold 15). Drivers by points: if/else 14 (59 pts), loops 7 (22 pts) (nesting depth added 60). 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":"msaexp/pipeline.py"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcc5e5bc7687c1f12b8d30697ca60850a09086317f33cb139684d516196f70b"}},{"ruleId":"D2","level":"warning","message":{"text":"general.drizzled_hdu_figure (cognitive 77): general.drizzled_hdu_figure has cognitive complexity 77 (threshold 15). Drivers by points: if/else 51 (68 pts), loops 4 (7 pts), ternaries 1 (2 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":"msaexp/utils/general.py"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93c7e0962dd86f3d0147c1fcea47d1206bc45ec299f53f894f5f25fd9bb031e"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.rate_group_regions (cognitive 70): lrs.rate_group_regions has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 9 (23 pts), ternaries 2 (9 pts) (nesting depth added 44). 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ce46d52ec016ec846d99a2ad977fdbca374e39168902d6a94176d9d4f0537"}},{"ruleId":"D2","level":"warning","message":{"text":"combine.get_extraction_info (cognitive 64): combine.get_extraction_info has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 16 (24 pts), error handling 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/combine.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c04d268a97c429ebcf82c62ca076b00323484161a60eb99c01ef27b1ec29e1"}},{"ruleId":"D2","level":"warning","message":{"text":"FullLineList.calculate_merged_lines (cognitive 60): FullLineList.calculate_merged_lines has cognitive complexity 60 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 6 (22 pts) (nesting depth added 45). 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":"msaexp/utils/lines.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a46f2f69d68db7157cb2bb19fc01c4d0e4bf261f26b03cd8270740761bdad8"}},{"ruleId":"D2","level":"warning","message":{"text":"redshift.run_fit (cognitive 58): redshift.run_fit has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 8 (12 pts), ternaries 4 (7 pts), error handling 1 (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":"msaexp/cloud/redshift.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1590adc87ed9b0224ec08477fff54b6b9a73b97ae3423e4af5c7eed193ef5b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.plot_spectrum (cognitive 58): spectrum.plot_spectrum has cognitive complexity 58 (threshold 15). Drivers by points: if/else 38 (48 pts), loops 7 (9 pts), error handling 1 (nesting depth added 12). 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":"msaexp/spectrum.py"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d7603846224862dd3f27fd06606ebaec1ca32dcd2e874469cfe7d33fd121e1"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.full_lrs_pipeline (cognitive 56): lrs.full_lrs_pipeline has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 9 (18 pts) (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":"msaexp/cloud/lrs.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bea864dcc198a6a3e98b7ce8df529c207de5652e6183a8ffe5ec424c47d800"}},{"ruleId":"D2","level":"warning","message":{"text":"fixed_slit.reduce_fixed_slit_obsid (cognitive 54): fixed_slit.reduce_fixed_slit_obsid has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (43 pts), loops 8 (10 pts), error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1d9f2691367adc721be37de0ac123507d22ef662fe233786f3b611bbb3f79e"}},{"ruleId":"D2","level":"warning","message":{"text":"msa.pad_msa_metafile (cognitive 51): msa.pad_msa_metafile has cognitive complexity 51 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 13 (25 pts) (nesting depth added 28). 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":"msaexp/msa.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"77816dec24613f83c5120ce55f644285eac5439c68ca100018ecb8d32ac6c899"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.ifu_pipeline (cognitive 50): ifu.ifu_pipeline has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (30 pts), loops 8 (12 pts), error handling 2 (4 pts), ternaries 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":"msaexp/ifu.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad77d12eeb606fefe6149179753f6ee1fad5af270cab39e4a5b71fde46b9024"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSampler.smooth_velocity (cognitive 50): SpectrumSampler.smooth_velocity has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 4 (13 pts) (nesting depth added 29). 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":"msaexp/spectrum.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4344fe0787d512a5c9e6e16236e673ace32f8be40dbcee7ae719d4e5562e3906"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.cutout_pixel_table (cognitive 49): lrs.cutout_pixel_table has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 7 (10 pts), error handling 2 (6 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de99a2667a3a40226623c9f9c22fde098ee33a90865eb0b2e698dc4750345cd"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecCalibrated.slits_to_full_frame (cognitive 48): NirspecCalibrated.slits_to_full_frame has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (36 pts), error handling 3 (9 pts), loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_group.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621212b78545cab32e74e42a064fb892d6ded40adc0d3b1dcb9dc9099754c72"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSampler.multiplot (cognitive 45): SpectrumSampler.multiplot has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (37 pts), error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/spectrum.py"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b74cd804f7a7dae909e0b386d9a3750471e8964e3a93e02005363c2b05ecbe1"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.fit_all_traces (cognitive 44): SlitGroup.fit_all_traces has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 6 (16 pts) (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":"msaexp/slit_combine.py"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0524591601e3cd772a5fb2f898843aacf5aa63234508f691be85ae93b8a5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"combine.handle_spectrum_extraction (cognitive 43): combine.handle_spectrum_extraction has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (34 pts), loops 4 (9 pts) (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":"msaexp/cloud/combine.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc34b98444e9d75eabb1b9ece0caffef7ec8e0f7b30c3d33327e34e4ddd010d"}},{"ruleId":"D2","level":"warning","message":{"text":"assign_wcs.load_wcs (cognitive 43): assign_wcs.load_wcs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 4 (17 pts), loops 1 (2 pts), boolean chains 1 (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":"msaexp/fork/assign_wcs/assign_wcs.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c6cdf08270dcf771854831c35688771f92f88e969a65657c515e2a6cc8e54a"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.multiplot_spectra (cognitive 43): spectrum.multiplot_spectra has cognitive complexity 43 (threshold 15). Drivers by points: loops 14 (29 pts), if/else 12 (14 pts) (nesting depth added 17). 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":"msaexp/spectrum.py"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b2b93c27e2c8621bf61d8647e09e15123b806164a57474c98bcfc3ddc38f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReducedCube.fit_emission_lines (cognitive 42): ReducedCube.fit_emission_lines has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 9 (18 pts), error handling 1 (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":"msaexp/ifu.py"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a949aae1abeab78a296a9ea76043f183b53d5a014bde66aed495c2d0e274a8"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.objfun_prof_trace (cognitive 42): slit_combine.objfun_prof_trace has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27 (34 pts), loops 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 11). 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":"msaexp/slit_combine.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bc3a9dd6686c6476ea68bfb6ad0421ccc320d449446fb5ecb85edbfb7c71a0"}},{"ruleId":"D2","level":"warning","message":{"text":"resample_numba.compute_igm (cognitive 40): resample_numba.compute_igm has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 2 (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":"msaexp/resample_numba.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5085971e3299a87b81b6f19a6fca1ea0970fefa3c580ead24f755828562a1170"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSampler.bspline_array (cognitive 40): SpectrumSampler.bspline_array has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 6 (15 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":"msaexp/spectrum.py"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cfe8c89278151a18f184f09ef831f02698605c4684bc0f3ba511c824b6d779"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.read_spectrum (cognitive 40): spectrum.read_spectrum has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 4 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/spectrum.py"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc36b837dc8c257e7b840fc2a5de18b78bc69508be0ef209bc759fe2bd210d"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.simple_trace_fit (cognitive 39): lrs.simple_trace_fit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 5 (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":"msaexp/cloud/lrs.py"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"74724db6d3c1dd36394a97ba12317c70b80ff2ee8a07b7502e641ec334846997"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.obj_header (cognitive 39): slit_combine.obj_header has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 7 (13 pts), error handling 1 (3 pts) (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":"msaexp/slit_combine.py"},"region":{"startLine":4466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1170954cfb4fae0f72028746044c00307eb3c90d9469f88a80567a504a9f86"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecPipeline.initialize_slit_metadata (cognitive 37): NirspecPipeline.initialize_slit_metadata has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (12 pts) (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":"msaexp/pipeline.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f26c4cc40bbf6325a7385c030b28d8329dad4ac18792710f57c7f3702838f"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.__init__ (cognitive 37): SlitGroup.__init__ has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (28 pts), loops 3 (5 pts), error handling 2 (4 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":"msaexp/slit_combine.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"99555332f823c9299c9f5d86470419524c00c38381af0374ef364086438a491f"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.estimate_sky (cognitive 37): SlitGroup.estimate_sky has cognitive complexity 37 (threshold 15). Drivers by points: if/else 29 (36 pts), loops 1 (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":"msaexp/slit_combine.py"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb632cd52abdaaca846487042ae79da2b17a74ddb9b6e02082fbcbe6f791958"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.fit_redshift (cognitive 37): spectrum.fit_redshift has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 3 (6 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":"msaexp/spectrum.py"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c1ed5dbe237eb391b2eecb87bcb84777c341dbd211ac5e7cb0c5b382ce34b8"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.nod_sky_subtraction (cognitive 36): lrs.nod_sky_subtraction has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 6 (12 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e46627372d02ccee4ff311cd82153c23c32a63dbfc10e66481a7d88970d2734"}},{"ruleId":"D2","level":"warning","message":{"text":"drizzle.make_optimal_extraction (cognitive 35): drizzle.make_optimal_extraction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (32 pts), loops 1 (3 pts) (nesting depth added 9). 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":"msaexp/drizzle.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b03301e4c5314d0210cec9a8c08cc55a3fff4bbd4c393fdcfd22d36fb4bee1"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.regions_from_metafile_siaf (cognitive 34): MSAMetafile.regions_from_metafile_siaf has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (10 pts) (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":"msaexp/msa.py"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5361ed79bbc5a24b7c258d7d33692d8e0059a8e92bb261ed962d6b543b3ff3e"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.drizzle_grating_group (cognitive 34): slit_combine.drizzle_grating_group has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6 (13 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":"msaexp/slit_combine.py"},"region":{"startLine":4804}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ef01aad4c9d37cc552110661500501483610a11f5262ed6c52ae07e3a10326"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.get_flat_diff_arrays (cognitive 32): SlitGroup.get_flat_diff_arrays has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (8 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":"msaexp/slit_combine.py"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2082158c1bbbe717e6250f24f6231b9462017232f35b62258e3d2a2aa9a14f"}},{"ruleId":"D2","level":"warning","message":{"text":"general.slit_extended_flux_calibration (cognitive 32): general.slit_extended_flux_calibration has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (28 pts), error handling 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/general.py"},"region":{"startLine":3563}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d9fe1553441c8ed9f2f47c07166ffa544ffe79b3c66aa372358dd40d898a88"}},{"ruleId":"D2","level":"warning","message":{"text":"general.build_regular_wavelength_wcs (cognitive 31): general.build_regular_wavelength_wcs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 29 (31 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"msaexp/utils/general.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0962abd148a828a09d495e8bc48e1df2a3122d99db1466b104fa7c444fc5a59d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinefitData.line_figure_2d (cognitive 30): LinefitData.line_figure_2d has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (21 pts), loops 4 (7 pts), error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":4600}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c664ef699f473b465acefd4ee3b70135b68b5c4708cab037c9221830a72d80"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.make_summary_table (cognitive 30): MSAMetafile.make_summary_table has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (9 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":"msaexp/msa.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b165bd724cb8afde2b386678e19529206c575b8da48ae5c41f1f4b212399bcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline_fs.reduce_fixed_slit_obsid (cognitive 30): pipeline_fs.reduce_fixed_slit_obsid has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 6 (7 pts), error handling 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_fs.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"909099227c36526a402e143a97138184363abac174f238018e0a527ded3335c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.set_background_spectra (cognitive 30): SlitGroup.set_background_spectra has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 3 (4 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":"msaexp/slit_combine.py"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e61bac082afd63f75e2152aded099ea2d63bc5168c7c511a8040ea72f08a67"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecCalibrated.write_slitlet_files (cognitive 30): NirspecCalibrated.write_slitlet_files has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (6 pts), error handling 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_group.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca5e97af6763b96b5924d777f3ff4ccc8f797bfe9634980814d418ba81abdd9"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.process_2d_products (cognitive 28): lrs.process_2d_products has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 4 (6 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":"msaexp/cloud/lrs.py"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c07e8d97d67314c611b887051a78f94d75f8c449f2270b0c5a3361c971a30a"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecPipeline.run_jwst_pipeline (cognitive 28): NirspecPipeline.run_jwst_pipeline has cognitive complexity 28 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 8 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7171f1a377d1404b345dc1383623f559b65435137c7dc1e5e6bb392e44cfc0"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.split_visit_groups (cognitive 28): slit_combine.split_visit_groups has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (6 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":"msaexp/slit_combine.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b0a4f77d745899d34d27056fd0521c8a34d17c37df902c9520ef4b8bc8a1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.fit_mast_pointing_offset (cognitive 27): MSAMetafile.fit_mast_pointing_offset has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/msa.py"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d5c8273b3b22f049babcc12f8288aa24897e2747533fd221b3f9e4e97afc4e"}},{"ruleId":"D2","level":"warning","message":{"text":"FullLineList.set_colors (cognitive 27): FullLineList.set_colors has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (12 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/lines.py"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e73390f8a7f79155547495d0902b92d90701b67d3321720d828684ec08f8c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.merge_source_ids (cognitive 26): MSAMetafile.merge_source_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 4 (9 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/msa.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0219327be891b1f28fc8fa62a60c563aa13762e69bb87487b52a6668055873cf"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecPipeline.__init__ (cognitive 26): NirspecPipeline.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"febc23f4021ff0f78fa0096d2a33eb8a12c674cb71b2bfa76755c7fa8a7b83d9"}},{"ruleId":"D2","level":"warning","message":{"text":"resample_numba.resample_template_numba (cognitive 26): resample_numba.resample_template_numba has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 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":"msaexp/resample_numba.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4683530673bb87fabea29eb3dcd37ff4ca5431b24ea92a82e1c1866a345c86c"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecCalibrated.set_global_flat (cognitive 26): NirspecCalibrated.set_global_flat has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_group.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e84d20c6aa39015ea6358f555a05b270962b282ab4e6b22d357dda01248ceef"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumSampler.load_sensitivity_curve (cognitive 26): SpectrumSampler.load_sensitivity_curve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), 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":"msaexp/spectrum.py"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dda8d8681c14f19da604166871fe3a700354ea8dc1a155c356c2726d252c025"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.update_output_files (cognitive 25): utils.update_output_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/deprecated/utils.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74d2605597ee7d3fbce2d93ade058ba39db4b6b1fa31248a1ee5358ca1106f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.query_obsid_exposures (cognitive 25): ifu.query_obsid_exposures has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 3 (5 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":"msaexp/ifu.py"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"207cef1d27d7741b2132dbd5ac67a5e70447131131b2836c099f1ab07bbdf53d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinefitData.line_region_pix (cognitive 24): LinefitData.line_region_pix has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":4998}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc6da08f0a89206ee727e42b209434ebb89a3b59e705c46e9909815ac8cff4f"}},{"ruleId":"D2","level":"warning","message":{"text":"LinefitData.plot_pixel_spectra (cognitive 24): LinefitData.plot_pixel_spectra has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4 (5 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":"msaexp/ifu.py"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c452eac38a73a514c3ea76a5e163285ec4e14fea1f036a34dc08cb09f1897d3"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.measure_uv_slope (cognitive 24): spectrum.measure_uv_slope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/spectrum.py"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b78f713fa0e499a33adfb569271810fbd7594a2a62cbff44f587354c5b7c96"}},{"ruleId":"D2","level":"warning","message":{"text":"combine.fetch_files (cognitive 23): combine.fetch_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/combine.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb213bbe82270d75b79c9cf6ea4ad6d338318591c3ae9be35a6e4785a733a1"}},{"ruleId":"D2","level":"warning","message":{"text":"LineList.select_lines (cognitive 23): LineList.select_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (7 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":"msaexp/utils/lines.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cf9551044caafbae0cc23e5cce98cec3251880c7c26dc1b0801903aa8beef5"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.pixel_table_background (cognitive 22): ifu.pixel_table_background has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19 (20 pts), loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9c6f4160380444c92b4c68dac93bcd4511aac4c10b5cd66b4318d72b49b183"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.pixel_table_oper_mask (cognitive 22): ifu.pixel_table_oper_mask has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 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":"msaexp/ifu.py"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8533844b8af38cdb7e6b0b738ae3faca2f6c959a613c8c18c86d2dee2a96cae"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.plot_2d_differences (cognitive 22): SlitGroup.plot_2d_differences has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (9 pts), ternaries 1 (2 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":"msaexp/slit_combine.py"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c87a4329935be9ea5584c834dba90445754c7acf87c033bc226f659396faa7"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.get_lrs_slitless_cutout (cognitive 21): lrs.get_lrs_slitless_cutout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eed93fcb697d120159fb5721e63eb11b0adad0897ab0287dbc144c7eab3a88e"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignWcsStep.process (cognitive 21): AssignWcsStep.process has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (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":"msaexp/fork/assign_wcs/assign_wcs_step.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e604b60478eb7c37bee65c8d1a6a2f1c60a7e3a4b4cdd533b204c060edf4f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExposureCube.pixel_table (cognitive 21): ExposureCube.pixel_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 8 (10 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":"msaexp/ifu.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"216cfddf5060d9d3df3b28693395739ab7b15e7169fd7fb787b2081a43a352de"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.cube_make_diagnostics (cognitive 21): ifu.cube_make_diagnostics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 6 (7 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":"msaexp/ifu.py"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e72af68bf9d51d23ec775c576f06f355ef8d646ee93b809d456d32e688a854"}},{"ruleId":"D2","level":"warning","message":{"text":"general.combine_2d_with_rejection (cognitive 21): general.combine_2d_with_rejection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/general.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"30701125c92bf12b3315d8fcf1718a4a9fec14a7018ca0561c3df4bcaa86eaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.pixtab_from_dms (cognitive 20): lrs.pixtab_from_dms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (6 pts), error handling 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":"msaexp/cloud/lrs.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a95f57e9f3f9b03f1ae8c070dc4bd952a96be2dd00eaa14340dadca553d97"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.regions_from_metafile (cognitive 20): MSAMetafile.regions_from_metafile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (10 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":"msaexp/msa.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"c956882eab98ef7aea7e718f48a545651f8256657249f313a25abb19eb6c781d"}},{"ruleId":"D2","level":"warning","message":{"text":"slit_combine.combine_grating_group (cognitive 20): slit_combine.combine_grating_group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6 (8 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":"msaexp/slit_combine.py"},"region":{"startLine":4611}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d7c13bd380f048c9489822c6e7aec016cccfab1e99d066a2c6eb1aa035ab38"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.dummy_spec_hdulist (cognitive 20): spectrum.dummy_spec_hdulist has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/spectrum.py"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3643aed40ce9022b049aa3f5d50842b8873be169d805b10c1478130f4364c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"general.msa_slit_sflat (cognitive 20): general.msa_slit_sflat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 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":"msaexp/utils/general.py"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f5421c96994ca4ad511846bfb59f70e682d6d4221057d4d0d669ee3ff6bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"fixed_slit.run_one_fixed_slit (cognitive 19): fixed_slit.run_one_fixed_slit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de83a235a8e4a40e8fb0fc78949bf09abbf30e0451feeed18eca24dc2b2eee0"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.fit_lrs_redshift (cognitive 19): lrs.fit_lrs_redshift has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c847229c97be76072bbc4b772c2d07fde5a775965ed17396755da5ba5eec815"}},{"ruleId":"D2","level":"warning","message":{"text":"redshift.read_templates (cognitive 19): redshift.read_templates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4 (8 pts) (nesting depth added 5). 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":"msaexp/cloud/redshift.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9355a1d44b76b9df1fff508f9f8a88a440eae43209f3b7818cc147fe76928d06"}},{"ruleId":"D2","level":"warning","message":{"text":"MSAMetafile.plot_slitlet (cognitive 19): MSAMetafile.plot_slitlet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), error handling 1 (2 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":"msaexp/msa.py"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef0d75a843b3c98f7f32e885a30f9eb034926e55a571de1577d64d9a048699"}},{"ruleId":"D2","level":"warning","message":{"text":"msa.get_shutter_wavelength_limits (cognitive 19): msa.get_shutter_wavelength_limits has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (6 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":"msaexp/msa.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cc08b432dbc1ca1ea189d7d8d7cde9e15ead3c1b07248cac729d7c394bf01a"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.slit_metadata (cognitive 19): SlitGroup.slit_metadata has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 2 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_combine.py"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e98fd15331169d53fffcd09b9a01e5fbafea6799988e65d8d9248425939c748"}},{"ruleId":"D2","level":"warning","message":{"text":"spectrum.do_integrate_filters (cognitive 19): spectrum.do_integrate_filters has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (6 pts) (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":"msaexp/spectrum.py"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"801034da88a350ffee411aa07dc7b5c86ef817994046ae36ea08ce5c6fe2cde1"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.preprocess_ifu_file (cognitive 18): ifu.preprocess_ifu_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), error handling 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":"msaexp/cloud/ifu.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57ad0f9bb5227fbfce1f6e929591cb9603fbbe50e4d526838bfa19038535eed"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.saturated_mask (cognitive 18): ifu.saturated_mask has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5180567d19bba07a12ebb1c410ba2ce6e5bb9623d170d473a833475e8d83fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"NirspecPipeline.get_slit_polygons (cognitive 18): NirspecPipeline.get_slit_polygons has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 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":"msaexp/pipeline.py"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114a5f55af43e7ecab5b3918df9b728a77ec9838d87a21f7f56fd2be79d0f14"}},{"ruleId":"D2","level":"warning","message":{"text":"SlitGroup.flag_2d_outliers (cognitive 18): SlitGroup.flag_2d_outliers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (5 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":"msaexp/slit_combine.py"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efbb2904d855b68d6b81c45e3e0ef16a77b9d8df58f1043b6ed3b8a6f6d2e47"}},{"ruleId":"D2","level":"warning","message":{"text":"lines.get_atom_colors (cognitive 18): lines.get_atom_colors has cognitive complexity 18 (threshold 15). Drivers by points: loops 15, if/else 2 (3 pts) (nesting depth added 1). 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":"msaexp/utils/lines.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5f3a888fa5d86464b481aab37eaa61efe07f05f3a6de114fd7df66754f431a"}},{"ruleId":"D2","level":"warning","message":{"text":"drizzle.extract_from_hdul (cognitive 17): drizzle.extract_from_hdul has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (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":"msaexp/drizzle.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"610680c18135aa324e1edd25be1cc213460c4fd545cff6d93e004e10a240ce68"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.detector_corrections (cognitive 17): ifu.detector_corrections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 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":"msaexp/ifu.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6381c9b25d7a5bd9d12a5e22d9a829d693e1490aec227581177bf5fcc923f804"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline_fs.run_one_fixed_slit (cognitive 17): pipeline_fs.run_one_fixed_slit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (4 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_fs.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae7c16e6d8cf2c603bc5ef2c0d49988daf6320a8cc2fe8d85a81d06b8fff72b"}},{"ruleId":"D2","level":"warning","message":{"text":"general.drizzle_slits_2d (cognitive 17): general.drizzle_slits_2d has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/general.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ab5b38715bf71194ed80e94e5de1b30fd36e26aaa26905a3c42b818c085489"}},{"ruleId":"D2","level":"warning","message":{"text":"lrs.miri_illum_window (cognitive 16): lrs.miri_illum_window has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2699538aa30fa96542cb3ecb83d3344212897460851dc7c18811d143b935e"}},{"ruleId":"D2","level":"warning","message":{"text":"msa.preprocess_nirspec_msa_file (cognitive 16): msa.preprocess_nirspec_msa_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/msa.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47b5693e536e2acdb81819c934c8b4a69abe73528300326f8c0f766cf5bf68b"}},{"ruleId":"D2","level":"warning","message":{"text":"nirspec.ifu (cognitive 16): nirspec.ifu has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, error handling 3 (4 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":"msaexp/fork/assign_wcs/nirspec.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfc72be58f535c1087f73db54a99f4ba97edba63a7c737a42a277e9dd5ca8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.drizzle_cube_data (cognitive 16): ifu.drizzle_cube_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), 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":"msaexp/ifu.py"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b9ffeb8aa4c396de85a5f04a72e475cd946406208f785d2a2489f7b3b5566c"}},{"ruleId":"D2","level":"warning","message":{"text":"ifu.cube_extract_segments (cognitive 16): ifu.cube_extract_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (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":"msaexp/ifu.py"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"204cac8235d0bd264314ce9b3df60d391ed622616489620d092a1b7f273d123b"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.exposure_groups (cognitive 16): pipeline.exposure_groups 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":"msaexp/pipeline.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b99901506077e134727ba14e9919bb08f3e42ecf9404280dda761489999e60"}},{"ruleId":"D2","level":"warning","message":{"text":"MolecularHydrogen.spec_model (cognitive 16): MolecularHydrogen.spec_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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":"msaexp/utils/lines.py"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3119c435c68dcc8c2feaef282cff3c6eacac765711a79afe9e1c54ca03aa557c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/ifu.py: FileTooLong \u2014 3453 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2953 over it, 6.91\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":"msaexp/ifu.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f1c699ff1be139e6adaf7e67167bceb1b4bfddde1a29dd830c9d647793ecf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/slit_combine.py: FileTooLong \u2014 3450 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2950 over it, 6.90\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":"msaexp/slit_combine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8520b856b8ea6a2276aa9c645c7849b7a79d13a2d81d48c3fe2ac3d7fc33318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/spectrum.py: FileTooLong \u2014 2585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2085 over it, 5.17\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":"msaexp/spectrum.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e9e93b105abb3f221d5e2b6052a05badaae4c4b17042181459b051b0aaa565"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/general.py: FileTooLong \u2014 2414 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1914 over it, 4.83\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":"msaexp/utils/general.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"663350383f338e2c15836e2b11caa6872f67136679142e92bc0c68e355d5d523"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/lrs.py: FileTooLong \u2014 1625 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1125 over it, 3.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":"msaexp/cloud/lrs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb73092116612999f92093b2379cececc1682c55ff8d7af779586c62c9b3dfe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/pipeline.py: FileTooLong \u2014 1454 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 954 over it, 2.91\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":"msaexp/pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1447cca85f2250047ee7c60251cd050e48fb15356f3569a2b0196df529119a3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/msa.py: FileTooLong \u2014 1314 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 814 over it, 2.63\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":"msaexp/msa.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8132fdc54b3d5f8889652d8a3f5dfa8dadbcb01d88ebf992260ebfcee8b22de0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/lines.py: FileTooLong \u2014 883 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 383 over it, 1.77\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":"msaexp/utils/lines.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bed3413223fc7a750ba897c591df71f46e179587fe793ba54a6e4e32bbae8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/drizzle.py: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 321 over it, 1.64\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":"msaexp/drizzle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ccfdda0538e47ba6effea6b301bcf23fa88c9bc6800174839ae63d196fe106"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/slit_group.py: FileTooLong \u2014 795 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 295 over it, 1.59\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":"msaexp/slit_group.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f2e527d70eff492c94bfcbd91aaf5b0f04ab5c419bb0b7a71cd4065fab1fa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/combine.py: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 230 over it, 1.46\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":"msaexp/cloud/combine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"298fc9a1284050c72fa5b1635261ee61cb05e40c68852b2f140ada48371f3227"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msaexp/resample_numba.py: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\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":"msaexp/resample_numba.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eadada5007e8968084a3e52c29197cfc3a54d9dfe1c5b0322d8c761b67a5779"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (142 shared lines): msaexp/cloud/fixed_slit.py:239-463 | msaexp/pipeline_fs.py:185-388 \u2014 These two members are variants of one another: 142 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d265bb1a8e36ff263062125fc5007e7e5230050e69bc771c816840c983e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (120 shared lines): msaexp/utils/general.py:2643-2801 | msaexp/utils/general.py:2813-2951 \u2014 These two members are variants of one another: 120 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":"msaexp/utils/general.py"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fe7d825fc30f8f132b413b0fd773eca73ef30bd6f78eb3484c8ff3aa49af14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): msaexp/ifu.py:1393-1486 | msaexp/ifu.py:1502-1623 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"msaexp/ifu.py"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e414fefd759287a78b717e10a084e4ca3ef4dcb3f895af967ebc18c8e5958"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): msaexp/drizzle.py:1406-1511 | msaexp/slit_combine.py:4618-4801 | msaexp/utils/general.py:1765-1829 | msaexp/utils/general.py:2338-2451 \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":"msaexp/drizzle.py"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7af21bfe6f77c6db12cdcc1610e66a15693329ec8d5b32b99c19718cbe1a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): msaexp/cloud/fixed_slit.py:467-547 | msaexp/pipeline_fs.py:392-476 \u2014 These two members are one piece of code written twice and then edited apart: 81 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0f3922a66f5d4e910a5f0b576dfd6e253f0444e776dc20e6c06e1dc888ca9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): msaexp/cloud/lrs.py:2852-2958 | msaexp/cloud/lrs.py:3684-3764 \u2014 These two members are one piece of code written twice and then edited apart: 81 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":"msaexp/cloud/lrs.py"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5cf876ed6756c5173b58bc012c4701f095982a6c5eeaf2e066d6b85d92e324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): msaexp/drizzle.py:735-823 | msaexp/drizzle.py:827-896 \u2014 These two members are one piece of code written twice and then edited apart: 70 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":"msaexp/drizzle.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7aa6f81b4eb45085f3dec3084e025456bfb682ab5f417727c020f88db664e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 59\u002B corresponding lines): msaexp/resample.py:204-267 | msaexp/resample_numba.py:401-461 | msaexp/resample_numba.py:468-526 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 59 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":"msaexp/resample.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f058b326c24015ef4ecca4b1cdae6d1be77b92fff3d5815d85043ba0e307a69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): msaexp/pipeline_extended.py:179-236 | msaexp/pipeline_extended.py:245-302 \u2014 These two members are one piece of code written twice and then edited apart: 58 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":"msaexp/pipeline_extended.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6291a2ace60ee06618950287bd808f22d04a046b89529184461c7d21d9e2465a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): msaexp/utils/general.py:2983-3023 | msaexp/utils/general.py:3027-3072 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"msaexp/utils/general.py"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4072a3c05cb06eb159386c89a60c2e0a3b09eb080a09831f8eedd7e82b2d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): msaexp/ifu.py:2292-2318 | msaexp/ifu.py:2421-2452 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"msaexp/ifu.py"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebabb5ca26d94edef07b8c04a3de545e238340bdd7938b99c7a23cbcee9dd5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): msaexp/resample.py:106-148 | msaexp/resample_numba.py:353-396 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"msaexp/resample.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e77ea2ff159af65d47218b22f2304db07dddbafb7fec30e08e08a359fc5c063"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): msaexp/resample_numba.py:82-109 | msaexp/resample_numba.py:114-144 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"msaexp/resample_numba.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f0d77e40e018d71cf2722d7d45c6f5bc71d7e88bb78220ba1cd8604132071a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90\u2013123 lines \u00D7 2): msaexp/utils/general.py:2643-2765 | msaexp/utils/general.py:2813-2902 \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":"msaexp/utils/general.py"},"region":{"startLine":2643}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca72bac6f637f102508ec9e79e7370ed34f816a40ff3a99c29de1e4cb663d1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (78\u2013110 lines \u00D7 2): msaexp/cloud/fixed_slit.py:239-316 | msaexp/pipeline_fs.py:185-294 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060msaexp/cloud/fixed_slit.py:235\u0060 calls \u0060dict\u0060 and \u0060msaexp/pipeline_fs.py:182\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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a86bf693bafa595ab10cd46cb8eaeef90e373516932d2146686f622e65c51d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (100\u2013101 lines \u00D7 2): msaexp/cloud/fixed_slit.py:74-174 | msaexp/pipeline_fs.py:74-173 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/cloud/fixed_slit.py:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2079cea0756dca4d1f64a406f3d4d5c6cc0287b6bcd8da18128576f38820ee02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): msaexp/cloud/fixed_slit.py:479-545 | msaexp/pipeline_fs.py:408-474 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8890df44fcf6a25926deb8bbeb2d13008cc13fa1501424548058af3710a702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201346 lines \u00D7 2): msaexp/drizzle.py:735-780 | msaexp/drizzle.py:827-862 \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":"msaexp/drizzle.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5866de7390f2e0abc6faeb9c2fc16fd3b6ca6ac298fd061fd42cec569a938f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): msaexp/slit_combine.py:4982-5022 | msaexp/slit_combine.py:5148-5188 \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":"msaexp/slit_combine.py"},"region":{"startLine":4982}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1515eaf1c5756526c71c017c58a8ed07af51bb0bd03b8705bb16a0bdd2804f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): msaexp/cloud/fixed_slit.py:29-68 | msaexp/pipeline_fs.py:28-67 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"91faac18b414a600e49f9ae2a4a9147ef2d8df99816f51348d3ebbc602fea3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201336 lines \u00D7 2): msaexp/cloud/fixed_slit.py:371-406 | msaexp/pipeline_fs.py:340-370 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060msaexp/pipeline_fs.py:319\u0060 calls \u0060pop\u0060 and \u0060msaexp/cloud/fixed_slit.py:371\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"864dc630915aab704759414fd483b2dbe0fe86384ca87f981a1eb94515db4181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 2): msaexp/cloud/lrs.py:2148-2182 | msaexp/cloud/lrs.py:2185-2217 \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":"msaexp/cloud/lrs.py"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e26469ab31466461a935c671306df43a48d6211fa6b33a450b482bf188dfacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): msaexp/cloud/lrs.py:2701-2732 | msaexp/cloud/lrs.py:2757-2789 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/cloud/lrs.py:2701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"64da514fa0d2162e2f187fcacb3e9d9ec52917af5b2add7c3bd8c150425b0def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201331 lines \u00D7 2): msaexp/msa.py:2272-2294 | msaexp/msa.py:2304-2334 \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":"msaexp/msa.py"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aefdb334112d978e34a236e6b224970d0cc1bfcd28887b959cebb4bd71d1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): msaexp/cloud/lrs.py:1433-1462 | msaexp/cloud/lrs.py:1651-1680 \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":"msaexp/cloud/lrs.py"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0325b4237ac87fe338e443e9fd1e73d5adaec24031d9cb49227e3d0bd6485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): msaexp/slit_combine.py:448-472 | msaexp/slit_combine.py:484-507 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/slit_combine.py:448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_combine.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c467057bc803af3cbd4c7ca721efe9aeb23eef25dae470bdc4535f7fa32ac62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): msaexp/cloud/lrs.py:2912-2933 | msaexp/cloud/lrs.py:3715-3737 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/cloud/lrs.py:3715\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"8995b3b657706fbc8b0c9ffbc48c17b04855aaaa0ae9a2f199b4cd055d76951f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): msaexp/ifu.py:1398-1423 | msaexp/ifu.py:1514-1539 \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":"msaexp/ifu.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"645b5356f4b3d3842a164ffcaeba640cfc4c67073465d95aedede13d038ba992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): msaexp/msa.py:848-867 | msaexp/msa.py:1936-1955 \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":"msaexp/msa.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c0401a66b6b122fa515322b21978f33cc9ce1ddd1f4a50ecf2741bca8a6e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): msaexp/slit_combine.py:5698-5715 | msaexp/slit_combine.py:5731-5748 \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":"msaexp/slit_combine.py"},"region":{"startLine":5698}}}],"partialFingerprints":{"codehealthFindingId/v1":"6091a64b3fe105d3c45663105cd8074acffbfba7e2ddaca459d144c9ed02c6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): msaexp/utils/general.py:706-723 | msaexp/utils/general.py:925-942 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/utils/general.py:706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060msaexp/utils/general.py:924\u0060 calls \u0060zeros\u0060 and \u0060msaexp/utils/general.py:704\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/utils/general.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e0a1fd31cf227608ecf2a5b73b952db02ff574e7b4bb87a87725d23e34aa48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): msaexp/utils/plotting.py:35-49 | msaexp/utils/plotting.py:54-71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/plotting.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b072a7b921e9670dfdd7b7fcc0c0787ed50e8296c8cfee84b76468e730bbc3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): msaexp/ifu.py:1330-1346 | msaexp/pipeline.py:120-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/ifu.py"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd63701020231ebb775f7ea6f8a5198637c1ce1040db524edd03b928daabad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): msaexp/ifu.py:2300-2316 | msaexp/ifu.py:2431-2447 \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":"msaexp/ifu.py"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed68702222ccdff7500f294e4c5e369439ae5afc99a6e7d4751afc8a0ad9245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): msaexp/ifu.py:4249-4265 | msaexp/ifu.py:4746-4761 \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":"msaexp/ifu.py"},"region":{"startLine":4249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d88ab11454eaa573e916a75d39f1c01d4a2200668d010eb6b4df6d6fbe23ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): msaexp/utils/general.py:2767-2783 | msaexp/utils/general.py:2904-2919 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/utils/general.py:2767\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":"msaexp/utils/general.py"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c9fc179e3efb6187ea5dacce5b47d109d3ed8310184dc87d160e89d77a9cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): msaexp/cloud/fixed_slit.py:337-352 | msaexp/cloud/fixed_slit.py:359-374 | msaexp/pipeline_fs.py:304-319 \u2014 before extracting anything, compare \u0060msaexp/cloud/fixed_slit.py\u0060 and \u0060msaexp/pipeline_fs.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/cloud/fixed_slit.py:337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b894b1a4a6e75da11bd3ac63fb15e86681f33ac7595d0266e431fc1bfbf2d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): msaexp/msa.py:909-924 | msaexp/msa.py:2014-2029 \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 \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":"msaexp/msa.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279f034a7c73bf16ee9576584a111be47a37cfc80ff18b80479ea4dc7e924ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): msaexp/utils/lines.py:484-499 | msaexp/utils/lines.py:533-548 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/utils/lines.py:484\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/utils/lines.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd4f35b8ff47ee17c9c38c4ce63cec5e87bf7ead8189a9782083528a90b339c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): msaexp/pipeline.py:2182-2196 | msaexp/spectrum.py:4022-4036 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/pipeline.py:2182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87fc0999a929e6067acdecb23723e205c93e591ac793337f17e4260422c2b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): msaexp/resample.py:238-251 | msaexp/resample_numba.py:432-445 | msaexp/resample_numba.py:498-511 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/resample.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb9ad400b1bbac8652f80be46b473c7477afbe600235cf44c37d212538778c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): msaexp/ifu.py:4882-4895 | msaexp/ifu.py:4898-4911 \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":"msaexp/ifu.py"},"region":{"startLine":4882}}}],"partialFingerprints":{"codehealthFindingId/v1":"3376d01779504ff3fae807fd68400aa026c5452e921906e2c88452d51e2cf3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): msaexp/utils/general.py:2788-2801 | msaexp/utils/general.py:2938-2951 \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 \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":"msaexp/utils/general.py"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"91892efbd4d85fb0ee2ec8152910a69cd0cbaf4b41091458ff809020d778d8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): msaexp/cloud/redshift.py:578-590 | msaexp/cloud/redshift.py:612-624 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/cloud/redshift.py:578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/redshift.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb5c6bb0af9295b5c6e859c7d55c2403fa5f60ebb638280e9e4fb89986d8fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): msaexp/ifu.py:185-197 | msaexp/ifu.py:831-842 \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":"msaexp/ifu.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9333f7d37798d999ed121dd4bca96e56a3761da06debabf83e1f25e94776d1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): msaexp/pipeline_extended.py:221-232 | msaexp/pipeline_extended.py:404-416 \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":"msaexp/pipeline_extended.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f60dc1bf0870f5139aa3017e30f1b8e0b7482b6e43c2a48395f7b6a92ab75e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): msaexp/drizzle.py:1119-1128 | msaexp/utils/general.py:1620-1631 \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":"msaexp/drizzle.py"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d28e833c0f69b53996ea3e5e0823970f9899d95df22389c895df34b3e129a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): msaexp/ifu.py:4304-4315 | msaexp/ifu.py:4831-4842 \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":"msaexp/ifu.py"},"region":{"startLine":4304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0724ff15f63b34a67bba63661b11dde0e64765b15d0bddd2a4a6c677fd8466ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): msaexp/msa.py:2187-2196 | msaexp/msa.py:2201-2212 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/msa.py:2201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/msa.py"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4fe4e08449e26442847986054a09dc609985d29ba52cffda6859071989ef00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 6): msaexp/pipeline.py:944-954 | msaexp/pipeline.py:958-968 | msaexp/pipeline.py:971-978 | msaexp/pipeline.py:991-1001 | msaexp/pipeline.py:1005-1015 | msaexp/pipeline.py:1019-1029 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"864b3d002d7c59271e96ec51125c5c427ba62c73f94564605141e53c539b246f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): msaexp/drizzle.py:564-574 | msaexp/drizzle.py:594-604 \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":"msaexp/drizzle.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa90080ec2cad30c5de6afaa120d62a9a8f00bc7c2190c5c9e907f0353ea396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): msaexp/ifu.py:760-770 | msaexp/ifu.py:835-845 \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":"msaexp/ifu.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"13541f183148b15075b8df719b3ea360b69b54ba1628769d5ad71a2d12fb371d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): msaexp/msa.py:179-189 | msaexp/msa.py:2073-2083 \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":"msaexp/msa.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c4d733b1fb2c99f408cbdfa8c063d44c118811157865cce4782dd5524a05e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/cloud/lrs.py:1394-1403 | msaexp/cloud/lrs.py:1621-1630 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060msaexp/cloud/lrs.py:1633\u0060 calls \u0060nanmedian\u0060 and \u0060msaexp/cloud/lrs.py:1405\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/cloud/lrs.py"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9402e7775127acc8e9aa0b11099e01ca4da8eb3c62d65f496b181105e6907d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/drizzle.py:803-812 | msaexp/drizzle.py:876-885 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/drizzle.py:803\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060msaexp/drizzle.py:886\u0060 calls \u0060hlines\u0060, \u0060get_xlim\u0060 and \u0060msaexp/drizzle.py:814\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/drizzle.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"692c638aa218f851c91d551bf995a03f3f23a43f83c933735b78b7efea58d9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/drizzle.py:1295-1307 | msaexp/utils/general.py:1692-1701 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/utils/general.py:1692\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":"msaexp/drizzle.py"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed128a0fe9774d08ea5275d3c18eaa64b4ed61ec50b5260d00d09756edd692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/ifu.py:550-559 | msaexp/ifu.py:596-605 \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":"msaexp/ifu.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d98952cd2efa0ab1edad9aa42a6fc2ae2ea613f5ca23bfe12639fb5ee44ab3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/slit_group.py:762-771 | msaexp/utils/general.py:3238-3247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/slit_group.py:762\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/slit_group.py"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c822a29478e43db9e5af6ec442bec613a98f126736e6118cf4c63b3e0ce5f93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): msaexp/utils/general.py:691-700 | msaexp/utils/general.py:844-853 \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":"msaexp/utils/general.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12ec04918d930b01f4b74511b47b864bd38a1e4409ca46c1ff07889902d578e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): msaexp/pipeline_extended.py:220-228 | msaexp/pipeline_extended.py:288-296 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060msaexp/pipeline_extended.py:298\u0060 calls \u0060BinTableHDU\u0060 and \u0060msaexp/pipeline_extended.py:229\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":"msaexp/pipeline_extended.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2027ac9ef6bd60c35aa416b2fd22f7807cd563ee2654faed6b393e28e78113f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): msaexp/spectrum.py:459-467 | msaexp/spectrum.py:755-793 \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":"msaexp/spectrum.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cb7b3b46ffc8b1226809bb01495d98ca5906f2da8ab14a3eba260b2456f210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): msaexp/utils/lines.py:473-480 | msaexp/utils/lines.py:490-497 | msaexp/utils/lines.py:539-546 \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":"msaexp/utils/lines.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ab3f681603872fd9c57869ee4e85859c12b233d4f5eaf61c53f7b64d55401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): msaexp/ifu.py:4421-4429 | msaexp/ifu.py:4435-4443 \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":"msaexp/ifu.py"},"region":{"startLine":4421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac74bdfdec978f0137b674a93dc7d5c1cf0c35ad2b89301d65e81fdfd649efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): msaexp/ifu.py:4941-4948 | msaexp/ifu.py:5104-5111 \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":"msaexp/ifu.py"},"region":{"startLine":4941}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c4e57212891c8a072f9248a1cca661c352410c51e45e9c35274cf90220d872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): msaexp/pipeline.py:1924-1931 | msaexp/pipeline.py:1938-1945 \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":"msaexp/pipeline.py"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40df3c26b202e7d411c02fe6e08aad7641650252b09003de06e3daefaec0f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): msaexp/pipeline_extended.py:469-476 | msaexp/pipeline_extended.py:497-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_extended.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3661fe7e17f400c1f7157af5bcb28c3cdc71a38c43eb53a41d3e9468613520a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): msaexp/slit_combine.py:975-980 | msaexp/slit_combine.py:986-993 \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":"msaexp/slit_combine.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c50ca0881feb7dbb853b3c0f18c62c918e10a69f6a2376135aca713916a892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): msaexp/spectrum.py:504-510 | msaexp/spectrum.py:637-644 \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":"msaexp/spectrum.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b827355790a099ffcea2534500290ea23a5d7bfc2b476a945f8f0c2d9d10c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/pipeline_extended.py:210-215 | msaexp/pipeline_extended.py:276-281 \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":"msaexp/pipeline_extended.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"759cd09f69266b34bbd6fc27194a2269e376795c470a61522df1334b010e2f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/slit_combine.py:1874-1879 | msaexp/slit_combine.py:1891-1896 \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":"msaexp/slit_combine.py"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7f0a6ad9d2a35773b38b2db46b14a9845b87b60e61b592dff3e6226e348cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): msaexp/utils/lines.py:442-447 | msaexp/utils/lines.py:449-454 | msaexp/utils/lines.py:455-457 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060msaexp/utils/lines.py:442\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060msaexp/utils/lines.py:454\u0060 calls \u0060hasattr\u0060, \u0060interp\u0060 and \u0060msaexp/utils/lines.py:457\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/utils/lines.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5122d601878588ee75f20eb31639e5606d8978ec9e92322a2edfda49594386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): msaexp/utils/lines.py:826-832 | msaexp/utils/lines.py:836-842 \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":"msaexp/utils/lines.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf803c28590f25740e5f712df3a3d9068a925dde049b73600b87547934a1836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/utils/plotting.py:258-263 | msaexp/utils/plotting.py:265-270 \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":"msaexp/utils/plotting.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fcd74c6ae75723074452509234299a41ef0c338ed872280dc3b127866ab47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): msaexp/utils/general.py:2239-2244 | msaexp/utils/general.py:2251-2256 | msaexp/utils/general.py:2267-2272 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060msaexp/utils/general.py:2250\u0060 calls \u0060sum\u0060 and \u0060msaexp/utils/general.py:2265\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/utils/general.py"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"578694812185e11a678ab317c563659c0ee7a5dabc5e4130b6a30fc780ba0d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/slit_combine.py:2406-2411 | msaexp/slit_combine.py:2437-2442 \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":"msaexp/slit_combine.py"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"72216331f5563eef684965c61c6d0e8f5347d1cbb4f63eb128e7612059e71fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): msaexp/drizzle.py:1501-1502 | msaexp/slit_combine.py:4779-4780 | msaexp/utils/general.py:1815-1819 | msaexp/utils/general.py:2442-2446 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060msaexp/slit_combine.py:4776\u0060 calls \u0060HDUList\u0060, \u0060BinTableHDU\u0060 and \u0060msaexp/drizzle.py:1499\u0060 does not \u2014 after which the two agree again for 3 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":"msaexp/drizzle.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef376d6adffa8438b8b691ba1f4b565a104694b5652980cb2a46d4b40eb659a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/ifu.py:1811-1816 | msaexp/ifu.py:1827-1832 \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":"msaexp/ifu.py"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a51d041db11a92f05a55446a1cffe588460db3e2800337ded05254763b4c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): msaexp/slit_combine.py:3502-3506 | msaexp/slit_combine.py:3508-3512 \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":"msaexp/slit_combine.py"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"12654675eec81ddae59c1b5757d114e6eea8e14297fa92e9c1106eb5925efc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): msaexp/slit_group.py:751-756 | msaexp/utils/general.py:3227-3232 \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":"msaexp/slit_group.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c2b962ffc3c090d13f2a855365ea01d70e3b2b5176eb675388ac107be51fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): msaexp/spectrum.py:3966-3970 | msaexp/spectrum.py:3973-3977 \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":"msaexp/spectrum.py"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4450540bd201aaadba8bd9870685b7709f6b9c575fc90aca2f02940dd29164f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): msaexp/utils/general.py:1720-1724 | msaexp/utils/general.py:1731-1735 \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":"msaexp/utils/general.py"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f9b891077df52c4a4a573913da0937763dcf3697b0a1aae1ea38e79e5540ff"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: bayesicfitting: \u0060bayesicfitting\u0060 3.3.0 is published on PyPI under \u0060GPL-3.0-or-later\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"262068be583ec403cfe145ef7dc7bc1dcad365708e06490395724fbb3eb4403d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: msaexp/cloud/lrs.py: msaexp/cloud/lrs.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in lrs.rate_group_regions at line 2445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:12:08 \u002B01:00\u0027 --until=\u00272026-11-14 00:12:08 \u002B01:00\u0027 --full-history --no-merges -- msaexp/cloud/lrs.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/lrs.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd98398ce9246e6ee6f3bf6e1b8b10d436adaf22589e4fb4e0f8ec274a237c2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.rst\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.rst"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"780d5a95b3462ca62e58e61f8860d407b669ab3c1f90813f04e22f965c6dbdb5"}},{"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":"773e80640ba28d61b932b0c8854ef699dc9acf6c21b282d872f00e406e27605e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ae9fc51dd4e7278932e760e4012fbf9c4be81612963850766ce3359c0f15a3e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"780f2663313fd92b55128cafb79b45ef72ebda9a93ddee152200dbded6c9f3fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9a8602b5b753d371e5d14b5fc0a6721f5ecef5d9c6298e518dc1ada87b9b285"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801c14e033a2920e2656c2ef1caef1401fb51386a95c40ea03dc3a4a06301b43"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482bfb9c4b44ed2304274c01e4b29457805d569b14e7c14bad270f894205099e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e408aefc11e492b0f5b0999adfd2f553cd0b5e3eb80efd50312fe61ec67389e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e401c3583dda3de140fc1ec7d252b68bee67802711535b10aa49f9ff3ed930d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"860785b91bf7817e400d164bcba9334c3519b1158f66c5170714ecb181d696ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f15f3a2d0975de5e51f5c03fdd4323de9f7a722352c3e1efb72f891529a2a3c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f392c9f90de3a870156528ea20555b2eaedb974dcb1399b7671e427b98148474"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a650a6bd03add202be0877cc2c336bbb812e96738a1e3b3e246ad274cc6d6a11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c006072d85d4c7286b1e95c3f38769306d5695a3c96a3d0a4b05e5fffe2795c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40e6115fd4b37e0002a476db1baf588b0ae2c84bb77ce5479c0ec50aaaa70302"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"879b02d18e0e6fc965ef27e5d75032512f4bccd61063fe0352281733569ae5ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d8cf1e598b5ac62ef6c511722cf49938dc875b612cab2a151c50fc24169ed55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"854137f85afb73b5b516fafa57439207ff92e0c92f416ed58e99e235a56cad88"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"723d980b3d6b3919febd9968be5132c1817bb37464da7d4cfe4cd5bf15095957"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8f115ffe6aedeb40724e1a23e9b06cdd30bc901c0fd6fea1db7c01d6d248aac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25a82dfc32e1711d2299ca36215dc2c418167758667fead1e7d5891cc17f2771"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc39dc94056d56bf0947d4d2326879ef6605058c227478c277abdbf16d9f2aeb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4c6675249b64b491906f41f9352c0ed6e9496c7bdb2266b7b1871594d2453f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"055ef27bd935b4ccf9664e38a3cc594ac4febe499ae22b7f1c6e9dc45e4478c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64196c09678ea8bc81c2a6149be8d5d8f586400ceb74080ee48415883745a5c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb945e212fe00709e0a00bebe4ad9cb86d67f1b21f1085143aa285a03fc3e9d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab06e3b0f8d1e336994b59603e4941f239d3002580b23a3dae0659b322201aa9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"105eec12feea81612f5a85c97d4ad4056dd0a7e909f48f1bce8b47cf9478b5b2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0a839f79d67162a7dcc181a11f713e0d67644489a922c3e002c56658f67ba5e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"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":"09e2f89e027335f0eb585494adc11a98551a3de15c64ad16b3e9da65e93e1741"},"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":"fc5194e48644019630dae4cacc14d5eec8e5e29dccceb48810f7ab0354105ecf"},"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":"a935d57f43a20e1d894eb783e0e68ca2936a22c5ed9acdb2d2258501de8f247c"},"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":"c9c6b91ff752e31c491c78eea6ca5297a0a8cdc7934dfc2a934ae3b2e451844b"},"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":"9ee77372d9f4e65076a507f9098b4bd4ff19b64f3c163ba4e5ef37f6fffec3ec"},"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":"b0aadfc015f395e0a10ab0a771cf6bb120658972e53403bfaca258f1ed18b6db"},"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":"74d46997564871639d362c8bf27aff05b86525457f21a5252f737dfeadc0cd03"},"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":"d11324794b03a5a33f782dd8c57a0d2147c0281e52175f39f5c8fcc4e8088c60"},"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":"a39f1484832625bd848023f068b54627aa7fc0c00555846ec9c8929df6d8cf01"},"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":"013f0592ccbef30dc4a4311db39804811c03a8510111242bebb778b05a2aee0a"},"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":"e062704e271d658c787b99ed4fc0cb594ec49efc5f421265a618eac5037119f6"},"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":"e1bcc008a0111eac7d715f061003f0b124654ecff8159db861eff953d09925aa"},"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":"f3226f7b7dd90fa0f82c8c282f9b085c514c214cad99633bd446d4e7a7f65ba7"},"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":"c719aaf381872499c56fa4eba1c153cf38aee6f5dd1b34fcd4d322b01fedbb10"},"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":"b193091d5a2b7226cc06d74c75c1f75edf4c4d4104169c9f45ce6be716972318"},"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":"576ca80155b444d045453efac6231843a7e161bc6722dd232926ab253ff89138"},"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":"14e845e69c28d5087163545304ec7a57dc986b601c9f506af239dea92b8d5f24"},"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":"c1f849c35ef5d1c5526fd16c243ae320d6dfda5429c5d93818c9e84184906bd7"},"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":"409b64df98e480eb2e18a7d38c7af87bc0f0204c0e360912e6d6a0fbf304c5d3"},"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":"d624387122976429a5ef3f4db214de19ca307f17c8825352cce653694ad56fcd"},"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":"fcfa373b36df6dfe2917b502a1309545d1da1d1eb8dfc79410eea0df45ab9ee7"},"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":"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":"63ef7cf7db8b6d3de73d75222a0b52de4eef53a7e9ab802393a65114fdba5fa6"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"4b3d4a6dd44234addbe3985e2c48f237bbb2f02f7cd2f61252facccf7517f26d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"803a4b62f7ebd25d283c35b1806bb665dc84a4b8f58e70b7264ba6bae072dec7"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e1f668900d54beabf13bc3c80d8d4ea2eae57f6264bf373059a689328cc7b4cd"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c224158c2fa025b4ca8b1d50f1f0bed48523b1f0e83a1240b50469ffac6d499f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"77f41cd5791604a79d7b592dcfa0be97247e371b89165a79b49759dbad40ce6b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ce1610adbedbec44cf8f1846067a98487b6c9214fd64ff66b4bdac2ab1f9b0f"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8aa617ecee18b59c9b9e5ede30c3fa00d0d48b180569484d6b4f679b97b009b"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"187a8209df1ffc125c07201c9dd48dee17e52beaf9a231464592e0aa60f16ee2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add 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 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/python-package-with-numba.yml"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060docs/requirements.txt\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/requirements.txt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d20c161d02f74f2966e64f9e053f7509688bf68acaf27a345e6cb06abb8ed4f"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/publish-to-pypi.yml"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060reduce_fixed_slit_obsid\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the process working directory (changed at line 242, put back at line 386) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/pipeline_fs.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3994ece14e09584675c1fad6a38b86487b64775ef5ebfcbf126a0b07e76e438f"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060handle_spectrum_extraction\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the process working directory (changed at line 1046, put back at line 1146) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/combine.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"320e74fb148cff7b0f314138cced3e050c2d210b36f7a9decf67ada56a85ba09"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060reduce_fixed_slit_obsid\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the process working directory (changed at line 265, put back at line 461) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception raised in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, \u0060subprocess\u0060 launch, \u0060os.environ\u0060 read or \u0060print\u0060 in ANY module sees it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory, the environment, the umask and \u0060sys.stdout\u0060 are per-process, not per-thread, so a concurrent thread sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd=\u0060 and \u0060env=\u0060 arguments of \u0060subprocess.run\u0060/\u0060Popen\u0060 scope both to the CHILD, absolute paths built with \u0060os.path.join\u0060 or \u0060pathlib\u0060 need no working directory, and a stream handed to the code that writes needs no \u0060sys.stdout\u0060. Where the global genuinely must move, \u0060contextlib.chdir\u0060 (3.11\u002B), \u0060contextlib.redirect_stdout\u0060 or a \u0060try\u0060/\u0060finally\u0060 makes the restore run on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"896772fe78de0fee7a678af9b7daa56f3b7b00f1eb985ea4b2613ba05e3ffecf"}},{"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":"msaexp/ifu.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77dbda1d7bca16f1d833ffafb354b5f1f1569867223ef5dafbc2e8a65b3fd19"}},{"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":"msaexp/ifu.py"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c06e15d46eb224d179cf17f5360eae310062bed499c9aa433e9a9509bdd8df3"}},{"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":"msaexp/ifu.py"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"74547ccc4f5adb97461bd2703b713730acd710891624e30eea974859ec1f2326"}},{"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":"msaexp/ifu.py"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"558d4166944ef8f4e11c6117efb2eada52aca11faac0c1d2ab7764f724449b59"}},{"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":"msaexp/msa.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf2771066c04f62250b1dc256b97f54b64699804df5d9d9a4a4cae2ce6ee39e"}},{"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":"msaexp/pipeline_extended.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6000a88222fb9e31b732d8a0282662ac5949773f4a54fcf766102edc63db4801"}},{"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":"msaexp/pipeline_fs.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100e80f668618a9ad0cf46fb20d409bd9de719dd3d96832f050b208c8bba0f1"}},{"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":"msaexp/pipeline_fs.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e8032a637187ec4fd855338566f6ca9a6d6a0256956e5dbc2619c4dd8d30c6"}},{"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":"msaexp/slit_combine.py"},"region":{"startLine":4574}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51d91510aba2232e908928d26a3d0e6fc53e03d08952cfd683cf72827e8a02"}},{"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":"msaexp/slit_group.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62334911bf55ed177bea5ce078a11ce176a7cd288fe52f40ed7c765ccccd85f"}},{"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":"msaexp/slit_group.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af130eb505d08dd9dab00259c75c02169075ba4b40edaae68a3aeb595ba58a2"}},{"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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"54368302f6872e4860bb2636fca320f184bff0161e2d07b247e66341a0ee5cb5"}},{"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":"msaexp/cloud/fixed_slit.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796046cdd575f1284290678f237094f916712b035a65b776d7810824d970781"}},{"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":"msaexp/cloud/msa.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"221f572a18da004b0f1cb64ac6f3b01407b9a392fe94e922281cd4c6317d8511"}},{"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":"msaexp/cloud/msa.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b590ea056896d64c876fa633d7251a498aebb6176d282d516d38e8b0201d009d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 115 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/assign_wcs.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed765f4c50e776ff7b167f080502edf6c2614fb5c52ffaf6b1bae65d2fb430dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 87 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/assign_wcs_step.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8daec0907ac95b348490779547f99c695b78c66338b02febf23ae60aed6fdaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 123 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/assign_wcs_step.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae139d0bc2e3fe7712b07ff3cfb7552953585044a05ce4c40bc8e517529a7fe7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 143 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/assign_wcs_step.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae8d64a6b1c0d0ce4329f2aeb69fc8152daeda6cdf72970e6f5332a20506f48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 327 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/nirspec.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e3dcf3042dbfa5a790f79cb7174b68c7b6e705a5d4468e202b103a05645ea8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 332 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/nirspec.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d7591d4170c5cb677461797e81b7c99dedcd82f0cc1432454167291a76ea4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 361 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/fork/assign_wcs/nirspec.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1957346dea35238ecf399610937c1a17d4c31542ff30ff52c0390f52e77a3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 91 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"876044785fa61a020adce4d13a50e95ffe2cf8129fe4343743508341e5c9885b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 102 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"676fe440dc7a9efe4e4953920169cff42679ae018ea46b766852f84259ca92a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 149 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb055ec4ec60c2f4dc7be2c9848232556dc8a469c6ed7a20054c12b0ccb18211"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 177 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26016adbf52028cbd1da10720d747261485578d288285619ecfc0db820d243"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 219 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7c54ed253448dc81bcfbcb278c6aafaf85b1d93019c8a47cd2fafc8d969c60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 390 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c389361abf780b7261720a79c8cb68b3052c45d02bc435111c5c9d1c1cbe119"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 404 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"msaexp/cloud/ifu.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff948b14acddd32329349036b736e623126f78975eafc2dfbdfca0a0ef33a82b"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":63,"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."]}]}