{"$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":"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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu (cyclomatic 5426): TL_SaveEditor.Namerelavalu has cyclomatic complexity 5426 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu3, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":53327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c322b72ca369a88f91472d0da4c8a1789013cd5b16eca38022b4dee55b05c41"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu2 (cyclomatic 5426): TL_SaveEditor.Namerelavalu2 has cyclomatic complexity 5426 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu3, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":64405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4a65fa0160f3289136417ed81f9bd48f26bd926d57d6ab7351b68b4fed1291"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu3 (cyclomatic 5426): TL_SaveEditor.Namerelavalu3 has cyclomatic complexity 5426 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":75482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f108499c36b069bc5eebbcb419de7a5d119ef4063f23dc7bed5db6a2714c8e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu4 (cyclomatic 5426): TL_SaveEditor.Namerelavalu4 has cyclomatic complexity 5426 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu3) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":86559}}}],"partialFingerprints":{"codehealthFindingId/v1":"69825a28530b8251803ec5ef4f9d0cae19c87d9c11b230b42835c597497438d7"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS (cyclomatic 1926): TL_SaveEditor.NamerelavaluUS has cyclomatic complexity 1926 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS3, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":97636}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f56ea51f69443f2b11f4b2bbf1e009d688144f8ac49f68a6b6018b4c3cf8466"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS2 (cyclomatic 1926): TL_SaveEditor.NamerelavaluUS2 has cyclomatic complexity 1926 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS3, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":101689}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a6e80deff2af021ad97c5cf7a72ba2c34eb4ab8067b6d31eaeec8aad9bdfc"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS3 (cyclomatic 1926): TL_SaveEditor.NamerelavaluUS3 has cyclomatic complexity 1926 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":105742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc583d0655ad1f3663eb474a3b7b28c289fbd7520ba97ec6f70e4fa5ac6930"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS4 (cyclomatic 1926): TL_SaveEditor.NamerelavaluUS4 has cyclomatic complexity 1926 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS3) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":109795}}}],"partialFingerprints":{"codehealthFindingId/v1":"4923bbc4cefa9361b686b2fb80c2721144b8e46caf3ff1741308e6554ad2da54"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Button_setallrelation_Click (cyclomatic 708): TLSE_Jrelationships.Button_setallrelation_Click has cyclomatic complexity 708 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46585}}}],"partialFingerprints":{"codehealthFindingId/v1":"43910f34747eadfb22f758feb412d08866f542651d06cf78ece060f5b7c2ff07"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Button_setallrelation_Click (cyclomatic 708): TLSE_relationships.Button_setallrelation_Click has cyclomatic complexity 708 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46588}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd0f3e1799d9377f45fbd63e0aad6b9c828c64f8bbdf681c821ae1da8cdfec4"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Button_setallrelation_Click (cyclomatic 708): TL_SaveEditor.Button_setallrelation_Click has cyclomatic complexity 708 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f0e19f7dbc735488d251ff38156c55c09397a154f6308bdf1c0183513101c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_extras.settummyfullempt (cyclomatic 604): TLSE_extras.settummyfullempt has cyclomatic complexity 604 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8160e93d7c56069341d53e5bf27c4cc9ead6d5302fe96f0b9a29c4d55fe03923"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.settummyfullempt (cyclomatic 604): TL_SaveEditor.settummyfullempt has cyclomatic complexity 604 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":7123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccaaee64a25799acfc7fe05711911dc6872f95d560a614fc65606a100db1dac"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.valu_target1_ValueChanged (cyclomatic 566): TLSE_interactions.valu_target1_ValueChanged has cyclomatic complexity 566 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":9084}}}],"partialFingerprints":{"codehealthFindingId/v1":"da992cb41a9c887661526e18fa5571c7cb4e3c99ea2109f416539258ad853935"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_target1_ValueChanged (cyclomatic 566): TL_SaveEditor.valu_target1_ValueChanged has cyclomatic complexity 566 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d692c5bce3e8d5bfa244f0be014f04da98bb47ada10eb5658ca97d3363604d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_1_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_1_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":48919}}}],"partialFingerprints":{"codehealthFindingId/v1":"91756c52a7edd0c4537c755fda801339865c0f68abf3405ed71eeb3fce8e173d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_2_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_2_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":50327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2905c544f6327226a3da7346488afa0578ec6974980fb73f2aba023306e839f0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_3_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_3_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":51735}}}],"partialFingerprints":{"codehealthFindingId/v1":"85915c0a663d69b809d9e11e20b2a37891455ba82abf88d43cfdaf782023ee3a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_4_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_4_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":53143}}}],"partialFingerprints":{"codehealthFindingId/v1":"469d86695c8716f272bcc86b88ddc8d3c225241485b5fac1489e66a998f58d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_5_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_5_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":54551}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e33f7329d1dc56136ffd1c1b4e2447080e2361f73a040c30366f44cd32aff4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_6_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_6_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":55959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f402fd24eef7a9a6422f1945ad8907e22045623b8bb2fc18e1da696d2bf49f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_7_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_7_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":57367}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f65817c5350b30c850aabad30dac72434865a0d6734b3fe5ea2fb5886ec0fe"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_8_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_8_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":58775}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dd3214977b8fdfceb00ea15333e6a43cfbc35f3f3cc040b7c5586d4f6431ba"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_9_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_9_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":60183}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dffa0ddcd88e7b892b232b10269cf60dd9bf7d12f0a4e1325fe574c9efc83f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_10_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_10_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":61591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da99ace80f3a60562c1389d991a973f33b0e7c5c0e55b6455279e6bbdd9142d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_11_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_11_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":62999}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1698c63b1e8a92fa0f2dca90cc84c93f94de09be32eed10a2f860040ce4b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_12_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_12_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":64407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae066bdfb97cf1f836a0978d87a5c06f0ddc669895b8a52d5747b1f8569467c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_13_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_13_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":65815}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8dc460937936d43a224fc9e6c8ff39e41daecdf277da5e439a935bfd15a22f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_14_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_14_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":67223}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f37256493740fbea9e4083bfa63b26917620f08d4e0bf7dec8cffae8189b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_15_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_15_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":68631}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a841cc68f38b5d2fe3135fa6cebedcf2f9f80321f9f20c6db6a65cef4a2354"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_16_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_16_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":70039}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a006b650868958c871de63c1d333fc7009d4d4285a41fc97f4dcc694a4aba54"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_17_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_17_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":71447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfce2c8d11519f5d898f4ad097151c148448907722f980da0602fd379af45da"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_18_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_18_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":72855}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d4a2b436355f5a00d42837597f80b650d9c5fa7585b4a2219986e23c49e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_19_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_19_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":74263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0481bb84da31e8e7086a9d62865b8969e7b196890c092363c0c60d7ba6f07"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_20_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_20_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":75671}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bab44026ca4736ec1146c5c3bca7f4d7f6008240271af24669617320e53457"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_21_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_21_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":77079}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f2f02851ab5671026ce286d2f1eb49efb1e5f884d026285a87d162f3348e98"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_22_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_22_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":78487}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7173d72557c0878cbef849429e7096263e19c61ce66bc6091bdca220b2e54"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_23_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_23_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":79895}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c108c6c74b2675b803bbf5d5f555fb21b567f6724715f3c44e2c9db8ac2f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_24_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_24_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":81303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeb8ac259756d46af5c4100509cac3bd9536d4f91cf2dde981e67bff8b2cc80"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_25_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_25_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":82711}}}],"partialFingerprints":{"codehealthFindingId/v1":"64468aa29108abbcf47a5a142d593a7c0813fa6f09fa82cc11710591d45f4dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_26_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_26_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":84119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f978687aad7b39068d6acd63e69bb9754c1192b438886d830c7c2092c33216"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_27_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_27_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":85527}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bf3b4b996c4091a7b7538687e581e2429ab7cb3fc0470719d37da9b4f1187f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_28_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_28_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":86935}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687fece1777b8abf7009402177fbe4e884015bacee0e78f104c9699fada49e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_29_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_29_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":88343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b441d8eefb711d5f9ef9f9100fcdb8dd624c9e4afacbc1a244a8d2c1bddbc906"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_30_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_30_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":89751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56735ae31d34056e222d58330efe4e781e15a894b51567fae8574f8be00d993"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_31_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_31_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":91159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4edbe1cebe0304888a44a8f39ba822fe740dda0918dd472cbcedce24e6b201b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_32_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_32_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":92567}}}],"partialFingerprints":{"codehealthFindingId/v1":"649d9898632d1711a25aeef5d2619117667ed7a83d57517eadc5a60e8914c082"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_33_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_33_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":93975}}}],"partialFingerprints":{"codehealthFindingId/v1":"929f5086729d64f6fb7240dbfa0c8d3cfaed3896e35bfbfe0fa4214c7d7d44b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_34_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_34_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":95383}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bfb039fa9ea789996b0d0387980da79dbbb5cb378caaa33b6bbb0b5397f1c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_35_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_35_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":96791}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c09c30a29ae68f13e590fa63fa20117548a2c7e6e88d36640298f36b678c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_36_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_36_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":98199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce16ceee08d64f534ce808519771cf8e906e6d18cb461952199ce934bcc51814"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_37_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_37_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":99607}}}],"partialFingerprints":{"codehealthFindingId/v1":"549bfea51e1ee0887803faef3b07bc4a0e918854e32ecc775152ef851a5c2977"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_38_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_38_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":101015}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df9e1506eeac52cdf9ae603904b1650e2d8dcadef05f9a4d909099ba05696c8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_39_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_39_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":102423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bef107daa9637f2cf38123f93c0f7e7b6ee26788c896df4578ebaa837fd33d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_40_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_40_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":103831}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aa6cc3ec82f4cd98f16bd43d576f70454be9b22b41b274a67a521f84d2bd2d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_41_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_41_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":105239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a058e06288cfc6622a1c02562393e9824635ba1603ab4db144939a631d0497"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_42_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_42_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":106647}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4af9b8320f0dd171cc45b191dbfa21e37c7b29f6478ced1b0ce1b5eace5d70"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_43_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_43_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":108055}}}],"partialFingerprints":{"codehealthFindingId/v1":"68897406bdaefece3923dbea3d5013ec6456d20bc087554a533767b0c20c0fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_44_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_44_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":109463}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2b29d937bd7be14145ffdad3a4e541847b76187e51c8117c8aea122c784c41"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_45_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_45_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":110871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92cab73d6941b1bb7a772ada629e85517d8a0a896d3ab98f16bd5bc141547b9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_46_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_46_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":112279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fcf7a655b979564fe4d2e9c129a6ce30d5214bf5c5f8bb0111f85aaf4d4c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_47_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_47_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":113687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c73385f19180c59d922d2767611f447d2a84a85d6ec8875108203fe748d4c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_48_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_48_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":115095}}}],"partialFingerprints":{"codehealthFindingId/v1":"be32429bad875d20c245daada555d34f1a5377fc155e8476d98a1bd331efe6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_49_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_49_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":116503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e9cbb71d0a609ab2ac3bf536529a1e55850403c24745e5741b6548b46a29f0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_50_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_50_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":117911}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458dbaa1d75ff76134d4bf44c5c7c8a964d88a5ae58f45d5b12f71259c13462"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_51_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_51_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":119319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8a1e48d7effef4ba8d6cd90dff3a3b83eb197294bad444d96d7ab1ecd97770"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_52_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_52_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":120727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb8660ba397436ad807441be53b018131477f276d54c5e2f44175d8cf62a7fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_53_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_53_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":122135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d70fca354bfeb8999783b326062496e7ea9dd576eb32689b7c1a36f041b6d91"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_54_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_54_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":123543}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eb3c937d304ee528d429e06c65655b104f539a45e9737a71971844747dce34"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_55_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_55_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":124951}}}],"partialFingerprints":{"codehealthFindingId/v1":"140e084198857df98d0d969751347d3e8b18859e68191e33d5293c25d5833f48"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_56_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_56_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":126359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb2a5cbd24d3bb7819fe2bc4f6559bd95167296c72e158df484888e0d5eaeec"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_57_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_57_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":127767}}}],"partialFingerprints":{"codehealthFindingId/v1":"850519f78d40755fcb1f1d5a672b6d0b6c4a649fc25d6869d368f7c107051e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_58_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_58_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":129175}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cad09dad37219f7b8ccf2d240b6a8dc341bd808f9bd74bd6ef734d1e090988"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_59_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_59_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":130583}}}],"partialFingerprints":{"codehealthFindingId/v1":"857402b6f34584c5bf50f50060cb9c8774164b1c95fd8410a0330f848f01afc3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_60_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_60_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":131991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0974d92daab15b8c48ca2db8c239a4ff2d97a549481a0e8a040a94cd9705e02f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_61_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_61_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":133399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a832b13b2196d155f9d5096dfbf213d2abb7e6cd31245d7029b15e39d991d772"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_62_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_62_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":134807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8459b62bc0331429fbca9cf3dfec8f31c2d62cbe012d42da8b120a618160a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_63_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_63_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":136215}}}],"partialFingerprints":{"codehealthFindingId/v1":"854bf1b4f2fcf421f5a31efdea3e6ecf7663222d4b9dda7fc48e1593be19160a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_64_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_64_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":137623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c058d455fae2e3b2d4016c3499c0b5cb2a23432fa14f4096c8bf6e3be4efac91"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_65_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_65_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":139031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8e3fc403dc8f33732cc597ba9656b0c8a00bf272fb5644175431a169d89a6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_66_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_66_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":140439}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87c6cac05e76370c9b37c3b5470001fde6279a0e42290a35281269c8afdda6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_67_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_67_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":141847}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ab21de605e959fb20b51130b7914953b953b18f217b8b53523d85d1ddede8c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_68_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_68_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":143255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef5b0ce479ba2b3a73b59487450fc2b842d7b744c9d78676dd24cabb3c1fecf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_69_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_69_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":144663}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8380830e7ff730ba56f1f7186c13c9dd34074f0adedc100f5e4c182ca57302"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_70_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_70_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":146071}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb69aa1869889c35015a735ee003b570b6d140a74a9990ca44290cfea52f889e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_71_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_71_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":147479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8059682a348d4ea7afe64eff411fe28ff5b81de090132d2c67115e7fa8d5b9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_72_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_72_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":148887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c056c546d3a0c72726ac2992a6c113bb41c0e18b3a3624eb7941beb7ee497b4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_73_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_73_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":150295}}}],"partialFingerprints":{"codehealthFindingId/v1":"71583621c7dd1af03205edfc8a0b1abab6cd3c5c149118d51584b19aa0cb5dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_74_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_74_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":151703}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c602f9b594d3aa3e3e670affa40f8479ebf92c61389a8e42ec9f579b8a4ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_75_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_75_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":153111}}}],"partialFingerprints":{"codehealthFindingId/v1":"540b3b664937cd3563e99d5b5ebd0944e346bb507a00be94f369c0085acae8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_76_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_76_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":154519}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d7d7e8f3ca20bbb62da4665d23d348a741026bf4b48f629084775bfd0ca535"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_77_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_77_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":155927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d4a11b404b2a6b0e33bdfe16ae39747f509c48b94762d345bc67203b7c2878"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_78_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_78_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":157335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b4c9d27c611ddd4e738edcc63c0fe985d802eaab4f4ac402a3f4ea8a8df5a7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_79_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_79_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":158743}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d36359aeca997c4b9f04798ee49ad6c343a532dfb67493278f90c067d41f3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_80_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_80_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":160151}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d3f18a98b6800dd80b298dc1b532b77fd427d3c834d94a9df5fadc9a1b4421"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_81_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_81_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":161559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8949be8de3006f9d90874c2ad01427607c337a86e0206cd1dfd404e7fdbec0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_82_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_82_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":162967}}}],"partialFingerprints":{"codehealthFindingId/v1":"010a3c8ce92993a17e83d875daaecb132aec7e6481b7cece6cdf0361b5e451bc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_83_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_83_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":164375}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbebeaa99419f7b3f8092f2b44a5fd476fdd480e6e87d9e0dc746def1681867"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_84_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_84_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":165783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51bafa532569564240061aa21753bee14eb464637361f9ca620d011e32b75ad"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_85_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_85_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":167191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1924a2d4ec86abf6bbdad5f2239fe60081946a59ca7571ed18d695a49c065ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_86_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_86_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":168599}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a7fcd5cef3961b7e0585e91e0aa61c70f338ca8b635401ab1449e9a8a26184"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_87_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_87_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":170007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34d1d5e5b6a3e1e391540ce8184f90b771e2d045c8d80e5612c306269f7b98"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_88_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_88_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":171415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7831c637abb804a492e43613299c391c3ae306f2760dbb4dd91b56034d838239"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_89_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_89_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":172823}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f643c5fefceb56765762a5f5ff2db885b8194e068058e616e8f6955242e5588"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_90_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_90_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":174231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0702cb9547b6b7142a3afa6541847123c84af4cb0314517bc96234d2476708"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_91_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_91_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":175639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5148513a05ec4f888ace4cbf7e1d752cdd9797aa1abec6d016437699876689f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_92_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_92_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":177047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee686a8bc1f6e8f0e149ba1aaad23c584ec79c14b844fcd5d2f377ea7815bfcf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_93_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_93_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":178455}}}],"partialFingerprints":{"codehealthFindingId/v1":"770f66ed0d4783d116a57a0ee23a29ca84567f7ccdc26cd9f31bbf3d4edd7644"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_94_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_94_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":179863}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcffc1cb03d9ebb1c4af85773cc66a5bb4cd23e4e23034d7fe2d05f778de98e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_95_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_95_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":181271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b618e5007dfb21280493af85ebe8c4dccdf7e460e55dcc312fa198d00649b7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_96_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_96_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":182679}}}],"partialFingerprints":{"codehealthFindingId/v1":"814576f1696a736197ff6300cbb19e433b07cf845a9a162d9f8251b4d887d15f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_97_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_97_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":184087}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932501f1494058746c2f101d5bd144eab8ab63644b36156586dae5c7ab352ce"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_98_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_98_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":185495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2fd31914e722cdb0bd61dc18a25fddd8dd82e7a82f42271bef0a62dd1665f9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_99_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_99_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":186903}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda895bcc62b9c95830c9191f5d106b50b04fa8d9119ab781f77f9cf4e5c13b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_100_ValueChanged (cyclomatic 560): TLSE_relationships.valu_friend_rela_100_ValueChanged has cyclomatic complexity 560 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":188311}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fb8f5df53ca8ff016f1951bc3b396910a3f36d07fa5893f04947a586efb88e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_1_ValueChanged (cyclomatic 467): TLSE_miifoods.valu_fav_1_ValueChanged has cyclomatic complexity 467 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_2_ValueChanged, TLSE_miifoods.valu_fav_3_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"617fb61f1443cb7331585994cb0fea618c800a8e72ba728bda3dc32ad2974f05"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_2_ValueChanged (cyclomatic 467): TLSE_miifoods.valu_fav_2_ValueChanged has cyclomatic complexity 467 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_1_ValueChanged, TLSE_miifoods.valu_fav_3_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":7086}}}],"partialFingerprints":{"codehealthFindingId/v1":"21abcc71389af84b774d8b2ebdfdf8c54b30a1e69165f2748eff1c79546e4052"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_3_ValueChanged (cyclomatic 467): TLSE_miifoods.valu_fav_3_ValueChanged has cyclomatic complexity 467 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_1_ValueChanged, TLSE_miifoods.valu_fav_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8027}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde6afe25e2e3b2c160498a2ce0c43252c5e10bea24953ed5efeee24d2c15de4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_allfav_1_ValueChanged (cyclomatic 465): TLSE_miifoods.valu_allfav_1_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95ce17e21a799c0a079f9d92786afc62c6642ebf10e88e397b9266d050fea74"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_allfav_2_ValueChanged (cyclomatic 465): TLSE_miifoods.valu_allfav_2_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c6e1eba52aebe73a57bb36eaed29f6f63dbd8e70cee98dfa13850e7fafae7e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_worst_1_ValueChanged (cyclomatic 465): TLSE_miifoods.valu_worst_1_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8968}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feece335374b27f2ea7217d27ebb3ea0de19ae4bead91220fe01072644241f4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.valu_worst_2_ValueChanged (cyclomatic 465): TLSE_miifoods.valu_worst_2_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":9905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323ca17dee1be710d668a28116e6b4a64d13e4cabf151b5460c85feb3210d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_allfav_1_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_allfav_1_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836587288965db8699542994642cc9d335045d99bcb9979c350f26ecb16842d"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_allfav_2_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_allfav_2_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":41407}}}],"partialFingerprints":{"codehealthFindingId/v1":"1254219f431655575bbb282d40a6b504a57181a5107f504bf0966f03518189c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_1_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_fav_1_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":42341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c244aa9e6c665655b60868172b6d5cc034d099c4b3b833d1e27778ce623096b"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_2_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_fav_2_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":43275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2310732466a45869f455f38d5f7a16eb57d7aa344078e68af28022400073057"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_3_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_fav_3_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":44209}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c0bf90256c6ea8a2e059f6fdc28e57ee9994998d2c8251b12a75051204d2c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_worst_1_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_worst_1_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":45143}}}],"partialFingerprints":{"codehealthFindingId/v1":"929886e9ae4efd8c941f03d67210ccb298c31a2e22fd7f524e49483608da845f"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_worst_2_ValueChanged (cyclomatic 465): TL_SaveEditor.valu_worst_2_ValueChanged has cyclomatic complexity 465 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":46077}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3e10a4b0aaa94f24d14adb9948f916003c47e9a65f62a920c20f9e167cc892"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.readfriendlist (cyclomatic 404): TL_SaveEditor.readfriendlist has cyclomatic complexity 404 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":49416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d34e7309050213eb6a098295df965bc42d358857686e3352231c714d9fbee"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_itemsedit.Writehatsitems (cyclomatic 332): TLSE_itemsedit.Writehatsitems has cyclomatic complexity 332 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1495c33d8c46e122a869891bd109a86a075aa2f79ae2e2316103f0df16fabcde"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Writehatsitems (cyclomatic 332): TL_SaveEditor.Writehatsitems has cyclomatic complexity 332 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10837}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca0edd82997d77f1af7393ef0dccd6d5734774750ad289bcd6db8a081560a19"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged (cyclomatic 233): TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f267addc5ef47e6fe14503cfd0f40693c1568d4047220887eaeed5ceb1202aa"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged (cyclomatic 233): TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10895}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbdd36f6ea1f2c2f465926b49355ba6bf0a1bbfaa02900a941034831046b944"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_1_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"329d26abc260b7a80bb4a867147ba695e75e1b4c799d4a883158334ce785218c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_2_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"85948390e36b596708e78865615aa23543a9b17ab50abae0dd34aadcfd7cbb9b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_3_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_3_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9880523460d5793facbeaea7edb19c8290bc8a1a889c7ee34b24353362f2e526"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_1US_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_1US_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f07364c0f3110db9d66224478a087c1173e02436a208af486c9c5013b7a842"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_2US_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_2US_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15323}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e460d04d6e5a42c626413e1ae816718a53f9b52513d2bfd33724f41fc1e42b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_3US_SelectedIndexChanged (cyclomatic 233): TLSE_miifoods.Select_fav_3US_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15791}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10cb8bec198e607e0e5a9765e26c5b94d380b12343cd7c820414f25982bc60c"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28832}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0c8cd179a983f5e526fd4fba6af8c8d90c16e63063a4a1e7c887ef4a24a218"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b696abd1277f9210811fdf762abf2b00e13c17a306dd39d4863848663dc43b08"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c437bbc37e870ee0f42ee677a5d5a29131bb0c98c6bee941b446b4e5ce6200"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30671}}}],"partialFingerprints":{"codehealthFindingId/v1":"290011f5dde9c4181a08b29f6f6629826a93e7a4726c3d227a1630a687c810a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_US1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbd2558088bd2a781f26504af3a3faebf14224ca74cc617bafe395eaf95e42e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_US2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31607}}}],"partialFingerprints":{"codehealthFindingId/v1":"158b60b0124b8f0c57d149be4918239a2d45d22bd6d209a15f58cb8adc132ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US3_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_US3_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09f779c22502d904637a98a69080eeaa955b41cc7569812c200cd6fb6471b4"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_US1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_worst_US1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32543}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aadc1432b8ac80cf7f72f6467f28f633d108a28ae730b406e3fc72a2c79ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_US2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_worst_US2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":33011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633d856726d41db8d38ba4dd96233524cfdfefc16076bab47e3e3c17a9208fe"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_allfav_1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37197}}}],"partialFingerprints":{"codehealthFindingId/v1":"84368e982702ebf59f8e0b7b79e8057c2624dad318d74f42d0123a95e91093b3"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_allfav_2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37665}}}],"partialFingerprints":{"codehealthFindingId/v1":"9677ceafa6503fdb19bb167360faa03f2a18a041fed6fe234ffa5b945f56bd8f"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abcb5d2439d38abee8eef6933dcbf69293cc179cacac358209be0a5b9ed575f"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b286bbdf0f631f58c78cc9574c5c048924c27b0ddefb698fc69a570fcfeb8c"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_3_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_fav_3_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39069}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f2e3461596b09f8899c600bc92b53dfa32ac4ea5164233603a128defb6da67"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_1_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_worst_1_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39537}}}],"partialFingerprints":{"codehealthFindingId/v1":"191fa290e2aa659db0f64c1df52d5eb89ed4da2c96d31d8a7e27cba13b3dd4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_2_SelectedIndexChanged (cyclomatic 233): TL_SaveEditor.Select_worst_2_SelectedIndexChanged has cyclomatic complexity 233 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd8eb6cc542c82059986c15be9d825814a1110681259165316faa52c87b38a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_1_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_allfav_1_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f3f4adf14a4361c25d5f7f421560c9658d9cf5c262542f7e47702c4805444"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_2_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_allfav_2_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d970574f2e9a94d5bbd96ab1c41e60494a1fd41c67a4fec17ce86c1e90f08da"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_1_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_worst_1_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5406b14765378757765800caafdd6b42e35454825f21cb6a3749fea3bf06ad"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_2_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_worst_2_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfe8f98241016bdc74e545edf85f978dc8c4f7db0630b6f96b114ced737cf56"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_1US_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_allfav_1US_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":12991}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d56142365da3dcb3d7a46c2d89c3836fe6b9a5d4f419d3293be3d4d89075d90"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_2US_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_allfav_2US_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a56e0538a7e613b3009e04c3400bad067d5a84b391f7d3c453eb0dc54106f58"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_1US_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_worst_1US_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13923}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b11a0f5d9500f45b91c9cc8216a1f0c09e9e4e8446f4ee36cfae834edf34f4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_2US_SelectedIndexChanged (cyclomatic 232): TLSE_miifoods.Select_worst_2US_SelectedIndexChanged has cyclomatic complexity 232 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca458071767c83dd0768ad39140aee5a5b30b1f173f88f1310b28c1692943737"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_extras.Check_resetmiiapart_CheckedChanged (cyclomatic 210): TLSE_extras.Check_resetmiiapart_CheckedChanged has cyclomatic complexity 210 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e13558c3560480778508e5b3ebab3da7bf8aaef7fd94061cef034bc9c9432d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_extras.Check_resetrelationship_CheckedChanged (cyclomatic 210): TLSE_extras.Check_resetrelationship_CheckedChanged has cyclomatic complexity 210 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd974adbef4cb15441ffe635202cf43565e60ca06ed4c4bb6a90d17761274b63"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Readmii (cyclomatic 208): TL_SaveEditor.Readmii has cyclomatic complexity 208 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":48419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a580bcf30433c6bf05d0dee0a4f31434f8c39ae9ba04c0d7331ad921cbe270f"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Patchfriendlist (cyclomatic 206): TL_SaveEditor.Patchfriendlist has cyclomatic complexity 206 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51702}}}],"partialFingerprints":{"codehealthFindingId/v1":"365d8ee1fd1d1c9554b9b62225704d2d6169b3aabc4cc5db7a6d1d9f8ff57d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiprofile.Savefileregion (cyclomatic 204): TLSE_miiprofile.Savefileregion has cyclomatic complexity 204 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524dfff1af8bb4ba5da9315b468f01d85ba6b8359fa851f92846e38d96651b8"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.resetmiiapart (cyclomatic 204): TL_SaveEditor.resetmiiapart has cyclomatic complexity 204 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b8cc6e51f7410a4b607ee9bf9bd89b2c2f5fd7d001c8619ef6399d16afc25e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Resetallrela (cyclomatic 204): TL_SaveEditor.Resetallrela has cyclomatic complexity 204 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9f6512038de2418cd1908bdf328420897c40dce9f91f9011f920b3cf476be"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_crcxmodem.readmiidata (cyclomatic 203): TLSE_crcxmodem.readmiidata has cyclomatic complexity 203 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbb167b6e2b0ac5442293ba282272e53b4c938f20912794a0cd01b56903f375"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_voicepersonnality.Savefileregion (cyclomatic 203): TLSE_voicepersonnality.Savefileregion has cyclomatic complexity 203 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd71af273deef37796965530fc544596ea9ed41316770b92e1884d5ae1f9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_miiapart_ValueChanged (cyclomatic 203): TL_SaveEditor.valu_miiapart_ValueChanged has cyclomatic complexity 203 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":26604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55ddc55d7d977074536b81c33e599a1b0dac8e4a381cdcf8c0aea934a6d9371"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miifoods.Savefileregion (cyclomatic 202): TLSE_miifoods.Savefileregion has cyclomatic complexity 202 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":10909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66214d1a787e4095bc9b2b3c77b6512544fd26360695f80df9ab23bb1ec4edf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.Savefileregion (cyclomatic 202): TLSE_miiinventory.Savefileregion has cyclomatic complexity 202 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f8357c472b09db26114cb5666431a476c13a0a73d1bff7a0536de2b4a7042b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miistatus.Savefileregion (cyclomatic 202): TLSE_miistatus.Savefileregion has cyclomatic complexity 202 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d894b594cba64624f81bc3551932138190198c8e8b15df7e54ada482ab6e18c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_itemsedit.Writessclothesitems (cyclomatic 201): TLSE_itemsedit.Writessclothesitems has cyclomatic complexity 201 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f7b8b4006119a0811f264ef2a55affb82082c22c7183484ed891999db394ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Writessclothesitems (cyclomatic 201): TL_SaveEditor.Writessclothesitems has cyclomatic complexity 201 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10036}}}],"partialFingerprints":{"codehealthFindingId/v1":"7162d5c8cab37ca74b9836e94f4f2c9811f303cb3eea4b9d4bb46f66a189c423"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.WritesavedataArc (cyclomatic 193): TL_SaveEditor.WritesavedataArc has cyclomatic complexity 193 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd047dd22f3386af9e21d8b37933e50694fb112cf167cdd8afea1e684dffecd1"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP (cyclomatic 176): TL_SaveEditor.NamerelavaluJP has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":113848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad87f99ce1a1d042433fb5a90b1771a255d2b462807d1d50bbe2f27bb6dc947e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP2 (cyclomatic 176): TL_SaveEditor.NamerelavaluJP2 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP3, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456e5652cccecfa86c18b7597b06a6a4ece10c3d4fe6e6c6c9822ebf4e16344"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP3 (cyclomatic 176): TL_SaveEditor.NamerelavaluJP3 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114604}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ba61314673b71876ceae5f91ac48e4dcae3bc4894ace9930e8c2c3fd8c530"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP4 (cyclomatic 176): TL_SaveEditor.NamerelavaluJP4 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ad63b455edc6c1d8c8b16a887c1f68d5e805df3f763ff63821da6841e36ec"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR (cyclomatic 176): TL_SaveEditor.NamerelavaluKR has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115360}}}],"partialFingerprints":{"codehealthFindingId/v1":"23593a8aef9a98e5fe720e4c41f98232173dfe294da74d58117055786a95b4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR2 (cyclomatic 176): TL_SaveEditor.NamerelavaluKR2 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115738}}}],"partialFingerprints":{"codehealthFindingId/v1":"df297c2d8dd54a77f0dd045e24d285208064db70faad96a57a8039acbbf8d4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR3 (cyclomatic 176): TL_SaveEditor.NamerelavaluKR3 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116116}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3bd69a95bc74e5c60a6974142bd60a6dac768e6384ae1b21281d3e331862e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR4 (cyclomatic 176): TL_SaveEditor.NamerelavaluKR4 has cyclomatic complexity 176 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6caa45a8511d77fe770a284aefa700691538df56c1c33447239d2f94206351"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_travelers_status.Writetravelers (cyclomatic 152): TLSE_travelers_status.Writetravelers has cyclomatic complexity 152 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d6b8e34dfb1d54d32c345338f4c6c7e3499fa50f87a4800372badbf34d4477"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.InteractionlistEUR (cyclomatic 146): TLSE_interactions.InteractionlistEUR has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":4977}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bbf4f496216f56354407de381cc59b3ea0d074319e35b9318c02fabfbf6f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Select_interaction_SelectedIndexChanged (cyclomatic 146): TLSE_interactions.Select_interaction_SelectedIndexChanged has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":6153}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f3fed1bf2407db196940d785df0559c37fc1f35683321f4dae774e78ac1703"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_interaction_SelectedIndexChanged (cyclomatic 146): TL_SaveEditor.Select_interaction_SelectedIndexChanged has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4914fb7fc4b20da7e3522e679caa726a266182a16ee9eb5aec3bd934a7b1490"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged (cyclomatic 146): TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25841}}}],"partialFingerprints":{"codehealthFindingId/v1":"daec8f07770caf45c908cbab9383255a2a62d42b39fd207efa45ca4ec292f71a"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.InteractionlistEUR (cyclomatic 146): TL_SaveEditor.InteractionlistEUR has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":119925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3ad7cec00ad0bafacfbe54013ed5621b2ff62741ec57c56463e05fb59cb72d"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.InteractionlistUSA (cyclomatic 146): TL_SaveEditor.InteractionlistUSA has cyclomatic complexity 146 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":121219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5538e3668b0713f20bb38c1e446e6a72a6085c3960a2bf2a4f563ce77796a9"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.ReadsavedataArc (cyclomatic 145): TL_SaveEditor.ReadsavedataArc has cyclomatic complexity 145 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d162e1c133be019ce87e8102b61d64e9d4620d3b2993685d47a6532ae3167d"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Danger_interaction_Click (cyclomatic 145): TL_SaveEditor.Danger_interaction_Click has cyclomatic complexity 145 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29768}}}],"partialFingerprints":{"codehealthFindingId/v1":"842b6c4ef1538e75a21db3068ca80266e36daa6bc841536ed9bc4b3346ec77ac"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_creaislandranking.Select_spesymb_islandname_SelectedIndexChanged (cyclomatic 115): TLSE_creaislandranking.Select_spesymb_islandname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"844fdf945a2ea08da649879e5940259ad9e67c8109a8f6234e8a72ccc26c8059"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_islandinfo.Select_spesymb_islandname_SelectedIndexChanged (cyclomatic 115): TLSE_islandinfo.Select_spesymb_islandname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeb46ce7a984d1bd5eb2b1c85bc0c7739456d5582648be15ecb2483eca5ea17"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged (cyclomatic 115): TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f399e01e7c4980c5af3f6b6b90eeda610ae413e7b1ebacd455f863eb10db10"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged (cyclomatic 115): TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"417416923989715fadc09d89b6428bbb1a54d39238f045d591154b36935658e4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged (cyclomatic 115): TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb8f5eadca1ad5cbb0882f398d621dd327b65926a329a8978fb59c904e54f54"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged (cyclomatic 115): TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9ddbd7fb29068ba5fc01e6f43efa84f9cb2f7da53a3eb22c2d289ff33ae25b"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged (cyclomatic 115): TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3e3b16244148316f3afb18ef16acd1efdfca6fab5e5f6ad4744de6bfac38e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged (cyclomatic 115): TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2e3d0a056e17d70e1052f865999b13b0ad15c3be09357f040a9c573253392f"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged (cyclomatic 115): TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9c9853dc736a39b6ce7eda8fb9379c2ed981c1af1ef7974e5bef5c0236ca51"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged (cyclomatic 115): TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged has cyclomatic complexity 115 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14678}}}],"partialFingerprints":{"codehealthFindingId/v1":"006163c271206f7c0006dba82501f2881e66714eef0c8ddbeb66dad68ac35045"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdae2c6ccd45a0712e94f219736ae9afa4197fda752b69fee538da6f1f06fb2a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23400}}}],"partialFingerprints":{"codehealthFindingId/v1":"450b3787bf6e491534160cbcfebd221cc6fe390a408656b2e98947483cb34e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23631}}}],"partialFingerprints":{"codehealthFindingId/v1":"850d51c0642c37abbb69bea7b01ac80ecf8722f125551a502081835cc4262dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9085e4f753608fc0b252fa9fd2d2fb0fd51e28b1daf105dee5a56354aed81ec"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_5_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_5_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24093}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa0cb4317ddcf2dd5e5a1efbc812417e60a811e4ad76758c2429bbdd9e37ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_6_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_6_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9548526bda3ba84bf341903792f4b88d1d0754d7cc3e3cc97543aac701d1cf47"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_7_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_7_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24555}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e54e03ec5e0150cf7488bdf2c7f2182cd9e7a37d81ce403b0eea5082d052d6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_8_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_8_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24786}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f058678d81bd4c35d0d03622ec55608fa2b8fb0bb79d31dcbb3edea5fedf5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_9_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_9_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25017}}}],"partialFingerprints":{"codehealthFindingId/v1":"19244c7359e37db3fd3e139a280c50c212b644f0ce4b94d7a600889fe94d8060"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_10_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_10_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6fb09b6672030ea625d947d5d50273a5d0ff1e9a44d584d9ee20f09385696c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_11_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_11_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0871c556d31513654de25eb274e317c6eca7eed31cc3f2fd2757e3d8b58193"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_12_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_12_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f225eb810ac175eb9ae8497aa67f42fd0b8999c94c02743a3615310bf7f42ff"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_13_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_13_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25942}}}],"partialFingerprints":{"codehealthFindingId/v1":"d372fd1c64b0e550ac9fe69af5d4e46ce8a18ec846e6d4b078c0688f8d0b194e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_14_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_14_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5218a0cb0d4dcfcdca3e09aa9ee1934ae5b8f016d9ee82a60a8fcf68dbda3b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_15_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_15_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa5f19292b310bd0da4f057fc4f897b910a5c5a4b3a8cf17e5627a58668092"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_16_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_16_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26635}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d669b5a5dbc218dc6f3f1c273e305a64db28b46d21a01cfc6b911a3cf008b0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_17_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_17_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26866}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff20b981fada6cdc35d3413dbae9f42987067298ca8e308a898b97fe12d036"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_18_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_18_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27097}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbbcda2451d9452aecf394749a993ffde4f7d41e4ba66a5ff6ecce7f241e212"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_19_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_19_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04ee0afa6aede303e5316b21b6b10f744ccf2ecb53f049888f1540f7d17783a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_20_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_20_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f13f37c24d4f5408f5faca6d6a8e7cc861f3277a253ea142bea70e250740c8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_21_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_21_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad361a1833eaf85892b8db1ecba46dc0e1c9e9514449c9befc8f5f96c82fc39"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_22_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_22_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28021}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ee846b485981da5d1b19c52a3f4c558ebf38614784f992aca282ea5adb1920"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_23_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_23_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28252}}}],"partialFingerprints":{"codehealthFindingId/v1":"266193ffa75ef88983509390d89628961758cca4fc14e772b6957b4db43a9b73"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_24_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_24_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1bbaa75f91274daa1198d04f0d98a66acc638fd71cd8303e2a0f42b54da4e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_25_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_25_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28714}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e78b456aeb5378c94adc96a2770e596e519174123cdbbb9aa68a770ca27dac"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_26_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_26_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28945}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6ff5b3b39e419606ca44c2f1f15721755838460bedb6113b92c53c1b45a523"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_27_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_27_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29176}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a4e80b84ed8131a91aec6182fcb2f6e619d09ff763acf773523782017ca6f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_28_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_28_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c077dc85291b7d6ba98875b267b06deaea2e51a208038e98b4aedac8e0222c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_29_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_29_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29638}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a0ef1c21c1eaf789dacb0f1697d2dc7d92cf3e89b6218ec8926338c638b55"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_30_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_30_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29869}}}],"partialFingerprints":{"codehealthFindingId/v1":"466820783ef0ff86bd26f993395ea890d1e3e8b8a3194d9ef1abf655617e8c91"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_31_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_31_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c004180ecf34c6d00ad326c3384aa7b826c2ce04e9217e3a81e28fc30160f366"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_32_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_32_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30331}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4e4adf53d4a689b2dd2d92efc3ead52f53b3a7dbc1e91f591a2727a799a46"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_33_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_33_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30562}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f04ad008accd68084da71c767e2cce1810ca12b749516d6990e98927d3da49"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_34_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_34_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c3c34f0764c450e9fe26944c3cff4f3c87549e0401293e839dbbb03a5fe7f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_35_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_35_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31024}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e4312471796630df72afea247489e891350b929d14e1ecef1b5134089211e7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_36_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_36_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f79a497fec91dba92f82dabe8ad63768fc8b1e981791e30bc8fec0c3850a808"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_37_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_37_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5657ccfdecbff3d2e2cae4dd47ff026dc5409db2181a8c16903ff994829b53"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_38_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_38_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31717}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cecde0a02e3f1411d755144480991df1c5467a237125a2f33c7fba394280d7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_39_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_39_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a61dcc24f78b77e2e4746e3e669987d4c249beecbbea05698c7444da740dbf9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_40_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_40_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ededfe8bd04ac2e2b497f3f86e8a7130fd05048aa7c28798286bdb2d2f8253"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_41_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_41_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247d080bbc00a2903fff51ef37c530b3ef8e847283e79e7a5def19726f8eb17"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_42_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_42_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e0fbe8e436a7d55443f2c9832389ae38432e25398bbfe04e48c9b6fca1835"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_43_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_43_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c2dd1f222fcc11b52bddc378cf412ade665566af84b21829fc0d404162940"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_44_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_44_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1aba1de43214e1db38e0337d4ac9dccf462bb3f9809602256d1ff6b138dfd8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_45_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_45_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33334}}}],"partialFingerprints":{"codehealthFindingId/v1":"529bcd439e76712343a26091703f732c8f92d929ccf58eada245d636e407ddb1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_46_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_46_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7464962ba251900edd2fc6bd1c83d77e9c77feab846271582ecc2c79862e3b3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_47_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_47_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f327133bdde9330ca8ad4effa4ac92d974cffade0068b3532c3459c39ea97ac"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_48_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_48_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34027}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c92bf0605ddc048ab84c1fd734e2e64603e92baba4a5507b919115f8902be"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_49_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_49_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8366e97986cd55eab063870a8ade5365c3eaf58f8974c62f6d4b0cd19a4f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_50_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_50_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa00cc086aebff56931b8f38e418c622d4371c80b657fb6e0c90bbd13fa216c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_51_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_51_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34720}}}],"partialFingerprints":{"codehealthFindingId/v1":"052dacc3ff6e4a2f13c2c85cfcdac3f70f9b7b11d19a6b68bc76fedaab8a7398"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_52_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_52_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34951}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1d3164b1270ac43b7297c38d85223f1385eb140253344156b907af1c5492c4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_53_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_53_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d476e28c416dc4e78d3a67c4fc12bb049b869789e5da5422541f24e95dbe48c8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_54_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_54_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b72e84891887ec61b29450b493a981e0d30bb2e07233ad564046a06c1b865b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_55_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_55_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35644}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd9b83b2536e51a000bab690be18bb641b26cd0e3d516dbd58d52f13980f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_56_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_56_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35875}}}],"partialFingerprints":{"codehealthFindingId/v1":"19641cc4be832fb5b63a31a9cc871e2ece131c6e23701f87684675f0c6588d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_57_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_57_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1ea898243542e9351324aa6d38212cdf7e8862aad67828d13592047b6c25ce"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_58_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_58_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36337}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd836c45dae64b41a221dd4f7ce1d1e42998588bd1205100186ecb16632c4460"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_59_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_59_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1265fab1848deb04b7cae6de7269619072f7d35127fe6d85f3e596d6dc071c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_60_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_60_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092cb5ba1add2c5348c10e4b85b77fe82a051e0418e0809d8f6812716eefafe"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_61_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_61_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37030}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f17d15d57869caa08cb3f714a2104eee2f1ff22dab737b3c36891c9944bee"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_62_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_62_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7538ac6569d82bdce157c86aa93aabe24aeb75afce2494d2dc75c66986ba96c2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_63_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_63_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf15bebcbdd3d8c2187c1f5dccd43f51b7aec7eaeefb99dbf6418ce7d1192de2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_64_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_64_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37723}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb6d2438a7aaa3dd1034f22f5c824ea02b3591b42e88bcb52990370cb8456d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_65_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_65_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d998ef8697e358ac3825581e3cefdb33a5afe212ee679e2777abd10aeaa49db"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_66_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_66_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7847262edd8ee65303e3ae26bf1f3b45417b89075eca05fedadb812175c6e53"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_67_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_67_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38416}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbeecaaa8a056aadffdee5fafb5a5b8bf24c81fad4c857ea370b29ee021a700"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_68_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_68_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f0c1eaf9449708fedf731fd70a3725823a2897503224338cc57c4bcc671c71"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_69_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_69_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38878}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee2799c0e820bfab17d8bdb75dd6d61eb8a6b02b9f58d21e897cf7393e2501"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_70_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_70_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6839609aee0c0adf9dc325ee2a3908844f8730f2ba78b31ae2f3bc7d76f80e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_71_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_71_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102a09909dd9f892dc36b9040b456f14dfcbfba452ca303552535aafef38efb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_72_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_72_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39571}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e6365558152a5ab74fcb26bddbbe8b193aef6b39b544f448f545a806deb468"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_73_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_73_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2755092315fe5edb717c956bca68565a3aed5f4301e3f09c82f6fe7b664768f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_74_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_74_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1fd2ed3490e5d5acb2176b40e4e0eac688bc9abecd419aa334092e36a27068"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_75_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_75_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5eda1a688d71a79422879499d162d08fe547759394b8eb84a0df0336ec5f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_76_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_76_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40495}}}],"partialFingerprints":{"codehealthFindingId/v1":"289e4578a4c31396c3199d267fc01ee54a38b5fa7b958d023bf3dbe896e5b7bd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_77_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_77_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c233f61cd02b2fb677e2fadddbe0490e8027340cdf9f5e0ac549b8e18fd1881"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_78_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_78_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40957}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb2b2725c33e973e60dffa48a05d951b3a483910bd2edcb0745bfc9e55c16c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_79_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_79_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3facc9c2b41bff0fc300f26e62952f9494bb2478c872be7b38a028d542fb251f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_80_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_80_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41419}}}],"partialFingerprints":{"codehealthFindingId/v1":"470db4e63c791244221f7d6bb98dad47044cb4f8b10a8168dc03f06d1a9df814"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_81_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_81_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41650}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4343c629350866564667acf8005b2866cf09166be2d4eaf66aee6a4810ef43"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_82_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_82_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41881}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2639ea9d09fe338635fbc7b8bc1a744e0a58d087c4505ead55f0ca7aad383dd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_83_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_83_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42112}}}],"partialFingerprints":{"codehealthFindingId/v1":"69656830b08793275288ebd7d93b8bbf201cff4ff8470ce4f367884a98ee0118"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_84_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_84_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42343}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e39776c07935f7463ccca40a26ef5f27b8e4e1ce136029c4b323ac08025169"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_85_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_85_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64aa3304d2cc8c20f7ead2dea779ef93fa7c385a6fd9895ef3a6f6697e824eb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_86_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_86_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908f0663f292ffcf0126b887b71705b5cd135811f95c4ee2a5347caf6576009"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_87_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_87_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43036}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab4951c52a1146c3785853e9e7e001f18a462f4ee0c0c093709a9c23e0cef4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_88_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_88_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa0bb6b70d1810c454c2465c89036dd592046317e3e5e6bcd23a5bbbe0cd4db"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_89_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_89_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605e1f6811949f53a813aa4eb1972e88c2328228db666706139ce0f1a0f26dc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_90_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_90_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9190934414beda4a4c1c7fe372c3ca25951a94ba7dfddee69a150df82a60727"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_91_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_91_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4671290c935678afc712d9c2d9a01f7c9238ad13c6fc34bd04b9af99d83cf8e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_92_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_92_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0659471e8fd253f533ab2fa51cd108c18bdca263f7ce62aaf8ed2075b1b07d89"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_93_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_93_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8228f4c491ab004c6ea07d5547ccbede17f82d9edcaa92beac1e0f9a36efa63"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_94_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_94_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44653}}}],"partialFingerprints":{"codehealthFindingId/v1":"63263e19d4487144a1a98e463541bc92da182e89d77cb484eb333d2d85ad70f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_95_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_95_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8e4d93d4aa4aa3001d5fa5bbd450bbe26e16214e04d6d2dcb8d43b7fded537"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_96_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_96_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b460137c6b4abe7907d52e232fb523acf2a4ba8526295bc587c0bb72bca6016"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_97_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_97_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45346}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afe7a74c9385014b5441b4d2ad5bb999fe37c3785f3b5043cd3f6577f94530d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_98_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_98_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a314c756eca23e8482398a060a616a793ef845fe9396b8ea3e2b8d8db2929"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_99_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_99_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45808}}}],"partialFingerprints":{"codehealthFindingId/v1":"69089353c236b0f9423eca6f0643b309c760cb9be5c52c226f78773861c003ce"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_100_ValueChanged (cyclomatic 113): TLSE_Jrelationships.valu_selfriend_rela_100_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46039}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abd3b747a4a6f71c1d483c0ca62c7218b416ad5462bcd8887121101c644d63e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_1_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_1_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9530fa7ce0782cc1a540820acfde4857f1f68d9690513e5b44917be1cdb94e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_2_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_2_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23402}}}],"partialFingerprints":{"codehealthFindingId/v1":"418975448937586ae1091de416652d35e256d09673c310df9b5fe7ac63a1a412"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_3_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_3_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23633}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1cb04137d0f640be20a2526a0342aaf52812adf25e752cadfcb8a06a43fb99"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_4_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_4_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23864}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a35e1c7cb4569d4d410afad0eabd6a6aa5bb2316d786df09cb6f0e226496a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_5_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_5_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85525123f1d2ef7c665252d9beb6931e849b0f6ce643c7a6d2fd216042e5cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_6_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_6_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7755eae603d5e473c4c21308f56783897d82b021d4e96ca7a48745133000cfd8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_7_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_7_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24557}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf87fe7b9235261b57c0b118251cab53eef616d955e869e65162f1efaf5cbed5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_8_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_8_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e25461d9603ebb9c71c8a3c01a26b1a8c967cee7ab27a355c9346796aa70fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_9_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_9_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25019}}}],"partialFingerprints":{"codehealthFindingId/v1":"c771ff3ea7a9e91b9775a59f0f52ea200593bdf9e505566e46453be2b9adf353"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_10_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_10_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25250}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f4d177ba8ad4cd8fb7419d991b5ffea1a696c317e62e4b2844d3f9fa14ab4c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_11_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_11_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4cc3ec8c99e1514b5e835cddd4667a64336e70102529f58ccd44babca726c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_12_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_12_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd044cbd190e43c010e268e854d65f3c1b54cc21c796326d22918758db61408"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_13_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_13_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd65051f9f9b565a38e7d76adb09d68e2d8651519fa1d5cd887f9b359cb192"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_14_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_14_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8116ad540b8d4effbfa9274b7ae4f18469ede83f9629fd8b62b7f584a26d9cd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_15_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_15_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26406}}}],"partialFingerprints":{"codehealthFindingId/v1":"205f469d7aaa5f680061f919f8d79426a30f3906b38af203b17bf06f9fb104e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_16_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_16_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26637}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af707526ac1f8d3a75a9138c07647ab4fc5de04fc73a62bd6761c06099c0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_17_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_17_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6643fab9ef71b12b27d72232516aefb63a643594446e8c6154713ded8205d10a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_18_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_18_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27099}}}],"partialFingerprints":{"codehealthFindingId/v1":"584514a3a474524b6d7ff48f390471c0be7806558734b4ce1cf3e64e8ed53cbd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_19_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_19_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22c65b7cf91319d2f9f72999f25554e5c691f8b4d59e92b2b684096f568c7b6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_20_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_20_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d77b645dae86fdf2e5d6b9890279b089be691910ac82cf4d1f6da83e0edb9d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_21_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_21_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fa60c740fe1023a32cae8324db2914f1d2f435ebfe7b304df6d26e9fe3386"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_22_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_22_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28023}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cc02fe2e0875a9655500e2bba040be44d46ba1ecb52016b2a7027cdb7576d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_23_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_23_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28254}}}],"partialFingerprints":{"codehealthFindingId/v1":"950f92e4a791930accd581e7bad20e3a7cc9667b273734d71052bccbec52badd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_24_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_24_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a94ae04f450f5e27f3d415390fabee3c77005c3798f94cd74663e6db3b1ff7b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_25_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_25_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28716}}}],"partialFingerprints":{"codehealthFindingId/v1":"45825063ac8af6f5597f407daeb80544929dc04c69b57a5c7814d96c3e39da74"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_26_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_26_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28947}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b6c0b980ae2faa1205aa652193eb96fd294813590cbe86948fcde5c6a1c49b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_27_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_27_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbd1a950468372d5909d6bce657a3b390626c8abf34aaf0eb696ef1ea502ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_28_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_28_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29409}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1d2b35e7b113906cf52cc93d21dd0cddf3724acbb1af7c86911ebf2a9d15a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_29_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_29_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1623146ef5494dace9cce3e85f29e37c07a793be21dc8de1735ba21832186dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_30_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_30_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29871}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f86137834698b6b510e60566303f3c64b1761483e4c912234edcfff80bb58a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_31_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_31_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d16f225ec4967cb02640d93a8d1af29d4da96d2776be2341d4af6516d3dc3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_32_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_32_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13f29416423ef09d72f72e5e904257a118eecef91647e5e2a5aacdfd1e38767"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_33_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_33_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf71fb2f5b96e33f766d368451b58e100d15c5b81605c396e20993624c2fc5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_34_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_34_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30795}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e4637e9e350b03930a5198f07511e22758174699a8b9d7e924f3c1cbc203a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_35_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_35_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31026}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff80709840d373380c0609aea1934d5b3260c8772e268bbdcb6d6dd0503eed51"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_36_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_36_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6986528339224baf0f205e895575aea9c7e2d82d69b3591d0a0545c58ab893fa"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_37_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_37_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31488}}}],"partialFingerprints":{"codehealthFindingId/v1":"622f4c9cd18fba90070b27cf653c50e3031302d9274cfc0ccb18eaee350a357a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_38_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_38_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31719}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f58ba721867dd2f4b2e50242786b24d92141a067b036bcfd5a21684cce560b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_39_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_39_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31950}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca9ddbac30ea92c099c78e3fae736a0a3025a6684c6c7177a5f6396c8df2c93"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_40_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_40_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0daf2db029333a3970fa0e7a7a1f173431915c9253bba691678e1b30bb3d83"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_41_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_41_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad59327a26fc33594ae002411ef7f4c92fc3086e5d511823012369ab8379f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_42_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_42_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eda5ed2f97548e5602cdbf8cd3cd6d5b782492747558e60c4c6123d251e9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_43_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_43_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32874}}}],"partialFingerprints":{"codehealthFindingId/v1":"0772cd21cd2de7da6039e2e8adb5b26b99c557a04fc576a0fa73e0766b444760"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_44_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_44_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e35bb7263f5c9932e718a6a8b53409f1c8e40f05fa74c1a466f8e8aea3183e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_45_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_45_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8149b82e999d269f81ad5df20a7ce1f9eedd9d07022868041c0661e5ebdbc905"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_46_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_46_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f58c1f13fa94306d1dc31cdf847647bbef90dbe809102445f09a2a217f0b835"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_47_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_47_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8abf01b6d8bf73a79b366865adcf3e3713153b2186adb2dce4cf0f71fdcf65a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_48_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_48_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34029}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d9839d9f9f9997105ce6e6a8424b04d0cb45f8f2097d3e2361eba210dfe2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_49_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_49_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34260}}}],"partialFingerprints":{"codehealthFindingId/v1":"161b12cba2a9ea04200f7ac7edc3d5cfa4566257d526f420d353750c5989c948"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_50_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_50_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b5b4850ca453a815aeff1fff7ef633c1f368eb03f068b232c56ef8435310b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_51_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_51_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfbd1aa75a520d70458c4441f9ec5675ae6a0ef7c9fedc4dfeb3800d0d59dad"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_52_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_52_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34953}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef57525e2dea201bec6fede01c875750f36bab02bbe14f063424ff1186d4769"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_53_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_53_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04c0eabbd893ca0a1b7e8bbd1d0008a6691484f724d173d7ffcc9cafcd0dbf7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_54_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_54_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f1b414af208520fa6043128b09e9de6caa489976388412987c9b66665ea96"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_55_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_55_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8776bdcc507e8ed53b49085ffb4e51579a20ecf5c2575d39a76ea3453e806337"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_56_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_56_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35877}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d8f092c638fd20225ce0d829e2e7c2c477d9a9c24f960b6c0f2d3f632daef4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_57_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_57_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b2a8b31d73d8dcd5c883868322de77eba23ebac8b05a3c4b941c3bcbcad60"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_58_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_58_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c981c49fbd52210f89259fe768df3c7c971b4d7cd9f16a4d37cef8534276fb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_59_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_59_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bba88858b3241fb41149aa616fc9df3aefcdeddddb41d36533241bdb938f853"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_60_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_60_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d526675a7d564ecaed413c11916c60c191c59830c1e306cddbd34757f03fac3a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_61_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_61_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37032}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb08aa1eff5cac2a0201b2649d4b5018650eae1426df16f597371adac209e85"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_62_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_62_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37263}}}],"partialFingerprints":{"codehealthFindingId/v1":"df465dbbb11a1650be2f7e91fcfb64cf858bc97ad5cfdaad2fcc1588fa328a47"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_63_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_63_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae15ef27fdde854dc41bd6fb6a95c6ce2cfae989661c01732cc0f645c0423fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_64_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_64_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37725}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f8eb0ccec2e17aaaae9469eb76eac5755730693dccf59ee21abb7a5752eb96"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_65_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_65_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37956}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb6968d02733e00d7164c17dfdb802ec39bb0214e6953b5fb00a7cf883dbb4e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_66_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_66_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d53b128c11d50c06eea73720fc03d6c685c2316150ec4df7885406f599b18d3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_67_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_67_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38418}}}],"partialFingerprints":{"codehealthFindingId/v1":"723f122be7d6942e660287b0bf3a3ea859858c60cfbda3f30931d3ae6a330f72"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_68_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_68_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38649}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc13d37f6bc06fa00d9d8ee082678bb33d70e625a40d329ed8191c49fa512d0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_69_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_69_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38880}}}],"partialFingerprints":{"codehealthFindingId/v1":"83668344e7c441fc7abc2d258b4a272f51a250bbc3a4bf30a68531c5feaceac0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_70_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_70_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4172570d2d0e82b9c3febb535d3940999b0bfb9a8a666bb8aaa43ca544b71a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_71_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_71_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39342}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c5011ef489e60ec600727f08753cba29c733f26cb076f3b51a988cb7785a29"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_72_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_72_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39573}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0e63f774a4a9ddac097e37389c6fbe4866b1f63ea75ad938c75b833206cabf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_73_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_73_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fe97ec79a67da3e7c07fab3d9d010772024415655ae6af26c2a6288a2adbf1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_74_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_74_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40035}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce06f65d2433c2603795522f337d40ba8126b0d923241cd54b1a625b2bf429b7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_75_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_75_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40266}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a350f7fe1cfc0ebbe2e8a373af7b6cd52c03c7325fe8b34b68af421be32715"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_76_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_76_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40497}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cbd72415649dd77d453a506e68ab92ade966bb4133793faacbac42aa1dce38"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_77_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_77_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40728}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89102edd6380d401c16b041b63ea36c922b1cbe4f379089e8f14f5cb8c76b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_78_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_78_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40959}}}],"partialFingerprints":{"codehealthFindingId/v1":"039805e89c55b62e80a63266b4a67fff0f0c67407a17843e8a0153632ef05618"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_79_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_79_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41190}}}],"partialFingerprints":{"codehealthFindingId/v1":"635f8ccb0a595e7a06518a09a76ce5da5f178248181d0cde3b6f5c64830608a3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_80_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_80_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f835e204cd2441931ea66fde53baacbf44d727be707305033623e8d13414edd2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_81_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_81_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41652}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f2f3bccc083a526012eba1d4b497bd4c83a31099ea8b46db1ea5e825c87ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_82_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_82_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41883}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4be6c36678fa162f42e94f1dfba49fee9a7615bcc7a178a7d1f604f695ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_83_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_83_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42114}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f05fc8a704485ab7818c92433857c29e609f6ebdefa4d3a14960b139bfeed3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_84_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_84_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42345}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fdd327d9fa9de0bd0fb87b1febacee717b94ba2b87719d233539bb4a74b7a9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_85_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_85_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42576}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aef81f2f789bb1c04712628e94cc68a644a024e71ffdd6a5664863a04f2b90d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_86_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_86_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4079df0489c91150e956895f76d9f533ef612ae1a5a1c5bb36fb601692a70959"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_87_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_87_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43038}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a990d5658339d385a26b6851a0cd594448338e04c2376adf93d1049433f6f5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_88_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_88_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43269}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a5fe7ac3efa55c46f7f6a4238920861cf77991e98297fb59d2ae96463be6ba"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_89_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_89_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e0427eadc2d0be4921dbe2ddd41053aad150bd9f72287a1a30d57f80b662e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_90_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_90_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d3e7ae67cfb63bd62227783f6ec73f89ea6a7025b9fde758cc968093d72f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_91_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_91_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43962}}}],"partialFingerprints":{"codehealthFindingId/v1":"747ae9abed0b20fee259609005e17da6055a9156521940bcc86669373d98db7e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_92_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_92_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d545e0e48b21a8086347b5db664a20fd5003ab9844a5325fb4c4fdac79e5394c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_93_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_93_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3040f2f2d433687bb09e92f98f8f24f8c9aee3ed6b623d294b358848835427c2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_94_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_94_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6135aff70337abdc95ea124e9ba384d0734fac619695a0ca2f1df3b210072a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_95_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_95_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44886}}}],"partialFingerprints":{"codehealthFindingId/v1":"371803114137bec93d9bbe79835edb78dd4bfe13a5bcfa5207a88203924109d9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_96_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_96_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0067911313ee7880a952f958479c8c6a330c6c1618caf4560b9bab501ec8baab"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_97_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_97_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45348}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d5f2ef04e26dff4a03b88aa1316f661cdeed0c50ef28b1f52b227d31618177"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_98_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_98_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8874a4416131b64c6cd6b552fe68bff1c442e8e7ba94ae079f52cfeccc4ad7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_99_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_99_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a516adc43c3a5ec54e180835f87c109bc4bdd3022f8e4fcbdbf10ad7f6296f20"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_100_ValueChanged (cyclomatic 113): TLSE_relationships.valu_selfriend_rela_100_ValueChanged has cyclomatic complexity 113 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46041}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daa904f4fcc1fb579baf83ead561244169070b070d3dcf75abe0bd4b1cfc4b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Readfriendlist (cyclomatic 104): TLSE_Jrelationships.Readfriendlist has cyclomatic complexity 104 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80579}}}],"partialFingerprints":{"codehealthFindingId/v1":"853bcfdc39dee782af77ed34abb7664b13d7bb5da5e8d566a3364e3a534ee56c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Readfriendlist (cyclomatic 104): TLSE_relationships.Readfriendlist has cyclomatic complexity 104 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":192202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3f13ea98bf4e6cd1d488a2c9594291946e7e8b329d4c498e79c1f3924c947d"}},{"ruleId":"D1","level":"warning","message":{"text":"Miimusic_edit.Miimusic_edit_Load (cyclomatic 104): Miimusic_edit.Miimusic_edit_Load has cyclomatic complexity 104 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b54996dfb4bf6a181b55f0a447e04af459d6583da8a9a8fc1413922cfcf56e3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_manag_travelers.Readmiidata (cyclomatic 103): TLSE_manag_travelers.Readmiidata has cyclomatic complexity 103 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0b7034d3256b801c81bbfcb112e36f467139c5c36bb8d83b64a6d42db5f6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_dataislandranking.Readislandranking (cyclomatic 102): TLSE_dataislandranking.Readislandranking has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_dataislandranking.RestoreIslandranking) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc3515396db93064983adbc7432c2a9a7c81bb8c90f6caf397295df8ad5ef4a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_dataislandranking.RestoreIslandranking (cyclomatic 102): TLSE_dataislandranking.RestoreIslandranking has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_dataislandranking.Readislandranking) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3272756ffa8cb94aa42d5b5b7fa9bb67f2de4225a7e2e086a5bcf5422f95b9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_datamiiexchange.Readislandranking (cyclomatic 102): TLSE_datamiiexchange.Readislandranking has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5ed222c2cd770aa0168fe27557d8ed08c56227a82fa48b326de770a7b1e109"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Readinteraction (cyclomatic 102): TLSE_interactions.Readinteraction has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93fb6282d0c8a92ab3a84dfc8f96b588d8173cd34fa87eb39cc1b0fb6e3845f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Select_target1_SelectedIndexChanged (cyclomatic 102): TLSE_interactions.Select_target1_SelectedIndexChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target2_SelectedIndexChanged, TLSE_interactions.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8672}}}],"partialFingerprints":{"codehealthFindingId/v1":"716bf5e5582a77ed1f226c6e198a6ad95319ef502898c6ff96a180a8a837d484"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Select_target2_SelectedIndexChanged (cyclomatic 102): TLSE_interactions.Select_target2_SelectedIndexChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target1_SelectedIndexChanged, TLSE_interactions.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dde3c3493c595d313030da50085249cfde03ce963c8a44d90f87048508960c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.valu_target2_ValueChanged (cyclomatic 102): TLSE_interactions.valu_target2_ValueChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target1_SelectedIndexChanged, TLSE_interactions.Select_target2_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10221}}}],"partialFingerprints":{"codehealthFindingId/v1":"907a1ee11f5b3fcac49dda809573ffca911b3b0606bac8a35123d14e0b9825df"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_interactions.Writeinteraction (cyclomatic 102): TLSE_interactions.Writeinteraction has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfd20315a98eb8068f8dc64ded3d123adc1141a8adae99c6b322b27f278e0f4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_manag_mii.Readmiidata (cyclomatic 102): TLSE_manag_mii.Readmiidata has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_manag_mii.RestoreMii) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6522860e9cbbad26e07b979b2d257cff0bab6f393828e2febbfd0157c8a3192"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_manag_mii.RestoreMii (cyclomatic 102): TLSE_manag_mii.RestoreMii has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_manag_mii.Readmiidata) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc1c7fadbe36ebea176a1a8de4f9f26d6ea1e9c45347bc2f07527a9d61980dc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_manag_travelers.RestoreTraveler (cyclomatic 102): TLSE_manag_travelers.RestoreTraveler has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"07410a00451d01be333c9f3f7741c3bc09a9fb3f80ab47eb2ef65b4218f1e9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_SelectedIndexChanged (cyclomatic 102): TL_SaveEditor.Select_target1_SelectedIndexChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target2_SelectedIndexChanged, TL_SaveEditor.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27077}}}],"partialFingerprints":{"codehealthFindingId/v1":"67085bc49d5e2a4a25c27caf755a3f3000277f8cad745a56eee120eb6c82d02d"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_target2_SelectedIndexChanged (cyclomatic 102): TL_SaveEditor.Select_target2_SelectedIndexChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target1_SelectedIndexChanged, TL_SaveEditor.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5e0d66b3687c4346e844fa6e567e71599870e84056819e0393fb26fae8cd5e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_target2_ValueChanged (cyclomatic 102): TL_SaveEditor.valu_target2_ValueChanged has cyclomatic complexity 102 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target1_SelectedIndexChanged, TL_SaveEditor.Select_target2_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28626}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd8a627a996d6c39e52e67371567683e2bf9d35904d5447c974e26770fba75a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Button_setallfriends_Click (cyclomatic 101): TLSE_Jrelationships.Button_setallfriends_Click has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46282}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eccd25a46c466ba462f4e9a808abc7093110dee2ba64d01aa4b6cb22899798"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miistatus.valu_experience_ValueChanged (cyclomatic 101): TLSE_miistatus.valu_experience_ValueChanged has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387d06f6d622ecfb7624cb7c2d232dd6fea68b6889cf0da100064bfdc3ccb79"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Button_setallfriends_Click (cyclomatic 101): TLSE_relationships.Button_setallfriends_Click has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c476a4d722c2fd8850d64662e38e2327c8eb77bdae86edfc1e77a08260ef2af"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_travelers_status.valu_happiness_ValueChanged (cyclomatic 101): TLSE_travelers_status.valu_happiness_ValueChanged has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"09594e278403908ed06c25bb8899f697a63e88b807cc251ecbaeefe4597f56fc"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_experience_ValueChanged (cyclomatic 101): TL_SaveEditor.valu_experience_ValueChanged has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TL_SaveEditor.Button_setallfriends_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":13803}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f47f0094dd0593bf554bdbccda6fd883297f8f28ca03cbbba6077042cefa87"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Button_setallfriends_Click (cyclomatic 101): TL_SaveEditor.Button_setallfriends_Click has cyclomatic complexity 101 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TL_SaveEditor.valu_experience_ValueChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9968377a3264b3756802d82985a93f4289f2d77e39c007d292f1d2c482b039cc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_1_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_1_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":48916}}}],"partialFingerprints":{"codehealthFindingId/v1":"6145f49c29d4343dbce2372917fb7782fb0768f5c4f708c51014fb678012fa32"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_2_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_2_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13eb550fa617393526b6aeb8776c1228e19a4dc501cace98eb19a170316f45d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_3_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_3_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49500}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b185f27758420da6c055dd6c38614c88a743658c273ce09dceefd248bd942f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_4_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_4_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49792}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cd275b92e5b1cea3331abe20161816d3c91874c942941a9a84c710a36fec38"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_5_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_5_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50084}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df0dfa626043ef52fa211d215632b042afb0964017fb67c2d55d65ee3d58a84"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_6_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_6_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50376}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b0a06b4bf97b2a1ce7d3287966492c6e350d134843537f42369027626e686"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_7_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_7_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50668}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b54a5a9eb17499924d601d6e5b1c2125f818db49c8619604600e42df921b31"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_8_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_8_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cd4905e9600a1d09386512fe1bd2e7a4e1583edf5ff72b7f6325d30f06731d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_9_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_9_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a721faf67cfe3ab86c83b709426d8cf9a40993951b69fc20ba3032c577743da9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_10_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_10_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eb87c2198a4471de5e36bf5ab3910530f3b76c616e333941cbdf4d6fb2eb2b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_11_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_11_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51836}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b497d6c34987eb5f25bdb10fb4e0c4b7bd11435a7ba7b839e1614fb216272c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_12_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_12_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52128}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ab8c32336809d9487ff45c038ae014cba823a81b81e240aaf249d741b8f902"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_13_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_13_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6f0f259efcd3b47fee8b4cdf56d547e7a1b2cfb9da08bf9672cf1dc9354955"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_14_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_14_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a69d754b8af1195823bb2bea3780b7dc6086516b90dc63645d8f7da2b03c153"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_15_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_15_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53004}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20f1328e4166594246117826efb8d221c422d6293f871019010ac01a5b46c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_16_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_16_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3509d1b96c68a503f4f46be172eb2d6e41fa4593d647810bf6bdab90183605a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_17_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_17_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47fb9e40e72c2a8233909575d6e92b712281a63a8e70b6c746547a68b7d5423"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_18_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_18_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eed2177ce6c3b1130584b834b75ec393cf3bc526366d7915d599f5bc20edce"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_19_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_19_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54172}}}],"partialFingerprints":{"codehealthFindingId/v1":"48af9d9e36fe7036786c1f52ffec287ab46290cae33bcf82767fc49eac38213d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_20_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_20_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef96b513cf2edae8c250c431052872f3a53460e1efea8b2db712b12458f088dd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_21_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_21_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54756}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92e602de4494bcb519a170b22ece63d540259ac738f5a8038aa54929423e5d7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_22_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_22_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55048}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd5bc8b6d5708714e464fa9cdb0985abc464b779f469d7e60efcf19e9108a9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_23_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_23_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55340}}}],"partialFingerprints":{"codehealthFindingId/v1":"569e7d8becf13f3a7965424988135c83a266b3169cbc41a123abd03a77ee7b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_24_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_24_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2675170f838b85c2cff491ec2e24991de3f234cc30a557eeed8af5123a1340ea"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_25_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_25_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55924}}}],"partialFingerprints":{"codehealthFindingId/v1":"013cff9d272e01f16360c4bd4b93fb613b1d6a409e86d9b7acb45bc026ddfddd"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_26_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_26_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6045a2f4806057a2437cec5229904885e9e381860318caaff3004916bbdebbf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_27_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_27_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56508}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb2a34be139f217246ed88b76e8cc0e85cd521ea0e1103dc7d37cd30bee8a2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_28_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_28_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56800}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7773ebdd0ff3e20e86109d52a02843c1f840f07e99cdd3caac48e6febd1c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_29_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_29_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57092}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc74a2e40ec46f5c4795d115baa7e2ef9f7e9243666d71ded9f6983c7b6061a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_30_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_30_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc3321bda183cbb2ef18830e8f2d19ae383299e673829ba8f8a0a201d0e152a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_31_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_31_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57676}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab0b650a51df2e4bb9dc8be3fd166367cfceccccb98b8cab381627a0639119d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_32_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_32_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57968}}}],"partialFingerprints":{"codehealthFindingId/v1":"522c0d6a4311d3157fc4378fe9f64905778d7ff61b0f38fbffd65ba2ce878722"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_33_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_33_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54d6eede2a17f749a208c4db058d727994557dc29254bf240444a003857810d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_34_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_34_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58552}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d3ba1ee6f07e54370afa87e58c348748a8fe1f9bc99033c22545f5c81f58b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_35_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_35_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70449d153191ace9b124b7b5b532a9d079918a785921f17b38b2d666530543e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_36_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_36_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9cdc47a15a8a89f21fe6b482c076a69ff0e323ca9736f013106174b44fb56f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_37_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_37_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6734b1eff57b1b9738eb51017e6b96aff4960aae2840dd47fe77b588a27f51"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_38_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_38_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdb808482e199a276610b35a4967b66024f5568b78468982964287f5d9c1023"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_39_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_39_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60012}}}],"partialFingerprints":{"codehealthFindingId/v1":"418499bc1daa7e06ef8cdba3812e4685bf7a2f4187e91a1cf68fce9bff6252a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_40_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_40_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0937b95c116fc459b54aab3d803714aae07052c4fbba9049c3cca90489d16a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_41_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_41_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60596}}}],"partialFingerprints":{"codehealthFindingId/v1":"99875e705998daeffeddf0b48ca484ea31f2e1faca363d40ce9b0b7783491b26"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_42_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_42_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60888}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeff2bde7d53953d8a35f865fbb0c963037238e6b4efee1de8d4897850acb6e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_43_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_43_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61180}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaba4e6dfffcd287f1d1114680d13576cda94f1dc9d5dae2e65883a2cbb341d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_44_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_44_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61472}}}],"partialFingerprints":{"codehealthFindingId/v1":"76198b0fbbe44612ebf887aa3f4682332403d549986559568d20865ab93f71a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_45_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_45_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddc39bd9917589900e8ee1b556627eacd57eb2af398904975a98d61d892d56c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_46_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_46_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62056}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce183343db3f23fb9e9db3b6ffb0e4dd9289541ffacd479d42e3a72fd0e69003"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_47_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_47_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40288185151a13c67e1e0ef521741e561daab4961e872ea48740664ac11015d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_48_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_48_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7bd6020efd200ac6d8b904c64ac39e06e51cfc6e2c05a3bc2345c5a1f5078b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_49_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_49_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62932}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbee726791757adad600648a01365a49ded72448cf8d82911b650e809bb9a756"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_50_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_50_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63224}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bb3c5f63fc0896f23cec53b01eb244043282e6604d7fa6811bed1100411d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_51_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_51_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcd8e86f9df41b89ae39889b34f9e4711875d7f02645f7013dc9c46d4f9a251"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_52_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_52_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c9565464fd0124cf87c03b27df41737975728cfc5b4c316bf8f6facd48ac7f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_53_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_53_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d442c3f0e6cc65dfc375ffe7a2b0738504ddaa29aeef9886b3ce01bb0ea40615"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_54_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_54_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64392}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dae00cf34abd68ff2932301268b55a8a2369991c1f9966314bc7f4a58b042e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_55_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_55_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64684}}}],"partialFingerprints":{"codehealthFindingId/v1":"209592f30c10ae4126cfc29a37942fa103e12a04a164055d3ed57688681f045f"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_56_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_56_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64976}}}],"partialFingerprints":{"codehealthFindingId/v1":"556daf840781b2fae4913b33c4591d620d69b4937a2467555e8173db1d28a565"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_57_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_57_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65268}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b2615233cab09c59b529a2b353bb742cfa44748abaebedc6b09a64b76a33c8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_58_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_58_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65560}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b1a3a9551369c0686ae9175e3e422c8720b4d2fdda3b0655e465df9c9a861a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_59_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_59_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65852}}}],"partialFingerprints":{"codehealthFindingId/v1":"004175747dfd8e7b8e2accb42d14ee6d4169802b0efd9176541a09eeca8ffb77"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_60_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_60_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66144}}}],"partialFingerprints":{"codehealthFindingId/v1":"240060040ecba8246905850c656d59d9c88363b9a844b4eaa3a6ce80e41894a2"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_61_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_61_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9688d6434d1324180acb8b7a476c60ca7ee26d961518e3870a1bea95642ae954"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_62_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_62_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66728}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4a3d7591baf1346659561565ebe3d4477e7dc2b0c943fa4456a647d1c36a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_63_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_63_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67020}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51f7770ae1953b36681a5047060bea3596a3de15c80f41de71fa3beb7ee3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_64_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_64_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818f314db67768800acf4668e0132775b0a370e9cc8fbdf4f33ed2cba9111a7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_65_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_65_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67604}}}],"partialFingerprints":{"codehealthFindingId/v1":"73961eb0a27371959a90109768f4037e8c882d6bb5ababace5f9a477a6f306bb"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_66_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_66_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67896}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e74114e22603effe82aa07e11b96501b57552a2c2b0464b200fa12e7dbd68a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_67_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_67_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68188}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ee7693ec0f93ab941521df4c63023b4c335185dbf952a8e53211c8bcbf600a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_68_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_68_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68480}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d9d7c95adf63d61ddac856a43b73e7ce1a90d7ed3873e51ddc766513d84976"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_69_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_69_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68772}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22f359e5a9851119e01351aa955c1e556765c5355c3ad8b8fb08365b25f121"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_70_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_70_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69064}}}],"partialFingerprints":{"codehealthFindingId/v1":"048e54c43178d0a849e6ffaed7fa586a95af87206e090c25d8f2e3e705006f1a"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_71_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_71_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8bf4a516fc2b0df388b81938b85d8dc87886f6ab6f81e5a5c6a9c81ffe0fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_72_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_72_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69648}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db34dcf788fa3a2b40574561c2cb3db6118d72c02c501050d5c884e45108f10"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_73_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_73_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69940}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfa9e3b9ea66da80052c6f82e7fc50d39642c7ec62563f9c56ecffc754a7ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_74_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_74_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70232}}}],"partialFingerprints":{"codehealthFindingId/v1":"613e71487ce06454544d4ff40dc8372e05f44c3e671f3205f87c760cb0aac9a8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_75_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_75_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea99c4a8d3160783e64c79f69574626ffb60ef2725bf913c7600d3aee21848ff"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_76_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_76_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70816}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81c02319b61c97710d133b69b3f9f4708b10b0ebde246809a9771e38b81666"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_77_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_77_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef8dc87ac11d48982b0f57687839af818a8b05c0afa38f76be56bc9c6c9a0a7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_78_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_78_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7fc890fc0986e834d48516c788cee34a5bf2ad6364e0c058b183d9f10bf0d"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_79_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_79_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71692}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cae53e9dd2d4e28221987e51fd94f2d2cf591495d8cb1bcd4bb030ee7177c25"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_80_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_80_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71984}}}],"partialFingerprints":{"codehealthFindingId/v1":"206a43ec9fa83b51a26578a047051272ce508ad8e996aacb324376b5185e2a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_81_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_81_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72276}}}],"partialFingerprints":{"codehealthFindingId/v1":"df276d64f0e35255e25e79e223b50ac2960a41d547bba648e00754942959f0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_82_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_82_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab1d0fa961425ecc6bf528e6e0346867d0952e5cbe83d39ef964373333a4c0"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_83_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_83_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72860}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecc6bc224238c0a4192e776a346be41d3b032fb40753f78ebfd6247f861e115"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_84_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_84_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f19a82e6a3a1c27f594d333a7d7ff7bf7b24fbf0499a21504c5d0ca493feeb4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_85_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_85_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff551a5299a183efa9393521b902ec67e9e79a1578919f4f02f71e4f177d2fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_86_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_86_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73736}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a40b4eceec56fd7a0136e4c6d59f60151b731a35ee6f25313620da4562bd6df"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_87_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_87_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aff9c129d74b545303a803537bed6f6f2566282882384dea8ef72d1fddc36e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_88_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_88_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b555c8ba7d4fe782b6a55de6ce36e40693e48ce0d57fb84dafd6693d5de17c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_89_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_89_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74612}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41eaa76125e8bdf062e449b308ad8a7ae0071ec84f71ea5289a01f297ba967"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_90_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_90_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74904}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba14594c531bf74f7177fdddb89e2a8bd0cb1025a4416a77f80875d7954d509"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_91_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_91_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75196}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a2576764c6923c09ea80e8713f24dad62ecc311ae8a1b1f1f27a2fc41bcac"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_92_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_92_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75488}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aa75b574aaafb6fcda42b875548d526f06c218a3920bbc5040039efb5ce6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_93_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_93_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75780}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7aef4977e921069272adb69c8e3a377166b7960f1d755aaf9c64aa311a4fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_94_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_94_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76072}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d74356054b6b195f04b68fefd936a17bf59d2f9ec41bb1589bcc53272c1156"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_95_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_95_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ee4b58cae9b4a0fb171fefb26b49f194478ede5b574b6e01907ea77cf83d52"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_96_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_96_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52f8cc151e5cb870573f683772ebdc5093f915d7d2e0e35b3844e9a42af357c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_97_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_97_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d61b70cf5d49d301fdec361ef8cd8ebbadab645dafbe375a876f1e839c4f579"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_98_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_98_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfddb6b25075a9858ec78795ebffbbe94aa0f49961ce04f726cf42c08c602dff"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_99_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_99_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77532}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed3fdc2ebe5ddef95a9b5b2878f5145d3e43e01cc90cf001984d4b37668e28"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_100_ValueChanged (cyclomatic 99): TLSE_Jrelationships.valu_friend_rela_100_ValueChanged has cyclomatic complexity 99 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77824}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155df8d61071851c48d82b224a97ded51df1abcd73a6d99ecf9ac3fe709efcf"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_itemsedit.Writesshatsitems (cyclomatic 74): TLSE_itemsedit.Writesshatsitems has cyclomatic complexity 74 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f554e24928b615d553dc4435e78d400ca9d569346667eb03b9b17029492026"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Writesshatsitems (cyclomatic 74): TL_SaveEditor.Writesshatsitems has cyclomatic complexity 74 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7325796bd988df2ef7e4a277a48a4c50d6adc673a3495c0352adc91251bbae4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Advanceitemsedit.Checkitems (cyclomatic 55): Advanceitemsedit.Checkitems has cyclomatic complexity 55 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3eda8ae9b9b40213b7abae579cf421cb80abe114b5ff693bf763b5296bbb61"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_manag_travelers.RestoreMii (cyclomatic 52): TLSE_manag_travelers.RestoreMii has cyclomatic complexity 52 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccc0a3302f4b9a1c6845134d4e2e545815bf145e147b20b92ac361ed7b13569"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_travelers_status.Readtravelers (cyclomatic 52): TLSE_travelers_status.Readtravelers has cyclomatic complexity 52 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e33f837d244b12847d588c7e4196ff3ac15dc2af6cd100337e2527facda440"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_concertedit.Select_songs_SelectedIndexChanged (cyclomatic 51): TLSE_concertedit.Select_songs_SelectedIndexChanged has cyclomatic complexity 51 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"93047005088b76b81373db69fd826bf439b21b46acd91b9549129276bb41ee90"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_songs_SelectedIndexChanged (cyclomatic 51): TL_SaveEditor.Select_songs_SelectedIndexChanged has cyclomatic complexity 51 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_miihouse_SelectedIndexChanged, TL_SaveEditor.valu_miihouse_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe560fad5138baa9870acfdfbfccfa38ab9971bbbad6f0349dbdae6eb59d99f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Select_miihouse_SelectedIndexChanged (cyclomatic 51): TL_SaveEditor.Select_miihouse_SelectedIndexChanged has cyclomatic complexity 51 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_songs_SelectedIndexChanged, TL_SaveEditor.valu_miihouse_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47257}}}],"partialFingerprints":{"codehealthFindingId/v1":"415694bd0b0ea6e8d5b963435971b1cc0e4c8f070c7d9b8991be9d0a3d7acb21"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_miihouse_ValueChanged (cyclomatic 51): TL_SaveEditor.valu_miihouse_ValueChanged has cyclomatic complexity 51 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_songs_SelectedIndexChanged, TL_SaveEditor.Select_miihouse_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd2e26aec6cd0b86413314407e549f58e083551268e57c0bfd98dd351b4324d"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Text_save_editsongs_Click (cyclomatic 36): TL_SaveEditor.Text_save_editsongs_Click has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":9106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f51b48149461cc4e68fe265683fb2b32510b5018cb1dea5d01450334e41292"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_concertedit.Text_save_editsongs_Click (cyclomatic 33): TLSE_concertedit.Text_save_editsongs_Click has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc2f15ae9d3b2b4aa2f033967cdcec17af275f8d372f39803fe233e48755ca8"}},{"ruleId":"D1","level":"warning","message":{"text":"Miimusic_edit.Text_save_Click (cyclomatic 33): Miimusic_edit.Text_save_Click has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6600b230ff386f619d9fabf78146e85257533fab0597b78fcff087ed9c814b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist4 (cyclomatic 32): TLSE_Jrelationships.Writefriendlist4 has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":165387}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ddb65564638b040b166ca6ee361e0a4a06a1a5923bb15e302b18a8163b9662"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist4 (cyclomatic 32): TLSE_relationships.Writefriendlist4 has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":277010}}}],"partialFingerprints":{"codehealthFindingId/v1":"75385407e86d7723cc7eb35208a416b1f4950856ed53de70f8a87908c9406aaa"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_itemsedit.Text_menu_save_Click (cyclomatic 31): TLSE_itemsedit.Text_menu_save_Click has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"090943258fe5b5fa08ba0174441d8666809fa414329e729320cce7185df9ad6b"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_1_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_1_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ea3e80756a1aca208ba972832a95f3f002c30d0a96f9c4f50379e06569f2e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_2_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_2_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4ed16482801eec39b97599e92bc846637301c081a10a3644e5c84926daa7a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_3_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_3_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d7598f45a5f1dbb4ac34f642e98caa70af756be4cc3a481e26e61af31a5e77"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_4_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_4_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a322fa6e69457e67124388851f387ef19bcf807fac52092c0d8b8005be29c7"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_5_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_5_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba826ba7d12cedcae4c631469f783302dcbd8703ccba44dc6654e3e1639a1ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_6_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_6_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f6df2149ee2fa23ba8ff9c1c0590d95cd19e5b67d403995b981bee27bf730e"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_7_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_7_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aab043fdbd19c479c5073ad0305c1b6ae7484b087da73344ae9831af771b18"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_8_ValueChanged (cyclomatic 30): TLSE_miiinventory.valu_itemmii_8_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"41029e7d5c903e3ec32587838fec8aac162294258648c9e98b118156969f785e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_1_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_1_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d043e732c8fd5ac240e23552bd4f5d1574b3367479a831fe49d174cbf68cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_2_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_2_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16906}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f17fff76e1aee685b1c80ad1807825bfbaa4c70bd274eae21fd253e4828be9"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_3_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_3_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16968}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd870a1a2e7e78594e9ec5aba7b3932e411e0e0a8caa6dec546d7c3adad753"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_4_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_4_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17030}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d639d7334d606911dab4c390d97d0d7b3ab1d2022b7c066eb5abf0115049a5b"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_5_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_5_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9bf2d6c01afeef8e78ac823903a58c71db74b0964668b135ea39cec47a3f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_6_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_6_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17154}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e948715d14389684bb2c17c7d4941a0ad4afce51d953dafb7908cc18d4798e"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_7_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_7_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17216}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ebdf46b04f9c15a8f537a9e4e0aef1b896f8520b4189f4e388ec3dd399c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_8_ValueChanged (cyclomatic 30): TL_SaveEditor.valu_itemmii_8_ValueChanged has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b342a264ea7314858aec93e7c1cf92eca503549642a2bbee28509f28dda96d23"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist2 (cyclomatic 29): TLSE_Jrelationships.Writefriendlist2 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_Jrelationships.Writefriendlist3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":135257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b362f083c21a26b2f3c0c1186dc889ed7ca38f66fe2475f1d31047da51ad4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist3 (cyclomatic 29): TLSE_Jrelationships.Writefriendlist3 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_Jrelationships.Writefriendlist2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":150322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c8a7ac147edf7c1947a2f6552a3fcefa5221b956475cefecc5f4f1a5e1cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist2 (cyclomatic 29): TLSE_relationships.Writefriendlist2 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_relationships.Writefriendlist3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":246880}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8519610a423b8c656de3f9633365942e757ff98f35d71b60506489f8189c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist3 (cyclomatic 29): TLSE_relationships.Writefriendlist3 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (TLSE_relationships.Writefriendlist2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":261945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4189e526cb6b8481e57ceccab8edd3da68c2b0cbdb93658028f431a490c7ee07"}},{"ruleId":"D1","level":"warning","message":{"text":"TL_SaveEditor.Writemii (cyclomatic 29): TL_SaveEditor.Writemii has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: TL_SaveEditor.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce1599f8f3cfaf33874e772f626b99690b04d31d1e5ac627ad1be1e8d2e4c97"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist (cyclomatic 28): TLSE_Jrelationships.Writefriendlist has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":120794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559d006233da36c137e3d947c1911bd5ba98d8205daf06044d0a5d56fa3df77"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist (cyclomatic 28): TLSE_relationships.Writefriendlist has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":232417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a053cdf6591132a8ae2886cbd7bd21052b0fa5c2c9c198caf96676e8b29a1ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_extras.Check_timetravel_CheckedChanged (cyclomatic 23): TLSE_extras.Check_timetravel_CheckedChanged has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e37a7bf054967cbd13cb78810e373e6fcc230714e7619273d3d6cc4d54fd50"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_miistatus.Writemiistatus (cyclomatic 17): TLSE_miistatus.Writemiistatus has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: TLSE_miistatus.valu_haircolor_ValueChanged (cyclomatic 65) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d72953539dcccad7f758b08bbd78635912eb06eb9263e771f382638506c5275"}},{"ruleId":"D1","level":"warning","message":{"text":"TLSE_extras.Check_resetnewsflash_CheckedChanged (cyclomatic 16): TLSE_extras.Check_resetnewsflash_CheckedChanged has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0669e7b842e561974277b05a623eb37cdb136f9c854d9b82fbdff9793576b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu (cognitive 7175): TL_SaveEditor.Namerelavalu has cognitive complexity 7175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu3, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":53327}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fb76b2f409cf56ab1a6fa91fbe0dc93fcad1c295712d22f20f9fcc50fc2bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu2 (cognitive 7175): TL_SaveEditor.Namerelavalu2 has cognitive complexity 7175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu3, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":64405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96087ac1f5052e2efd0b4674a27e3f4fafaa0f89aab95691dd5346d063de86f"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu3 (cognitive 7175): TL_SaveEditor.Namerelavalu3 has cognitive complexity 7175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":75482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e81f7917b7de2cd034f19787fa99f34da71a077e5f39c761931ae79c652927"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Namerelavalu4 (cognitive 7175): TL_SaveEditor.Namerelavalu4 has cognitive complexity 7175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Namerelavalu, TL_SaveEditor.Namerelavalu2, TL_SaveEditor.Namerelavalu3) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":86559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a3f38c5ebc2bac577cdb32aea7038cebd0c4d162899fd71716bd0596b999b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS (cognitive 1925): TL_SaveEditor.NamerelavaluUS has cognitive complexity 1925 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS3, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":97636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b76ad8e28b62f6d9d0dbb7bec0570ad478b53bdd84b2dfe9f2779a6efe07fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS2 (cognitive 1925): TL_SaveEditor.NamerelavaluUS2 has cognitive complexity 1925 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS3, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":101689}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dc5191eceb82c4b1f23c7f41fa8a196f472122804bec7e5ded4328a97ac496"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS3 (cognitive 1925): TL_SaveEditor.NamerelavaluUS3 has cognitive complexity 1925 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS4) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":105742}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae1800d16563e6ddfc74c1b363955b1ae352324c995c861aac2d7ce9d8a312"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluUS4 (cognitive 1925): TL_SaveEditor.NamerelavaluUS4 has cognitive complexity 1925 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.NamerelavaluUS, TL_SaveEditor.NamerelavaluUS2, TL_SaveEditor.NamerelavaluUS3) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":109795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9560ea7614faadb33122fddadb5abbf8095b906a648c38f35ac59298b19375"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.settummyfullempt (cognitive 1604): TLSE_extras.settummyfullempt has cognitive complexity 1604 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc4e95009be7f63815ce12e7cc849360a47738e64a9837dc61e0641d4b87fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.settummyfullempt (cognitive 1604): TL_SaveEditor.settummyfullempt has cognitive complexity 1604 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":7123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f2ae3b1f2cff6ea8c376106f37cd591aac86f27c40ca86996980939cc90e47"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_1_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_1_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":48919}}}],"partialFingerprints":{"codehealthFindingId/v1":"293f202e66cc7aaa8a4e5a2fa59897329e89f02b6adf8c252ddd2859377e1eee"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_2_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_2_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":50327}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b14556e04f7454025258fe936355bef02009b579c8505c88ac4696e64b60d0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_3_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_3_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":51735}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97f1a6529f7d2b3319706f316cb1626a8d5827f2da513c671d71e8ab0166acc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_4_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_4_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":53143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e82ef0ab8c00e6483a984c1f5a35975cf49827a0ffdd1e699da68cabeff0d90"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_5_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_5_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":54551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7525fef8443daa293e2dcb37bbde0713d4eb7b003a8967e549f67e15edb978cb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_6_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_6_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":55959}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6cc639dc1e6ade456198466ce2f7f287feaa01e6bb2ee5ecfbfb5e5ed8c7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_7_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_7_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":57367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e30fbc2938a2725f34afe66f2b754ac14effe88e8978363cb8d6339dba6cd7f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_8_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_8_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":58775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c895f3a42b70ea772c71d488d9efdc4ad45534039e4cc5bad351887ae8e91519"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_9_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_9_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":60183}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d0d9a6090764c011f6df4fc3424bb0eb583fa68b1a6438b87e82d0b3a5fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_10_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_10_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":61591}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe3af3dd0dd8a2f442600889d9c940fb2e1bb917df776ceb015178a9e919c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_11_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_11_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":62999}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b36799ac4ed3d7f6a07cbd01c2dbaac1720f419152bc4fe9f0e0b57ef6bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_12_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_12_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":64407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceae661682f0f8b8b3956c9e8aa1f62b7a75d117d2d450947699e7dc45a505c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_13_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_13_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":65815}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c04907040aa0c7776b74a92adcb7d92dd67ce82d0ffa90b5c03fb95599e80d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_14_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_14_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":67223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b683ce5632526bd5a743383d22e89959c45f09f0534bff4184e64a9771f064"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_15_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_15_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":68631}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca6d056de259555ea92d9360f495d58ef74d2a5ec222a8dcdba8b9e08ce2881"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_16_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_16_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":70039}}}],"partialFingerprints":{"codehealthFindingId/v1":"50923dc5f3056602498d79e975c2583a46e2d3a60dcf638ff80c666f2abdaf3d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_17_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_17_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":71447}}}],"partialFingerprints":{"codehealthFindingId/v1":"da137ada527d5713303defe2d56f36f1249fc1f57a1465380525cfaf9395171a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_18_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_18_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":72855}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b51c755c4a5bf7c14b722fdcfecd5e1f3647e1a83d321a5b9dedf07934438fd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_19_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_19_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":74263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aec925c06af7dd7a56dd6d5f6a1f8dfe9c3ae5e94664ca290db68a3a6661070"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_20_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_20_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":75671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f1943275f8613257a397bbe5a19db8969244ebc76061c1f58362afbb327c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_21_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_21_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":77079}}}],"partialFingerprints":{"codehealthFindingId/v1":"c685cb37fe23622253e42621210fcad5de6760748eb709af682850e32c4f337e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_22_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_22_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":78487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b58b271f8e26d8137cec45ad4fc173dc8665558f12af7e44df3048c13a43f8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_23_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_23_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":79895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0204b83dc9c36238b693a775ad541a21d6c9cac6c4b8a73a9272647a29828d26"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_24_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_24_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":81303}}}],"partialFingerprints":{"codehealthFindingId/v1":"824e3baaa47d7afeba9f4cf840ac7f635baf49af7205c426f81746c7b6aebf2a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_25_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_25_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":82711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2378212aa963d67f940f0a5c23da5983040f4af2279e8ed82e82d532679c54e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_26_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_26_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":84119}}}],"partialFingerprints":{"codehealthFindingId/v1":"de233a453f916060e0e9a250964d1e53b4dd7e706effa3d915a023582a509b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_27_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_27_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":85527}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c33f77a08c7b57612842987db8f0778eb478ec45d93ff0370d27f3969e385"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_28_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_28_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":86935}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f11ee0979670925edec4660f17a0b8f04bb985bc1526b74db6f95e7c977591"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_29_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_29_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":88343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0681ed42e3cc8974860369d22f278392db5c9f503fabaa5487f44c09d324c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_30_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_30_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":89751}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c70b8b76d51361061b193e297c8b7133f8a8121541ad0a1c73d44efa54c8ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_31_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_31_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":91159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7528287db440e420f4a14d75695438f5c83d88ef71628e65ab77d2fd4be80e92"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_32_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_32_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":92567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e24b6817a99227694d0156f38b15c1c18e5966d6a6e9b265ad2d6546d541ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_33_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_33_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":93975}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f1b27e177ad0e1dbd0945f77d85bda4948aa3e11cf39ba1c2cd9c2d821526d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_34_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_34_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":95383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fc350b82331ef79eadd1a8d2a8dc4a92d80d62f49295e2a41323e914f5d5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_35_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_35_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":96791}}}],"partialFingerprints":{"codehealthFindingId/v1":"98edd40cac0fc16e49ee090a52cfdcde1ec6945d7c66010acfd724536ad42cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_36_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_36_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":98199}}}],"partialFingerprints":{"codehealthFindingId/v1":"981e50ee4c118e9da35350f1861dc61eb67f337c8b71d4ce15bf617fd7ff703c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_37_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_37_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":99607}}}],"partialFingerprints":{"codehealthFindingId/v1":"21955c1e6ea21ac1ea99a0870c5e13b8a1241338247be65d763343211f7e6884"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_38_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_38_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":101015}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fb5a35af243f8926bb3e6d9a97e479a126fd66bba9b1e7255e0b47bf03f2ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_39_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_39_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":102423}}}],"partialFingerprints":{"codehealthFindingId/v1":"321745598bc45043972b0956031887fbc60446e2574604d95c410e1809bb0140"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_40_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_40_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":103831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700cb82c805667c571ea80c55d8683cafeb3cd78ddee8f74625187e8f7b4c92"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_41_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_41_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":105239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d49ecf4ad8373bccfbc9db01cb8ba1d46d219cc2ca316c0b6fa98d42eb6cdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_42_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_42_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":106647}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ed77252668445eedcc8f2daf209c95433c38c8d64703a6a76a295d7d022c73"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_43_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_43_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":108055}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d4d92ace0bf3fa7fd44ab961c7f18a1b887473f160d2336c53adb0ef83c934"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_44_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_44_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":109463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b86817f266fd28d481bded7fdb34ca3d1feb1fc813102d995370f95d80cd259"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_45_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_45_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":110871}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f2160f0dc3e08ac49ccf896742299cdda84399075a2afe0bbe6d2aece5938"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_46_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_46_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":112279}}}],"partialFingerprints":{"codehealthFindingId/v1":"791cffa15ae1ed47f4e169bb554f20ad92d126d9ffd670c2a61b92e3a5b136ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_47_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_47_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":113687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d063bdeda5aa1e3b182b5bdfab9833b90d451992ff0bb88ac776b6e7a6fadd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_48_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_48_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":115095}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e896d359d66cf3a87d2e96999f609afa923745bdab72e4f47c7531c94545f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_49_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_49_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":116503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a85993713658eca6424c026058382178b6159d9a245e03318064672aa8e671e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_50_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_50_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":117911}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb07b59c861d602d9d357ca9f45dc179a9e3eadeb0e510e665a0bfa6bdc698ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_51_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_51_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":119319}}}],"partialFingerprints":{"codehealthFindingId/v1":"83adeccf8de3902c0536dab11573aa9e91dec57496e9c8b6ec3c9aa7027e2798"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_52_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_52_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":120727}}}],"partialFingerprints":{"codehealthFindingId/v1":"86621c64073a966082ae27f46f0999d684994412302ee1e659523f1c31716f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_53_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_53_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":122135}}}],"partialFingerprints":{"codehealthFindingId/v1":"657c001ffb6fbd3c3ba5c6b1ce51c6ae7b96cab711b1e8eed4b22a98af277f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_54_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_54_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":123543}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e437864791aed7c87bee03fb93b2675ba5014e16f957b4e9a69761c57f86c87"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_55_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_55_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":124951}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f265e07325f9c98b80ad34cfffef18f9819bafed04b51004b6bc52f335beaf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_56_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_56_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":126359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9af8a28cf40e164c1dcfe8b0d3df2e353832f7fb7b764c4cfd946f7f3dcb05"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_57_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_57_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":127767}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e8377a63cca9baaf297234afa3fa263f29f6c5b5e59811dbca87937369dfad"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_58_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_58_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":129175}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c235e7b1143794cd1b4b6f514135833f1bfb812bd51b97c5ba5b55915b3038"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_59_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_59_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":130583}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b5363f442467af5afd1a2a03432d0e50a79a8ec86979d6d7ccc4deb1455d86"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_60_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_60_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":131991}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d89fa2fb77dadae64b7dff38f154b442a846a26d0d121ae29b2d727ababf7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_61_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_61_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":133399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523ca64d80f709f9373536493e8975fdcf815b40529d888d07da62ebf1f569d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_62_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_62_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":134807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1c80f132d6e167a45ed62da2abf18f5862c2bdd68b13f65b2daa78be2e25a5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_63_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_63_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":136215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61d6ef077763c703fb19093a4bbb10e51c2ba9f09bb69b7df27ec30859d17e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_64_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_64_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":137623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba367fccd2683c63d550aa5f4171916c449a3790c9baf5435d5ada6e60f42922"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_65_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_65_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":139031}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4563af093334ac821527935d1ed46bc8ab37046d2911d05e7ef8eb5bf9108c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_66_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_66_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":140439}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c13a8f1a59ea04c17d5418b79a919bfb8986c83c1fb06b41e62f800de5a66d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_67_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_67_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":141847}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3fa7b28678acd4d89c22f70283dd8f3de6adb3a8da245c26f0964fb21d52f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_68_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_68_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":143255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45b45868e5b4bbca3008a79e1ccdb94e9daf012813c8dfdfb72deef0053024"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_69_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_69_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":144663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e67c3a75b96d8a1eae7bed094ecf09113eed4d7ed64af10927e9ca017b8cdda"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_70_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_70_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":146071}}}],"partialFingerprints":{"codehealthFindingId/v1":"472af3be7083c89c5feeae38345b58e8a264a936acb2f2d3d53b250b9bef8db3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_71_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_71_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":147479}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2b65fc2ac7831f091eee3d1c5e48ea51e024ef95bce3b9f6806a3f7e96902a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_72_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_72_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":148887}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b89082328cdba3d0c9f827e9e86f1159a62ee87808937a99f2a1cacdd9dc7d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_73_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_73_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":150295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb832b48adc249d596dee59e216d60dc6663320bbefe1bd873cbe9066c861176"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_74_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_74_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":151703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a494c936264e2e7c2c1331b4922f63aff7074ca683278cc9f310a32f33caa2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_75_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_75_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":153111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7a00c36697f92c5b07045ce0e4541508ac969f02a0289a07423a30ea92eca4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_76_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_76_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":154519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddd271de41f6d23f357c4931b2e9ece69af2e57b631d86dc96ff6e5d487a3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_77_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_77_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":155927}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f03a2159e2dd9187a2d556c212b4e3c18043e080120b6528a17f1a6921d37a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_78_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_78_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":157335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffc1ef6ef6f1c15096e3be11f52673be7c4cf2936f6ad4ae346aedf9d4e995a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_79_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_79_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":158743}}}],"partialFingerprints":{"codehealthFindingId/v1":"61739405f3c98e1ea27a165b93590f080a2ddce62a5347f66f29280d3f6a7dee"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_80_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_80_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":160151}}}],"partialFingerprints":{"codehealthFindingId/v1":"081620aad1b5eaec57c968f2e104a06e1a0020980c913aca282371e6e132f1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_81_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_81_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":161559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8cb86166f4e2de486c370b67cd6060e7cff4c80ad465b8f28c9fa87c1051b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_82_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_82_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":162967}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75036426a13c75560941c506fa241afcb59324db4335b7c66544a4f49bbff8c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_83_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_83_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":164375}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6895bf241fc54930e17619aed8b2dc38c40b2bf66062fe06d017d2eaebe0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_84_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_84_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":165783}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69fb3a1ce69c08cf86f1430e91dbc4ca2c026a86b2626d052c01ebce95af4e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_85_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_85_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":167191}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0f66f923bbfb4afb70d6197fba348e40ab376439af2f001a5eeb4be55b3b02"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_86_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_86_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":168599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ca64cd5d75f688db1876734451c9ebcda05abc8a7f45639afcf22a717b5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_87_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_87_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":170007}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3df64d1906cbac6bc72124aa2f294085f6d3ff48816db8f39c94504202dbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_88_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_88_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":171415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c59607244ed6fad24c4ebca23f71c790f7fc286a5d49979867bca20a1cac2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_89_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_89_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":172823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1876ccb48affa9f2cb6e9bf7d2c2010a223fb384a6eb6082ffde56fb20a160c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_90_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_90_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":174231}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb0b823dfb18f3f67804ff2fe8c570ac5ea4d89c23d0cd2ffbbf5ecbeaddea"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_91_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_91_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":175639}}}],"partialFingerprints":{"codehealthFindingId/v1":"20367c1d482a2bc461306cdd9326f36a09d96aeb9cb5f5b9ae6b6131419a4598"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_92_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_92_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":177047}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa296f5178adc8ac3c56d0b6f2ee6a96920b1fe13c6adead5ea45e93ed9232"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_93_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_93_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":178455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7cca1de501397214d09437811ca663f9f42d0e10049955b6a42ccc78091ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_94_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_94_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":179863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c254dd07cea571d18422e1885948424db16f3aaa8dec57a272a9023d71172d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_95_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_95_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":181271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ab6426b68b42b3f180276afc32c88ab64cc2b803b6f5e2a15610de424b2035"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_96_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_96_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":182679}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42a05e6d0690ca965280b63cf290dc0735a09a42795c4c52e90df2b19d48444"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_97_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_97_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":184087}}}],"partialFingerprints":{"codehealthFindingId/v1":"f847894e65e030daaa14bae4749176e06dbb01ed0de60603883d606ec56b605c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_98_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_98_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":185495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cafe705d21c6e53fefe9c135e0733211ecfe91f0c73f6823e9ac6124ac26bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_99_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_99_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":186903}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd67b621af67e615854e68c5cc16b5c3a54e4465afd80c12d0ad3f54795cdaa8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_friend_rela_100_ValueChanged (cognitive 1475): TLSE_relationships.valu_friend_rela_100_ValueChanged has cognitive complexity 1475 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_friend_rela_1_ValueChanged, TLSE_relationships.valu_friend_rela_2_ValueChanged, TLSE_relationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":188311}}}],"partialFingerprints":{"codehealthFindingId/v1":"532777cc66a0061ff1f506dbed384b523c44c0017521f4f6aaf0307c560506bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Button_setallrelation_Click (cognitive 1407): TLSE_Jrelationships.Button_setallrelation_Click has cognitive complexity 1407 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46585}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf40b73a0649690e791b5b1b7b16a5f7c73b8cdb58f3f48eaeb0495e26b1ada"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Button_setallrelation_Click (cognitive 1407): TLSE_relationships.Button_setallrelation_Click has cognitive complexity 1407 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46588}}}],"partialFingerprints":{"codehealthFindingId/v1":"df346212dbbe503d49a962648410a3a643259f8ec0e23d820c2af0d243f8438d"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Button_setallrelation_Click (cognitive 1407): TL_SaveEditor.Button_setallrelation_Click has cognitive complexity 1407 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a123bc95d654a77e41eb3ac4ec779f7f909e7cfecc674f50408d5be25e247af"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writehatsitems (cognitive 987): TLSE_itemsedit.Writehatsitems has cognitive complexity 987 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"530716bf160e1e71826ac36b199596673b5d726e797f30be051388e03c2626d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writehatsitems (cognitive 987): TL_SaveEditor.Writehatsitems has cognitive complexity 987 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7732d8fc095b1a31c59bb13818d825caf111f825b1e650b1a4216bd5a67f745d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.Check_resetmiiapart_CheckedChanged (cognitive 816): TLSE_extras.Check_resetmiiapart_CheckedChanged has cognitive complexity 816 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc130a8f16e242ff234e81caac26db98b18bf07e7ad9eee79707a3381929129a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.Check_resetrelationship_CheckedChanged (cognitive 616): TLSE_extras.Check_resetrelationship_CheckedChanged has cognitive complexity 616 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"82547c3ecdd4eefa8027eed3a85ce5a2d81c4ea3e0bcd0927c81c93d6f96b60c"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.resetmiiapart (cognitive 604): TL_SaveEditor.resetmiiapart has cognitive complexity 604 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad7ac3b68d2df5786617e290f6b6bd2075c17d914bcc76b0e156606b2fef77d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writessclothesitems (cognitive 594): TLSE_itemsedit.Writessclothesitems has cognitive complexity 594 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a5311bd2c52b010296532a22d512bc857ac87c8d3fbadbb229bbe967e36a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writessclothesitems (cognitive 594): TL_SaveEditor.Writessclothesitems has cognitive complexity 594 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10036}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac038367ea87c23fc5074dc0b4d4a5d614969629a4161c1c09d6ade5bdcec25f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.valu_target1_ValueChanged (cognitive 565): TLSE_interactions.valu_target1_ValueChanged has cognitive complexity 565 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":9084}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5a0f18be1295311ee6e63508e00335c8b379b68c0ebd91816651b1b644a957"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_target1_ValueChanged (cognitive 565): TL_SaveEditor.valu_target1_ValueChanged has cognitive complexity 565 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27489}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145a6b606b408bdb773f6430cf6e1ddc8d75192b01864329285ee63444e4d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_1_ValueChanged (cognitive 470): TLSE_miifoods.valu_fav_1_ValueChanged has cognitive complexity 470 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_2_ValueChanged, TLSE_miifoods.valu_fav_3_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58388d43a8d7f89162a1fae09efe6e32c67c7e6236c263028814e4a156f7a51"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_2_ValueChanged (cognitive 470): TLSE_miifoods.valu_fav_2_ValueChanged has cognitive complexity 470 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_1_ValueChanged, TLSE_miifoods.valu_fav_3_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":7086}}}],"partialFingerprints":{"codehealthFindingId/v1":"334962ec2682a53286eac64231d86e4aa12f30695088d60fa5d4884a8cf8950a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_fav_3_ValueChanged (cognitive 470): TLSE_miifoods.valu_fav_3_ValueChanged has cognitive complexity 470 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_miifoods.valu_fav_1_ValueChanged, TLSE_miifoods.valu_fav_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8027}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dbe72671544a075f29c2f1ab08a47484d49ee9109b7f14146dbfa5d0459cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_allfav_1_ValueChanged (cognitive 468): TLSE_miifoods.valu_allfav_1_ValueChanged has cognitive complexity 468 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d383987cae325f04c9d3e8efcacd28630c7ead057290007b0c6a7f8a01dbfb5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_allfav_2_ValueChanged (cognitive 468): TLSE_miifoods.valu_allfav_2_ValueChanged has cognitive complexity 468 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc4c621b41c07455e53b971778de5f8f0d81ae01ab11227d330958652e78bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_worst_1_ValueChanged (cognitive 468): TLSE_miifoods.valu_worst_1_ValueChanged has cognitive complexity 468 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8968}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd1e5426f9265809eeacc1e67f33ba08ed0793a593db1f22192e2482b6b3aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.valu_worst_2_ValueChanged (cognitive 468): TLSE_miifoods.valu_worst_2_ValueChanged has cognitive complexity 468 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miifoods.valu_allfav_1_ValueChanged, TLSE_miifoods.valu_allfav_2_ValueChanged, TLSE_miifoods.valu_worst_1_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":9905}}}],"partialFingerprints":{"codehealthFindingId/v1":"e379f3d841aae74f7f92ccee2a334f4ba101e0767c1e4d867f8770703123523a"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_allfav_1_ValueChanged (cognitive 464): TL_SaveEditor.valu_allfav_1_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d78f0bf5b0975b4bcab7b896b21cff6bcc03f1ff31e9fb104afed138a5fdcd"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_allfav_2_ValueChanged (cognitive 464): TL_SaveEditor.valu_allfav_2_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":41407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e5d3e0630aa62c0eabeb78cea42c28b5701c79af1fa15effec574fa1b7ad9a"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_1_ValueChanged (cognitive 464): TL_SaveEditor.valu_fav_1_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_2_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":42341}}}],"partialFingerprints":{"codehealthFindingId/v1":"830b41014004eea687e54a3007ef7f5ffc0d21fa05ceac20768f9611bebef47f"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_2_ValueChanged (cognitive 464): TL_SaveEditor.valu_fav_2_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":43275}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2995da0d612f19d211ffea12aa0cb2ecbb0347f3d7b1b0f8433b1f69d69515"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_fav_3_ValueChanged (cognitive 464): TL_SaveEditor.valu_fav_3_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":44209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ea2529593d3a6e7bea2c7e7737a754e4201971368b7409b25513d73de40942"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_worst_1_ValueChanged (cognitive 464): TL_SaveEditor.valu_worst_1_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":45143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603db6b6efb3ca3c73adb46e126ee3d51c3ba28c051e02fc90fcef204a8543c"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_worst_2_ValueChanged (cognitive 464): TL_SaveEditor.valu_worst_2_ValueChanged has cognitive complexity 464 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 6 other methods here (TL_SaveEditor.valu_allfav_1_ValueChanged, TL_SaveEditor.valu_allfav_2_ValueChanged, TL_SaveEditor.valu_fav_1_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":46077}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1a6ffaca60fda7f2740fdcde001046b96fdba7f386b9cad4aa8a1af4acdceb"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.readfriendlist (cognitive 407): TL_SaveEditor.readfriendlist has cognitive complexity 407 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":49416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd239325001f0a1975566575fb023d360bca9b1d583c9026cf2f44f049114b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Resetallrela (cognitive 404): TL_SaveEditor.Resetallrela has cognitive complexity 404 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf338707b477e95c260a2fbdc78db3780fbb6971101112f913621510a3998ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.WritesavedataArc (cognitive 257): TL_SaveEditor.WritesavedataArc has cognitive complexity 257 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"82867f811c3918dcab0aa619eca97b232c46ac8a54c481c5c298aad52d9f6854"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_travelers_status.Writetravelers (cognitive 251): TLSE_travelers_status.Writetravelers has cognitive complexity 251 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac40cb92cdd4597b82e7669a570f36c8a363bad14ebcbd82780b5a360e1a95ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged (cognitive 232): TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37dcd98c69c2548a78dc49c0bf218e73f0707a731fc63aba33b2fcaed7a0be3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged (cognitive 232): TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10895}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8f7717f454b06bdf722393946bcadb22d91cb2759862b4835643fb4e7e7f7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_1_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a67fe584a3d415eaf15d65e514384f3dfffd91e3d987bfdf10943ee6b6ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_2_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfd0f7edea62e2868cbe80b4ba21c8ca5d23287e8dd53a44bda0678129652ff"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_3_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_3_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_1US_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9234640618f8fc0324f1d78dea4463a6e2c5a71cdf09cb0ae3342ad6a8f1e987"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_1US_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_1US_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14855}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4de51fffe064c46778f119c7f42b9a37573932a9ad46ee85fa777063415f2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_2US_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_2US_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e583e8573e4f67401693a189aa3a68511553622cdebe2add47d3129e1b0bd88"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_fav_3US_SelectedIndexChanged (cognitive 232): TLSE_miifoods.Select_fav_3US_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 5 other methods here (TLSE_miifoods.Select_fav_1_SelectedIndexChanged, TLSE_miifoods.Select_fav_2_SelectedIndexChanged, TLSE_miifoods.Select_fav_3_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e104b66c93ea3fe0e4e11010a914a3b3baf77945bdaeccf2e6b26d71454ee86c"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4286446ba979e3729683b86225ab46c9b725cee803c83975d57d7fb2284973"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b68460e0bc5022c9bce11b1ef90848cea7347dbb2d2ec62a0a60ffae9667d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30203}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bc47c6a8d37ee10ab25c694907844f34e67db70c2a4bf3e1068b8e571e18f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30671}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5d871536719c1a28b9ec78428d8609c0c182f08c94547ee1b357eacd19d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_US1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c1744c2f8003e890ab260bff51de7b1183055fabcf10ed60117110941c0f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_US2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31607}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3c27bb0b295e140ab6b6a3a3f4a9c8f80562d371c2ccb199b96eba0769aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_US3_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_US3_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32075}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e6e40bbf2ed07ebc6fec38d1364dd1d4fad7848c9120e7a7f6f08cf5951543"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_US1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_worst_US1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32543}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0fb48164395c6e5c0e0d67f497956b1b3927bd4ba16c494d4602323ba18ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_US2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_worst_US2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":33011}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7fba3678ca5a5c2eaecf6357424a94fb1fa48c5b60f9259a1fbcb32886676a"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_allfav_1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d757f3d3e354d88a49d92b378860454d02e3af5f081a57f74f0e96e777f5a78"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_allfav_2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_allfav_2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72a18a18e3d2315ec477f3c7a20af2b2d6222b9c956a4eaf0852430e0449705"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06a0b34f8e886ee02be39c9d9f9241e93180bae4dd7ac5da93df167dd8788eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38601}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089c7d049aad687a28c4ed97aa724237fe323cd12efa6fd59980e9fa14a8350"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_fav_3_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_fav_3_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4434b3ed2214ff937b09aeb99a0e4225c8b7db7281820b764cb1777538eee82"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_1_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_worst_1_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39537}}}],"partialFingerprints":{"codehealthFindingId/v1":"da90dae7e723048e9ed1334eb1685c37bb66a5b65039c624f146404964448569"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_worst_2_SelectedIndexChanged (cognitive 232): TL_SaveEditor.Select_worst_2_SelectedIndexChanged has cognitive complexity 232 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 15 other methods here (TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged, TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged, TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 16 times rather than 16 independent problems. Splitting this body alone leaves the other 15 exactly as they are. Where these are variations on one operation, the change that clears all 16 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a320215f249634be1b3a5570aa11a5da580d5859884282733a756f42d60b2f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_1_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_allfav_1_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0121cc3e1286fec37bd499478c55228e74f83b86e7a2bffae96a8e7ac0eb01f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_2_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_allfav_2_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b739cb49028f3dde0e44c2d7b4c357c51d2ca8db60b6ed69ee5b301e29c709f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_1_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_worst_1_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_2_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff25dc621fba18b1538cbbe45f1c55a8c0a0f52645be04fb5b48f078dce5936"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_2_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_worst_2_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6925f20f0c8c79b3a59e97d97c4a96e3d0127870e84f2005e690bc00ade1025"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_1US_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_allfav_1US_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":12991}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f08b1aee78751c653191b3a8dcd0d93862dfee16ace5e6700163d5f648ba4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_allfav_2US_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_allfav_2US_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13457}}}],"partialFingerprints":{"codehealthFindingId/v1":"732af9e32219f9838b23949b53553fc4e5dae52aed9b663527d3d3d4deb1554b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_1US_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_worst_1US_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13923}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a8e5e94921740d65fb06613afb17034fdaa7e09e77232d57a2024a76c4f4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Select_worst_2US_SelectedIndexChanged (cognitive 231): TLSE_miifoods.Select_worst_2US_SelectedIndexChanged has cognitive complexity 231 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miifoods.Select_allfav_1_SelectedIndexChanged, TLSE_miifoods.Select_allfav_2_SelectedIndexChanged, TLSE_miifoods.Select_worst_1_SelectedIndexChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef433b94d75344820af5407e736219c424c579385ed132f3bd88df08671f31c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writesshatsitems (cognitive 213): TLSE_itemsedit.Writesshatsitems has cognitive complexity 213 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fc253d8e7b7e345d7894cf9d85219451d6d56bfac749954943f184b7e49e38"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writesshatsitems (cognitive 213): TL_SaveEditor.Writesshatsitems has cognitive complexity 213 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7d12709a246a0ef2ce7c307367e0cc14d2ac032d2d7d7ff4641aaf4290b9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Readmii (cognitive 211): TL_SaveEditor.Readmii has cognitive complexity 211 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":48419}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d19f1ccd8e9bda79fc828ce7a77aa045b87d8c25cf268558cbbe79d5b9e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Patchfriendlist (cognitive 207): TL_SaveEditor.Patchfriendlist has cognitive complexity 207 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492f2061af88bfdb473af279b2d5b4894339b32118ba5afee075aa1a821a3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiprofile.Savefileregion (cognitive 205): TLSE_miiprofile.Savefileregion has cognitive complexity 205 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b3540d0d49a2e4000149e1a6d496e6ca1817976dd0ffab6907fa05096b142e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_crcxmodem.readmiidata (cognitive 204): TLSE_crcxmodem.readmiidata has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff693ae7eb08ab64c0bc77860dec575a2b67d51406bec3d59242cf73c05630da"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miifoods.Savefileregion (cognitive 204): TLSE_miifoods.Savefileregion has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":10909}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c150d2d8c8e79eda1a328fa100afe1197c838d129661e9c5c17c7598c3dd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.Savefileregion (cognitive 204): TLSE_miiinventory.Savefileregion has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52c2f1825f16add806f85d07483556b8333c93a3343ebe9744f30aa64c9ee63"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miistatus.Savefileregion (cognitive 204): TLSE_miistatus.Savefileregion has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c24d9ce19ceb176fd913bedaed4a32a4885990101a3e93b535c509cebb21aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_voicepersonnality.Savefileregion (cognitive 204): TLSE_voicepersonnality.Savefileregion has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f2bb3b182c0ebf702f2d2b4c4c31925068c09e85d810a0a633780f4b92fdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_miiapart_ValueChanged (cognitive 204): TL_SaveEditor.valu_miiapart_ValueChanged has cognitive complexity 204 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":26604}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb16a7f71f7f2821bcfa7966d0b5a042ecc93f1f8dfa6e4c576b539054990088"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_travelers.Readmiidata (cognitive 203): TLSE_manag_travelers.Readmiidata has cognitive complexity 203 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"134064300b758d12f377ff2184e091dd5cd7f4084206f77dfb977c41c4222448"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_datamiiexchange.Readislandranking (cognitive 201): TLSE_datamiiexchange.Readislandranking has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfadbfb53a04592ac057c1e79dbbbab36c040be6775a9ddad9a0eafb1b471e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_travelers.RestoreTraveler (cognitive 201): TLSE_manag_travelers.RestoreTraveler has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"65058a912e728f9b3b93151877dfa608b0ac686e040c1f7ce12361dd858896af"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.ReadsavedataArc (cognitive 194): TL_SaveEditor.ReadsavedataArc has cognitive complexity 194 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ece68672016387f932d0f0241c49ea495d44e8d817d29f3d6b91c6fa7771de"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Danger_interaction_Click (cognitive 192): TL_SaveEditor.Danger_interaction_Click has cognitive complexity 192 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29768}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ae6680837b0bac260b1a7e4bce4897206d746ec313c37633bd298661c83f20"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_1_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_1_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":48916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ad76a6d982aa907afdc6fb6cef76db5fb90bdb59601f8071439f3696de31aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_2_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_2_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bc5eaea6bdba8de5aa8d10a1a8a5f0f4e7f173b3c7b0c588b425eb75722116"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_3_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_3_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59fd68c27e33d91dc75bcef1b62cc747b2024ddf8af0f47d4ee525f3c0e8a72"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_4_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_4_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49792}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6fca8183195f9d868da31c6e343b183268947564bfad4e936f38417bc3c0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_5_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_5_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50084}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4292d119a57fb7ddf0518103baf6826c42a38a544e832f68af31f97478edef7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_6_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_6_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d407409a2ab8a105d67c2cd97f86a446edc50dc3b6b057e3542cc07a9452ca06"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_7_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_7_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50668}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a206acddb26938d48e56c225eef96b4cd5062ac35bc93624bd7ec56e0fe25"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_8_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_8_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50960}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e32bb7883accd0bb0b17bd5eeb0a7503b835661e984ff4787cc0560fb4bf448"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_9_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_9_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad6ddb1c0026d553a5188ca7b3bacb6f67ef3d87fb786ef0c82696808ad243"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_10_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_10_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51544}}}],"partialFingerprints":{"codehealthFindingId/v1":"16942c37f3bfbea2f045488a52fef4e7bb3bfdf97fc47a47ac96e96ad2be3432"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_11_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_11_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51836}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250c3eb5057479e6ad306122e74d330b16c18bd8c76407d978983bc849fea25"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_12_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_12_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fda7ca514537cf910b750027b4992fe6d71822a9c43751a66bb3dd07c6609df"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_13_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_13_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff9595ab2f1df83d0413e7d7c89a7249f3aef3767681dfe2f6ebe16b39f87c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_14_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_14_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52712}}}],"partialFingerprints":{"codehealthFindingId/v1":"114084a6101115f2e9f99a57d56e787b4a4f3dfb3297c1d897d4a53c3a34ddfd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_15_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_15_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53004}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f730f2f90c16e41f4a10d81f0e9f5b88dce60c606f23de39af09c13c8449dd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_16_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_16_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b78fac4f6fce6241d77ab7f4a2a3772e3f68f9ac75d22f64c42cd876b7fbbc3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_17_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_17_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53588}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5fcaaab4b67998c5eb953162afe7bc4f3e58deee163ec665a7790bd2f78e50"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_18_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_18_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cf98d60386a9a131570f44986b00b05c61262d59ce54757e06ea2826a263aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_19_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_19_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54172}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4782c7a087c90420a5fce2286804770002cda4225237d99d19dc6dd3ea37a7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_20_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_20_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54464}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d75df47145cbcd0bec5939a75b5af3dfbffd15a4026fc64ac710d4334b82f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_21_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_21_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8d3daa5529f84b38cfc68dcbbc25adc5b99d2fb3dff7927788ee3bfcb5d1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_22_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_22_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55048}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e58f5b2e2d4b3c144f40a85fac8a6a1503a16ad3371de562bf530f6031e8193"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_23_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_23_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55340}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fc3018f782ee23e4a0c9264d3c362fc69bc95a631cccce768f719012a58e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_24_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_24_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55632}}}],"partialFingerprints":{"codehealthFindingId/v1":"271f8f3525cf45b92951eb292233e4832cb5c039795e98bbbb9e53bd8f014b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_25_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_25_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55924}}}],"partialFingerprints":{"codehealthFindingId/v1":"862219068fcba76780e246774b2f5c64985b5a61626ca5c5e9c338c8d07e1dde"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_26_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_26_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56216}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e9ed8426478eed6ac1b8c08dd46e151da5d116ecc95c43264bd67d0b7fd0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_27_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_27_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56508}}}],"partialFingerprints":{"codehealthFindingId/v1":"141c85d1a85bdfc7acde4f26939e8307c3f33a65b5c2725c0eb94e13f249bfab"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_28_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_28_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0b824a65530330b30242e65b62a0bdfd35bb60e8bfedbdf59e103c0c615126"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_29_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_29_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57092}}}],"partialFingerprints":{"codehealthFindingId/v1":"600f712c37b14a59e46af0c53122611649965f5fb4cce9f3958224ce113f36d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_30_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_30_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57384}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fcefe7f0c52b0e38c8f6b489dc0e20e8338b3e44318616104d001b636282b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_31_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_31_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e83981e52367d105c682e30760852730006da5b9cd173d57ecd338d28a33883"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_32_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_32_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2851c5b6472d8b1b18dee283b4d61cc6938879082a240c994760c2b6c9f7db5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_33_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_33_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd24ded23e1e5b1c72476fbedd02958950a6de04d161e1416d5846cc69c1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_34_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_34_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d59f541cc16c79987fc28af19b449cf54fde76d4f3aa5a37fe12bfe6e5dfa4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_35_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_35_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be012d0c025eb8b9d4c6c588868042f3e3c349960f48c6f9d44692a9488084f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_36_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_36_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a116679739d0714aa0103eb4e0c0689acd168f9692ef22716a850e4c499d92"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_37_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_37_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4dc17ad1d978151a04c433e8304dac7f61b759239bd3360bb73a6a73d71730"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_38_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_38_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c1ea1477b8697ce4541ce24f6f99fa2842e8834454e7143296f4ec1abe65c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_39_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_39_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60012}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d91ba4734f0158ec42264b4c8579a8a5cae31f4d231e49e1f4c16e8ebc0f85"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_40_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_40_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60304}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f6d93dd9805801322e101fa717b5fbfa6c079bc74f6e69b355fceacb093638"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_41_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_41_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2741f7dd37ce4ea653317738d39a95ecd258ff444026726d86f079111ba39c9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_42_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_42_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60888}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff43dcec9610115dcb306c73975cb4717e4d4478da6cd06b687b2a637b6ac742"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_43_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_43_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd45bc2f8cbe99e42aba4331a107590fb403cab9c8651ba3ffdca07c7c77f88"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_44_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_44_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61472}}}],"partialFingerprints":{"codehealthFindingId/v1":"88811232c5c503db3599726155d59d23056ef14d3548dcac64c6cc78a3d41f61"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_45_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_45_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61764}}}],"partialFingerprints":{"codehealthFindingId/v1":"967e465f30436c06f39f50bb4623868cf11dc27967f8754e9cc4148e4243ca5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_46_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_46_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62056}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb75c5ceb343755cce3da4d0e4a867e22ad2ac02136ea14bb10c1e8cb200a88"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_47_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_47_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62348}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e98d672f0efa3f37ecfa4f0885b8675d02ee848e21659005e27213844ab64"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_48_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_48_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72928ac75b92fc5647393de73e919587e1714fa87ee9d34f4a525703df8718"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_49_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_49_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d064e724423a2c9de4ebcde302d8a3b07b9171c87eb18861256c26858f394c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_50_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_50_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63224}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab8e13d753196a3bfe66bd156e73c652ec867015a0796e5a91033a8938596c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_51_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_51_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63516}}}],"partialFingerprints":{"codehealthFindingId/v1":"47443b6c7870003fafb1d04a0a98fd3eedb190bd540bc3d9e4cbb514e9feef15"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_52_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_52_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d61ca98bfe288df478b29285ad2a85329c54f6e658b4374b6645bb9a7114ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_53_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_53_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec4a9f939139e22963e6fa63a16257ffe097df245e93f877876e1e135900e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_54_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_54_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64392}}}],"partialFingerprints":{"codehealthFindingId/v1":"282f2c4e495bc80fcd6f892ae940d24e81cbd29dd4c854a235f0372c03970d63"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_55_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_55_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31fa20840939e65e77ebdcddf4662baa52f9d5b22a9569053dc0b4f5490e8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_56_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_56_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64976}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e36d7ec90049248e59aace9353ed31f40fffe17210688095b236eb42e3a635c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_57_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_57_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0dadc99fc402a0b58d722bfd992667af7a4e19961e20cfc030878ec917f10d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_58_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_58_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65560}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6bf102b320eba4eb74bea44164d36cd0643d787d9a2a45071fa7eefd03685e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_59_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_59_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65852}}}],"partialFingerprints":{"codehealthFindingId/v1":"95232679e4d6f401975c8cfab4a64d2f814b8be042653cb68abfeb563ab8aea6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_60_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_60_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66144}}}],"partialFingerprints":{"codehealthFindingId/v1":"031b37e14082d261b1194b205937aaa08c1a522fdb4cc2171e6752b43f2f3458"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_61_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_61_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25ded6b3ff83343ef720b92bd8a95ac1959435ade367801dcbfdb15b3237858"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_62_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_62_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1547e80794b152ae22fd15a8261ed6d488818ab934a99ded7bc1d9b7951f2e98"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_63_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_63_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67020}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba8eef0d2b579ff58b5af3074b0489d719d971c978088e5e360dc8d85eab4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_64_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_64_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8234118e83db6847650702a9f38badc4865c38cfc5ac2350894261bba58bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_65_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_65_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b102b266bf749f619221d72684976b2259488d4c2a96d8a69f911fedcb2b496d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_66_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_66_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67896}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a8fd0871dd7ce1151e5b10f1f0fbd9b150b9fd3c2dbb8d7e167a22d11616d8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_67_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_67_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d162566d14b36216996c065e64e6ec98f6da90145c339c7ef641a1f5efec201"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_68_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_68_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68480}}}],"partialFingerprints":{"codehealthFindingId/v1":"005aef66b683203bb11b0f30bde6216e70d319ca649e723012ada9d688163b14"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_69_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_69_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a608f4e2e7c8b716c5bf281dab6865c712dd8020d893a587d45920810fbb1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_70_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_70_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69064}}}],"partialFingerprints":{"codehealthFindingId/v1":"410695a006b6a7315b106ca8e2dce41da8ef3af1fb37a5fbabc8dd7cbbfc4a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_71_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_71_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5863ee4024d102babef8a8b87df6d17a8f5026fec5bc1b3696b4503c6b47d892"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_72_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_72_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b07aa32890ec24c1465f56ac57321cdd6cba54b046ec8a9cf013406677a4ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_73_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_73_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69940}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec262d1fe97b8578adbc36dec30d226bbe227a70fd61863afdf973b329d78d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_74_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_74_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f86836f27b72f5e436d9a68ea9b5f89fd4a29810de743c52ebd3b5085f6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_75_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_75_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70524}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf346a0d1384a60899a2e3cd241b7522cd12b313e8613dca8eeaccbafd8271"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_76_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_76_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70816}}}],"partialFingerprints":{"codehealthFindingId/v1":"baded1e2bc11aa52799364ddbb4a45404075aab6548ee2bc2f7bba0a4d789b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_77_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_77_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6bdfa8fc53315d56f73e53bd6a4280a1940a417d54fc274dc2e762a8dd353f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_78_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_78_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3172212ef2243126b96e05bce57c4c1213ecba7862a1871d83edd24535ef8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_79_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_79_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f89a945f3588408b4fef4b1d8295ad9fb4befc507dad804f864577c882c48c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_80_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_80_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71984}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d00873010aae6de03fdaea764aead3f6e36e5f1295876eb76a357fc8d65ac"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_81_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_81_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85b4074cab6705b8072cd95aebbaf472b3cd0a5e0d0a43265e5d2e98d74577"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_82_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_82_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72568}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae41315157e0fc554c00dc862f3cae6b56f1df16f95804fd1c9d07720810084"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_83_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_83_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72860}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e4a203b68d55aa4be44781f7459e9f005e040b8b4afec0155876a68121e0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_84_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_84_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f20712a19f5265a68fc18c3dd247c2f794aa7e07f51d3bd4f39b31fbc4dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_85_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_85_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee26f8ea53a7f1ebd5178a9a7b428b9fa2a885c312b33883937d7e243b9c1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_86_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_86_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf879f0dad3b34fb4af5296bac80b69301712157a4fc4f52e0687eb9c14a98"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_87_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_87_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74028}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f53cefe2a841be6b0b8dde3e781dd2c1b7ec70bfc0ae7c15299811c9609283"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_88_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_88_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001fb34e77b6929de3db70f21d75eff59451b9fe5097454bafc1b7c1da2881f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_89_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_89_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74612}}}],"partialFingerprints":{"codehealthFindingId/v1":"346c6fb61917d8e017308051cc933ba23ba47defe895f89b074cfef75bfe811a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_90_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_90_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67510b66a2c960eae94ce70b3c3e82de2b3e98332bed754dddfdbba5ed14d08"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_91_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_91_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75196}}}],"partialFingerprints":{"codehealthFindingId/v1":"309f6a343f49a2ad9f49055464c394245a0535b887284e7e3c3cba816d1f5606"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_92_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_92_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36b9ad78d28fb24ec8cd59d69b56b19f3a46a042a6ddf8e4fb99ad67c5b42b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_93_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_93_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75780}}}],"partialFingerprints":{"codehealthFindingId/v1":"1770de4375a93207d611fc901dbeafba142f71faf1cbc329dc72fefbcc5d93f0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_94_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_94_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76072}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de9249f114cfaa0f524d4c927e2d10f46bfc2165dc23d0bd6a02764d15b89a4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_95_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_95_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76364}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9824c0ffdc007cf1015a74562ce7b70f91799b77495bda480950ac5dd6936"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_96_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_96_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76656}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee03a021559193cf7e8e89df711e98038559e0083d5a5a242548dd221dea5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_97_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_97_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76948}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec7b02eb057a074e15ac2157dad62b2761f593d080c8be3102960d9a5610433"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_98_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_98_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4a6a5d6b1028d4efa588cf490e2eec91122cdac55413c1c06f920f1a869696"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_99_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_99_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2d5b2a97a90d1fe0a28e8667693c84bbe42912142b2fe379b69a6c40479784"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_friend_rela_100_ValueChanged (cognitive 183): TLSE_Jrelationships.valu_friend_rela_100_ValueChanged has cognitive complexity 183 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_friend_rela_1_ValueChanged, TLSE_Jrelationships.valu_friend_rela_2_ValueChanged, TLSE_Jrelationships.valu_friend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77824}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6f19e7155d102b61ce50ce48bceaf591f2e7740671790408ce79625c20c99d"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP (cognitive 175): TL_SaveEditor.NamerelavaluJP has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":113848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb4c88bcf5acc7d999c493e4c2b42cedf23de1d8b6f50aff022c9a4fc807617"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP2 (cognitive 175): TL_SaveEditor.NamerelavaluJP2 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP3, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8cced059bb14d3bbf05275e0ea9fd5c5b097bb229450d1c13588b2682face7"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP3 (cognitive 175): TL_SaveEditor.NamerelavaluJP3 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP4, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3ebfa087e9739cbbf492f0ba47bcb8abf7d1992009cd631dffcec1aa701a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluJP4 (cognitive 175): TL_SaveEditor.NamerelavaluJP4 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114982}}}],"partialFingerprints":{"codehealthFindingId/v1":"95afe42c63205d688664f358028b288f623c064b9efb2905af96870512d0e11b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR (cognitive 175): TL_SaveEditor.NamerelavaluKR has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a454bb9cb893e37d3024034f316f12fc0d6a7d1d1719faf5b32b0932e145849"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR2 (cognitive 175): TL_SaveEditor.NamerelavaluKR2 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c114111a93530996e3cdaf807071bb2a40e76ef09054c9c14cdbd79088fe99"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR3 (cognitive 175): TL_SaveEditor.NamerelavaluKR3 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116116}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a0fdd89de98235938ee2192a14d3372218fc56ae884ebb0475a4a9fccd6763"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.NamerelavaluKR4 (cognitive 175): TL_SaveEditor.NamerelavaluKR4 has cognitive complexity 175 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.NamerelavaluJP, TL_SaveEditor.NamerelavaluJP2, TL_SaveEditor.NamerelavaluJP3, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321ed47f0a66f948950afe3a2c0045642bac9a650c87b2ac121511d12608eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.InteractionlistEUR (cognitive 146): TLSE_interactions.InteractionlistEUR has cognitive complexity 146 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":4977}}}],"partialFingerprints":{"codehealthFindingId/v1":"34293dddeea37da3cbd57db83ed3815ce9b220c41989cc2b90444fe62053c784"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Select_interaction_SelectedIndexChanged (cognitive 145): TLSE_interactions.Select_interaction_SelectedIndexChanged has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":6153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb538f6508f08710067a4b461211fab2715e6618a2a36d014f8fbe4e04a51ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_interaction_SelectedIndexChanged (cognitive 145): TL_SaveEditor.Select_interaction_SelectedIndexChanged has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3f23790ce42c7276087a8f9a2d5aa790fbe40ef22abe4bb049cba400ff0720"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged (cognitive 145): TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f692b216f8ab73ff541df3f746015722bd5c88463ea405750e56e55b869b575"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.InteractionlistEUR (cognitive 145): TL_SaveEditor.InteractionlistEUR has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistUSA) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":119925}}}],"partialFingerprints":{"codehealthFindingId/v1":"345abec0ca04157b569bae9e3fd80be29964676413901989dd26538295dab6e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.InteractionlistUSA (cognitive 145): TL_SaveEditor.InteractionlistUSA has cognitive complexity 145 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_interaction_SelectedIndexChanged, TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged, TL_SaveEditor.InteractionlistEUR) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":121219}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ef83f8f9d7a0b73cc8b1ce3148a34364b20e687779d1fee32b3b576e9bc600"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_creaislandranking.Select_spesymb_islandname_SelectedIndexChanged (cognitive 114): TLSE_creaislandranking.Select_spesymb_islandname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"717041f19253bd7e70c45014c50f39dfd9bb1b37a309a176f38b5e817756182a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_islandinfo.Select_spesymb_islandname_SelectedIndexChanged (cognitive 114): TLSE_islandinfo.Select_spesymb_islandname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc68fd6497365af4b311a9816f7e20a0edb04e47c22cf3407c54c03f765926de"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged (cognitive 114): TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"942600bf2fb793f4bcc11882442a1778e3b6c3e268806de37296c9d791be57cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged (cognitive 114): TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aec848f976818265ad0272c8af43c4fd0e7287ee4c2fe8528ec69456310190"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged (cognitive 114): TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7f5068393447e378c9a3d98c75e70eab252a0ff1662e0630be52317f3bdf4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged (cognitive 114): TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged, TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"579675bb57904bdc9e7ec84eb9308b61463f1b803e0f64ba877ee914e2283399"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged (cognitive 114): TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed07d062aa8b57157a9210b01e7eded5e9816c74dcc33914d010554b0d726f2"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged (cognitive 114): TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b55db970050c5d49bf7cddafe1f3b5b292a4a44892415b9dac49155688c1787"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged (cognitive 114): TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14400}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bf2bc50d288d89cb70934d465942bf9084183474bd5f297b42dc4d92742a86"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged (cognitive 114): TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged, TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14678}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3d66294de857ed66ee830e1558dc7db4a306732d0061b477a94e57f863cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23169}}}],"partialFingerprints":{"codehealthFindingId/v1":"647ff387c2073745832e67338869f375b39bd0f4450673ca2a2651703ba3b5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23400}}}],"partialFingerprints":{"codehealthFindingId/v1":"42510ae5c08b9601f146f9a6f79411d9b2909384a293002b6754c5b4c2144672"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f490a6827c9a7e558b9711fc0e3191dbfeb0337bed0ade5250f318c9fab6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23862}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdc2748e37c8eed852d913b0f9d80e05001fa57169aa6e7835d44599a5a9f9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_5_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_5_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7f553349b118aeb11da4e2983d759a811e8e2bbc95ac4b72facbdeaece674"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_6_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_6_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5fdf738fa699a137495d972eddb6a8b9718bfffb0c0a33f2fa51b12ca147c3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_7_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_7_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada24a8c9d63ac5f16df8f524e78596d465fe35c843d55cb99af6c2bd15c04c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_8_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_8_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24786}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b9ed6c7fa4e3220bdb565fadf8fd0ffcc5404f7231099503bb99a9f01fdf23"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_9_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_9_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2541b40bd5ec8f22919b87a68e17e5d734e258986633e73e1a0112bcee74fd47"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_10_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_10_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8f53b0beae03b1aa4c41c70f36e36c8ad84a97dd72c603674349b25bfa42fc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_11_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_11_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc506b8d0d32ee2bdda9af82ff42f63b66feb184217dddcf2df725ef4382f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_12_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_12_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a291aed8d86f26684d85dd7fc8e71e893c41948ff18ab311e8949e4bb868285"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_13_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_13_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25942}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d4532460ca57b6394f053e90df1c00ff1bebe4199ba0b6825ad9e2edeb01a9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_14_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_14_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c9bc737c0a25e5d31d28b326a2ad189c847cc1b8dcf2bcc1290e366b88425f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_15_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_15_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e3b45af66dadd470817ce17f13cff294b33398ced8716effb4ea3f47815513"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_16_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_16_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63dbdf8664daa5319508f81dee20dd67059e1447d479d05a9828a50a4ebe771"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_17_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_17_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d918fb39e392d62d5dd71789eb2cc5ebea421b76f1340fa53d5a486dfd15c9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_18_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_18_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27097}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ffa20d8eb8b6cc75115a662373c99d3e301ab8a1790cd0b7f4c2eadd38a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_19_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_19_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d32c2df0ba3423f2496f0056c784fead58359532d5819e25495bfad8f5f9447"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_20_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_20_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fa5fe4bf2e7f9a076356b933692983466e63a1683461828aca8529302ba574"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_21_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_21_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27790}}}],"partialFingerprints":{"codehealthFindingId/v1":"7983908027eab4a8de96f8351e3b8c434e60ac5f53cb30df9a67cb57e5992525"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_22_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_22_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca593bde89825b384cfb81be72954c1d51a297de02cd34cae3175eb80c0818f9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_23_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_23_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28252}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b51c843687edae26fbafa13878f9f897287f71366fc9c6cea4b384194d2daf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_24_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_24_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28483}}}],"partialFingerprints":{"codehealthFindingId/v1":"808fa89853091f3a87f2e0ad8b7a08107ecd0bc74ea98dd6b475b46d49f5bf3f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_25_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_25_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28714}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fbc870e33aa9a970bb87b760ad8c03cfd8756b5adec81f7efb852bb4ac3b56"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_26_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_26_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7a2d7d16a299f8382141f8b84d0e81acff49d2e7ea5d5bc0a128fd3ac7788c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_27_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_27_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29176}}}],"partialFingerprints":{"codehealthFindingId/v1":"595a006bd9ca767d6a3fc868411d15af108dd7abd73ee5026a9a4872938862d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_28_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_28_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7056954b3e10580e43c4d4239e87aef62b1f720fbf423da070c085de2e18be8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_29_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_29_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d2390ef319e706a57e666220c7396df9a319a56e5e06c6f1f0c2f2c28589cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_30_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_30_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29869}}}],"partialFingerprints":{"codehealthFindingId/v1":"60db08513f9a25d7c78edb754bd0fc745e99b7a2642b1e28893e0503608a7a92"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_31_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_31_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30100}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d572aea8a00ce606d38a26ce6391746cc2442a5a9d61b7b308207f77718cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_32_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_32_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c861aa989207110243897374d6365a1c2775671f2848f82d95e88c44dd4c73"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_33_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_33_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a21aa0f8335f538e3c699c05fe6d55cfb3c97a221ebfd727ce5745c8b31e4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_34_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_34_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b65b1b38b7194c9ae8ff6476170e77a29ad2d6d9b4399b4024852f81722c547"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_35_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_35_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e027fcd6d1e022a0b622f6a971738833175d4e237e5ae3710a62c24745fbb1b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_36_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_36_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56b7fde76e741bbd5317da3b7dd5404b8c27513a771fb7e59432affc2f8366f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_37_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_37_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31486}}}],"partialFingerprints":{"codehealthFindingId/v1":"258abe8b8b26aee23b89301faddb7a10ca4e94c67e6f98189449af2c89731186"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_38_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_38_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31717}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b9b3b546a10ab520888eec4cf53cab01a1539af1bfd8dfe2094b9386a35a99"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_39_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_39_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31948}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5720fbf2fb4459cc52ca8dcdde5ba5653bb714138db2fa4c948ab7f7e68e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_40_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_40_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a02fab126c5406cc7e0554c0d79c33617256e602d7f94e1df726620fb6ad6c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_41_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_41_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32410}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb298045560f3cdd1684b78aa01c25b53cdb698a93712a85aadc27320df4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_42_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_42_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1e7c8272ec6c1abefc8739178bbdf1cec03800dca910ed0cc94d6af67ef45e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_43_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_43_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d75917e242e741b1db204deacc1af8cd8c035ee977d35e63616ea34f6e985a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_44_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_44_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad70f0169de02ffb2ead33afd294f0f579c37a24ac3df5279c9d8210e9ffab7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_45_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_45_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33334}}}],"partialFingerprints":{"codehealthFindingId/v1":"50618a0ce25d3a40d8e75b0b7fd727d83f2a74f04b8d004fdce09a59f86e30ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_46_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_46_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33565}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc6b9875cae2284487e116752affbfe8ffa0b66dd087370b6c86a8022987a2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_47_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_47_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e646e4c4855af513a739b3cd7b745535df675db3fe31810b3b9f1e7edf34717"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_48_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_48_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34027}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4f87b68abec882fe7e2e93a33c4e583f8bca63cf23e5b91ee2ccbf89d98af"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_49_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_49_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34258}}}],"partialFingerprints":{"codehealthFindingId/v1":"529e0d14c802179c5e62bf1c73e62678eb19ac6e7c8b592db52f29ac00d8fc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_50_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_50_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34489}}}],"partialFingerprints":{"codehealthFindingId/v1":"088e0f10b730e8735ce413d3e48d922d2a67ac66d9516a6593468852844f8f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_51_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_51_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13efa2322185d9337c3ce0cb9b792f55c09a7d1fdbbb6023a9941480c70e1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_52_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_52_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34951}}}],"partialFingerprints":{"codehealthFindingId/v1":"8febd42fcf66dbc1628e0385fb384a1127d38f53e1735caa8d6cd1f89acadc5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_53_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_53_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d942588f445a8d8e1feac8a5e6c8d7161fd442bec63e50fe7685b7aba7e3b1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_54_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_54_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35413}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e00de2686018e3016e42df71ce425b960ddead811c73dcdbbe53c67aefa944"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_55_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_55_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7798c7572022a55029c720b14666c7d5daaabe264b344fd62de63ce060b79d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_56_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_56_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35875}}}],"partialFingerprints":{"codehealthFindingId/v1":"55daf911aeeeacb228eeecb77589cdf41814963499df2632e986175743a5c394"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_57_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_57_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f859a54c46aa9277f8cc2dfe9a4528f4e4b88ba3781c5fe7118e9538431cc480"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_58_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_58_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e9eeabb42aacb728835d982024a83d9c349ac496fddf336a5126e6250a644a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_59_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_59_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50466274b358386e35c244d0840c02d4c4fc93fb37eff97be9206e9fd7a05e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_60_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_60_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5befa732bdd48ed0043fea7141326f752f48044b09433f40f8d499564db297"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_61_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_61_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37030}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb269e58b9c1159753833a60e605af64df5b6667eb75cdf2955dc1e0862d12f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_62_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_62_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37261}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ac172b157c0b0f665c0a09ae293c3d733665b0bdd3a773c7de90965f1b1175"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_63_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_63_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37492}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aeba62d47e80a9b8db4a99e6d0ee86ecc181980853649cda0c54319e11f7df"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_64_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_64_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e05ff58997dcf05f0dd6d2efa6505e331c51793a3b422e63b230a87e5e3f02e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_65_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_65_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37954}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec81a0eb9a245f7b55e219c1b017c4aaf521234bc3002172b2c4c4937d0b2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_66_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_66_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38185}}}],"partialFingerprints":{"codehealthFindingId/v1":"813ffae90d9739d0d785ce6168d9aa24e133577067498e239866ac1cb6c6489f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_67_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_67_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38416}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bfed175d32f6c8fddc1970b9b2981ef437ae12e42dc07712972e20d77ea1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_68_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_68_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38647}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fc871eaee6d0596deb3a0f34cd563457abf72bdefe60c4583f259207ee90bb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_69_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_69_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38878}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ef8bb4c24d91f09674cc29f6e5124ba7d046be64efa4d625c1830260ee5c86"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_70_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_70_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e71c851acae61cb72fb67f30ace81e491d0f1c2abf7bc1c3832fa47285e0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_71_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_71_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39340}}}],"partialFingerprints":{"codehealthFindingId/v1":"55492f796eba9fa33f9080109e50e7d6306d00e48b5d6c54f91c6f96f49369bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_72_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_72_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf13e2eb9ed766c8eafa5e37d22b4e1e8ad7be3d1a2524ee19ddb2e5aeb2953"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_73_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_73_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03ef71b6c880b6c459afbeff909c8e9c64fea6cc858419eb10fa56d2e56e037"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_74_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_74_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bbbdd1bfb6f59e61cd6ba20074e093619491f80cf1d7a875e2e804f9438f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_75_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_75_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40264}}}],"partialFingerprints":{"codehealthFindingId/v1":"35be625307a09752f49e094808e9ea78b81cb8f82f88d52c1714d4fa1e2681fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_76_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_76_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c941737f76858ba837a780f3fad3d402dc5c034adca113158b30fa92c78401"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_77_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_77_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445e679a79f5f92aac165c7134e08a04537dd5cc9bde7525ef7929317352373"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_78_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_78_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40957}}}],"partialFingerprints":{"codehealthFindingId/v1":"d585812907bc0980474c42deae89a61f29762b8fe27c1f336c2f08bb5b07c979"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_79_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_79_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41188}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c4269286749bc3ed7512155bababc2df74d7cf04473bf7aadbfce03bb962a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_80_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_80_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03cd16ebd593baa61f38e5987415f6bce907e4270c76d85a3b62bf7e66f62a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_81_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_81_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41650}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e4b22c368812d74e17589264338b0e5be021d6bea6245b586bc22b4c46771"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_82_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_82_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41881}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcfb5ee9cb01cb44db18cba13b027a4f68b54704ba9cedceeb998d16142028e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_83_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_83_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9c0866dcf8c992e7bee714099446faf043e98dd3c7420b78448e225ad98971"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_84_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_84_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb54c887663a950d8c37faf8beb34592e73f3fa19927e0810180f10fb0d94bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_85_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_85_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d550764d33311de4eb98750cce88e5c071b972eb346be7b794df4ceca34a809"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_86_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_86_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42805}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec37fb0986957b963f13197861d3f41b030661f63cd92ee6c441fc80c351461"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_87_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_87_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9580d989a8820239e93da195684528df051a450d51f2d48d86a1bd2a8c7d330b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_88_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_88_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43267}}}],"partialFingerprints":{"codehealthFindingId/v1":"922f27a191a9c6bccc227c65156dfb09d78d3513936db993c6009f1cabb951bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_89_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_89_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca6a713ebeee0c0e113216f9b9e415bad4bb8d6781085e92cef5b373b366afb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_90_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_90_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d4bc255021f04eeb9c1298935f82dde65c5419f274b48f109f7b4fc45061d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_91_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_91_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43960}}}],"partialFingerprints":{"codehealthFindingId/v1":"740935e3f1b793ad75c51c48bfc028bd216ec84d706885f45f90881b1130f40a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_92_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_92_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba9bedcd2f8070aed66b6a225cba3421350b53f57365ef955c1dc7a0cdcdc6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_93_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_93_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89398b7d126e821ef8a08ff118092163413ab10cd6afb3c82bae6835ebcfb7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_94_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_94_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44653}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c596202897fc82c0e0038647366224f4048df35eb57cdf963ddd144f456f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_95_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_95_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5792ba1e96825124882fba3f29e81e94ae8f0ac6a3e1adc9e111b5680479d320"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_96_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_96_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45115}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f790365efd0625d0db58a3aacefc72b18d6f10ff1575152cff4a89c9cb1ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_97_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_97_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45346}}}],"partialFingerprints":{"codehealthFindingId/v1":"340de4146035ae1974a5bce48e9c96fde6ff8f09574a30bcd6f849bbd1042cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_98_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_98_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d95ad97c3101b859c17f9d3bea82ea8d05d0c0206a849484501677ecf43772c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_99_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_99_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45808}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0f02a61d0fd01387fdf7f0d7a9500f4076856d52c1a241f2dd6578edd00576"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.valu_selfriend_rela_100_ValueChanged (cognitive 113): TLSE_Jrelationships.valu_selfriend_rela_100_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged, TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aec7e4d4fbb5c1fa2050cf9c56d6f25799b3113df768456a860082faee097f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_1_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_1_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75d116e9a5c3d6f9394b6652868a210096ebcc9c778a9b81e612639e634b44"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_2_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_2_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7860af2c06fc8fc026ca11391b7acb814f6321af3c8ee357f4969939f71997f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_3_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_3_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23633}}}],"partialFingerprints":{"codehealthFindingId/v1":"181593a51f1335da3548674577ce58a9e40b26a0dc663980ce4b42c1bb296207"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_4_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_4_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1927eb03bceee7d6e7ad3690cdf369d4081c3751cd743a88338a9cc3b55dec2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_5_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_5_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24095}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00635de31bc203dcc0228e45443f7a7473a6ef63eb4b8125d0f1608f078ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_6_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_6_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24326}}}],"partialFingerprints":{"codehealthFindingId/v1":"680d5f88e97487717d54e8ce45e9f328b018c085366078978cbe7583b55cacef"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_7_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_7_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c019bf3175fe8d675fb93427b8f9d707e7fffafabc34446f66540a3104ee656"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_8_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_8_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9db21b3a6b568aaf2606a588f6acf3aefc00682b87ac2a218feba4d4c1f12"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_9_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_9_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25019}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e66b7aae0ad946fec2b6a2ceb1b6faef6a2a68f58872441b1188fd0f6760c68"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_10_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_10_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c471c0a45a6b3a2c95898d115b0945d60068a3f4297b89c5b414ca6e3bc3dcce"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_11_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_11_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25481}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59114b6656b6dfc1487c1138684a64702bbea8b6f13592089403f5e221e23b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_12_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_12_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25713}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e99514356d6a80d1a0bb5ad67a02ce12e051cce22bf8cf499be27b77ab3c31"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_13_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_13_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39e37d897df4131fd02871c930af9f00c5c62c621411650561b62476463e1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_14_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_14_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee23a0d979163c5e8fa0cf04934a26889620858b333b817e02495987d63c352f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_15_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_15_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26406}}}],"partialFingerprints":{"codehealthFindingId/v1":"35362e25d8b35535504a9e509bc52e26c8b0d2f341b65a97ad7c713ed0e26fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_16_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_16_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c64f07e30dd33f4de051e6df0d6b56a6e0744a9ea1c1bd297b54c3b0dcbcc85"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_17_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_17_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4644acdfdb51a3178dde52b966fe88fcc188ec125f870a4ee36b226f2d8b0586"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_18_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_18_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27099}}}],"partialFingerprints":{"codehealthFindingId/v1":"463955230620500ae8ba4a559590dac8e395ae92ebb08764c7e69713df5dedd6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_19_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_19_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27330}}}],"partialFingerprints":{"codehealthFindingId/v1":"599bbb0d387c0fc9419be7de769864a99949977cc04daae923d36c8130e51b72"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_20_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_20_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764f9808c2d359c9f9020d8f67b3b11ae00fdac274dbe0ea1084f3a9b8f864c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_21_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_21_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5344397fdca185fc95d75bb9a1bc03ac4e1121ea9a1c119806eba15705092f04"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_22_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_22_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b96423180e1a81a3d9ad4baf7b9f4af7b41fbc3e397340988b93f506d1dbf2c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_23_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_23_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e25b7c6ba0ef1c279620fea960e9b9b1d5d2553d402fc3b86f8667d2276e3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_24_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_24_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c843f4f5e1c5771199e0b840e963f4d85581797a1f8d5527e68ff154cc44bf12"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_25_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_25_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfed9d0d99901baa81afe3612980e952f414e9b35213a4b8124fbb7434456b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_26_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_26_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28947}}}],"partialFingerprints":{"codehealthFindingId/v1":"217bb2094185ebc2c50dd99d2cbaaa5d0c66c219f13d6ba8a3b83eb66741d20d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_27_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_27_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd2b86f191a822cc40fd999f3fa1160aac17660d459a8bb2abd5bde06da5db2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_28_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_28_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b6c636c5e2958d8013f1790876c9f3a74b6ba0442a2e06da049a9794fa9e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_29_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_29_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29640}}}],"partialFingerprints":{"codehealthFindingId/v1":"21218866ba1ece33a8b649b24e5b056c42d5f9f587a86d88d98f2140d0370dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_30_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_30_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29871}}}],"partialFingerprints":{"codehealthFindingId/v1":"247347b4b8274b18dbfafd581477de3e1ab09aeb93a84a6e7327e11b4a44b663"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_31_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_31_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2052ebe1f85cbd51bbc1ab62c0d52c00d1988011079e1ed917832e38fcaab3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_32_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_32_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30333}}}],"partialFingerprints":{"codehealthFindingId/v1":"842e21dec94b166d8f2539b6dd899376a9b3dde94eb85f5a6f88ba9e170cdc07"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_33_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_33_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143e593f7b4067a156e07853892cf555cf4e5990e5a71a5f9f54ed76c5dba43"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_34_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_34_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d32f38cd9ebd2274bf60aad1d6b1e12fd401307c34cdcce271a5e00e813529e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_35_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_35_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31026}}}],"partialFingerprints":{"codehealthFindingId/v1":"66814d10fb6c1995ed53b667828ca1559887fa90e4a459dd452a218be52b18f5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_36_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_36_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31257}}}],"partialFingerprints":{"codehealthFindingId/v1":"83361e3f0c00e22d527509f919c3ca47dc0b80166a719cd2689e09f599cc7ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_37_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_37_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31488}}}],"partialFingerprints":{"codehealthFindingId/v1":"14924023e3b573eaaa0912a14ededd13df36b46c00c12fba1d96d5bbd3ca4cce"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_38_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_38_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31719}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1fd9a59126f264def990aab0a645aade5fe37a62d36b7dcf2a055cf1639088"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_39_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_39_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31950}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c072c129d3ca80e0176ea200933918f32f60e15a48057f3dca584fe8f6b7a78"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_40_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_40_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ccd83c6cdb783381760ed2ce7775288b3d8fd6e2b5ceca87d704d03180c160"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_41_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_41_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d134cc6456ec4c346da96b4dbda642594b70002f65a969485c8b92322b0ecb30"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_42_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_42_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e83ad97ad2066cc4d9ef12dc10887c45e5992fc3155b21ea9957bf557b90d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_43_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_43_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32874}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a06709d64edb42fbbecdf009a62db4d967ebf85c2e7e48503ec16d1ee0951b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_44_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_44_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33105}}}],"partialFingerprints":{"codehealthFindingId/v1":"73938807461a5d41795fc806999075f4025ffae26ed5ce5acb8377f4e98aafc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_45_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_45_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4351fe0d3b33aee8441b9406755f8c245bb58c23bea5b3db872d1557f375ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_46_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_46_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eb128bc5a7854f11ef40789e706bbd3747c942d8dd9022727d668046899b47"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_47_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_47_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4799e5d6ed498914e245de38784d1ae0e5b46f150daa79ed3387ce936379c25"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_48_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_48_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34029}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2cf09d0e4e8fbf7b07685213e55651bd2a08684695eb6838cd255612c8be7e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_49_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_49_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34260}}}],"partialFingerprints":{"codehealthFindingId/v1":"99587a16cecfa33dab4adc3aeb7d8f0d3206405684c99bc48fa6c2708c521dba"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_50_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_50_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34491}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a7119b89aec1a363c8523fe406072a9ff71016a05fe938a2f6737919af1c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_51_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_51_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34722}}}],"partialFingerprints":{"codehealthFindingId/v1":"0706d341ff8a366be7576cede3af64228aecdad2c1810acc03b0f207d6d13808"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_52_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_52_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34953}}}],"partialFingerprints":{"codehealthFindingId/v1":"962c08e3a30421a244f193816d294090ab8fbeb22d4e140d933d90349ec0997f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_53_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_53_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cebf5e0d18d78d3f27c4f0d6d8b8b565b3177be46d36e3d1d9619ce4d897043"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_54_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_54_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c09f6bf9ee76a710083e1af48f06af4b8b2d30bc24b391b17b959f251a61eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_55_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_55_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35646}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dedf235889e6a977fc3e0014bdb0eba914660da37cc6b60393a91d789c89c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_56_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_56_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebbd52d5c04125c8c2e3458080c8a560e5a780d05d80fadf887fe308c4d6245"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_57_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_57_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f917d9498ca32cf9c19311b56fb2f31e44198979ea14c3b85b92367e1091fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_58_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_58_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe827eb1c7a0301962e468c35f426999b698f24aefef7834ac3019d1597d9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_59_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_59_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36570}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc60f587156eccf1407124971c5b32e15c7f4cb48c5522dcaf1aaf25c3180289"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_60_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_60_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36801}}}],"partialFingerprints":{"codehealthFindingId/v1":"6472d300122c37babc3f2daf419434f666d88d0be254f55d085fe5c53fb29a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_61_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_61_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37032}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ee399d64678cc4beaa0aa06effc1cb8d665b572c3972607eb9a97ab7a14ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_62_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_62_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96711e5d09ebd39b5d643b5389bda8e409b8b0b0c92d15a88c05aaef7ec624d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_63_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_63_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37494}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa064aea76b8ed23ce4968e57154a317e6f1f66e9c880f6a534b02ce8419e76f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_64_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_64_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37725}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b082ae27edf6a12a78373940ad31f88a6a9be17bf2d49757449511d00652ee"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_65_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_65_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37956}}}],"partialFingerprints":{"codehealthFindingId/v1":"db35f1b5ba59cf52e48eaf320c9c16924cdd1a98d5f8370c12a224f6d4e4c43a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_66_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_66_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38187}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b131519f57a849adf5dd08b1451a0b86e8263eaeddbf9b364280802b92257"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_67_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_67_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38418}}}],"partialFingerprints":{"codehealthFindingId/v1":"554d3cb05b1630ced9b2c1627043232bbca1356a610ce74983bf58cc01325e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_68_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_68_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38649}}}],"partialFingerprints":{"codehealthFindingId/v1":"982149347ddbbac607670d824f226cd433ef2b05dcb8340b0f3700634c209f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_69_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_69_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f034e1117a36907ec4a4082faeb51d33a07c229322df0332d9bc1ea19239d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_70_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_70_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc5214f1a4fa8102c1ea1accea6f4c17623873c78d790e2c226f4d8e8b67ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_71_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_71_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3026f7be7f29a5abfd314e6a8a9751f5f76db971d36b01b2e845aeadcd1dde5e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_72_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_72_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7fd4a61c50120a44719045b8746f072cea177cfffb13865d8c147d10986764"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_73_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_73_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367c762d3b240cdd63528867c6868e99e8480b384a90e7f7b55db3002e0e27b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_74_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_74_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40035}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3925023ad0ad021406125670d8bde3bd2b13e669d911b1877a89eaf1c85998"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_75_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_75_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfd18253f80e25e38061beb2b0eb34f8222aa250f5b55db19b9fb4837f486a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_76_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_76_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40497}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e441e9221c5eb4af23245b0c2a3cb3a87db8e149c4806f50df58c63ad83bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_77_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_77_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40728}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a670dc2ba0bc708f50c05e160a7140d0f02af59a3fb8fde4e5a2ecc1dc9448"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_78_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_78_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40959}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b7e6e42412cc5d46fe7090306373a5489254580fb6ceaf1626d900685c9432"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_79_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_79_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea48b8b0f79204b58ba10a64b948a7bcab9c952f6c065139f89492cfdf6fb14f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_80_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_80_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a267904f006c643d16588aaca91f3c48a1328aeca60346f02b2f70cbcc89cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_81_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_81_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41652}}}],"partialFingerprints":{"codehealthFindingId/v1":"64faa1448cf120c88368065a2c076e89a9fb9088e87fed49fcc59b4b20ba029d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_82_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_82_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41883}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cb255845ae5916a46731d1df112e96183fa5b38c1eb5b9d4d1289fa8b31293"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_83_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_83_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8c70402e3db29f0a1c5abc9cb3085318ff03a42764a9aa1df6e332bbac0d68"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_84_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_84_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42345}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b274541146118a63e2320373b25f500c5df301fd10b5f0d819cdb3890c1e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_85_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_85_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c662fd0f6acfaffb105c43795e8390c853f3045d312a2082081bd0d644b2a610"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_86_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_86_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42807}}}],"partialFingerprints":{"codehealthFindingId/v1":"27066d80cd92ed47f5418b58b81feca7f3102edbd8cd5b50419317a4d8ecc2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_87_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_87_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43038}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3bae3d32dfcab98d58031aacaf6f05e2808131111af99df94437b54fb79a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_88_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_88_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43269}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e224863ef3bae062f008c5d4fbeb871acc9acda7c0db66845c8d9769e7895d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_89_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_89_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8008c365a474829c4b044a122a1eadb2552b06c9fe824e5768ed0b1198bbdbc8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_90_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_90_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df2ad0f66c420148fcfbf2861c2ce00fca8fd2197d9c27090ed2f99c12fe18"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_91_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_91_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9770543f809d664ea3d2d4838e435609da3156f2d82a496c62a7a27a780d12a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_92_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_92_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b646c4be031e42f9e22313d169d5c324d76473fd4607d6c8bf7f91f9eb02149"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_93_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_93_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6dbb885194c40964f768bc5d667827a5c2359ebe341c7179234ff555714456"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_94_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_94_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4725439bfcdddaebb18db9f01ed2bf828a362606a404ccf429f1a1b8450f935"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_95_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_95_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c962ccaf7a89ee85ebaa55fb077d124d5c0313108f4dd797d47dccdf0d4d291"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_96_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_96_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45117}}}],"partialFingerprints":{"codehealthFindingId/v1":"622fc5d613ffc7dbb95520ed942ac8ba2dea5b439cd4e0d0c10343974a5abab5"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_97_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_97_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed637d912c1cc16dca503c7a78738483b86aeabb5361c29baa5b89367efbc00"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_98_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_98_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45579}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d973880443c4cfc33d63acd0ca66590ae0d3b075dfa7e9e49bb60850ff87b87"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_99_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_99_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619702dd72abc2ecd4819e75bbeb2dcfbe7a1d459801fa4830520dc0609fec8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.valu_selfriend_rela_100_ValueChanged (cognitive 113): TLSE_relationships.valu_selfriend_rela_100_ValueChanged has cognitive complexity 113 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 99 other methods here (TLSE_relationships.valu_selfriend_rela_1_ValueChanged, TLSE_relationships.valu_selfriend_rela_2_ValueChanged, TLSE_relationships.valu_selfriend_rela_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 100 times rather than 100 independent problems. Splitting this body alone leaves the other 99 exactly as they are. Where these are variations on one operation, the change that clears all 100 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46041}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3975e2c18bc4b7aad5a54922c888f52f6ed5433ed7f053f811c0ce7b8e0963"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Readfriendlist (cognitive 105): TLSE_Jrelationships.Readfriendlist has cognitive complexity 105 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1de90cc2e2f310802d4d2af212aa326d50f203055a659492f0b557ca71fbf0"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Readfriendlist (cognitive 105): TLSE_relationships.Readfriendlist has cognitive complexity 105 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":192202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c879394b621f460e23d0b132a2d64ee13569629ae9e80150a8b8dd8adcf0431"}},{"ruleId":"D2","level":"warning","message":{"text":"Miimusic_edit.Miimusic_edit_Load (cognitive 104): Miimusic_edit.Miimusic_edit_Load has cognitive complexity 104 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a772288c6a192e6d4d818ee69740f0d6b901582f0243612d5178099ade3c7193"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_dataislandranking.Readislandranking (cognitive 101): TLSE_dataislandranking.Readislandranking has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_dataislandranking.RestoreIslandranking) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1835acbbc336f1ecf5c2e21c7a32baa8bb641287ac32e75b871f20ad1458c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_dataislandranking.RestoreIslandranking (cognitive 101): TLSE_dataislandranking.RestoreIslandranking has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_dataislandranking.Readislandranking) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f6004851b192baaad61265bcc9afabbdbb52a7c7df41b8b6e2da41ea82e64e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Readinteraction (cognitive 101): TLSE_interactions.Readinteraction has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3a4e43dab96143f467c4e1dc183fee4a8dd2427d231e52f23b8c3753c097c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Select_target1_SelectedIndexChanged (cognitive 101): TLSE_interactions.Select_target1_SelectedIndexChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target2_SelectedIndexChanged, TLSE_interactions.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8672}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f098fea991dd1e1b401a078ebe4d63eaa8a3dc1aab51e6329bab3030f94a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Select_target2_SelectedIndexChanged (cognitive 101): TLSE_interactions.Select_target2_SelectedIndexChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target1_SelectedIndexChanged, TLSE_interactions.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39699238eaddfa6684d77cd5b32511855e9249df1651dda8a46191268004694"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.valu_target2_ValueChanged (cognitive 101): TLSE_interactions.valu_target2_ValueChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TLSE_interactions.Select_target1_SelectedIndexChanged, TLSE_interactions.Select_target2_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3b5435c07cf73a05f8f153bc46c8b5ee24cbaff2840ec30bf3571d45c60aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_interactions.Writeinteraction (cognitive 101): TLSE_interactions.Writeinteraction has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07aa7fbb8a5d90a99cd1b651ae4f195e99b7dba44be039a7c23b4ed6e88803"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_mii.Readmiidata (cognitive 101): TLSE_manag_mii.Readmiidata has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_manag_mii.RestoreMii) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb3d99e6468ea61820592e211ccae04abf8b374309114b9c36eb898ce31f673"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_mii.RestoreMii (cognitive 101): TLSE_manag_mii.RestoreMii has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_manag_mii.Readmiidata) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"18568c5434e623ba825d9709208685fb118ce18d7a12cab8f4b9aff3fc387a29"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_target1_SelectedIndexChanged (cognitive 101): TL_SaveEditor.Select_target1_SelectedIndexChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target2_SelectedIndexChanged, TL_SaveEditor.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27077}}}],"partialFingerprints":{"codehealthFindingId/v1":"8414d366e9744199a5d83799192fde0d31a84fecb97d386de3e34b2b010552a2"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_target2_SelectedIndexChanged (cognitive 101): TL_SaveEditor.Select_target2_SelectedIndexChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target1_SelectedIndexChanged, TL_SaveEditor.valu_target2_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27283}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b455228ccdd8a0160a5c456e173bd6ede9071c44ff9f8230de7e3d500f9c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_target2_ValueChanged (cognitive 101): TL_SaveEditor.valu_target2_ValueChanged has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_target1_SelectedIndexChanged, TL_SaveEditor.Select_target2_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28626}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde665ad7eeedba2cd91871ac2a58ed65099fd06740112b0b45c698d0fd4acc8"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Button_setallfriends_Click (cognitive 100): TLSE_Jrelationships.Button_setallfriends_Click has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96ea5ef1a9387d417bc8f28e86136a0f379d9ab49167d040f57aa142ad43929"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miistatus.valu_experience_ValueChanged (cognitive 100): TLSE_miistatus.valu_experience_ValueChanged has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9692802482c057479f4beb3fd2e20df48f7580a6aa43ed6fcb4e58037f9a5682"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Button_setallfriends_Click (cognitive 100): TLSE_relationships.Button_setallfriends_Click has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68322f49bcff75bbd6701fcbf3b378f9b591115d88514198dd65a3c00ed458d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_travelers_status.valu_happiness_ValueChanged (cognitive 100): TLSE_travelers_status.valu_happiness_ValueChanged has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"22efff8d7c10b883379c7bb0427ca37e628f3bc5a459c41c3c38efecb93358b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_experience_ValueChanged (cognitive 100): TL_SaveEditor.valu_experience_ValueChanged has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TL_SaveEditor.Button_setallfriends_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":13803}}}],"partialFingerprints":{"codehealthFindingId/v1":"15af7488b2b003b3796e3faf16f820a2f0e802fa04234039c8225e73ed32f923"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Button_setallfriends_Click (cognitive 100): TL_SaveEditor.Button_setallfriends_Click has cognitive complexity 100 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TL_SaveEditor.valu_experience_ValueChanged) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17433}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e25692bcffe9a0aa1a521d64d0ef74845b688202b8127504134eca140f20eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Text_save_editsongs_Click (cognitive 58): TL_SaveEditor.Text_save_editsongs_Click has cognitive complexity 58 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":9106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba2ca624568ed0aa610f4f8177d46adf764679af3ebb5c35f95703efdf980dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Advanceitemsedit.Checkitems (cognitive 54): Advanceitemsedit.Checkitems has cognitive complexity 54 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4fcc125ee6d54e85ed334b8d9b31aafb52ecae352fa1e7e526fab8ad8a82ba"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_travelers.RestoreMii (cognitive 51): TLSE_manag_travelers.RestoreMii has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d6f4257251ceccefe7b12d4558b00a88af136205862b1aa1845f1a5943d035"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_travelers_status.Readtravelers (cognitive 51): TLSE_travelers_status.Readtravelers has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50148f6f22a852b766e8472cb5f786aa1d3833a567a8d2ba98d7a05bf0b662f"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_concertedit.Select_songs_SelectedIndexChanged (cognitive 50): TLSE_concertedit.Select_songs_SelectedIndexChanged has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881966bbb46b5190c98c6480e5be6150ee1205b78ae7090202732e3d8a7ad70"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.Check_timetravel_CheckedChanged (cognitive 50): TLSE_extras.Check_timetravel_CheckedChanged has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c18fb43c557d4695bee524d1744121425834f687b10085830559fc64561e17"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_songs_SelectedIndexChanged (cognitive 50): TL_SaveEditor.Select_songs_SelectedIndexChanged has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_miihouse_SelectedIndexChanged, TL_SaveEditor.valu_miihouse_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0e0a155bae521c429f41d11f6bbc6bda4a4c569f315b21fa1414ce9469a717"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Select_miihouse_SelectedIndexChanged (cognitive 50): TL_SaveEditor.Select_miihouse_SelectedIndexChanged has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_songs_SelectedIndexChanged, TL_SaveEditor.valu_miihouse_ValueChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47257}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a17e3138bba54dc206b338e5a14e3084604f76ec3a373d6400f9dc0eab594a"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_miihouse_ValueChanged (cognitive 50): TL_SaveEditor.valu_miihouse_ValueChanged has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 2 other methods here (TL_SaveEditor.Select_songs_SelectedIndexChanged, TL_SaveEditor.Select_miihouse_SelectedIndexChanged) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47361}}}],"partialFingerprints":{"codehealthFindingId/v1":"850e69532d508dcaf889368a2422d9ea50851b985ccf8f97d0e59df963f24b04"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_concertedit.Text_save_editsongs_Click (cognitive 47): TLSE_concertedit.Text_save_editsongs_Click has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f221540b4fe39ca7738f42b1813db70f36c0070305e34906d0cd040a8cd9755e"}},{"ruleId":"D2","level":"warning","message":{"text":"Miimusic_edit.Text_save_Click (cognitive 47): Miimusic_edit.Text_save_Click has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3a6a8a7b0169276da16650ff9e43e7a3a0062f2cf7daca257a08785a98ec79"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writemii (cognitive 40): TL_SaveEditor.Writemii has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51383}}}],"partialFingerprints":{"codehealthFindingId/v1":"565e297a097b3843d53f6530545b4bb78d75cd03dfd0a0867d6d01d9fefbe485"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Text_menu_save_Click (cognitive 39): TLSE_itemsedit.Text_menu_save_Click has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeca14f818cd6f7b9940ee869b9a7eea6a65241ec0e1e876e6a7c46be98196b"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.Check_resetnewsflash_CheckedChanged (cognitive 35): TLSE_extras.Check_resetnewsflash_CheckedChanged has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d183f988355b65475d5291cd0c7ffab45237abba4731e56d7d8edc7e34378bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist4 (cognitive 33): TLSE_Jrelationships.Writefriendlist4 has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":165387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4cb160c4c3de069c39dc755dfd818e39ad668c800103afa9d1f6c71651e810"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist4 (cognitive 33): TLSE_relationships.Writefriendlist4 has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":277010}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebe98e6a9707852a9e82ce1f263480e312188ac7ac6f0e77c6af7dbdc4eee46"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist2 (cognitive 30): TLSE_Jrelationships.Writefriendlist2 has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_Jrelationships.Writefriendlist3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":135257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b8cdc2968dc593ff3bd2d7988427d3ac910c74ac211ceb5f27e18df378f619"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist3 (cognitive 30): TLSE_Jrelationships.Writefriendlist3 has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_Jrelationships.Writefriendlist2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":150322}}}],"partialFingerprints":{"codehealthFindingId/v1":"643d8f7830171b66231551e6c8e7b8a8dff543002b71af795b28a992438a2997"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miistatus.Writemiistatus (cognitive 30): TLSE_miistatus.Writemiistatus has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fd3598b8509cef0f083efd43351fe0ccd3f1d2c7f2d1b4d460102070f726b4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist2 (cognitive 30): TLSE_relationships.Writefriendlist2 has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_relationships.Writefriendlist3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":246880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b032d8afa609967339007e13a4c0e371295253e4a072c13c6a6b855ce57d78"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist3 (cognitive 30): TLSE_relationships.Writefriendlist3 has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_relationships.Writefriendlist2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":261945}}}],"partialFingerprints":{"codehealthFindingId/v1":"79813ab1c6365bc8315c44da750c327c3ec23d2fcf0926785df9fe173497dcdf"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_Jrelationships.Writefriendlist (cognitive 29): TLSE_Jrelationships.Writefriendlist has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":120794}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a2d10f5d49d033fd2b28a483e1572d28e6d654a98d810a45e7c9148860e12"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_1_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_1_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8de14cc184442e0574afb74eabe9ff97b3f4021c7a58d881b7bc61c5ce2596"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_2_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_2_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee3950bc336e52afdb3bc62a082b50524fde72da91e3423f51609ee6873c65e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_3_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_3_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd310839261e47c392284974f310b27f01b9bdb748c3d9f88c39077f62e5bee1"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_4_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_4_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"30341c206f2ce8bf1617f89f5e0585d2544eb817c2f221eab52e0827ee6076b9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_5_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_5_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa8bbaf12285e197c1319c463d13c74789f118fbb9069fc5d597383d14ed3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_6_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_6_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fd95b8c27e56de26dfcb803bdd94168a5ca855c5361fef041f8dea558705fc"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_7_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_7_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3029}}}],"partialFingerprints":{"codehealthFindingId/v1":"69754afcad1ed3aebae1acbfbf39cf132da353fb52b520a9ed53785c0635c36e"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_miiinventory.valu_itemmii_8_ValueChanged (cognitive 29): TLSE_miiinventory.valu_itemmii_8_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TLSE_miiinventory.valu_itemmii_1_ValueChanged, TLSE_miiinventory.valu_itemmii_2_ValueChanged, TLSE_miiinventory.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"043caf8f9019f557264eb7e28a91f3ffaf9d1d566632285466df92df66814b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_relationships.Writefriendlist (cognitive 29): TLSE_relationships.Writefriendlist has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":232417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7a3ad654060a54b67f5bacf84c71cb880f6d2828c32725464d9d3b662fcf4"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_1_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_1_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16844}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c700302dfdbd65b54b8f184e779626fc39797f0138dea8e0ba45d364c74fc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_2_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_2_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16906}}}],"partialFingerprints":{"codehealthFindingId/v1":"80efebf3148e96bfe8c1a384d83ec4d6dacb3ef02cdcd96ac33c990f33e827ca"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_3_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_3_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_4_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":16968}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2f4ee11f734a093123534c874e57bb526a97bc5921aaaafb00d9a72e8bbec7"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_4_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_4_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17030}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d865aa68bc3c896653bae9c674001125d734553e817945355b6cf666d7be50"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_5_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_5_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17092}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cf0ead1e34751899ee9bff18e22946f2e7fd94d9d19702a3c78db777d128a6"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_6_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_6_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4857dc9755a11a35ee51e92931b7083160f504ffe9fa06140a0ce8210c57692a"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_7_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_7_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17216}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ac0015e9946b6035a9612a50910e5ab55dd3e2571fdb0e7dd0159c6d7fed1c"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.valu_itemmii_8_ValueChanged (cognitive 29): TL_SaveEditor.valu_itemmii_8_ValueChanged has cognitive complexity 29 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 7 other methods here (TL_SaveEditor.valu_itemmii_1_ValueChanged, TL_SaveEditor.valu_itemmii_2_ValueChanged, TL_SaveEditor.valu_itemmii_3_ValueChanged, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17278}}}],"partialFingerprints":{"codehealthFindingId/v1":"716f28d76ecb9fc6b2b5e946619059aea5b5aa71d153e11acab97663a73d5644"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_allmiis.Text_restore_Click (cognitive 26): TLSE_manag_allmiis.Text_restore_Click has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"db459d32a98fd01fd963259edf64335e6fbf962a3418b561a8f9595f4cc87793"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_extras.Check_resetstpspp_CheckedChanged (cognitive 23): TLSE_extras.Check_resetstpspp_CheckedChanged has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccf836f3fabc29fa0f2598c6f95316d44c65cf3fc3da149183abdf5f602835d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writefoodsitems (cognitive 21): TLSE_itemsedit.Writefoodsitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_itemsedit.Writeclothesitems, TLSE_itemsedit.Writetreasuresitems, TLSE_itemsedit.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7583f628bd8f633289cf1843185df873a06c2c031040b77b33cfe4eb8975fa1c"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writeclothesitems (cognitive 21): TLSE_itemsedit.Writeclothesitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_itemsedit.Writefoodsitems, TLSE_itemsedit.Writetreasuresitems, TLSE_itemsedit.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"30380b3521a028b5f5c9438123ba9baf4cbbfd34f9910142739be33440a38e15"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writetreasuresitems (cognitive 21): TLSE_itemsedit.Writetreasuresitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_itemsedit.Writefoodsitems, TLSE_itemsedit.Writeclothesitems, TLSE_itemsedit.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd29a5f04e6fb143885bfda74d48a042e2e251f85cda1e57a6a13fcd5f60aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writespefoodsitems (cognitive 21): TLSE_itemsedit.Writespefoodsitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TLSE_itemsedit.Writefoodsitems, TLSE_itemsedit.Writeclothesitems, TLSE_itemsedit.Writetreasuresitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b225da8e2e23df8d4e614feb2093ce57b0e7a272bac3833ecbcceab7734cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writefoodsitems (cognitive 21): TL_SaveEditor.Writefoodsitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Writeclothesitems, TL_SaveEditor.Writetreasuresitems, TL_SaveEditor.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":9973}}}],"partialFingerprints":{"codehealthFindingId/v1":"2870d85d19cf42fc788953ba72033351311468a89ee94f35bd4e85f4593bc683"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writeclothesitems (cognitive 21): TL_SaveEditor.Writeclothesitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Writefoodsitems, TL_SaveEditor.Writetreasuresitems, TL_SaveEditor.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10003}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4949508e21f357fb818ecd0c10f5b6ce9362d93d981d4b108a07e1e752721f"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writetreasuresitems (cognitive 21): TL_SaveEditor.Writetreasuresitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Writefoodsitems, TL_SaveEditor.Writeclothesitems, TL_SaveEditor.Writespefoodsitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6eced9e08b865f2e191ba5f149293f884e66ee62d4197da857f7f17a64c6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writespefoodsitems (cognitive 21): TL_SaveEditor.Writespefoodsitems has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: 3 other methods here (TL_SaveEditor.Writefoodsitems, TL_SaveEditor.Writeclothesitems, TL_SaveEditor.Writetreasuresitems) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01ee2ddb81ab65b8689ba72fabdef2d26f849b70f7b0f2e6347a475cf46f436"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_hub.Checkupdates (cognitive 18): TLSE_hub.Checkupdates has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca77db3d4f044cf048a67f221aab6f07a7c8c40a19a06d738109dd6fd4793d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writeinteriorsitems (cognitive 18): TLSE_itemsedit.Writeinteriorsitems has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_itemsedit.Writegoodsitems) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0805a4c2b4cc5d299d246b442fdc644f4943ab8049d8245a2738d9ca1a30dd"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_itemsedit.Writegoodsitems (cognitive 18): TLSE_itemsedit.Writegoodsitems has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TLSE_itemsedit.Writeinteriorsitems) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3143}}}],"partialFingerprints":{"codehealthFindingId/v1":"be35dd5bed1cf2235fa98fa65ab738f618aee6d49c60a8666706ae99883ec815"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Checkupdates (cognitive 18): TL_SaveEditor.Checkupdates has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4ca4cb821861cf8515bb4921fffe1c3d9acfe7eaaf4934866e8de653f9de6d"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Resetnewsflash (cognitive 18): TL_SaveEditor.Resetnewsflash has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":6133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad6694224010b034b6277e3618246792283e07ccc7ca38500414eb68e49b768"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writeinteriorsitems (cognitive 18): TL_SaveEditor.Writeinteriorsitems has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TL_SaveEditor.Writegoodsitems) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12628}}}],"partialFingerprints":{"codehealthFindingId/v1":"504530d8403b66c81d016a564379c3e1a035ed7f8fb1682e06eda5945f83ec1e"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Writegoodsitems (cognitive 18): TL_SaveEditor.Writegoodsitems has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (TL_SaveEditor.Writeinteriorsitems) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12655}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d00e4b43624c1c9a3cb0a5a2c15b3ed4f8bb4d0b708e62769109dc0c3f599"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_manag_travelers.Text_restoremii_Click (cognitive 17): TLSE_manag_travelers.Text_restoremii_Click has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b39a0f1472465de18e754131fb69d2833a75f3375672aed0dc32ba259e17987"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.Text_menu_open_Click (cognitive 17): TL_SaveEditor.Text_menu_open_Click has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62e06c635b6f0b1734d2a7efe43f4ed45da45510cb01029e03149ff82344b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"TLSE_hub.Text_menu_open_Click (cognitive 16): TLSE_hub.Text_menu_open_Click has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b384bcb4e28dc2efb61365229544e02055fdd253bd467ebb0d99b715e73d3cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TL_SaveEditor.readmusic (cognitive 16): TL_SaveEditor.readmusic has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":8891}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6faba81f7d0df6967bad9cb01caaef469eb0ffb3b38f91707483fd36e8e89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_relationships.vb: FileTooLong \u2014 292277 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 291777 over it, 584.55\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":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c45dca727038af45fd5d165f3922487be0bf284aa7e661f520ac8ad7dde9a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Readfriendlist: MethodTooLong \u2014 Readfriendlist runs 40214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40114 over it, 402.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80579}}}],"partialFingerprints":{"codehealthFindingId/v1":"26423da2cfc6ac88b6fbe3c901a164ad041e864e99006bfa15a08914e3893640"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Readfriendlist: MethodTooLong \u2014 Readfriendlist runs 40214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40114 over it, 402.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":192202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f289f2d3f9744f8b5bdb6d38358a5533efe75fadc0333490c5dc091f2a2b0eee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_Jrelationships.vb: FileTooLong \u2014 180656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 180156 over it, 361.31\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":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66296c574e4c8f9702d472b38d22ea1c080db3295258f2709092d766b067cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi-Life-Save-Editor/Form1.vb: FileTooLong \u2014 120815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 120315 over it, 241.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":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7dcb59b1c39be23b8e5118e1cfb7578f9db7e43d8a46bce16e48e544ff5575"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Writefriendlist4: MethodTooLong \u2014 Writefriendlist4 runs 15674 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15574 over it, 156.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":165387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed39ccb31287bab9cb578cdebddb9dcb5a0fea5e6327e01f9c35d12f94a26b24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Writefriendlist4: MethodTooLong \u2014 Writefriendlist4 runs 15674 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15574 over it, 156.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":277010}}}],"partialFingerprints":{"codehealthFindingId/v1":"38752c96190d494489304acbc06208cdb12eb987040168c07118b980753fd02a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Writefriendlist2: MethodTooLong \u2014 Writefriendlist2 runs 15064 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14964 over it, 150.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":135257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb289b706b31e3d0b0d85db248f193e257f41ff7a394dd68aa6b7f4c4e37601d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Writefriendlist3: MethodTooLong \u2014 Writefriendlist3 runs 15064 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14964 over it, 150.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":150322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab20801eae5fa7f842b71fab0c35f09f1af09734d68d7d524132852c82ba775"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Writefriendlist2: MethodTooLong \u2014 Writefriendlist2 runs 15064 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14964 over it, 150.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":246880}}}],"partialFingerprints":{"codehealthFindingId/v1":"276ab895cbe8337c27c413f9bfcecc229c6ab8afafdc88f9d445c21438d7bb15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Writefriendlist3: MethodTooLong \u2014 Writefriendlist3 runs 15064 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14964 over it, 150.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":261945}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54445e1abdab1b962f374cf6f84c8f30b2a0ce021b4a317f7b7fe4b29ddbc44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Writefriendlist: MethodTooLong \u2014 Writefriendlist runs 14462 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14362 over it, 144.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":120794}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d97f0577bd572f3fd6e05bd19e1c395ea82db41112a7d6edda55346865de82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Writefriendlist: MethodTooLong \u2014 Writefriendlist runs 14462 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14362 over it, 144.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":232417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad08272b486ea41ef52ffe7ae5a348f1fa4bc9bcc27c3d9ae07620596fdf9b89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Namerelavalu: MethodTooLong \u2014 Namerelavalu runs 11052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10952 over it, 110.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":53327}}}],"partialFingerprints":{"codehealthFindingId/v1":"391fd31cb991428f024dca99620bcf0daaab7f6acfd3be847387dda6c33c6b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Namerelavalu2: MethodTooLong \u2014 Namerelavalu2 runs 11052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10952 over it, 110.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":64405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c660a0af034314669bf3459b6e5c09521dbf3d88a3a98c9fc667fea6f191e999"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Namerelavalu3: MethodTooLong \u2014 Namerelavalu3 runs 11052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10952 over it, 110.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":75482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0068913c08d7fbe808a8b85b6c141e3f3471255decab264a5904440cd5542c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Namerelavalu4: MethodTooLong \u2014 Namerelavalu4 runs 11052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10952 over it, 110.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":86559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e235a26bd0c5358ce46fc5a8fe53f5dc642164f9c8e81c5a676103ebb57166e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TL_SaveEditor: TooManyMethods \u2014 120811 significant lines (blank, comment-only and punctuation-only lines excluded), 1367 methods. The bar is 30 methods; this is 1337 over it, 45.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b97089a5a97e98292912a3bce09c09d641d45655f9e92efbc3ed7e0ba06236"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluUS: MethodTooLong \u2014 NamerelavaluUS runs 4052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3952 over it, 40.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":97636}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e767cf166f95ef3de462e288f10b6c3dbe4a26c4ef69f66373d0c0875542f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluUS2: MethodTooLong \u2014 NamerelavaluUS2 runs 4052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3952 over it, 40.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":101689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8d805a1a1bce9985195b1438628d37ba80b696aadf688cd95450679b6549f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluUS3: MethodTooLong \u2014 NamerelavaluUS3 runs 4052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3952 over it, 40.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":105742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c113303bdd153b9e93d75baa017cfc545a6544ac02953ec820ce860d0c99331"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluUS4: MethodTooLong \u2014 NamerelavaluUS4 runs 4052 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3952 over it, 40.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":109795}}}],"partialFingerprints":{"codehealthFindingId/v1":"5286d148f428b0c80222794629b1821e0d32624920450357a03e069f075f3026"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_foods_language_SelectedIndexChanged: MethodTooLong \u2014 Select_foods_language_SelectedIndexChanged runs 3717 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3617 over it, 37.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":33479}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebcfb51d1ff7cf15c095422cd69216745c90d1b07afecb8d5776817c7fefc86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Savefileregion: MethodTooLong \u2014 Savefileregion runs 3310 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3210 over it, 33.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8febad0987effee315d41f15b74a041fbce6624af2ebb76c747ea3a4ce72e955"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_miifoods.vb: FileTooLong \u2014 16201 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15701 over it, 32.40\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":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66683c731ffcc45ce5dbd32ccde4702a595d41a0bfe72cdfb8e0f9787f81c75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiinventory.Savefileregion: MethodTooLong \u2014 Savefileregion runs 3207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3107 over it, 32.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2a8a8501b80bbedd0e0e64f526e0c6f9e4e241b4983535a4d3165da2da4069"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miistatus.Savefileregion: MethodTooLong \u2014 Savefileregion runs 2807 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2707 over it, 28.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb712e2c193d485f30aa36f34644e9fe87faac48ae551d899be4eb8466253aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_interactions.vb: FileTooLong \u2014 12289 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11789 over it, 24.58\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":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7502a54f62331b9bceeb4211b0c54ddbbbd025d54ed029d4e91904941aba70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_voicepersonnality.Savefileregion: MethodTooLong \u2014 Savefileregion runs 2408 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2308 over it, 24.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9437edfaa05a955b12cd0feb6987ca7443e768a3ceec7c64a7e83f442b2b347"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_travelers_status.Writetravelers: MethodTooLong \u2014 Writetravelers runs 2309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2209 over it, 23.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28f9f31216fa2572dd35b86fd2194d15a733149942e331a63210e1124de7299"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Button_setallrelation_Click: MethodTooLong \u2014 Button_setallrelation_Click runs 2110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2010 over it, 21.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c558b2ef0afee57ea7c0552d4001e614903e0f8283aae12fe8bd6c437e499bdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Button_setallrelation_Click: MethodTooLong \u2014 Button_setallrelation_Click runs 2110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2010 over it, 21.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46588}}}],"partialFingerprints":{"codehealthFindingId/v1":"69079a26e0d7a12852519ba4804639c083a0b6166b9168805d09acf36fb262a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Button_setallrelation_Click: MethodTooLong \u2014 Button_setallrelation_Click runs 2110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2010 over it, 21.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2460e8b7b662f51a5aba7df62757262e6c79685b6eade97941b2a6daa6d3140"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Savefileregion: MethodTooLong \u2014 Savefileregion runs 2007 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1907 over it, 20.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":10909}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1e7ceb28a3b3fa34f7e83d3dba05085d0aa02291c92b6f773be2c97e20cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.readfriendlist: MethodTooLong \u2014 readfriendlist runs 1916 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1816 over it, 19.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":49416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b1e6571839b6b11154f10302d2a83f12e73c7222f7be50d17b186bece754cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_travelers_status.Readtravelers: MethodTooLong \u2014 Readtravelers runs 1708 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1608 over it, 17.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6b0e8fd09dd1eb98fb8c8c33146083d2b33d02b2e37c89b4f2b22da11aaaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_extras.settummyfullempt: MethodTooLong \u2014 settummyfullempt runs 1610 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1510 over it, 16.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161da9e81eb5f9d4180c2d1b4864a1d6ca69f5d4368b70b3b69d572ebe2ad76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.settummyfullempt: MethodTooLong \u2014 settummyfullempt runs 1610 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1510 over it, 16.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":7123}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b1f759e60f81e74373ffbb02023016e708e9e23898685aac17a7057b1c4ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_relationships: TooManyMethods \u2014 292273 significant lines (blank, comment-only and punctuation-only lines excluded), 452 methods. The bar is 30 methods; this is 422 over it, 15.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42aaa844f77f549d424a1d585ca2e917b1efa23e2de05048b11d5e0490c4380"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_Jrelationships: TooManyMethods \u2014 180654 significant lines (blank, comment-only and punctuation-only lines excluded), 451 methods. The bar is 30 methods; this is 421 over it, 15.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d718654faeb2817cf2fc6ab0b2d34acdf931fd239b8ce14685e9211a4e1bc5c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_1_ValueChanged: MethodTooLong \u2014 valu_friend_rela_1_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":48919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d558148c943baf08429e2751c688ab4cbb84fbee82845ad1e91f8dbab1357140"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_2_ValueChanged: MethodTooLong \u2014 valu_friend_rela_2_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":50327}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fc8e65626f35cf4f2bccb99c57dbc5b561516603176dadfa86247bc66adba9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_3_ValueChanged: MethodTooLong \u2014 valu_friend_rela_3_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":51735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52132b2e1e451f9a229d54fb61b43d6940d53788b9b240b56f506ecf27bcf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_4_ValueChanged: MethodTooLong \u2014 valu_friend_rela_4_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":53143}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c74e466bffcbffc80ea3f94ac7deb174e54c2db3ba740ae5464b30d5d74296"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_5_ValueChanged: MethodTooLong \u2014 valu_friend_rela_5_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":54551}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ecbd970fb9e5fd4e82a90a1ce5871cb8908d419bd96ff65bdbd16aa8363b4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_6_ValueChanged: MethodTooLong \u2014 valu_friend_rela_6_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":55959}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c40065eb410139d027d850b14bf5c0cfdd94f5ec48bfa382d08a8e0af3dab5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_7_ValueChanged: MethodTooLong \u2014 valu_friend_rela_7_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":57367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce539bfd80aca5bda41b28ceaead6ad732819633ea47ae30ea55ff51c2d5f3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_8_ValueChanged: MethodTooLong \u2014 valu_friend_rela_8_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":58775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f6bb62b4ccaefc92a54184ea38cfce3170d8f51fcb81573d702ab52b54200"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_9_ValueChanged: MethodTooLong \u2014 valu_friend_rela_9_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":60183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4816d59c4bf14a8f1a44597d0a376c4f2698e3728fd0b9cf6faae2e8b857817"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_10_ValueChanged: MethodTooLong \u2014 valu_friend_rela_10_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":61591}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe31492194d418748a3d64a767026c4dcd1c54b69fa9a4ab31f55fa806babfe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_11_ValueChanged: MethodTooLong \u2014 valu_friend_rela_11_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":62999}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd28499f377f5c2def4d28819b9891e13540c1fb9ab4422aef18b933aac5bdfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_12_ValueChanged: MethodTooLong \u2014 valu_friend_rela_12_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":64407}}}],"partialFingerprints":{"codehealthFindingId/v1":"df018faccbd552a237e01e7cc02300e76b48f264e4909127b6f62cb68644c301"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_13_ValueChanged: MethodTooLong \u2014 valu_friend_rela_13_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":65815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2647fac5d010e0ef4ae2448e3e33f6d0b03a780285cacd148bffed80f0a145a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_14_ValueChanged: MethodTooLong \u2014 valu_friend_rela_14_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":67223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f825900b62bd30478eb1d06ad3f863d9e892e4122f70b0c728767ac363cbd0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_15_ValueChanged: MethodTooLong \u2014 valu_friend_rela_15_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":68631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1d418e0ef74eacb1b79dadedff71eb4aa66a7f420030a2e21c12d0dce07f5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_16_ValueChanged: MethodTooLong \u2014 valu_friend_rela_16_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":70039}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e914509b317f8adcda7b9b64f403b9632e4a35d32faed2a16c1e20cf7068c25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_17_ValueChanged: MethodTooLong \u2014 valu_friend_rela_17_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":71447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfb355a4eb677fdbed27f3c117b9cfee9aa5dd80365044896a5fbc98f9414c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_18_ValueChanged: MethodTooLong \u2014 valu_friend_rela_18_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":72855}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2331eb55adbc8df358a9e50cd43c3503b9206a54c2f422508ff8d9403910b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_19_ValueChanged: MethodTooLong \u2014 valu_friend_rela_19_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":74263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974fb05ee2f0f425a5a0ce41f0ba70bb7096cfc8960b2c0f5d0004e54460bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_20_ValueChanged: MethodTooLong \u2014 valu_friend_rela_20_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":75671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e516ec4616a881dbdb9c5ac3f9542743b961d37e5bf32107e0b79710945839c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_21_ValueChanged: MethodTooLong \u2014 valu_friend_rela_21_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":77079}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd9fb12a2aa25b591020fe2a98f251e6e41767466b40a7c95f76d8b9830594"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_22_ValueChanged: MethodTooLong \u2014 valu_friend_rela_22_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":78487}}}],"partialFingerprints":{"codehealthFindingId/v1":"69468d66863897d487cc73f6c9c9a42293495f8c925379400f526da4e1ddf6cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_23_ValueChanged: MethodTooLong \u2014 valu_friend_rela_23_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":79895}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fc95a37a7dd8fca9be20e508f961545abc0eb759d1390b12b9adaaeaad7e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_24_ValueChanged: MethodTooLong \u2014 valu_friend_rela_24_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":81303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cf8e57d6c92237c647380c606bdba8741daddc6b75704a4ad8f8593bf937b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_25_ValueChanged: MethodTooLong \u2014 valu_friend_rela_25_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":82711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4477b93767d6764269f0fd81be2300169e59149589698afc09acf2fde1af926"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_26_ValueChanged: MethodTooLong \u2014 valu_friend_rela_26_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":84119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4158afe0c6d5a14ccc63c52909a4766802233a1467ddc491b5356db7b9cc4e19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_27_ValueChanged: MethodTooLong \u2014 valu_friend_rela_27_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":85527}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb694ecd703941c8aa7f629283444ae9345dc7bc04acb2cf429f7fc9e44b6f3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_28_ValueChanged: MethodTooLong \u2014 valu_friend_rela_28_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":86935}}}],"partialFingerprints":{"codehealthFindingId/v1":"74724a1172eeeaeb3608b06a2ef305af3b239826249781e52d7e4ed896df36c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_29_ValueChanged: MethodTooLong \u2014 valu_friend_rela_29_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":88343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c39c1131239eefa9c5976626d5aa2b6d6d52c1f8149cb5450153431bac9e1cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_30_ValueChanged: MethodTooLong \u2014 valu_friend_rela_30_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":89751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d6055a0e90db4aa8e1a387c3480a185cd6c38bc6ff3cb6e774af49eaf207a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_31_ValueChanged: MethodTooLong \u2014 valu_friend_rela_31_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":91159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f9e23e69299d9dca9f3d8f23b60baf2a993264aedc6bc91682e2db57cef9ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_32_ValueChanged: MethodTooLong \u2014 valu_friend_rela_32_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":92567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca9a4e5b9ec015b71cc548b284e30f7385e0d17bd021f8cf2f82dc52d7e385"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_33_ValueChanged: MethodTooLong \u2014 valu_friend_rela_33_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":93975}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b2a216e9ebaa479aac6fdb417177c154c2059268132fab1c7db43041e99ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_34_ValueChanged: MethodTooLong \u2014 valu_friend_rela_34_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":95383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833974fcd99e2145d9189d7d93cf7e9d526df91fbcb6db0be506f279081b888"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_35_ValueChanged: MethodTooLong \u2014 valu_friend_rela_35_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":96791}}}],"partialFingerprints":{"codehealthFindingId/v1":"c949408e2a105cc8cea64cd4b6c1b79da2d784cbf40eb0879e336906d151d606"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_36_ValueChanged: MethodTooLong \u2014 valu_friend_rela_36_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":98199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5346ec3213f253c6b6366ca8f4ccb58e8caa25336b1b3dde69b23d6c0d2c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_37_ValueChanged: MethodTooLong \u2014 valu_friend_rela_37_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":99607}}}],"partialFingerprints":{"codehealthFindingId/v1":"63508f161e42f9774209fc57e12931b903c3be893cbe93e761d8a0f76d495157"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_38_ValueChanged: MethodTooLong \u2014 valu_friend_rela_38_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":101015}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c911965f64e0c5d38c4b8c0cfec8ad66747bc95a1203c0df0cc56392e9607a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_39_ValueChanged: MethodTooLong \u2014 valu_friend_rela_39_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":102423}}}],"partialFingerprints":{"codehealthFindingId/v1":"770d93ecb9fde8e3f5f96c9ec7abe997106a1889871bb5ce6812c1838335925f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_40_ValueChanged: MethodTooLong \u2014 valu_friend_rela_40_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":103831}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6f4587ceab2b0288aab928b3c4daf4a534b8fc9708cf4ea8bac9fd862284d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_41_ValueChanged: MethodTooLong \u2014 valu_friend_rela_41_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":105239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc49e4cb0a1f30611195f17817c3690bc9c0314faf7dbd14a616b98cfad8c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_42_ValueChanged: MethodTooLong \u2014 valu_friend_rela_42_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":106647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0d9a83693e789460fbe717ff8951e99994d0264f6030a2e1376dd8a81e6ff9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_43_ValueChanged: MethodTooLong \u2014 valu_friend_rela_43_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":108055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c93a6769720100e15391a8f6d08ad19221e7319ab313dd342d2da89e2fba88d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_44_ValueChanged: MethodTooLong \u2014 valu_friend_rela_44_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":109463}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f7bae4e0c9c206580baeae00b2407d18b01066daf654bfba7b8e1b901807b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_45_ValueChanged: MethodTooLong \u2014 valu_friend_rela_45_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":110871}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab2fe13e510460c0407f42e9e196635b9e419442a53673c4f64057927831480"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_46_ValueChanged: MethodTooLong \u2014 valu_friend_rela_46_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":112279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84a433f38e300f08d4f5b6cc9571bc793ef71ecdfc254b61caebbc420fc977"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_47_ValueChanged: MethodTooLong \u2014 valu_friend_rela_47_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":113687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500e77690765130bc6236e0faf885fed3975da4a7c19860168eb0f2cd53455f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_48_ValueChanged: MethodTooLong \u2014 valu_friend_rela_48_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":115095}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7505d0ba77a8304b563206ddc3c5408608f41dc9214c858e0d2705cd606bc49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_49_ValueChanged: MethodTooLong \u2014 valu_friend_rela_49_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":116503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8334399ed2cdc63ccbe3c8f2e5883435e7fd2e287d714f9012abc46f63272b20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_50_ValueChanged: MethodTooLong \u2014 valu_friend_rela_50_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":117911}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf20a164802947b3b4d1d117393c0fd655484681323dcbf811a3e1ef859ee57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_51_ValueChanged: MethodTooLong \u2014 valu_friend_rela_51_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":119319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac7be5047cfbc4f80054c5ef31e399b26fdb397d47f3899f1b12fe1b6cc7a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_52_ValueChanged: MethodTooLong \u2014 valu_friend_rela_52_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":120727}}}],"partialFingerprints":{"codehealthFindingId/v1":"1382b396471454371664c329fbc75a075f2ae29c5541428e6ece9670595c0f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_53_ValueChanged: MethodTooLong \u2014 valu_friend_rela_53_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":122135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0496a540206b86c94e2308167bc00b433b20c887b94ffff7154d3d88d241714d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_54_ValueChanged: MethodTooLong \u2014 valu_friend_rela_54_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":123543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6744f210830907a700f9a14248cb3388fd9e571741f21c856dafb053e34c3cf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_55_ValueChanged: MethodTooLong \u2014 valu_friend_rela_55_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":124951}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e370a2824fb2f3b3fb3ee705cc0694a5d46185a6befeb6ceb26247d7f4331"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_56_ValueChanged: MethodTooLong \u2014 valu_friend_rela_56_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":126359}}}],"partialFingerprints":{"codehealthFindingId/v1":"9899330064b195d01dd99951a0ac81cd9e65bc8cba22aa3d9f4fc5702574c33a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_57_ValueChanged: MethodTooLong \u2014 valu_friend_rela_57_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":127767}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c8c08a51eb2e02416aac51f8e7e560fd6d34063670d4adf0709e26f75f84e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_58_ValueChanged: MethodTooLong \u2014 valu_friend_rela_58_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":129175}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e23b7e8958e97f5e95f04d090df10902c1781a3b2ccc01c0f92b2b0d6337cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_59_ValueChanged: MethodTooLong \u2014 valu_friend_rela_59_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":130583}}}],"partialFingerprints":{"codehealthFindingId/v1":"354c748329e5e0349566a4d095a97ad483b45020d3db5195965d37121a661c73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_60_ValueChanged: MethodTooLong \u2014 valu_friend_rela_60_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":131991}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec81df1caa2ba5ba1629e5b182ffc43ab801e1d2fabee71c63f0fa3478e09a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_61_ValueChanged: MethodTooLong \u2014 valu_friend_rela_61_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":133399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a19e9662d2d2ff84e5b88ba68493c86049902a729fd188f3b2dffec14073d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_62_ValueChanged: MethodTooLong \u2014 valu_friend_rela_62_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":134807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73d7656c1b15b747b66b51982231bc14f89691ab6695601dd3e1691afe7197c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_63_ValueChanged: MethodTooLong \u2014 valu_friend_rela_63_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":136215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85b670469f68584e8285e4d552ce59e9c0c1bc588a2cac62bc57e554bc63d2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_64_ValueChanged: MethodTooLong \u2014 valu_friend_rela_64_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":137623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c623817ea2c9efafa85d62bd29a793970b1450c9b8974176732eb2ee4449bb97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_65_ValueChanged: MethodTooLong \u2014 valu_friend_rela_65_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":139031}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a891282c9895b112d949ce1529d0d993b1da55111c58069e097ed775d721be7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_66_ValueChanged: MethodTooLong \u2014 valu_friend_rela_66_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":140439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0cf533c92b7ae89b521fbe75d851a33c9acafa9225a4d964ec47fb41e20bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_67_ValueChanged: MethodTooLong \u2014 valu_friend_rela_67_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":141847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6858ddee18f31fd846d618993addeaa01b7f5de3b7faba2c04f576e5ac92041"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_68_ValueChanged: MethodTooLong \u2014 valu_friend_rela_68_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":143255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2526bd6b7d6a353fe66aa93375dcb327ecd30a17ba7b1e755f8b5d0960c80c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_69_ValueChanged: MethodTooLong \u2014 valu_friend_rela_69_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":144663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3127417e9476e76e2660cfd7aaf82cf07ed0550995940517357a59e8b14383"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_70_ValueChanged: MethodTooLong \u2014 valu_friend_rela_70_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":146071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00a281bb6658f3319ac32897f9ee7333461ef0af804c6ffff5b9a6ae2de29e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_71_ValueChanged: MethodTooLong \u2014 valu_friend_rela_71_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":147479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d09f05e2ee4bdd0e87650dc705c8f967264e7b7f6513f298ed4641e1d528a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_72_ValueChanged: MethodTooLong \u2014 valu_friend_rela_72_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":148887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0ecbab36e98081e4df97c03872a43788672db4b191380111a975b5c9230824"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_73_ValueChanged: MethodTooLong \u2014 valu_friend_rela_73_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":150295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b93c6d3d12e82b73d2d0e8cfaff98f42d313cdc0a44ef109a087f301d210ede"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_74_ValueChanged: MethodTooLong \u2014 valu_friend_rela_74_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":151703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd9ffb35898e2ad20bc3a322a66380f5506e11889396db3bc7e0e05b12f9db6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_75_ValueChanged: MethodTooLong \u2014 valu_friend_rela_75_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":153111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4507e12885cd107bcc3648c385e3f1dec82fca289b9040455b0ba2147bd881c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_76_ValueChanged: MethodTooLong \u2014 valu_friend_rela_76_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":154519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca34a65518b475792fd023e6ac509541fa5e2d2c5601af5f57dcc3550a735ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_77_ValueChanged: MethodTooLong \u2014 valu_friend_rela_77_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":155927}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccbea52a5748e461caba2ef1d93b9bf6f047aae09846240bc4c3387eb68f83a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_78_ValueChanged: MethodTooLong \u2014 valu_friend_rela_78_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":157335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e469a8131f9f060ece88ef4b4de236519587e82fb35f583eb7bdabc6f97920b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_79_ValueChanged: MethodTooLong \u2014 valu_friend_rela_79_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":158743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f68b795133ca1b97f9aec58584c7e70d09f5c9cb5503b5c4eab3a5f3c3e45c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_80_ValueChanged: MethodTooLong \u2014 valu_friend_rela_80_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":160151}}}],"partialFingerprints":{"codehealthFindingId/v1":"de56fc116051a500df4a4bf7523e3f85c65f37d77a71a22bcf1f31705fa58dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_81_ValueChanged: MethodTooLong \u2014 valu_friend_rela_81_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":161559}}}],"partialFingerprints":{"codehealthFindingId/v1":"963bdd9ac4d4abd5d81ea0f936d7b79e973e8c2a6083c0e77c93465262c8856d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_82_ValueChanged: MethodTooLong \u2014 valu_friend_rela_82_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":162967}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b78d8cf798d9ae8a7b882b665c8f5c35a21de2d206a4bf4a2b87169020f8eb8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_83_ValueChanged: MethodTooLong \u2014 valu_friend_rela_83_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":164375}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c0bbb18520164e65a146a125a8b0a2584a7a1dfb359c286aa10a5aad0af221"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_84_ValueChanged: MethodTooLong \u2014 valu_friend_rela_84_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":165783}}}],"partialFingerprints":{"codehealthFindingId/v1":"893a57d1ea46ac7622e0aa8fd40493261be6603f09000a2cb34607de8635346e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_85_ValueChanged: MethodTooLong \u2014 valu_friend_rela_85_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":167191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb3098f7fe0775f2e77bef287f01e7e4694cc1d5949854a0849010471f906d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_86_ValueChanged: MethodTooLong \u2014 valu_friend_rela_86_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":168599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da192c2df9995aa14894951a73d746bde979ec5a0084fc78983990759e306a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_87_ValueChanged: MethodTooLong \u2014 valu_friend_rela_87_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":170007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbaa1d3b0a41e7242bbb2fb37cbea638c4faa514f3387c029e73ef13988feb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_88_ValueChanged: MethodTooLong \u2014 valu_friend_rela_88_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":171415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fb05f42921e6a1d38120fc8928a06836130180ee6d5dede72b2b173cf96c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_89_ValueChanged: MethodTooLong \u2014 valu_friend_rela_89_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":172823}}}],"partialFingerprints":{"codehealthFindingId/v1":"99665f40a59d24d738cb7ad6987afe39ea560209d16f2e686ffbf2cc18563f75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_90_ValueChanged: MethodTooLong \u2014 valu_friend_rela_90_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":174231}}}],"partialFingerprints":{"codehealthFindingId/v1":"377c9e2ba78b090ad14932265c794f87c8a681f5f750591d345f23a11b25926c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_91_ValueChanged: MethodTooLong \u2014 valu_friend_rela_91_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":175639}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c155d9f3476f697ab8484c1e9ab99816f41c5ffa8adb31e6bbd45e2d29e108"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_92_ValueChanged: MethodTooLong \u2014 valu_friend_rela_92_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":177047}}}],"partialFingerprints":{"codehealthFindingId/v1":"427f3b7e22cec69b60dc7ae4c6b5dd12886e35b03384d2f2c3c71fab153e216e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_93_ValueChanged: MethodTooLong \u2014 valu_friend_rela_93_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":178455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c780817035afa7ead015b9ed1e3237710632db3c0686a173357999ab6872f40f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_94_ValueChanged: MethodTooLong \u2014 valu_friend_rela_94_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":179863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4fa9abd64269c633553eb0aecfdd9adf412b3f2f7873bf8c1bcc8e94a1de7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_95_ValueChanged: MethodTooLong \u2014 valu_friend_rela_95_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":181271}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b31ef23ea48ea6a442371901008f14267cac23f68f009b7b391c312e951745"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_96_ValueChanged: MethodTooLong \u2014 valu_friend_rela_96_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":182679}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc8b73aa24ce64d48d55f117381f101beba36c927e50e935571bb11091188fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_97_ValueChanged: MethodTooLong \u2014 valu_friend_rela_97_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":184087}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8e3ac7da232fa93d99de245bd91797ee84b29425028b358fc46d4f65604bcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_98_ValueChanged: MethodTooLong \u2014 valu_friend_rela_98_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":185495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0103ac180f2b8b576fba59b8a7807f9cbedadee7d3ce3ea257af24377e92c46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_99_ValueChanged: MethodTooLong \u2014 valu_friend_rela_99_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":186903}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b1bd03d4c29f5615dc9a7e525e4224eeaa0cf344ab3f49103b893673805edf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_friend_rela_100_ValueChanged: MethodTooLong \u2014 valu_friend_rela_100_ValueChanged runs 1407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1307 over it, 14.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":188311}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e46c4de3292d9c5da78624c493642297270d1db2ea55e5fece85baed37dfd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_itemsedit.Writehatsitems: MethodTooLong \u2014 Writehatsitems runs 1328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1228 over it, 13.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fb96a60c003d156cc72c038dabff5dc386718318f30647e1d37b83530f540c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Writehatsitems: MethodTooLong \u2014 Writehatsitems runs 1328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1228 over it, 13.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10837}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed4dd070715e33132bd2ecba16a19ae464e3cf7fb466bba5ef527531e127326"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.InteractionlistUSA: MethodTooLong \u2014 InteractionlistUSA runs 1304 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1204 over it, 13.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":121219}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c9f9e516e337135f650a47857170c3c3fd1e38b3b6f2a2f91074924c6920cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.InteractionlistEUR: MethodTooLong \u2014 InteractionlistEUR runs 1293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1193 over it, 12.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":119925}}}],"partialFingerprints":{"codehealthFindingId/v1":"598b927b3f693dc65cdb78febec6e967bf02208f5c1e0f7717187d9832de6a13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_miiinventory.vb: FileTooLong \u2014 6195 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5695 over it, 12.39\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":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5533d123498041604ecb80edb568e31150cd3aee6467dbabe65c7b844235c909"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Patchfriendlist: MethodTooLong \u2014 Patchfriendlist runs 1216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1116 over it, 12.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34d2f0c20a475757e0fabe45e40aac337bcfa5bd3d78b8c496683fa8072f8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Readinteraction: MethodTooLong \u2014 Readinteraction runs 1210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1110 over it, 12.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e958851e591e6af0564ed6795dc1d69092f648109c6b3c94de282bc1fdb79a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_miiprofile.vb: FileTooLong \u2014 5904 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5404 over it, 11.81\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":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50e0812722ea30d8d1f90387f8a7f7ec5e87fdf9e9a27fa954ef5ad836fa0a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.InteractionlistEUR: MethodTooLong \u2014 InteractionlistEUR runs 1165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1065 over it, 11.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":4977}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b1f2b871c421892747a50b5e5fc914c2ff046ae635c95f5d01a173d2b0af06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_travelers_status.vb: FileTooLong \u2014 5702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5202 over it, 11.40\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":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e23bca85132174858b5730568932ebefe4f5186c58208ceb6224ccd63f346"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.valu_target1_ValueChanged: MethodTooLong \u2014 valu_target1_ValueChanged runs 1135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1035 over it, 11.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":9084}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd8b81aa28fccb836c085926b408809783192c090069d3bd3b9a82958fb8d97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_target1_ValueChanged: MethodTooLong \u2014 valu_target1_ValueChanged runs 1135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1035 over it, 11.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec712acca1f29d0ae0d6a2c8891dd8d59da3d56492a2dc12093fe7f05969590"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Writeinteraction: MethodTooLong \u2014 Writeinteraction runs 1111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1011 over it, 11.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":11380}}}],"partialFingerprints":{"codehealthFindingId/v1":"09865a0434984229e1f16fcded8ac1cf824c9e56760ab997ecf76ffb55eb327a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Savefileregion: MethodTooLong \u2014 Savefileregion runs 1005 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 905 over it, 10.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":6447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6f739c302775f0008c0fed87d57e1ed5ddf287544d575c4bb4eae86d9e270a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Readmii: MethodTooLong \u2014 Readmii runs 996 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 896 over it, 9.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":48419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0dc33ce0e757cb0d548904a674ca432c877be07e9384a4d3be7533c622a532"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_miistatus.vb: FileTooLong \u2014 4761 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4261 over it, 9.52\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":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67dc4947f71e1affa6495223d8d8b0be2b29d5af79e047b08f077c1d5d9518b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_fav_1_ValueChanged: MethodTooLong \u2014 valu_fav_1_ValueChanged runs 940 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 840 over it, 9.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80041be7d44ac54b6d66c63db1ecef8360ffc2edd85898a0ae98db5441c86bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_fav_2_ValueChanged: MethodTooLong \u2014 valu_fav_2_ValueChanged runs 940 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 840 over it, 9.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":7086}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5bf16fee8104bc969527525aa405304d8d0e1f7a372b5806f350820f54be0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_fav_3_ValueChanged: MethodTooLong \u2014 valu_fav_3_ValueChanged runs 940 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 840 over it, 9.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed0f7b240229d4e5bbe293417b854be186d9896c5f0fc91c990af2e3e1d45d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_allfav_1_ValueChanged: MethodTooLong \u2014 valu_allfav_1_ValueChanged runs 936 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 836 over it, 9.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed23caf38de1f0c85509f41bde7ac45929123473f99ae418ab7ec8237fe3a60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_allfav_2_ValueChanged: MethodTooLong \u2014 valu_allfav_2_ValueChanged runs 936 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 836 over it, 9.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":5208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892f87371ca491f19cac9fa944d3c597b8f29b841e97ecf74f16ad708e5deb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_worst_1_ValueChanged: MethodTooLong \u2014 valu_worst_1_ValueChanged runs 936 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 836 over it, 9.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":8968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77fcd85b9a1298c3e52ca275eee65278219d187ec5ede6a55d2d7b045fef329"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.valu_worst_2_ValueChanged: MethodTooLong \u2014 valu_worst_2_ValueChanged runs 936 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 836 over it, 9.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":9905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b7d32618bafe658463c8369e6c6764506a6b7be8b4f133e687a30eec322891"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_allfav_1_ValueChanged: MethodTooLong \u2014 valu_allfav_1_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2ac359bf643427ad61594a77ae72a33a7f0e4166c1ac86c9a5e2bef5bdfc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_allfav_2_ValueChanged: MethodTooLong \u2014 valu_allfav_2_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":41407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a2ec7762007861b05d930c6d8d4b2c6ea875c8e8c6c2a7f60d52a8ff5f3d80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_fav_1_ValueChanged: MethodTooLong \u2014 valu_fav_1_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":42341}}}],"partialFingerprints":{"codehealthFindingId/v1":"900be009fb21ef61dfc27738607c6f277a4eb03625d2f2d50aef7fce9d6da352"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_fav_2_ValueChanged: MethodTooLong \u2014 valu_fav_2_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":43275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37083fe463de11ddd473d34f8a68466d6723adef778568febbeeac9ff452f93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_fav_3_ValueChanged: MethodTooLong \u2014 valu_fav_3_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":44209}}}],"partialFingerprints":{"codehealthFindingId/v1":"907bbdd74582501bd53f263b92802b93286afd856c9e1d012e7855e3f00cd039"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_worst_1_ValueChanged: MethodTooLong \u2014 valu_worst_1_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":45143}}}],"partialFingerprints":{"codehealthFindingId/v1":"568bd310f0bbd91a7192d33af00a86702db612e5d2f2fea3e7d49a76f91816d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_worst_2_ValueChanged: MethodTooLong \u2014 valu_worst_2_ValueChanged runs 932 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 832 over it, 9.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":46077}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047c08bcb1c57df082787e474e2b48f7c04d8ee8a8d96a1a97844646b003beb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_miiinventory: TooManyMethods \u2014 6191 significant lines (blank, comment-only and punctuation-only lines excluded), 272 methods. The bar is 30 methods; this is 242 over it, 9.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7fc340f1fd0d324f56ef76b68771ecf6bf495da3a23365bae765b3f5cb24c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_extras.Check_resetmiiapart_CheckedChanged: MethodTooLong \u2014 Check_resetmiiapart_CheckedChanged runs 827 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 727 over it, 8.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0bd681c4e3525d6377e8fa4cfd29e60917f0fc0e2615dca95eb2d43a9f3ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_extras.Check_resetrelationship_CheckedChanged: MethodTooLong \u2014 Check_resetrelationship_CheckedChanged runs 827 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 727 over it, 8.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"005b469fc817c1982a2d1a23112dceb779a31bf63dfac5016db4ff643f43cafa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_extras.vb: FileTooLong \u2014 4086 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3586 over it, 8.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":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aaba5ed90af1e1b6b196eb07c4d9c9b363a8d77d54b40a9ca753f03e10eb99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_crcxmodem.readmiidata: MethodTooLong \u2014 readmiidata runs 810 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 710 over it, 8.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f51de84d99346c9578e9a987c5b20d283cbd209c463c7fcb44b1f1bbe1ae61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.resetmiiapart: MethodTooLong \u2014 resetmiiapart runs 810 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 710 over it, 8.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":5322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba6a41e26bda8ebc5f998c1a95d6c9ae7ba86f3608677e2aef22fe108119687"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Resetallrela: MethodTooLong \u2014 Resetallrela runs 810 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 710 over it, 8.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf349db773382811ced833d5f8cce8910cbf4cc0fdb5045e1b705a06ba2c123"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.readmiiname: MethodTooLong \u2014 readmiiname runs 809 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 709 over it, 8.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eadcbebf9ee3125542caabff8fdfbbb9070a71d0fe279486a127a9fedd6ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_itemsedit.Writessclothesitems: MethodTooLong \u2014 Writessclothesitems runs 800 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 700 over it, 8.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6795e842e06fc31e17d025348540fcac188efbee586eb52efdc0a0ebad5a8457"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Writessclothesitems: MethodTooLong \u2014 Writessclothesitems runs 800 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 700 over it, 8.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":10036}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e43492cadfe925014178a99275c05781fece6bbba6d1b6c95828430bf0db160"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_interactions: TooManyMethods \u2014 12285 significant lines (blank, comment-only and punctuation-only lines excluded), 238 methods. The bar is 30 methods; this is 208 over it, 7.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc840ed9192ca500af1e93cea7e495a1247bb9ad95898a31042922ac5a269d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_voicepersonnality.vb: FileTooLong \u2014 3749 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3249 over it, 7.50\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":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3b33e8a879d47f21cd279006908036a9c95992843c4ef52508c019f9cdb1c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.WritesavedataArc: MethodTooLong \u2014 WritesavedataArc runs 673 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 573 over it, 6.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7de2cefd9306e5e22b0a32417a817070f4fea650eb9c2de7cdfb8e0bdbf9065"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_itemsedit.vb: FileTooLong \u2014 3341 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2841 over it, 6.68\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":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d1396265840c7dd4d014dcafa31d3b63c20bfc2d96ea02acb5bbe5f03362c5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_dataislandranking: ClassTooLong \u2014 2627 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 2227 over it, 6.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3bc27f54902926574e1facc5e3accf6ee1b3b45291312c30a965c85eb7eff4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.ReadsavedataArc: MethodTooLong \u2014 ReadsavedataArc runs 625 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 525 over it, 6.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3348}}}],"partialFingerprints":{"codehealthFindingId/v1":"24788b7ee234f73988383b77949e08af421be9e71c51c5aa0b4cba60911a6f57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_dataislandranking.Islandrankdetected: MethodTooLong \u2014 Islandrankdetected runs 619 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 519 over it, 6.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"064249a8a2ae4edcb3673c50f0ee4c2b395af7a577cb5193c634658cd8161ded"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_dataislandranking.Readislandrankname: MethodTooLong \u2014 Readislandrankname runs 618 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 518 over it, 6.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"253243a191893938bf7e236bf8ed2a67b6d05080cdbc53cc2eade5c6ea0f1b42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Readmiiname: MethodTooLong \u2014 Readmiiname runs 617 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 517 over it, 6.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":4344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ac9741aba59197e3508aa39bde8b724fa4879426b10377bc91178a2e84761d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_travelers.RestoreTraveler: MethodTooLong \u2014 RestoreTraveler runs 560 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 460 over it, 5.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eea0965310fd7ac718fb069454144742a0222a5466eab62bb5c74dd6bb76ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_manag_mii: ClassTooLong \u2014 2130 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 1730 over it, 5.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29a4431474ab71a3a2091a8216580559df87bb89aabb177b93226a734aa9d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_dataislandranking.vb: FileTooLong \u2014 2631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2131 over it, 5.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bc2dca775f01f498148b573455b488f2fdf4dc91121e42a6955fc62726c80b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_manag_travelers: ClassTooLong \u2014 1978 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 1578 over it, 4.95\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f696e1f98f1552a43ff93f89385ff6306639d2c33be4a97503b98c6837b08f29"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_hub: TooManyMethods \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded), 148 methods. The bar is 30 methods; this is 118 over it, 4.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"535a5a1da1bca0c740dbd45a3bc6079debaff47b7ea379810e3a5a864314ddc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Select_target1_foodUS_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_foodUS_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdfb9c17ea72f45ec357eb12584600b40c644d3c33900dc7f37fba103277beb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Select_target1_foodEU_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_foodEU_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10895}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df602d67e1953870f9bb15a47edd2f4139fa6f8a8f4e481b8ff28d78222403"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_1_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05447409ae97baeacc70b92f457b7ca60b37fbdc12befa8512230e6cbad26b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_2_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"60355d9d26846c6ebeba55fc771bfd3c6a25b55e9bc29ef12689f55164cf2c11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_3_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_3_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea606f201f152dfd33c6f0d72a768d8c936a3367830f01c5f6c603a79c394e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_1US_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_1US_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14855}}}],"partialFingerprints":{"codehealthFindingId/v1":"7154af5eb0a1d0d9c2b66a1e18a5926bed4812b751dbd37bef81e464acf9107c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_2US_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_2US_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d881447a447bac72918bb9c689fbbca187dd6ef0bdd3c909d0d053713d39a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_fav_3US_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_3US_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":15791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5d2f92b49ea557822214bad0d2837e2943db2b39adf677820560c1dd17be12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_target1_foodUS_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_foodUS_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7558d54d06e4df13b1665a352b658b089dc54cde0810ccaa2c8e4f38154debbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_target1_foodEU_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_foodEU_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29300}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a0da26eec6f402d25732735628e88e176fca17d755234da3b2c26539777e4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_allfav_US1_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_US1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb41696bfff4d2674c9201862c73de60f3098674279569d84b49916d1c3bb944"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_allfav_US2_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_US2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":30671}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d1b5126e7beeb88100344e92ee96bb760b136c5abc9920b9d093ff15af0a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_US1_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_US1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d0706bf29da574dd4347e4eacf03f236f1b24d43d65dc9c09ae3d58300b80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_US2_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_US2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":31607}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ee8ae935d5637ceab92dd34af0e85611ca6d3603cdbd8d7f10b973df0603b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_US3_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_US3_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32075}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a17cf47adff621aec95d57c75f2b114f85142756612cc8b80c44b0677fc689"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_worst_US1_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_US1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":32543}}}],"partialFingerprints":{"codehealthFindingId/v1":"348a7103c6a27aa54879ce7e6bebc65648a936cc93364c246b2468358d472f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_worst_US2_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_US2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":33011}}}],"partialFingerprints":{"codehealthFindingId/v1":"f647c7b561ce19aae95d77aaa9c00f582f49b6bd1bf704dc357ef96aee5bda6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_allfav_1_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf80a4b7d6698761f5ace75278e9d787738c59d783f9e13b9589c5cf74363416"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_allfav_2_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":37665}}}],"partialFingerprints":{"codehealthFindingId/v1":"2823d54b4fda100343f99810c1b148003dad60f8da1e3885c00606402ebadea8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_1_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38133}}}],"partialFingerprints":{"codehealthFindingId/v1":"224970598573229f4038ceaa6ef9e9805c0b609e4ff9fa55d1d55fa18ab703b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_2_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":38601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d48f8068e2c82dccb25a86d7f19489134bc1ac64e44c64975d5bb4f87e31f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_fav_3_SelectedIndexChanged: MethodTooLong \u2014 Select_fav_3_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e43003eb25462c6e010e3bf911d3af4f3b2ef53a132e3d03cd40f5860c7a47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_worst_1_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_1_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":39537}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee335f39a5326aa75a513bee3858adb204af589fd35252a3623687450f29720"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_worst_2_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_2_SelectedIndexChanged runs 467 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 367 over it, 4.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":40005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb19f0c2e3cfa44d8b214c4edee5ac14816b71e3770329a3a0d37d3f9dbecf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_allfav_1_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_1_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c245d4b0c0de5e8c1f4fd8d03f33c4c7b8829310f7d0ae8654f289306b58f14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_allfav_2_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_2_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c551d240ad6ba80431ee9fc6586963ef3229dbc0158f41a1d5f46fe6d59e02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_worst_1_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_1_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e65faccb1fb5a689e1b18c9ebd4d8a141ca8006c7470d476cd6b70708f0097a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_worst_2_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_2_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":3805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23d6cb37570aefb0cdb8bfdead5c376671558ebd09fb9d6d4fe1b0412c866a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_allfav_1US_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_1US_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":12991}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a163b2d12140a6beb98238e984fd38656d65eb9c73e8c232455284abfbd8e72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_allfav_2US_SelectedIndexChanged: MethodTooLong \u2014 Select_allfav_2US_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13457}}}],"partialFingerprints":{"codehealthFindingId/v1":"424c15a9beb9f9db9d1d3d1f1f2f3478fa4703085fe38f5429c19c1c38a6005e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_worst_1US_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_1US_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":13923}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eeb957e736d39f40a13c136f756bce9bc7efb30a08273ed30667d95b262cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Select_worst_2US_SelectedIndexChanged: MethodTooLong \u2014 Select_worst_2US_SelectedIndexChanged runs 465 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 365 over it, 4.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":14389}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e30a8af32a4b041dc978ffa08e4533f7787a52b6e6b12e51383a73eb84389"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Danger_interaction_Click: MethodTooLong \u2014 Danger_interaction_Click runs 434 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 334 over it, 4.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":29768}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1c5ff5bbcd5d0be43edffc0ba89089c647710dfa40aff13a0d0cefb7c197dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_manag_mii.vb: FileTooLong \u2014 2134 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1634 over it, 4.27\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":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc976682721c25eb1f57aac855134578f5e27357739661922bd7f3731ed0622a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_extras.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45226f5aaca0b528a952b01d5f9789f2713e7b21cedced651ebd999109060c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_allmiis.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4db3f741c8e0794cc55bbe48df0ed1ec0a5e84008f070493860ecec2c70f438"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_mii.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"401504ca9fd38e10c75f3461966b9e1e3fa2782c11a705fc1c1b16adeb98da39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ee9f94babbe319688474b191f82c2697d017f0770bba7606887e4a14466b16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiinventory.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7584fa511df9f232ee5bc9b6498cc964f18dd86c553c17092b25a7bd24171548"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"600e8f886a73cae957ccc5608cb77c2b670de62ecde7cd9c1cb20c4fbd8fb730"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miistatus.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8c13da7345d88b85c92babb43bd04980249c38924e33b82bd7ea7d53dff547"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_voicepersonnality.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8348fb1f9542e7b5f137796efa3eda379c55cd48c87895dc9612d4a7c932dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_crcxmodem.Readmiiname: MethodTooLong \u2014 Readmiiname runs 418 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 318 over it, 4.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"00db844aae6a2891f809501fcc2d40ae08f811fd7f41ccb460f5687e0e9bb032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_mii.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"058692b9909b8021aea9600140773d465d1896d8e1e1ffa1d882e188c8c5456d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miifoods.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"69962975dd31286f8c487bf75db0114e70c2779331d184935a8269cc30d44549"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiinventory.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef1b740bde2e2f90cac577c174df0e456c8d99cb34d03fe48777aef04110388"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":5039}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93d1ea53fb85b5c17340ff5f3a6a65a5eb889c304a8fffc26c2caf034451545"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miistatus.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd3cf31b9a82803c2fa53781d620397c7900a8008d28a81d09296955b6a6f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_voicepersonnality.Readmiiname: MethodTooLong \u2014 Readmiiname runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c334244e2e01d8b4367d309e17694ce8044122af447eeef2d7f510d68a4a6d51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.readmiiname: MethodTooLong \u2014 readmiiname runs 414 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 314 over it, 4.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80060}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c87ce82d27a1ea445958e1a1605631bc2a43a32612b58980b9b0e26595b0adc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.readmiiname: MethodTooLong \u2014 readmiiname runs 414 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 314 over it, 4.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":191683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df01ada3dffc39239d74a509e54dbba539fa1bc86440ead60b5184c098d1dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Readallinteractions: MethodTooLong \u2014 Readallinteractions runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":3921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57d115b3475e74b52e425bfc4671c90e13e689ccf8d835c6c30e507d5d25e68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 413 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 313 over it, 4.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfaf454cb4374d16d78dd0d710f569c75df70544e42546824cdd0ef2b2bafa8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_travelers.Readmiidata: MethodTooLong \u2014 Readmiidata runs 412 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 312 over it, 4.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb162d011d9374d91b674afde29dd1b7b03a58c395c9482dfab9b9bab80583c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_dataislandranking.RestoreIslandranking: MethodTooLong \u2014 RestoreIslandranking runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"90903afc0a7539e43f9f4c5ab44c2b6d8e23f056236f5520184453916bd7330c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_mii.RestoreMii: MethodTooLong \u2014 RestoreMii runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a94c0ded2af00d423f8f4215d78350fa00d3ca56489b341dca3a03ff0f0f0e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_travelers.RestoreMii: MethodTooLong \u2014 RestoreMii runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e391f42a858208b6a2adaae324057222575e35cdb968b7d47f13474a6ae8bfa1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_dataislandranking.Readislandranking: MethodTooLong \u2014 Readislandranking runs 409 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 309 over it, 4.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f97e9c7a51f3473ff19470ae949ec86af38f1c74a5b7da5fa046a4fd10ef6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_datamiiexchange.Readislandranking: MethodTooLong \u2014 Readislandranking runs 409 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 309 over it, 4.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd045db8c25763b82613b095f45f0e68c4abd9768473c97059d03600233579c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_mii.Readmiidata: MethodTooLong \u2014 Readmiidata runs 409 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 309 over it, 4.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"38277c3e9e87ca97c6a138574678526eb776ec259b3a1356afa95c4cdc4604e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_miiapart_ValueChanged: MethodTooLong \u2014 valu_miiapart_ValueChanged runs 408 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 308 over it, 4.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":26604}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1f690cf36e01f107afa9c55e8ee599e99ef02e39de836ea338b793284d759c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Writefriendlist: MethodTooLong \u2014 Writefriendlist runs 407 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 307 over it, 4.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":52919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baff2c6362496b2bd5c19802fa957b94e3ee3389afc91e448aac58683d79149"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_manag_travelers.vb: FileTooLong \u2014 1982 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1482 over it, 3.96\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":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b7028f56ccddf04801c1792318832dccfb9baceb2632a1afc64232e0f1bd05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluJP: MethodTooLong \u2014 NamerelavaluJP runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":113848}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c0074ae3e603723d57f3a0a4e2d653b569c17015ae5a18f446d452aa9687ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluJP2: MethodTooLong \u2014 NamerelavaluJP2 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114226}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e6528d6c5805986f47af98e0756d882713524dd5d36fe35b088013620bc36"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluJP3: MethodTooLong \u2014 NamerelavaluJP3 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114604}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd04e5e8aadf57d1491554ef0c3e0f35d2fe0fde3a3f1032577889e1ea8cba2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluJP4: MethodTooLong \u2014 NamerelavaluJP4 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":114982}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed8ab02228431243f0e071085bf0a5aa234d4020f324f506e780ab98f888742"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluKR: MethodTooLong \u2014 NamerelavaluKR runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce422ba008907f60ea1332ac79fd9d49d61499220e9a5ac5ebaa2c9f7ca018c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluKR2: MethodTooLong \u2014 NamerelavaluKR2 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":115738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1316da0c6d59efc9d6af6c46101046f6ee7eb388fe4db5652f7181bc19361ed0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluKR3: MethodTooLong \u2014 NamerelavaluKR3 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab04b887bb56d0a6473865fd381672d810d92b868c767061608dd03107341144"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.NamerelavaluKR4: MethodTooLong \u2014 NamerelavaluKR4 runs 377 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":116494}}}],"partialFingerprints":{"codehealthFindingId/v1":"f474eb7c7f8189a7ab60a1d369349593101dbc22ae45c188c05ef9ba721d1275"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_datamiiexchange: ClassTooLong \u2014 1392 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 992 over it, 3.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c633ef64345c3f9df403668112eeaafe2594c26ae3ecec3b3ea2b2fffe59694"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Advanceitemsedit.Checkitems: MethodTooLong \u2014 Checkitems runs 344 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 244 over it, 3.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ab316799e4793d05b47843f9b23854fb10a0e336c1ba0983111211fc78bff8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_crcxmodem: ClassTooLong \u2014 1369 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 969 over it, 3.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d487f2457b28b464594c0cf0f0401e9a6dfb76e13d457f3b9042d3c004c208"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_miiprofile: TooManyMethods \u2014 5900 significant lines (blank, comment-only and punctuation-only lines excluded), 98 methods. The bar is 30 methods; this is 68 over it, 3.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c86ae273f2916560f8e3e647e52d4ccc374392f5628be512b88cea45067f5ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_datamiiexchange.Exchangemiidetected: MethodTooLong \u2014 Exchangemiidetected runs 319 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 219 over it, 3.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16fa36e06bd6df6dcfa75a2a49e8aac523cddf0f5f511623e1145ef5f322746"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_datamiiexchange.Readislandrankname: MethodTooLong \u2014 Readislandrankname runs 318 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 218 over it, 3.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dca3a0a84faee49981a1c192cba7ae6700db83493e0f4c305ccc3ec7830314"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_itemsedit: TooManyMethods \u2014 3337 significant lines (blank, comment-only and punctuation-only lines excluded), 95 methods. The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b651faddef184e86eeb043b7f05dd71f17b231fd44f56e5e6bbf56b1a6e125"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_islandconfig: TooManyMethods \u2014 1321 significant lines (blank, comment-only and punctuation-only lines excluded), 95 methods. The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandconfig.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ee3240db591ca011742f0de85c2df0c73b804154528ec64a40859bb07b60f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_dataislandranking.Setislandranking: MethodTooLong \u2014 Setislandranking runs 309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 209 over it, 3.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ba2faf01dc66f11f5c7b93791bae4c6fb0ba2784dc72df2625574d901e8057"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Button_setallfriends_Click: MethodTooLong \u2014 Button_setallfriends_Click runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46282}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb26c42a5f14a83eb23ba55073339a19c849cdbef6c0d2eb6d529fa49b0a4618"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miistatus.valu_experience_ValueChanged: MethodTooLong \u2014 valu_experience_ValueChanged runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a750f21d8eeda07627c662e414d5d2b93fbc3d6cd190c79ff83eaf3cd28ee67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Button_setallfriends_Click: MethodTooLong \u2014 Button_setallfriends_Click runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be414005157cffcc3305b56a3f33a3c64d45a8e414de0c840b852929fce3b41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_travelers_status.valu_happiness_ValueChanged: MethodTooLong \u2014 valu_happiness_ValueChanged runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3339ef5ade844d00bf168c5f0586ac7adc1aad4327d0eb3cea491c0b8767fc62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_experience_ValueChanged: MethodTooLong \u2014 valu_experience_ValueChanged runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":13803}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dac5ddaadd207808c930abfda25e59070f3e3136875a71e6f397adc066eed75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Button_setallfriends_Click: MethodTooLong \u2014 Button_setallfriends_Click runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":17433}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ac6132d200763e49ac8eb692fbe316cd94ec3ce6ff03b0a55b7065704352a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_miistatus: TooManyMethods \u2014 4757 significant lines (blank, comment-only and punctuation-only lines excluded), 90 methods. The bar is 30 methods; this is 60 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8493bc67d2a5967f7dc71ea3e62cc990d182a3575b11953ee5e0e4c6b5bd13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Advanceitemsedit: TooManyMethods \u2014 1429 significant lines (blank, comment-only and punctuation-only lines excluded), 89 methods. The bar is 30 methods; this is 59 over it, 2.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"454943cb312353c00f5e87edb9c694feda2e192b15c97e6f6b2b823c517d7f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Select_interaction_SelectedIndexChanged: MethodTooLong \u2014 Select_interaction_SelectedIndexChanged runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":6153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1993fbc8b189ef2cab3cff9f9d4dc3b893cc408b653a69609a9279a69b2a3818"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_interaction_SelectedIndexChanged: MethodTooLong \u2014 Select_interaction_SelectedIndexChanged runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25547}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dec6b9cbe7ce447d4f95ee6c7b956eeba86f41166d78ef1932c33e5a5aa89e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_interaction_USA_SelectedIndexChanged: MethodTooLong \u2014 Select_interaction_USA_SelectedIndexChanged runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":25841}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b9ccece1abcac83856a3bf784d9331426ad3696421ed6dcefd229707a4e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_1_ValueChanged: MethodTooLong \u2014 valu_friend_rela_1_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":48916}}}],"partialFingerprints":{"codehealthFindingId/v1":"83401e44088ca37b8f370cfe77a7de3e4895a7bc59b34b47642e7659d1c35f94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_2_ValueChanged: MethodTooLong \u2014 valu_friend_rela_2_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4b0e576b0d58f97cb096e413d514d2e29f37fd2932e8413276bce10378af51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_3_ValueChanged: MethodTooLong \u2014 valu_friend_rela_3_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c662ee1edec4ae3a10dd40fafdf99f835eb688499eb680f9108abc9fd2112d6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_4_ValueChanged: MethodTooLong \u2014 valu_friend_rela_4_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":49792}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c2b0f3258e692c5c0ed60bfee71465d9dc44b9e778487953910b1b61da44bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_5_ValueChanged: MethodTooLong \u2014 valu_friend_rela_5_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50084}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c860fb3ad494eba0535c0749e70b66e6350b1f97ad173afbdf85ae58db1540f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_6_ValueChanged: MethodTooLong \u2014 valu_friend_rela_6_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f754e85b0441b46606aac4ff7e8279e374a35cc740fc8767f8ea8a5f135fb1d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_7_ValueChanged: MethodTooLong \u2014 valu_friend_rela_7_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50668}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91968faa7882f1465d5833117634700b7846336cc806fd069a7a8ce55463fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_8_ValueChanged: MethodTooLong \u2014 valu_friend_rela_8_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":50960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93e03bd3d552e04394ba944015ac1f4e3c37f7346680fa8ba2980818e7ba054"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_9_ValueChanged: MethodTooLong \u2014 valu_friend_rela_9_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdac6e2154e4fe6423b9ecb3cb44544da601209e2e2824e143d3f9c78f07595"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_10_ValueChanged: MethodTooLong \u2014 valu_friend_rela_10_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51544}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ca73a2c217910dbcec593c37ee9a39ef4197fcaa20e8b1f4562dc530aa263"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_11_ValueChanged: MethodTooLong \u2014 valu_friend_rela_11_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":51836}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc889e1f2402d0dc8bedca3de3b0033b4c3566e044e3274e2b2879e807f20e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_12_ValueChanged: MethodTooLong \u2014 valu_friend_rela_12_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52128}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c2e1d0c5471914cb2f3ba67c7129c89dfb8abd7d71178f10007a416725cbe2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_13_ValueChanged: MethodTooLong \u2014 valu_friend_rela_13_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52420}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b227583cc14218fe46e333a5eb48f5fe53e628ff2183827227d4885049553"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_14_ValueChanged: MethodTooLong \u2014 valu_friend_rela_14_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":52712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ef9374873cacbe3dc5b665af05147efc201492623d04f8918afaee8abc66a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_15_ValueChanged: MethodTooLong \u2014 valu_friend_rela_15_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53004}}}],"partialFingerprints":{"codehealthFindingId/v1":"86553c52ce2f9f3ae736b8992d3034fe17fb8cb8993eb42242e13c1e9e36f1bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_16_ValueChanged: MethodTooLong \u2014 valu_friend_rela_16_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ebd0bcbb48e59879c425a5f27e4d919599edf4632961f6887907a2622ad358"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_17_ValueChanged: MethodTooLong \u2014 valu_friend_rela_17_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53588}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fe52a3027ff24492b8766eb96b53cc67cc6529d5e9e834fa3954f45a9c2e57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_18_ValueChanged: MethodTooLong \u2014 valu_friend_rela_18_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":53880}}}],"partialFingerprints":{"codehealthFindingId/v1":"a869a864e8dd903f12b7702c4e5ca1da2e13bef5f63adf820de29a8e481835a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_19_ValueChanged: MethodTooLong \u2014 valu_friend_rela_19_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2590dcfa19a5764463d9ebaa415dcdf795a247a980f7f3676e1261b90fa1164"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_20_ValueChanged: MethodTooLong \u2014 valu_friend_rela_20_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54464}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6ebb6ead3b08ef73adb0f4c2351ddff0d3549bab191e288849837fca7eeda3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_21_ValueChanged: MethodTooLong \u2014 valu_friend_rela_21_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":54756}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f1d15a1bcfd80b906e7caf6028abc7a202b477ffa77d724443ad99e1572a33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_22_ValueChanged: MethodTooLong \u2014 valu_friend_rela_22_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55048}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6177d45204d86ea3bb6da8cfdf796706ba14e21071702f456e8b5b5273880"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_23_ValueChanged: MethodTooLong \u2014 valu_friend_rela_23_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c0a3d5a839e2b53636ee590d445a86a8518a16404a9755c9af8a6e2f743d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_24_ValueChanged: MethodTooLong \u2014 valu_friend_rela_24_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55632}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f4cb91a2c3cbeacd66d01e623370d3c12fc2bfa98567ecf9166645afcd217"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_25_ValueChanged: MethodTooLong \u2014 valu_friend_rela_25_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":55924}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30746b72c2ca854a65913f64e856872b16272269b81d7c1bd4fed0dc8ae843e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_26_ValueChanged: MethodTooLong \u2014 valu_friend_rela_26_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7210968226ba136f39a7d1b66e6df2a8711a5b8d5e371bb75514321469d86c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_27_ValueChanged: MethodTooLong \u2014 valu_friend_rela_27_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56508}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d3b1a79132fc741179d34621a7a3f7aac40f36763779ec2616f6f410dfaea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_28_ValueChanged: MethodTooLong \u2014 valu_friend_rela_28_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":56800}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a42c22ab1ca81870f787cb4952fbb20b526cc947c979384670b38967a0a88a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_29_ValueChanged: MethodTooLong \u2014 valu_friend_rela_29_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57092}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f125def5ce3882065d314dae76e5f9539808c0e62e2ca510356c65a31d8650"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_30_ValueChanged: MethodTooLong \u2014 valu_friend_rela_30_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57384}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc15d219e9cf209f4a8e38944744c0d3749616152d7a1cfe9ff64a504d76b85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_31_ValueChanged: MethodTooLong \u2014 valu_friend_rela_31_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7193f772ab4dfbfe33c9ab746a5d1771d24b5e870305cd8a7e393ea004a37310"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_32_ValueChanged: MethodTooLong \u2014 valu_friend_rela_32_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":57968}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84a22033014470a8c446943b07e74c0c6eb739b42461c30496d1a585c3f0842"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_33_ValueChanged: MethodTooLong \u2014 valu_friend_rela_33_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58260}}}],"partialFingerprints":{"codehealthFindingId/v1":"afee40349fe83674dbe3bac5dcd488fe2d313ec87e68a1aadac77569afbc6857"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_34_ValueChanged: MethodTooLong \u2014 valu_friend_rela_34_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab76c185deeede6afe5ea108b27b5e0b957df9cfc800ab5a5c2771484f5b12d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_35_ValueChanged: MethodTooLong \u2014 valu_friend_rela_35_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":58844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ff4ba9694dd6b38926637b79a97788785cafd1cfcecf342a5bf793a0c768c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_36_ValueChanged: MethodTooLong \u2014 valu_friend_rela_36_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1337724dd72c38fb56254a378a597e931b7890d31db1687f29dd9c3d5c330459"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_37_ValueChanged: MethodTooLong \u2014 valu_friend_rela_37_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17b6cf2af9465d626560704e3a11e75ff6566efe43d51565eb3590c2b35d1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_38_ValueChanged: MethodTooLong \u2014 valu_friend_rela_38_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":59720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a375d594beaec2ee7af471da2fa8f386a3ceedc5365d302a2885c96a1a0052f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_39_ValueChanged: MethodTooLong \u2014 valu_friend_rela_39_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60012}}}],"partialFingerprints":{"codehealthFindingId/v1":"5960bbbe5195a004670956b6f741e37c0b24988e61f34428782fff2fe18795b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_40_ValueChanged: MethodTooLong \u2014 valu_friend_rela_40_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c457e4cb0b9ac3b4d2a0f81fada43be7a71703121b823628eb821d005a636d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_41_ValueChanged: MethodTooLong \u2014 valu_friend_rela_41_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1682334e2124b07ce3af804ccab414400f0bbcce9476b56c2ecd3659e51f01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_42_ValueChanged: MethodTooLong \u2014 valu_friend_rela_42_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":60888}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d910156184ab51c3806b79802649873dc56ec0ea3bd5fc57989d0c2028a693"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_43_ValueChanged: MethodTooLong \u2014 valu_friend_rela_43_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61180}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf8735ac1a196c69c0ea6da181f2569c8b9027ddd05b2370fb6ed4be98a678f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_44_ValueChanged: MethodTooLong \u2014 valu_friend_rela_44_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e35b4bea05af8e57cc23b2bbcd5460e684de41d19c60388e9e62900a4dd900d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_45_ValueChanged: MethodTooLong \u2014 valu_friend_rela_45_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":61764}}}],"partialFingerprints":{"codehealthFindingId/v1":"de126e8bd2ce8308122d80ce79dd76f26ed62748125c79a4ce21468e65454a90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_46_ValueChanged: MethodTooLong \u2014 valu_friend_rela_46_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d5bbe0e1fac5826c3ad5c8dfc04fa0edd0b8ec53ecb377db8d352555dea9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_47_ValueChanged: MethodTooLong \u2014 valu_friend_rela_47_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c99187614274a927219eba5e3b2581bf2da4f52e2b2fe0cbe9eeb4d58fe4ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_48_ValueChanged: MethodTooLong \u2014 valu_friend_rela_48_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9645826a761b99fed85485cb1eff29d03f3d704557d09df115b7d97df333e14f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_49_ValueChanged: MethodTooLong \u2014 valu_friend_rela_49_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":62932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64ff8f74f712c7f8d1561c2f7856544f0a1301b53e63de1c2be19c4dc315cac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_50_ValueChanged: MethodTooLong \u2014 valu_friend_rela_50_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa4c1f2874687df47e1c3df058dfcba96bf1cda91baf83589925e5d392f167e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_51_ValueChanged: MethodTooLong \u2014 valu_friend_rela_51_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63516}}}],"partialFingerprints":{"codehealthFindingId/v1":"139fb3febbb879f0134d16f3582b2bf7cb9936927e6cd9279e0061ac6b703472"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_52_ValueChanged: MethodTooLong \u2014 valu_friend_rela_52_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":63808}}}],"partialFingerprints":{"codehealthFindingId/v1":"875015a67a8ea3c4fb4e6e315adcb390653d96e767ebb86783da4515886bc928"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_53_ValueChanged: MethodTooLong \u2014 valu_friend_rela_53_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea9ce9443ac6cbe54ef4ba94695663a04d0b107e6864ee1fa93346035fb6939"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_54_ValueChanged: MethodTooLong \u2014 valu_friend_rela_54_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08aae54630b6292fb09d65167531f5d91380d693fd296e9413d418dafbd1e28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_55_ValueChanged: MethodTooLong \u2014 valu_friend_rela_55_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64684}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e61cb13be5f7845b21d3e80b4ed5264b012e4badaef03f9c6e2b46bcc57b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_56_ValueChanged: MethodTooLong \u2014 valu_friend_rela_56_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":64976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cde1e67fdd6cba931e6cb45efef7b6b400f932c50fb4e1963e1a9f0361d88ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_57_ValueChanged: MethodTooLong \u2014 valu_friend_rela_57_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65268}}}],"partialFingerprints":{"codehealthFindingId/v1":"446b489ff618cded2a3d2df9deca72a071078f9d5ee67c14485fde3c87ca8844"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_58_ValueChanged: MethodTooLong \u2014 valu_friend_rela_58_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b53238541d5a25e58fddfd255c3e5141daba418e0e1cb60c063f0f3a1c81db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_59_ValueChanged: MethodTooLong \u2014 valu_friend_rela_59_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":65852}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c067737a9c02c5e10450a4d19eea6ae64c361344c6115e2103ef99157869716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_60_ValueChanged: MethodTooLong \u2014 valu_friend_rela_60_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66144}}}],"partialFingerprints":{"codehealthFindingId/v1":"43591f700f36818cb4a416e94e609d67f93b9bf30cebda37efe8791669a440ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_61_ValueChanged: MethodTooLong \u2014 valu_friend_rela_61_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66436}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfb581aef6ac702bf73188ff137a4bfeefebc64fc8a78150c38707b987297c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_62_ValueChanged: MethodTooLong \u2014 valu_friend_rela_62_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":66728}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f42f7c0c52ae3afcf7f0ac1f199399da261275d19e4c25e0c30d47f290eb28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_63_ValueChanged: MethodTooLong \u2014 valu_friend_rela_63_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67020}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a858905e94ad13ee34a7bd9bc8e55a66578c30a8076ef0ba7d0840dc409d516"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_64_ValueChanged: MethodTooLong \u2014 valu_friend_rela_64_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f5d329409a6a194659c26336ada0136e799f13c6dec641203ef3bfa68ba734"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_65_ValueChanged: MethodTooLong \u2014 valu_friend_rela_65_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67604}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1cd2a72b89e8eed5a5f597d870d6382cbd98177be13f0bb286c17dcd2a5c04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_66_ValueChanged: MethodTooLong \u2014 valu_friend_rela_66_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":67896}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fccec430ad484b3f0fa0a82f36aaf5df19ff8ec160a5f2d5e137ff17849f36"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_67_ValueChanged: MethodTooLong \u2014 valu_friend_rela_67_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9172d3c9bc8bc1fd3c5d538a86b92bd9c126931cf418069179496b5c78249ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_68_ValueChanged: MethodTooLong \u2014 valu_friend_rela_68_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824270baac5cb22970bce03dd7d287b8d897d282bad20c02e33eb76917c0d56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_69_ValueChanged: MethodTooLong \u2014 valu_friend_rela_69_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":68772}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d968e56fd4bf0f7518336ddc55621e00b184062d633f1a4792a617d2870d836"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_70_ValueChanged: MethodTooLong \u2014 valu_friend_rela_70_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69064}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef8a7e8be6795f66caac3941df4a6f8c4313b4c8588754cf8765b1f09d20320"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_71_ValueChanged: MethodTooLong \u2014 valu_friend_rela_71_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c223d8dceecd97476957b46373ad1d84745a6f341bb06c202b7ef03824b8dc34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_72_ValueChanged: MethodTooLong \u2014 valu_friend_rela_72_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69648}}}],"partialFingerprints":{"codehealthFindingId/v1":"1939aa2e5b4b0d596f8bb5fd2138ff3c618fedf4c4d2794418047072f25ae04a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_73_ValueChanged: MethodTooLong \u2014 valu_friend_rela_73_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":69940}}}],"partialFingerprints":{"codehealthFindingId/v1":"55928e2bdacb22782d547ac3583cb514d693052690b1e68d2c51cb574b95074a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_74_ValueChanged: MethodTooLong \u2014 valu_friend_rela_74_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70232}}}],"partialFingerprints":{"codehealthFindingId/v1":"022901bc9aa0b72ed37f402cf14341bf9df665f1bf14c71f08f960c114f63bf4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_75_ValueChanged: MethodTooLong \u2014 valu_friend_rela_75_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70524}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc44ebe70a6e04d2ad0bb7000ad5f47ce70bfdafc81fcea6de3a7bd130bc91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_76_ValueChanged: MethodTooLong \u2014 valu_friend_rela_76_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":70816}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eae7610b0eda524c04d00f3c2c5213778273f97a8f7b9fe80407c4238641565"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_77_ValueChanged: MethodTooLong \u2014 valu_friend_rela_77_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7794552df421504516a48856e9fe9a4b8b9e508815759b4dca56eb6f8d584df7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_78_ValueChanged: MethodTooLong \u2014 valu_friend_rela_78_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71400}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f0c7145cbed6c9b56bea49d74b5aa43b040c407d0a5888908d0a7a0ce792cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_79_ValueChanged: MethodTooLong \u2014 valu_friend_rela_79_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71692}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f906f68f49727f6667eb10d4ad5c4a09b1ab3ad1d478bdeb9f753cc725c119b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_80_ValueChanged: MethodTooLong \u2014 valu_friend_rela_80_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":71984}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b2cc821825e1144c710c0dbfb043210b4df07b8fba0450192e94cf7a6c3752"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_81_ValueChanged: MethodTooLong \u2014 valu_friend_rela_81_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72276}}}],"partialFingerprints":{"codehealthFindingId/v1":"053382c3fc0aa84ddc1cbf5a1972a73e210ac0aa4ce639f4375d8c64c4f9db3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_82_ValueChanged: MethodTooLong \u2014 valu_friend_rela_82_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72568}}}],"partialFingerprints":{"codehealthFindingId/v1":"66622ac18a2a5d4e640bd0f04d24f5cf4dbe93b33e2602a76eae1e72298b4c04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_83_ValueChanged: MethodTooLong \u2014 valu_friend_rela_83_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":72860}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cb2a8d591330b03dc2c1cedf6b5c9ff448008b4b2799e6b4ccd88e71e94b7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_84_ValueChanged: MethodTooLong \u2014 valu_friend_rela_84_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73152}}}],"partialFingerprints":{"codehealthFindingId/v1":"69204df53c0bfb16eaea049d1796a20f519ac51fc2e8a9f2f8af9e6c03d3a1a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_85_ValueChanged: MethodTooLong \u2014 valu_friend_rela_85_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73444}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c0bf39cfed6068abbf8cff14d6a728d082d3cacea5e7398728add0192ca3f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_86_ValueChanged: MethodTooLong \u2014 valu_friend_rela_86_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":73736}}}],"partialFingerprints":{"codehealthFindingId/v1":"684ca32fc4ae699acb800e7464b23ac774f546ad2d397629e676a6d438dbea80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_87_ValueChanged: MethodTooLong \u2014 valu_friend_rela_87_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74028}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75fd46658255c76b4d505624aba71fcb310f7b37230002b153b9cd4796735d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_88_ValueChanged: MethodTooLong \u2014 valu_friend_rela_88_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0330854bf0413739d90d280480a9721377d69d5b1a0850ae0b2a8b40039042b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_89_ValueChanged: MethodTooLong \u2014 valu_friend_rela_89_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74612}}}],"partialFingerprints":{"codehealthFindingId/v1":"038bb752901b6bb320be748661495f7eaf59f83eb5f88ce67f92801a5d40509b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_90_ValueChanged: MethodTooLong \u2014 valu_friend_rela_90_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":74904}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d9246c009baa549c017e305d436993ab73814f79da1eda84005d42449920a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_91_ValueChanged: MethodTooLong \u2014 valu_friend_rela_91_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75196}}}],"partialFingerprints":{"codehealthFindingId/v1":"daafa14674bfc93c59edd6c6aea63662314701dc58a6490a414f9bc937a09cac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_92_ValueChanged: MethodTooLong \u2014 valu_friend_rela_92_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75488}}}],"partialFingerprints":{"codehealthFindingId/v1":"279cb873f94c06d0bc86b10096cdd4df2bc3ea78888a822e21856b5b3a3df973"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_93_ValueChanged: MethodTooLong \u2014 valu_friend_rela_93_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":75780}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9092dab760f268d0456a0332107c973836886e9c149a58e0377e002f9295cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_94_ValueChanged: MethodTooLong \u2014 valu_friend_rela_94_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76072}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a2860281ad8bbd137a7219c57071e807ae1347af8bf87b8e205837e2bd7d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_95_ValueChanged: MethodTooLong \u2014 valu_friend_rela_95_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76364}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe355bd5ace8b92c81552776483f6653ae130aaa5ebda654ea944720a70d2742"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_96_ValueChanged: MethodTooLong \u2014 valu_friend_rela_96_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76656}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ec41e4c21587700fbad47c8c7e48278ab6fb47238534e179b572dbf671cb0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_97_ValueChanged: MethodTooLong \u2014 valu_friend_rela_97_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":76948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0881e3ab0a783b56c495876875b6cf96930e7482da07cad4e7b7b42b866165"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_98_ValueChanged: MethodTooLong \u2014 valu_friend_rela_98_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77240}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c7ebd20464b26ccf2f6fa23253e0a27ce269aa2619e1bb9cf0d2d15515cc73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_99_ValueChanged: MethodTooLong \u2014 valu_friend_rela_99_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7315e48e1fdd9497806753117e6bf36a653f86d1a209524a1565b6cc286f45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_friend_rela_100_ValueChanged: MethodTooLong \u2014 valu_friend_rela_100_ValueChanged runs 291 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":77824}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c6d763e854ca1084e7ea3453c70ff0b3051510e2a049bbe86eebb6cf58aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_itemsedit.Writesshatsitems: MethodTooLong \u2014 Writesshatsitems runs 288 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00ba693b37b8075777b5f5d666cd391a76ed299d8f6805c94c170979bd03bba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Writesshatsitems: MethodTooLong \u2014 Writesshatsitems runs 288 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":12339}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b5be8044bf3704b28937c63b055d88d3fce0e05a027dca5f76c74c796c8a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi-Life-Save-Editor/Advanceitemsedit.vb: FileTooLong \u2014 1432 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 932 over it, 2.86\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":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826630f3d4439a61579d13797299643844ed275a999cb02d28fa5eaf9343ebe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_datamiiexchange.vb: FileTooLong \u2014 1396 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 896 over it, 2.79\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":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e6c5241c17ed60f34aaa1236f5937daf55ec593b75bc85743ea39a54716c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_crcxmodem.vb: FileTooLong \u2014 1373 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 873 over it, 2.75\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":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"236c14e317a925b2bbc9537b09f87d487fe45ad0adf0746bdb979c075219f0af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_islandconfig.vb: FileTooLong \u2014 1325 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 825 over it, 2.65\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":"Tomodachi Life Save Editor/TLSE_islandconfig.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b00a85d82b1a0602ebc3aa61a9e26783bc6a59a44edbc8cb896cdb3db1a17c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_voicepersonnality: TooManyMethods \u2014 3745 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7a61dbe56b70c70ad1157bb6815ab1e6de670127c56f4ab531d487f4fff3ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiinventory.Hidegifts: MethodTooLong \u2014 Hidegifts runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"306aa66e9a7e7b8b91b113577d9c62eed5ce99f31566c1009922262d9134d1d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Hidegifts: MethodTooLong \u2014 Hidegifts runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":15177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b748f6dc9d41845c4f44794046b5660c1166c500ccc503be80ac3e54bc1a40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_creaislandranking.Select_spesymb_islandname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_islandname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"615643ba9a00dd36ddcdb9e77194f0c0fa77914769f4baa6554af5cdb59fa466"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_islandinfo.Select_spesymb_islandname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_islandname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8408fc637ce14ef999c6409020f316a61de107bb0239ba21aadeaff39beffa9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Select_spesymb_firstname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_firstname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a7ed1d233eda85795de798df871716f079f0800067473465aa9f70dacf1f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Select_spesymb_lastname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_lastname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c249a1a16473799c5cc631b824de0186aac5d5077555abb32a8e30b22381cfae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Select_spesymb_nickname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_nickname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff8ffd5a970256c3a8d908b892569550f320f04bad342990e4340b916037668"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_miiprofile.Select_spesymb_creator_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_creator_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7653e02965980734e2977253efe06a6eaf5243963d97026e9611b61d767b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_spesymb_islandname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_islandname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"727370749619d759ce98f78764d91afc5a62a41e497cebd7ec343b60f533d4a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_spesymb_firstname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_firstname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4b4f2e22bee9dc6cdf5d180c8cdf516679ff8e512b28f04408e7e84a8daee5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_spesymb_lastname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_lastname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9330247136c15b6a1bb2bb73ef1e0a53abdb205aa2640a2da0bbd200144966"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_spesymb_nickname_SelectedIndexChanged: MethodTooLong \u2014 Select_spesymb_nickname_SelectedIndexChanged runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":14678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4ad2a75c239023f7ddd353284e7efc6f033b6bb457140246e940849a123294"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_1_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_1_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df6dc743b680afe1db3f9f56cb8489b91859084214aa367d4c9bede8f1a24dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_2_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_2_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23400}}}],"partialFingerprints":{"codehealthFindingId/v1":"469e40ef1260cce251dd5571f130838863f0b01a7f82c8a9924703be070fc3d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_3_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_3_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30aa7871f6e868a303f5da8b6ebce2784c6becbbbb2d8bf741894d7935f6be8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_4_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_4_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":23862}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ce7f13cbdbeb4b8b44135a6ee63dad9138ff1e1080f7d6fcc5caa80e400a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_5_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_5_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24093}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f7fb6d0854b91259a7992db64192465447f4f494c6bb06019df3b396018186"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_6_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_6_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd967b04ac75b6360c9953210dd106478b339ae3b8b0804265bb05052f9bf84d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_7_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_7_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7468d2c6a2b4ab22a66abcbe6f6a00f9ec1925d3478f8f4cee1466cc0c0464"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_8_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_8_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":24786}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b10179d5ea1b3b9ef2e2a131d5eda1c7a49bb9f2ef03111307d205f859c398e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_9_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_9_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25017}}}],"partialFingerprints":{"codehealthFindingId/v1":"b640cffaa9a42195702066743b757efcafb8b70500d77cbc8ac248210748d97b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_10_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_10_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3fc61a1f11871c507fecd37a1253f238a40c92936169c5e52e94e696757555"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_11_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_11_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd0b7e8bdd53a191d9021d8c12c40e3ea634f49dada61ab1d5d55894752a312"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_12_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_12_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25711}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ccb1b15d9079478f39eea220e7d6e00f3d3ba4dd36f9551eb2ae0a78f0dea9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_13_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_13_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":25942}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fa2a71b780f7dbc0447d8ef77e7cc8da60691a66c6d534619a1934a36643b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_14_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_14_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd9de0bd831dd762b188548e4490ef8c5ff4c649582a678583adb6726a8dfbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_15_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_15_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c78754968880864f6b509f853c9ffb6ece1fe61510afbc55a70f2b3db3768d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_16_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_16_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d15c86f08a776def067857aa427d466b5da9d24c4e71c73e557d5ba5e6f80e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_17_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_17_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":26866}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b18bd4b615e26c0bc30107482a6b42a0eef4c1696a44eea758c34e3a6c2222"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_18_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_18_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d358344803366fed3b9f1a3dfcd3fee373a6e55f78b7a1dcf09e6b47492ddf9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_19_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_19_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27328}}}],"partialFingerprints":{"codehealthFindingId/v1":"22787aaa48fa20a81b9caee28fb5027f507736fc86b82b7304ccd3b27bbadce3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_20_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_20_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e13d7744aa6ff35a75e458b207e8194f4138637c22fe533d2eed46a369ad92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_21_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_21_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":27790}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a2d1e4fee0180ad4ce7345ca860b4fbe6fcf6134201fa537a3a91c67c592f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_22_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_22_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28021}}}],"partialFingerprints":{"codehealthFindingId/v1":"69779d3b87d1af30b7abd420d93770993ee76758793a36866a7a6fbfd3c6c7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_23_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_23_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b446eb935d1a095cedb5b017f3f2dbd3929da2d0aff0af47289fae8708193230"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_24_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_24_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28483}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b3e09d95d0087d61823d6cbabac411355bd6bfc8a896c03d54444a8f0dab7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_25_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_25_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28714}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaacd8c21e0221ee1d0c922cf8e78aaedde01bb6f160926a348f5025610d11b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_26_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_26_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":28945}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9087a2ec21b2d99d7e987d1eb8f5c06d3d93d37fc6f748a987e78fc688e421"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_27_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_27_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ff736664c2aa94646ca9aa18c4a9a4805165a0607cab9d615663ae0b39f2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_28_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_28_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29407}}}],"partialFingerprints":{"codehealthFindingId/v1":"74efb1967f57dcfbe6c08c63099ce264da191380a81c9e30d2b3d8d40010dfc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_29_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_29_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29638}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d74fbd3aef9e672a4a8fd0e22100124e25151e325e26e8547c16b82771c522"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_30_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_30_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":29869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebb4dceff0fb208ecc0847225e79e83e2589f23540d42da121397eed92fc19f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_31_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_31_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65180edf0de927a066e2a2490d10ed9ede81d249bfae9e35c33a40f5a6aac22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_32_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_32_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496f338156b9bec9616cc5589055b5ab2032292fe1a4f8f1d75e9c2af2cce48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_33_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_33_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30562}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac7548c220260aa2d7c1881d0b6c8bc8049582acdd431660f82dee1ed873a54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_34_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_34_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":30793}}}],"partialFingerprints":{"codehealthFindingId/v1":"40603400fae5db623224bf4d9a62dca3d6316fb2e195f3dca8631f0ed0f91f23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_35_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_35_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2dc739561a891af7f86a540afb5dd31a8c1c19900fbc3b1d83d71bba57d29b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_36_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_36_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31255}}}],"partialFingerprints":{"codehealthFindingId/v1":"402b3366631122641a97c827f153b5ba2a3cd915dbc7e7df21c8ee34b3dc3865"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_37_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_37_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b995ab8a1b5d8f80b7334cd33348094c500e28291aa150ec882d8c50487cd33b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_38_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_38_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31717}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c7c203146831780e8da76cb62d8c49aab26726f232f57d544ef44d17cc55b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_39_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_39_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":31948}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc982bbf8817553fcd34853ff4c89ae12ed5011613cf82bd0869857f3afdfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_40_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_40_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2652a4cbed73c8ab27fb1d301be3d0e4b466181aa687c14b80d68e699f66e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_41_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_41_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32410}}}],"partialFingerprints":{"codehealthFindingId/v1":"163ffe4a73dadc7bbb43fb607586eea8f2ed234df544c817e33b67186888824f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_42_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_42_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7adeb1bb54811b09ef1298eae096476e515fc05fdf0c6fede196c83e9396ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_43_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_43_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":32872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110cd89d125d945fbe8a2650fc1160a132daddfb4bc9276ffbeb70b2d82dd02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_44_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_44_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33103}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f309222fae02dac235721da299f248b6b913d423dedec57382069e76ae97f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_45_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_45_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33334}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f70c5106b27a5e0a1e0cf4a70fae0abf3c42ec6a636b3d8a2a4690bee37fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_46_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_46_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf5d26f0179f60c7b1d3493e052de989271b9c5a3537c4fc083ba67822797c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_47_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_47_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":33796}}}],"partialFingerprints":{"codehealthFindingId/v1":"725b1fafc39c542d3acc67b21f6db2a7014dc8468c291d9c922564c26d057aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_48_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_48_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34027}}}],"partialFingerprints":{"codehealthFindingId/v1":"68050593dd3b8a8d4b32930456c8ce4914b16614748ac021ec0e0b33cac1d5c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_49_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_49_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa52a53c58338a38e2c2fac018945301ed69250cc069895ebc399a8dbd8aa7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_50_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_50_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34489}}}],"partialFingerprints":{"codehealthFindingId/v1":"638580c768c5b544fbd6bc1eba44ed289ee582ec0e08c95292f156f4c8882b65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_51_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_51_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34720}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f59946e6338c4ab3a68027f970d4046c73f9740151c63123078d6b88d1a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_52_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_52_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":34951}}}],"partialFingerprints":{"codehealthFindingId/v1":"473c7c435e0ba8b9d45f6975d0b2c9030be6b2a0c07b6460d54693ce7ed90eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_53_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_53_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f7e822e4464124fe80e0d80967bf3dac26b549549b5e1e17ac5b126b108b79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_54_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_54_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35413}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f3f026b4c67dff72d38b9af464fc3e11909e67cdbb0890dede99adbdf6004c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_55_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_55_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35644}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34eb696bb48e2b665bfd3b2d6b136d35dd967fb36d14d22ac82b6cc663080a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_56_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_56_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":35875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0842cf9c9722b21a1a535437c8a722aeb26d7f1777c30b6de4bb5ec4e9c9b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_57_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_57_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38685a84f92b42612b680830ebd72365e7426b94f41f5d21e9a3cc3e386f55c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_58_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_58_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36337}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a0add8d3029428cc74846f4f4a40ce75a903e8eaa78afb2bd5eac05f679ebb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_59_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_59_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36568}}}],"partialFingerprints":{"codehealthFindingId/v1":"624eb54926e3aa72301ed724101d4f2afe93542bd356fe5d469e5915a539f7c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_60_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_60_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":36799}}}],"partialFingerprints":{"codehealthFindingId/v1":"449740eb43961c9db236c4128f6f34e8998114e9886d2fb1523da2cb81626f37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_61_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_61_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37030}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d401af399ccae5d4b8cbef0e9aa36e7e05c7c3f6117869fefdb23fa75cfb3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_62_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_62_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f257dbd8affeca882a3334bbdf3f9a18dd89cdb19cc87a81154985418cb21fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_63_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_63_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5084680d66f71e4bc46006651223d0f10e3e77a380ea9e3950c53fe9b7f18f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_64_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_64_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37723}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a3eea870bc8089217ee94e54b34371426ea61b1cf798af84a08c0f4961b822"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_65_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_65_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":37954}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7e91c032eb84394ca7a53d0512dc5fdd537c49de0f76da5ee69a6787a6c6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_66_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_66_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f537d1e5a975b507e91349d17036e205668029336e27ecf128c552ae6f328e59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_67_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_67_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38416}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e3d502ee33bc48a0f4fac139268a4e6ec5eb65bdd99b6b3ac47572dbaddc0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_68_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_68_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236c216fcdefd98e6fffe470262474a698fa028233a26cc7021d7addd89781b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_69_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_69_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":38878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fec0bae53cfddc875fcc5225f5dd25c12424fa0dd53860f4712a078835b650d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_70_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_70_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39109}}}],"partialFingerprints":{"codehealthFindingId/v1":"205762568b523890e6c9bb99b672ecc5e85260961d70b633b028956d58d5effc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_71_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_71_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6ced10ec26555afaf243667c762f392b368e34bbf75551bfe5383cffc6b6ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_72_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_72_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39571}}}],"partialFingerprints":{"codehealthFindingId/v1":"414ec4c2b44cc383ffc3d987437288702c311ea350da9bd52be30b84653ee64a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_73_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_73_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":39802}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ba996761cdc3c836d6559607e50f2f7dd9559595a8fa6cb0c6ac1d16532b77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_74_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_74_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40033}}}],"partialFingerprints":{"codehealthFindingId/v1":"54babff1bee9357a55953b6113854ae36df0acf959f790afbd2a6eaa99749299"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_75_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_75_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40264}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b1d7de9374ce8d029b0dbadb6c9e611e5c2c198a1ef7aaadcae9d09100515a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_76_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_76_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40495}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bf0318554ca52f03e2c355f794ea26a3b8800e57e437402f7f1e7380fc9874"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_77_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_77_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40726}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cac4a4daab5bfd924e435f048495ffe174ae9ad65ba3ba2a8a515c600989e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_78_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_78_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":40957}}}],"partialFingerprints":{"codehealthFindingId/v1":"080ee4127bd25b5fce67f7bf4c51f46864ea508702b832c0025aa7b4f8e975dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_79_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_79_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7f444bfac9d6b0173d437fe0a117796383c42e403323949c62e864ecb3bc28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_80_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_80_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41419}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b6eab9525f55fa0ec87aba8be74cdc06f4a8df4f81af52c926cca133269ffc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_81_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_81_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f681faa06352706be7f540702c447a0f06b50aba6d19431b286a3f3dfc05fee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_82_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_82_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":41881}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a3eeee0ca5484e8cb216eb6abb9191b6927e0007637cbd88918e9a00cb21d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_83_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_83_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf5c2c36b3bc436e95e1ee44aaa3bebb6bc8ea70257230f6e8094139b25908"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_84_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_84_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42343}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9315ba3171010ec78e0921b6741f4e14c581f6bd9dc56f05c99c0fc7d9842"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_85_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_85_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4717038e487d5cf0c1142fb600dba1da0556e57624a007bf53a31bca549a6ff2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_86_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_86_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":42805}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c261872f775028ab4cebe11edf95f0bb2fecb578ea7a69d4ba7e98c0ab2d5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_87_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_87_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43036}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3957091f5a6665d5e3598e6fa719264a02a9c650f4fcb9ddf8f7ef0902351a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_88_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_88_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c68fa4fb697f89c4be221af0528174a3e94518edea65085dd84de2e976dde97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_89_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_89_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31a644c5d8c8914f94f99f45fcc73c29ad3a7f8a37fb549ab1c3276318f8d15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_90_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_90_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43729}}}],"partialFingerprints":{"codehealthFindingId/v1":"8206d29076e8bb45729de3b099a1c4a9f86cac7397d698a421e36251578e3465"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_91_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_91_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":43960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0431f8bb614eab25243ba38e7f679548a45cfb90dca56ef86eea68d8959cc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_92_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_92_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44191}}}],"partialFingerprints":{"codehealthFindingId/v1":"89765c11fe8b966b1e54ed399f8509ecd84abe5800c163247feae5bcb2943da0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_93_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_93_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd23466fd123aa3d55c47400eccade8ed71b4aa6ba9babadd33b900a158da4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_94_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_94_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab312858584aea507476a1e3a6526d20f8ea934d759aa919d622a7f87e896380"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_95_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_95_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":44884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c515850725a3d58ca1e672457d610786c5d39e6428d2a9296fc71c9e4b69de3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_96_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_96_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd860f309e9a8c89678ec9f87f3560a7e97a021cd0e5b5c9634530afeb80db6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_97_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_97_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45346}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe07f819dae6ec618bbed55a639ce40b98811dca9cfd9349aa66dd3a030bed9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_98_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_98_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45577}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e18e6361fd0c8155546564745500725a43c01519b2d4455ef0631f10c8c5757"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_99_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_99_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":45808}}}],"partialFingerprints":{"codehealthFindingId/v1":"beed50ce0c70c5c5f13486a2183a15fc1c38c953b559267a03c874ed7a738a59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.valu_selfriend_rela_100_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_100_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":46039}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa59bf22793a8897cd4eb4d1e2e11434835cc38b6eb6120770917a370f10e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_1_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_1_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a911bb3b3b177dc5963629fe3943c99a00f9415397f89bc4e1019399e45163f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_2_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_2_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23402}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d26881d148ecd314114c07fb0c5775364bbc3066ab77ca94b3fc7d4938fcb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_3_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_3_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23633}}}],"partialFingerprints":{"codehealthFindingId/v1":"299e194bbf64304f53a3422016cf13479943f3538fff40d4f23126c9bf8a8fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_4_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_4_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":23864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f684baf75f7ac22835b14c99db8cf8991a7d20b84e61024f06457e5d160da5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_5_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_5_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24095}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a66749127bdc4404e6063f74dcb784226a5759f364e24b92335fe13506f18d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_6_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_6_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf91ac6728eec88fb2dd24c38937bc54f46a00131d7fc886ab15bf869944c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_7_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_7_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215df726e1a519ad099152dd45b0144342ecfd2179a376058858170f6d45a84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_8_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_8_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":24788}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b50bb06cda61fd60edbcbc2bda39a9cf4c20ae6f7cb871babf35c66393b4eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_9_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_9_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25019}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de76a01e6849b69025ba15bccafeff3a3a6c6e8cc5328843f1a466316dd926"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_10_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_10_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ca4ef6799925a3b783dc0d9d9b06ac73dc4e8ebc48e045c0df3fa983c44d44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_11_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_11_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9373253041a6675195ab927c1236143729139bc29a525540fb530082951e90cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_12_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_12_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed20ad1ee9380974880e4dc9a841481004303597b86572256357463a905cd00d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_13_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_13_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"545a405dc9ab9c57206bb7e9fe55fae37e4c45999f34a6cba031de2d5dbf7bcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_14_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_14_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbd593c6321458e88f12dc1ac2715382e263c8471e16cea7a33ce89dc0d64b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_15_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_15_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26406}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3378daef1b9c4c2a749ad3c3085049bf6e96d6bf30781552e6883effb280d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_16_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_16_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26637}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dbc10a21423c95b32d502d3e97b0a6f346815347c97934075285a63165ebcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_17_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_17_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":26868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e132f06e83b9978bc71f42573b86e4d42a06dd46e80ab9ab41f3a395b46eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_18_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_18_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27099}}}],"partialFingerprints":{"codehealthFindingId/v1":"976e5ccc19e510311ce65242933688ffa488e2b247847eca599ee9d8e76a8cd7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_19_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_19_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf00304bf9f3ffa4f2b698a0aabcffc4d2e4a439cc9011886acdbea6370fb948"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_20_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_20_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed1197a80e44f78ddc056ac9e4970d48c4865e3ed3b445d39ba4b99dd8e65d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_21_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_21_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":27792}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd125f6d01bd2f3077450c14013a79d33008cce0119d9226e7b3467378077faf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_22_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_22_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bae83f354c47b5a0827ebb7efc56619a388fd07a23ac56b5d49fbb0d5d9b109"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_23_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_23_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28254}}}],"partialFingerprints":{"codehealthFindingId/v1":"280b281a041b08d4f12726f85772f48dc453273b957aabd86824ea8a418c114a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_24_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_24_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28485}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ddc644592a5611cb6506f0f4b277a228a2b27ec8f466fe03ecfb0cc128c63f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_25_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_25_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28716}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a234969b5848604dc1593717b6a076d8621d98e9182519ee6268d8dd613eb34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_26_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_26_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":28947}}}],"partialFingerprints":{"codehealthFindingId/v1":"2242eb4579170a1612549914075c417e80422115557b3a3667b8922d467ea851"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_27_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_27_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b076dd0d60c659ae31d9e57cd33b534b7b7ac1508677927e56aa7b0106b16ab6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_28_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_28_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd65dd809c877553e6e0674e6282b08b0a9b23a4fce4c80be7596d64f1ba740"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_29_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_29_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29640}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d20871792d32055098371f5abc33729f0bdac38492531f1bf84c9ba546e004"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_30_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_30_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":29871}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d67551d8817a5239b84451539564f43529f68bc9a5bc888711e3ce176db7244"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_31_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_31_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30102}}}],"partialFingerprints":{"codehealthFindingId/v1":"155d1e42ea8c84f300f8f62142c1f4b88571fc4eb9b84655b1c3abbe62ced00a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_32_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_32_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30333}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c9946ecdba36e724f3e2ece5b2d2b0cd5722c9b1e1470a67b9ce0f50bfa542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_33_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_33_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f597a60496dd6e6081b517e6588a2f29653378220d2814e742c0523a19ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_34_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_34_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":30795}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06be5407572282d3a86e313bf60c5cf98ee92b99705f491ce0ae5f49d17d1d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_35_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_35_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2b9169e32c32a383834c0d83243c0210867ad171e5462480d1a4cbc8b723f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_36_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_36_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31257}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0a25b66ce67148a9f7d1634deb532e676d377d038d82c96759e4dff303e01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_37_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_37_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cffe4f41a486b64cd7e2093c73dfb369a523b20fe45f9c5030788c306ce7a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_38_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_38_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31719}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a996043816955601598cdfa330a9686fe57a4bb6a9de9958da0be65db3807"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_39_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_39_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":31950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a49407e9c8981e0377fa689ddc12ccbcce1b03ed262d27182f47f1feae7fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_40_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_40_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe41fc8eb75e6c88834381bb4ad4106db013cee31d3ce5f8239b86c370e7f6ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_41_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_41_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a63c7acb93f12fb7220765f6334b3abad426707de1ea21c92e8707ad5e507b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_42_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_42_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f889a3b1c53d6e4d9006528bdaee62f0b96e28514b914bbdf8f476808f3da890"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_43_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_43_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":32874}}}],"partialFingerprints":{"codehealthFindingId/v1":"2005ef8d2fdf9b8f19ea31d50d30a12ce04432c3484ee16a1e5d22ebadd1aeed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_44_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_44_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe01c2083832a2d842a2d3aa5f34fc7ef218b2a5ee45e2583fad06f2ef196fa3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_45_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_45_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad80a40d2b76cebab6ee1e4b55642aee7fa5b8bddd4084085af35e70183fe20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_46_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_46_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33567}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc36731a2b1283de0771abdce8ad4a9c1ac427a6f59aa28e5e11ecb54c72f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_47_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_47_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":33798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad49ac18fdefbc5f83bcbc61521fc0677457439161dad048121185221f1451"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_48_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_48_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34029}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15f6db942a5bffc91aca027c5f33b1783fa9cd9eb9fa8dd5e1979b71a56d100"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_49_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_49_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f704187277a9a40093c0e46760a34bfe83ba7b29e87ddac9c37cd2d82baa7e55"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_50_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_50_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922eb7ca3345bf1d464d7625899070476c65a55c3a37846f2ce99cbd76e46f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_51_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_51_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34722}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63d4aa222a386112d1a7ce96bec4cee10bebd85ea3c427866053dbb51ebe34e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_52_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_52_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":34953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f367a81782fac85f6f8abd693ee2c94aefad1329e2ae2983b021341bb57bd685"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_53_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_53_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35184}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff4b53a3f12f0fe460d29ad7e946cc56a5e1b20857896cfe7227ef38f7b6611"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_54_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_54_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35415}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f3fd6e683ea2c711ddd9a2d3284334a7697a81db2c74f41f84f8f8611c0805"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_55_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_55_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eae2c3c7cc98e59ea5f6116d40988aad8c9cfd3adc1198d872abccb9abcd9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_56_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_56_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":35877}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d15b46699e266e80097ffa4367415694350f41998fc0339c98220b41ff0ffd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_57_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_57_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14ac91f8fb9d02dcd50c7fc4010b3986622c589aa282dc4520df02cb25645a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_58_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_58_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36339}}}],"partialFingerprints":{"codehealthFindingId/v1":"decb8d10d13773b4964c31dceda20de1bcc86d29e66fb08eeaf4a4ed9420e8bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_59_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_59_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1f2881508b817e4a3fa540632802847fc041e26a7892c22dd543916a0c2977"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_60_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_60_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":36801}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fe1b02bb3183388bb73f892522cad158b35cf47de28d1cc5963aeceb9caf9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_61_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_61_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37032}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d2955259a99763076539b08fe4758fcb179c5273ba1afb0a12d127684e84d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_62_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_62_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37263}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ae35a5518916ff3e5881fbc91757d682296b80b32c2a2ff6cfbc9b50c4c765"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_63_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_63_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37494}}}],"partialFingerprints":{"codehealthFindingId/v1":"168c8b311e0c6dd9219e8e6ee5a10191936f4f7fd5f36175fd6489dfbbf61080"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_64_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_64_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37725}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b35d0e02f44da29368f1f4089dc629b72cfa8d5b1b3036c1388772afa6958"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_65_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_65_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":37956}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ad604333a945bc4a7702dcdeb935d5b9311f2f541c60311ede019d3186df2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_66_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_66_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38187}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c78af2da02ae3fa06ee89c686918cf46b116308d31b589cb4dab9ce9fe7522"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_67_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_67_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d631b66f0326ca3f66a750a0b9445258063795af70938d1351fcdbf24028c50b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_68_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_68_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31f61c37b20ed9c037fd03073fe5f0d8effc64aa1214e1bfa827cbd17113b96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_69_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_69_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":38880}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb1cc132698665cd3be54b5d79dc3241779871f66b16f3ca5dcf6c2582d1d41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_70_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_70_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9581719113d17479fd54e482b0242e900467e9010d4c858390ec3f2aa373e7d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_71_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_71_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c49b69f5aeaad4abe826b22549235038505f66eb0a4acd4ad198c5dd8e88d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_72_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_72_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f645f9fe9ff2ee2736c233857c1f8888a93769b4898719987dda19462511403"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_73_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_73_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":39804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac6421a0dc8f7d675b96bd8e69e037e91ce519e4ff860befebf315f415a6c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_74_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_74_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40035}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cf92553ec945d6ac2b3b6a2742ec76fb1e031498c5d1612f1b23026f3379c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_75_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_75_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c317a86ffb99c43a8ec407e67e158e1712df8a8e84204a02c2d20dda1353a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_76_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_76_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad43954703213032aa1a112665600390991c740e9090c9676b4f487fefc334"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_77_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_77_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40728}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613c3d1d86297f7a8b1cdb58bad8862554dd274e7b0becf6369c7aae874c3db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_78_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_78_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":40959}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49ce387eb11cd7b0a83da5efd015d6441d27b7df874cf5b87b2173ed1e0461f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_79_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_79_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1edacad530d3d18c6813248c0842dea80b12d6254449f02e41be429bed65913"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_80_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_80_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6512aa423b9dca1c13cfaf2c2315b178b3e54452027c277f43f03a22af7210e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_81_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_81_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41652}}}],"partialFingerprints":{"codehealthFindingId/v1":"336c60f20f51bb650b44c7af2f6694a9a0dfdbbc29bc3600621ddc767c861348"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_82_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_82_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":41883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d88991a79b3d765af7841f12b716900f55b828437ad9f0e53316470fd7ab582"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_83_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_83_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e72d8b1f0dce8467c0ff3074ad627e84e51eadb86df4bc63c1c8aef9331e63c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_84_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_84_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42345}}}],"partialFingerprints":{"codehealthFindingId/v1":"11749d42ad34ee65eba786b63dee6079d9f7c232bb4005649e6111dae5d66f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_85_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_85_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42576}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f68d89523571c565209c34e5c5b1f582997d065179379f26ac277d6d95ee1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_86_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_86_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":42807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d0c21f5cfdfd737ede64ba366532a2131e5d378c56e3eb6e3d6cb61dbf0590"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_87_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_87_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43038}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86cbde5e6a9708a28ddaae69d0a7043b2b2fd137010b680aab0ef63b7cf9ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_88_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_88_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43269}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f82b5db892133c93d2958e0ae33591b31fff348fc85279ec9f352dad3d6431"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_89_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_89_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43500}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d152b329fd80fccc67f306738c80f83a5814e12c51b312cf752f7299f57e4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_90_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_90_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43731}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0f797696e3655ecac7f915229aebce1da01086225b724e5ec99290ccf76aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_91_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_91_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":43962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7adfbdfde48506b571ac683c8566b61423da12f140d7fd21a94d62c542b70b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_92_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_92_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44193}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b6c0f4439f43e65e6986626a4aae15241f4e5c11a93dce44387acb651ac85b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_93_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_93_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04537cc590cc925b5fb9bc723d07f55c934f12fd91ca32cb7b8aa45ec8b4aa8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_94_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_94_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44655}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b49b9efb8031342dc5cfd873990b6abb322d4094f278f26073d0e52379bb10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_95_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_95_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":44886}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f64f9147aaee069a4bdb482dbaf097ef26cd3add4cd33589fd2683384f9442"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_96_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_96_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd994ed4c71942ac754d84184742c5f2e7a12d12948675db2b30ebd7af5e0c48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_97_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_97_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f405b28d8921ca35ecdb94f8219e489ae1dac0a32574c323624e514ca6275ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_98_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_98_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45579}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf35a39b957da2035f14286a85ec906c96aef952c769cedbd44713869bc90a17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_99_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_99_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":45810}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c746ac9ec6f86c68e9755146a8f18f09fb729a96e3e8e8382eda3bec2565588"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.valu_selfriend_rela_100_ValueChanged: MethodTooLong \u2014 valu_selfriend_rela_100_ValueChanged runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":46041}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb64c614c33a508787e7ed29e3ce72101ced9c843769d90678673d877862189"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_repairsave.Check_deletetravelersdata_CheckedChanged: MethodTooLong \u2014 Check_deletetravelersdata_CheckedChanged runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"339fb57b8126e351be4db7621c24ddd6a3ee4f615c412db47439d6bba818505e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_repairsave.Check_fixunknow_CheckedChanged: MethodTooLong \u2014 Check_fixunknow_CheckedChanged runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e64a03be81e651a6241db0f63a21fe27c36c6f64d404548ab0d0109749e2de2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_travelers.Readmiiname: MethodTooLong \u2014 Readmiiname runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9bdd47bcbb679a2982fa31401d24a350013a117fdf3fc0b66c2507955e56e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_travelers_status.Readmiiname: MethodTooLong \u2014 Readmiiname runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c673300b0d7eb9c23414c1ec8161b3ddedbbd15cfa98dc58bc43d649670dc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 215 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":48696}}}],"partialFingerprints":{"codehealthFindingId/v1":"906585edef787679e376964378bbf39e3682ee50ffaaba19e05c20d9e728aa08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.DetectMiiregistered: MethodTooLong \u2014 DetectMiiregistered runs 215 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":48699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7242faa49cd47d05c7be946603c21a9b0b82cb8d9cab1792e77bb4c42dba716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Miimusic_edit.Miimusic_edit_Load: MethodTooLong \u2014 Miimusic_edit_Load runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6ddcfeb6fac46ec55d1f2ff248b8de5fcd8c1411c82933b8ab235fe9950c42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_settings: TooManyMethods \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_settings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9c6851c453e73ed2da2c6c0d1c2c56efeaa882c4775153e92c146d94dc8997"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_concertedit: TooManyMethods \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36d9a22cad96e9f8b7ee8235a81013a60e9927baaf97f72babc2ce4ca1aafe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_mii.SetMiiisland: MethodTooLong \u2014 SetMiiisland runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c1983d2e1f7ba0e94d086fa733dec9071eab9a39bd2012441cbd385fa4381"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Select_target1_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_SelectedIndexChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8672}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1105f2e14555800737205723af3f8c17c1de63f4c68acca1803af6296a61e72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.Select_target2_SelectedIndexChanged: MethodTooLong \u2014 Select_target2_SelectedIndexChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":8878}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0cfb3d288a8ffc6da599899d436f73b31aab791b3ecef158e39df0b8594ed8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_interactions.valu_target2_ValueChanged: MethodTooLong \u2014 valu_target2_ValueChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":10221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc178123a9db184668d5f48aafde50b609e37debfc498ed24faf4ffdf1bd053"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_target1_SelectedIndexChanged: MethodTooLong \u2014 Select_target1_SelectedIndexChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27077}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a04b2ea2f4247f40e57ccc0790eb2e19682319014cf7150e467c2dce9d22db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_target2_SelectedIndexChanged: MethodTooLong \u2014 Select_target2_SelectedIndexChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":27283}}}],"partialFingerprints":{"codehealthFindingId/v1":"76838a4efe54ede5ae157e33b4f7a8f28ba9139884f2f419aad535947f72c024"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_target2_ValueChanged: MethodTooLong \u2014 valu_target2_ValueChanged runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":28626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40a93f1244aaa05804c481192ab7824edcd8d05036ed190e7d4bc52cc86357d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Writemii: MethodTooLong \u2014 Writemii runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51383}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea925a1d5a0d7d0e646a9a9e6c95e58fa5bb673f57c93e0a33c6f4b6eb298ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_islandsettings: TooManyMethods \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandsettings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb8d10b1ffeda5e505d2fd2732776a6b587594793962a9dcf3239f9d380384e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.switchfilever: MethodTooLong \u2014 switchfilever runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d16926df3db88f9594938cd6e4f06ceb19a7fcde32c3e6c32588bb742b4bd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_travelers_status: TooManyMethods \u2014 5698 significant lines (blank, comment-only and punctuation-only lines excluded), 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fc67f62f74c9c7a1902733e52773428b487945e160098d989ad3b68e1f6b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_miifoods: TooManyMethods \u2014 16197 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d101bcce3ebeb8d0673e6102607f48b69a15b4c528a3ff72000679248cf5a87"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_islandinfo: TooManyMethods \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f4c72562a01ee7c74cc2c4e64642a0d7d261312184f355dfc333cddb2b4065"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Text_save_editsongs_Click: MethodTooLong \u2014 Text_save_editsongs_Click runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":9106}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ba8db340198426225677f886980c361c3d015946fb175ed9f1bc2befbb7397"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_manag_allmiis: ClassTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 270 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9a44d668315677c072d04044ab5ed29fca64a55e97013f03a8b1f8dab5ec3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_concertedit.vb: FileTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 328 over it, 1.66\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":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e95503caebaae4c3d0f73a9ab676132fe4e1f40c03c3d59c8a6605ec7641a60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_hub.vb: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\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":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48671fab1f3e70cfb7eed7e1c0ec614c6e41b0972e8b5d46be4df42c786f67ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_concertedit.Text_save_editsongs_Click: MethodTooLong \u2014 Text_save_editsongs_Click runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61a307e38735a1632ac0c86762ecf186b7202839d5ea7f392036624d47c2527"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_datamiiexchange.Setmiiexchange: MethodTooLong \u2014 Setmiiexchange runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"83db5288c48cdab4e0c5f05f4203a5d4cbbfbd659c1e54df47e565f5210516c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Miimusic_edit: ClassTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 212 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bf9b5d45d755130281634eb9b52157c17bddb21263fd7823aedd3803bfa282"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Selectlanguage: MethodTooLong \u2014 Selectlanguage runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41edc0701b53f70029d11d648a2def37b7ee97c38122e5d4515f521f821e458"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_repairsave: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 206 over it, 1.52\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e9499f149668a88b9530535e2f1e2bb64de237ac64e86e54eb352f1a255108"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_islandconfig.Savefileregion: MethodTooLong \u2014 Savefileregion runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandconfig.vb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ad03c047330ad7579c56ce700cd11e824b425b43e1f703aaa21f0b5bd0d76"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_extras: TooManyMethods \u2014 4082 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e50679e4579781e11c588e309d419b81124b9df935df627c025909f1de222"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_mii_SelectedIndexChanged: MethodTooLong \u2014 Select_mii_SelectedIndexChanged runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47465}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e4af19a832929eb1d3f42e2f9a7a3a97cf21c9f419f643eac2fca8be869cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Savefileregion: MethodTooLong \u2014 Savefileregion runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6607545c849dbe54eb1a0c6c9a362a78fa446af371fa1b56c6859c68a138c09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Icon_bakinteraction_Click: MethodTooLong \u2014 Icon_bakinteraction_Click runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47101}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c329d977a92a63a324c4b085b36bb7436f7784d7e77d6fb1e0a840434a062b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_islandinfo.vb: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 183 over it, 1.37\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":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37163215fac3cc961f9519233c159b4597572dafe9a24805d8181720a2fdeb23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_manag_allmiis.vb: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 174 over it, 1.35\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":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917d9ecfabd2e5b57c06b25432adc0568a992d08dd6d828f7b9e80f39573177b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Miimusic_edit.Text_save_Click: MethodTooLong \u2014 Text_save_Click runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb243b2a92cdf4b3ac012d042a8148aabf484ce3d0aa486b4f2c5cdea00bd82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi-Life-Save-Editor/Miimusic_edit.vb: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\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":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d61319306061db40e1538f85b88a9880d0cc65132e8c7bd47fab4219620c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tomodachi Life Save Editor/TLSE_repairsave.vb: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\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":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73b980e80b77ca7144d9c48f097d59bd3b4fbdacca0388a4d0ce5642ce1c9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TLSE_savefilesettings: TooManyMethods \u2014 344 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_savefilesettings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cde09fd828c8245c436f53348479cabcd7298bf10987279c9b1645e4da8beb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Advanceitemsedit.Fea_setallto_Click: MethodTooLong \u2014 Fea_setallto_Click runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc2cb698b4fa9385eda895d1cdfad31b8b87103f659b7c934d282a0782e1712"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.readmusic: MethodTooLong \u2014 readmusic runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":8891}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d290af9a6243b8911eda0923c9b964197551041eae970ff8538bacccd801b00"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TLSE_creaislandranking: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24037808c9796560ff6af6d1981799e8ea065d3f6529511ef4ab62bbb0d5eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_itemsedit.Text_menu_save_Click: MethodTooLong \u2014 Text_menu_save_Click runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4423a8c5e4eccc772f63608dd2f27967ba0ae24d20e8439b5b6e56a1fb81814b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_manag_travelers.Settravelers: MethodTooLong \u2014 Settravelers runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb13719992106d8a871f192141def2f15a40b81655e586ff417291575d2d1e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_concertedit.Select_songs_SelectedIndexChanged: MethodTooLong \u2014 Select_songs_SelectedIndexChanged runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8fcdf7f7bb6cff502821c6461a0f9fde086c81a7abf61306cf602c628114c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_concertedit.Icon_crthall_music_Click: MethodTooLong \u2014 Icon_crthall_music_Click runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c9901fd9737a551aaeef0c558a625113a8e2e93692047e273b3ec20058879"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_songs_SelectedIndexChanged: MethodTooLong \u2014 Select_songs_SelectedIndexChanged runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":8786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f7b080227d81ac2d61d0b595a42fb2128a36eacf1cbbb7606b43ebeb20084d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Icon_crthall_music_Click: MethodTooLong \u2014 Icon_crthall_music_Click runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":9303}}}],"partialFingerprints":{"codehealthFindingId/v1":"68591b1e2eeb9bcd0a38fb0beff18f89e89b30cd71f14445290fa73d3da4942e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_Jrelationships.Select_mii_SelectedIndexChanged: MethodTooLong \u2014 Select_mii_SelectedIndexChanged runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80475}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e8c85a022b8356bf912e7235ca7d475c5c319540e41ad08706fc237038c21d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relationships.Select_mii_SelectedIndexChanged: MethodTooLong \u2014 Select_mii_SelectedIndexChanged runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":192098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b967eedd695c13c9b096181ae5f3e3455b36eb8086de877a3dbed5308e2b16b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.Select_miihouse_SelectedIndexChanged: MethodTooLong \u2014 Select_miihouse_SelectedIndexChanged runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac50acb0c2bada9f1a93e6c7e6170523cb763750091af352109f797f4f4c4cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TL_SaveEditor.valu_miihouse_ValueChanged: MethodTooLong \u2014 valu_miihouse_ValueChanged runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":47361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e19363039595eddcee3a661cde184b9ba1ad7a22e7a839f2e3c36e9c07d9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TLSE_relamechanics.Select_mii_SelectedIndexChanged: MethodTooLong \u2014 Select_mii_SelectedIndexChanged runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relamechanics.vb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"99533404a7b425b7b343183467bb810e03bb3e9d5a2153c1e6b2434163cc6f3f"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":80026}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f5f140cd9ae23b62098917c6a694b9ad6ef419e155f3587b2044c275610606"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad60e2e6917caf1fbc4e5b3d64e8fd6145dc6a5b3bede96a4955851ab02052f7"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30e69ee3e9d033101c7a4bff574faabddff3f3efa758ebe4c7511f00d4880e6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c18f76e3a5cc759c686b23bd3dadc65fd952022ec40bb2254831120bb4055c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bcfc8a1f8c11cd539175f71f5e7ff48149d7e99b50431b1d39fc9158880257"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a09bc8db25bd4f8f063c17d97c4f33a49f25a2abc7d5967e1a2e80ff0cae3"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"543891dd2b11f2561cdcfa11b587637743e8ff0ef52b0f3ed199a34a3dc87ca7"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5544ece008492fb2c68a3904991e587cc820b25a64c71b19ca94e25ec7a4561"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70194ca1bead070be9ec2bc822f8f6c8c420185c6ab531cf425c0b2927c7d05"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe81e5dbb44094900ba9f045e6d34caf2abacff36a549166ea28e6f6b267e94"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7be53a7265d6399647924b531d7d0ef36700e92b099ed655a99faeb04898b3"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe25782646dc57d0a81329f01b1f70297ddad637a78e802baf4bae15ff0ed66"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac1e56c7540415bbf0e51a875c6e880d8d05e8e7759818439c2c0fcf8d64cb4"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandconfig.vb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0e96d976a72e8f9e7a8370864681e711a077ad0cf60eb966247882b9d885bf"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de54c87aefa667096c5c58fd2932d53a283a1725d65a3a73d7013d06f65643a"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandsettings.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b92919749dcecaf5f119ef4b52f70c8e6ebef3b1fbacae7f93631684900b278"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_issueslegends.vb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe61993d6490dc4c6ca2d13852ded847815da2d63cdb57759bfd1170a66296e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1339ee98a47e2287ed9bcc69fe266b25d2e74c9d9f98d3986f5fb1b8b6133b02"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsprovenance.vb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b61c34851aaf9a1befbdaa66bdab9fcd3385d445dcad97a6f130ac074782ff9"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64c7589b126a94ee45bd49108150bb689f0f34af754645f21ea4089dc37429f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c5923e75c2040aa77fc71f260fea74dbc9d592636c993fca4ed2296da34003"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a84c61739907ac8c17ea518b73672a089fddd3c4f5abfd4c9933e1b58a5b9c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"13308484f2163f5293a6db8bd0a5bcfa46b2abb7c6fc3e7155605ef43107b5a5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"636ee72491ac4797f8f9488f76b843f1ae31eb1435aafee56211bf160899988e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb361ce7086ad9b9d01bc828c53fad8133da5f329e08636b1e5cf044675d0ea"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be8622a5c866a76f5bbdf744bf5e8e9186e9b4105f579bb0759e92d3481aa2"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"94975828bd63295436401279a3fb81d29b1b62854fb9f7f055573859d410fd8f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eddf82f893cfd90042459f7fbafdd5c1f1a87b4a9f6ea44b883f1260c3a2aa4"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":191629}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cd7287ccd9451786e4e0ffd3c0c05cbebf33a404a4f96b75c8822a19326c87"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57f49ce5e8ccb88ac7c47cef9d3032dc913c1fd8924938eaf9c4c45fe49b07"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_savefilesettings.vb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3105bd909ab847a400f531ab3b929c5b8b685bd65612288e500453af5b84dca6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_settings.vb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c130a65a1c34ad5164c2b3be7f5fd0fbd9437715d7e8db56cec5f21420b63b6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe0551cbf6850529d80f98cb73782fd6a3484da430c26d74ff9a3a24499f07"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfa4197700fac3d10fe33a27277dcafe8b4f1e39a8b71d9cd2acf99f75c62cf"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"596b6708d63ca51686cffe90c9283c77230c9f42fadab2af8e3c61c7cec2419c"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeeac2c2056a6dd1b9c8b77da1d667555aa93dfa9ebeb52b7c66f6bfc62f5ef8"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43801d77eb097721776efd627283bc6a3b1cc9a7876b2b91e9a8192f6108977"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd6dfcff38a0eba024306b61e9714b0a5a4cddf01b3784ae3db2208a719298d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"873acb73972d83f14e629bd61fc0e705bf01d9fe56dd2c3aacb5bda6e9b49b73"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f625f25ef90d2e6ddb93daa87f2a20f0bed7deef26f14d93a807e2dfed49c1"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad12d987582c98df729c5cf88573de43bb66d688924422fb55b0e92322175bf"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69162c964c798efc2619264594966bcb06de5b1b84fa50cafe02c239c3a6dd0"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":48415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd27bba5c46d2a02a2403dbece5d6f3d5aada84ae62ac8a1e82df90e500fd46"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":51698}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b37a2d0e3406d1364ec9615039e51f8e28305c86bbbd5cfba0e56449e74274"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":52915}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac67b01a425b74a08bdc7b9a764ab01adda6c7e1eda87d182d173e6e3f584fa"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":53323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac981f2aaa83203f58e82767c00629889dc6e912dcb7d830547e3114f24a1e5"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Tomodachi Life Save Editor/Tomodachi Life Save Editor.vbproj\u0060 makes this repository a deployable product (line 8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/Tomodachi Life Save Editor.vbproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"78109385436047e6a4750a875b354576a2f157eb9a14b418030f83d351e79943"}},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 32 of 32 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 32 separate risks. Counted over 32 of the 37 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185987415c7ef1b829b38745188290ccaafd1fcfab0b85cd12dcc292ee92c6f"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_Jrelationships.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215cea7360c9253145a54b5537e859744023b253734bf02014f348b8a690954"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Form1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e531299de695946c8acfeebc3a2c04fea9209b11273afaf1eb41ddea50700a5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miifoods.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5b477ca606f1083efcbbb28e42dab1b9b7cca80bed7d0e55de8359bde5ad98"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_interactions.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ae33fc933b231c13b9df1abccf440316ea072f0613916a29394b2bc6d0e5b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiprofile.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f76c4a229f019a73245733663488e796a947d0a588411a742ca38ce3baf16"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_travelers_status.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe35c9bfc527fe8c79ff52453e0b742be47ed8a126ee01e9dd722f5a6196767"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miiinventory.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6e9f8e35738fac9fa699da82c406b614f3bb31c12bcd0e4049ff6ca353236"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_miistatus.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4120d320349f92c52e36a35e6ab69be2105aa58daae0f95fd8d3d0d88505e166"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_extras.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d69a39d662245f4c9a469cfb2aa13b41eedae31bb377d353251a00ccdce036"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_voicepersonnality.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc729167813503902c62b2eb5ac57810a9a409acd2e4489e543978b4c7a88550"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_dataislandranking.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be3b9fcdfee70d69e8eb59699a9fba2912ddc99950952a8aa0ecb8aea98c2ee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48dc5882e7086f8f0a93abcdc0eaa5bb308f678ba2ebb38d12dcd06dc2082ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_mii.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb699cfa10d8bcb6dd214e11764605a71d691c6a2b121e90e5ad9c197422857"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_travelers.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10420487fd147bb3278bc14e07c6add1bc5d9101ec1eccf79fdf605049a1626c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_datamiiexchange.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8601cc0774b4775fd8b62651a30dcb79001dfe46a2cafc3362b1f864f2deb03b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_crcxmodem.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c9532f4994487fcf5d365c3d763d0601bc8b53cad383be87975dbbd3ff4cdd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Advanceitemsedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61147a70184223c7ced8229579f5c50792350234e18aa7f4c38b1c8be33b2bb4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandconfig.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e5e59ad23968b7aa88f4e5bc238709142577023f104edf1c696fce92d33bc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_hub.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb53ddb83a8e7cc33926b12d1646eefaf6e8eb5766733cbc95ae3aaedfbe5ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_repairsave.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf4bfdbdb43c8b70fd8bc7f43822acb86f4e60f7fcac36b409d9714a7dfe449"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandinfo.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e192029103fe61d20e776cfb1932312b18209f49606158cdcdb70555024bac19"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_manag_allmiis.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aac10eb2d086538b3db4d4748182280d1d1907ac61aeab894754ddd626aa3b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_concertedit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75a035d0128a05c497b03ab90e91a5ed4c421d9240afae8592af2ab588685ad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Version 4.0.0/Tomodachi-Life-Save-Editor/Miimusic_edit.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a48087a46147522b24e1902702910f341ebd6cfc6884e9a4eb645136062876"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_creaislandranking.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524c6eb2796577e5108e1a4c809b7017cfa849539f8cf15ce6f0c03fa618ad6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_islandsettings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c787fd27fb08497f10f20f13c194344fff0b42a49c579249a1d72b21053e27"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_settings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b42434076ed91b1f0adfc8af27b7c4b9b69f9c7574b513d4dc621e5ec8b173"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_savefilesettings.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c3d70ca26d68a2e0890991826365a7ca05a3cf1681d4a8e0b172356fc3acef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_relamechanics.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36110d3aa9c507c1a1a282257f1908f6678d77b8565a791cebdd7900fe4d01f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_itemsprovenance.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae1e05fdd60d73eaa399b51d077568c7a0ee55d75ba5db24d1db45b88553ef2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tomodachi Life Save Editor/TLSE_issueslegends.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b45cee499052de144af243ac9be3371760a197e0c455a53cf5a8f12f7d944c"}},{"ruleId":"AX5","level":"warning","message":{"text":"Appears unstructured (no recognised architecture): ~674.8k production LoC (57 types) across 2 project(s) / 4 namespace(s) with no recognised architectural style or layering \u2014 at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected \u2014 code is likely organised ad hoc, which makes change and onboarding harder as it grows."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf38333cec692da9187608fc8d12d547460b1d3964d6b4da78c9c51e859dd969"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 79 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"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":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets \u2014 CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]}],"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":0,"secretScannerRunsExcluded":0}}}]}