{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Edmonds.findMSARecursive (cyclomatic 29): Edmonds.findMSARecursive has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Edmonds.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d115c79afdc1810cc0668effed0eee4ebde7703add5352351278490b28b5fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"LongDivision.divide (cyclomatic 20): LongDivision.divide has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/LongDivision.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f43aa1501ec304acaae88a6b0a50426d5e6afc3c46f589302a74e641a710156"}},{"ruleId":"D1","level":"warning","message":{"text":"HungarianAlgorithm.solve (cyclomatic 19): HungarianAlgorithm.solve has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b7b37ec5021c001c033cd4d018e4c93318d7cca83e95c9c99aa98a5b7e3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"EdmondsBlossomAlgorithm.maximumMatching (cyclomatic 18): EdmondsBlossomAlgorithm.maximumMatching has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"72023094090e559f5d037a89e6c5863094453f0faecb1bcc4c0689093cce6d55"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryTree.remove (cyclomatic 17): BinaryTree.remove has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BinaryTree.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e80e99e85b2c5c02113dc6fb0f88afd90b2f4dc97c5cc4f027cb28cdedd5fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"BentleyOttmann.handleEvent (cyclomatic 17): BentleyOttmann.handleEvent has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/geometry/BentleyOttmann.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"29261c140b191a1ee4ca87a53811480d24905e9206fcb0287a73cb975b51bcc4"}},{"ruleId":"D1","level":"warning","message":{"text":"HierholzerEulerianPath.rotateEulerianCircuitIfNeeded (cyclomatic 17): HierholzerEulerianPath.rotateEulerianCircuitIfNeeded has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/HierholzerEulerianPath.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b59ba071647f2ed46de0409d590d0adac3ac6077265db6e1ebbfd1069543a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"CRCAlgorithm.divideMessageWithP (cyclomatic 17): CRCAlgorithm.divideMessageWithP has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/CRCAlgorithm.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8624579c9be0bea5ee3a09130b66d164adb071f9be7d8b16d86acf091ea8153"}},{"ruleId":"D1","level":"warning","message":{"text":"TravelingSalesman.dynamicProgramming (cyclomatic 16): TravelingSalesman.dynamicProgramming has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/TravelingSalesman.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89401aa98de3b4c0e9c6e28c374f2839d29c43d9f38cfc5cd7562d41c6fecf6"}},{"ruleId":"D2","level":"warning","message":{"text":"EdmondsBlossomAlgorithm.maximumMatching (cognitive 54): EdmondsBlossomAlgorithm.maximumMatching has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 7 (14 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"143325be6da7f974d8a70621500ee9da9e7668086ef371418a6221eb6970d0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Edmonds.findMSARecursive (cognitive 52): Edmonds.findMSARecursive has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 10 (14 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Edmonds.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce813359ffbfcebe44fe6f80305e61d61a050cc8992d2ffd3f7b4a3f2fa91d31"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryTree.remove (cognitive 49): BinaryTree.remove has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BinaryTree.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b341b0703d3595a6f5fd680f2621f4f5d4271b6357d0f42bd300c701c04bed"}},{"ruleId":"D2","level":"warning","message":{"text":"HungarianAlgorithm.solve (cognitive 48): HungarianAlgorithm.solve has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 9 (17 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd9847ef0558ed0191b044066613716dd73ba190a48a0299ef3631f7ea70ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"HierholzerEulerianPath.rotateEulerianCircuitIfNeeded (cognitive 42): HierholzerEulerianPath.rotateEulerianCircuitIfNeeded has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/HierholzerEulerianPath.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46937d1f94cfa91e539f2318168794918a5fc9897e2190f9e685a6516023e39"}},{"ruleId":"D2","level":"warning","message":{"text":"BentleyOttmann.getIntersection (cognitive 32): BentleyOttmann.getIntersection has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/geometry/BentleyOttmann.java"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f189a21c94fd7785e1447e80b18f0389efd0e8cbab57057ff15a650c7c6ba03a"}},{"ruleId":"D2","level":"warning","message":{"text":"YensKShortestPaths.kShortestPaths (cognitive 30): YensKShortestPaths.kShortestPaths has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (14 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/YensKShortestPaths.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45ba5390c31fb767cf88c7467718742923ecf291f3253f4e17853d833c1eaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"CrosswordSolver.solveCrossword (cognitive 28): CrosswordSolver.solveCrossword has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (16 pts), loops 4 (12 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/backtracking/CrosswordSolver.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90db6074a0d37d9ab5d29af7e977de4116da4a3338e192960a2a492495e83f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LongDivision.divide (cognitive 28): LongDivision.divide has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3 (8 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/LongDivision.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c60ea3dea6d93ca7ee48cdcca4433a02500e51b77cd1f2a88a1b069eaa740e"}},{"ruleId":"D2","level":"warning","message":{"text":"LZ77.compress (cognitive 27): LZ77.compress has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/compression/LZ77.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a2912038060305d3835cabc914e2a8934170ba70ba074d039d711ec5e7efb0"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackBST.deleteFixup (cognitive 27): RedBlackBST.deleteFixup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"587d39cccd66628267bc7657df1b9e5a2de41c91b314f1bf79a951f921647d87"}},{"ruleId":"D2","level":"warning","message":{"text":"BentleyOttmann.handleEvent (cognitive 27): BentleyOttmann.handleEvent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/geometry/BentleyOttmann.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ca2fbaa4cf81a7984333e271d066c65a54162d6c661161cbffa4da4bc2c3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ZeroOneBfs.shortestPaths (cognitive 27): ZeroOneBfs.shortestPaths has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/ZeroOneBfs.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a7050e7578fec241b479e0faefe9b43f76179ed82f5d871436e6cbc7ac94e2"}},{"ruleId":"D2","level":"warning","message":{"text":"BankersAlgorithm.checkSafeSystem (cognitive 27): BankersAlgorithm.checkSafeSystem has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 5 (13 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/BankersAlgorithm.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2efc4db5919d6f5451cc1b8e7217ef9d67a16d0b5ff5d8564f99232f968042"}},{"ruleId":"D2","level":"warning","message":{"text":"CRCAlgorithm.divideMessageWithP (cognitive 27): CRCAlgorithm.divideMessageWithP has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (11 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/CRCAlgorithm.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d647944d505c1a7913f4c62a563d662eef64bab324af6565ac7bb12d90dfae5b"}},{"ruleId":"D2","level":"warning","message":{"text":"StoerWagner.findMinCut (cognitive 26): StoerWagner.findMinCut has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/StoerWagner.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ddc0060d260ecfc930d296bf951ad7c375f5b173195443d9227ada63de9d79"}},{"ruleId":"D2","level":"warning","message":{"text":"WordLadder.ladderLength (cognitive 26): WordLadder.ladderLength has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/WordLadder.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c3798c5bf9d00eb2d2d5d1b933162c0fdaf6edb1b122540c0522c8b1c987d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SplayTree.splay (cognitive 25): SplayTree.splay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df7923823d9b54475dddd65adce815a4fbaca7ff54c845d558c389c536f3730"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosestPair.closestPair (cognitive 25): ClosestPair.closestPair has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e9f0c3ec64dd695b12c17e97c7a1fe263bedbcb2bf8300c4c6b56310e3b4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TravelingSalesman.dynamicProgramming (cognitive 25): TravelingSalesman.dynamicProgramming has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (9 pts), boolean chains 3, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/TravelingSalesman.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31ab966acce22de9d1d2ef443b95da1d84ca415aed99df714a621e63cb66df2"}},{"ruleId":"D2","level":"warning","message":{"text":"CircularScanScheduling.execute (cognitive 25): CircularScanScheduling.execute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/scheduling/diskscheduling/CircularScanScheduling.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3038c0791908cca803782241684b5b424ad4e488c8339337d261bc34d53152"}},{"ruleId":"D2","level":"warning","message":{"text":"RRScheduling.evaluateTurnAroundTime (cognitive 25): RRScheduling.evaluateTurnAroundTime has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/scheduling/RRScheduling.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f560abbc61d22d640e99f2190739dab4b09b7d0901b42dc036620bf7a1aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkListSort.isSorted (cognitive 25): LinkListSort.isSorted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (12 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/LinkListSort.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f3c5c548ae25b4fc2617a80ba2f8f18a07c5dd8fe650ef26b84b874130332"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckIfBinaryTreeBalanced.isBalancedIterative (cognitive 24): CheckIfBinaryTreeBalanced.isBalancedIterative has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/CheckIfBinaryTreeBalanced.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3469faa17be93c839281182e595210f95cb17633e1ad54e6bad1c06a6297126f"}},{"ruleId":"D2","level":"warning","message":{"text":"HierholzerEulerianPath.allNonZeroDegreeVerticesWeaklyConnected (cognitive 24): HierholzerEulerianPath.allNonZeroDegreeVerticesWeaklyConnected has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/HierholzerEulerianPath.java"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6a0d90db3d3f6243162df667a36a1557e2b98a49de8444ab4852f29dba1a38"}},{"ruleId":"D2","level":"warning","message":{"text":"CohenSutherland.cohenSutherlandClip (cognitive 24): CohenSutherland.cohenSutherlandClip has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/lineclipping/CohenSutherland.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d149ab26352255f1a580da2949dfdef0bb3118b61557d107a50e259641154492"}},{"ruleId":"D2","level":"warning","message":{"text":"LiangBarsky.clipLine (cognitive 24): LiangBarsky.clipLine has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/lineclipping/LiangBarsky.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97473f48e66701765ae416fafd5c4d4fc70ae3c16590a42688e23b344198829"}},{"ruleId":"D2","level":"warning","message":{"text":"MosAlgorithm.solveRangeFrequencyQueries (cognitive 24): MosAlgorithm.solveRangeFrequencyQueries has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/MosAlgorithm.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa5b6e691cdb3e5dff3da174f19bb9a26e5309b91b7f98d2b1ea19348e9c2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"DialsAlgorithm.run (cognitive 23): DialsAlgorithm.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/DialsAlgorithm.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b25cab859e1a9b84a6d71a5be1f297ca0524e7ab79eedda391da05787ac031e"}},{"ruleId":"D2","level":"warning","message":{"text":"BSTIterative.remove (cognitive 23): BSTIterative.remove has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BSTIterative.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf14cb7133f00f75954d72e986a984f5cbd6f9b1680026bb8439531a4f0a84eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SkylineProblem.mergeSkyline (cognitive 23): SkylineProblem.mergeSkyline has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/SkylineProblem.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"34abe1243732e98e403803b3a8cd9bb11d3c795f2a886be72b96431464d9cefe"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomizedMatrixMultiplicationVerification.verify (cognitive 23): RandomizedMatrixMultiplicationVerification.verify has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (20 pts), if/else 1 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/randomized/RandomizedMatrixMultiplicationVerification.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbb689829f9549d32e022565e60e9296f068c5453d3cb63dfdf98f3a9f7378"}},{"ruleId":"D2","level":"warning","message":{"text":"RabinKarp.search (cognitive 23): RabinKarp.search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/RabinKarp.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d417c03064817d23a7d6471515e82860dd7e63ab66376ecd0f6bff5673f20d"}},{"ruleId":"D2","level":"warning","message":{"text":"RailFenceCipher.decrypt (cognitive 22): RailFenceCipher.decrypt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/RailFenceCipher.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e706ee6399ae0256fc663d968e934f22259ec71a7230e9bb4067ee1c541a42aa"}},{"ruleId":"D2","level":"warning","message":{"text":"SameTreesCheck.check (cognitive 22): SameTreesCheck.check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/SameTreesCheck.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe487423fb030b1e9f898f216c76d107d681ecb56d383dd7541227d84931fac"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterminantOfMatrix.determinant (cognitive 22): DeterminantOfMatrix.determinant has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19b9633fb48861f19c9f66d3dd6e3dc997b1beb7ace464f6c8a465dd072c3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"InfixToPrefix.infix2Prefix (cognitive 22): InfixToPrefix.infix2Prefix has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/InfixToPrefix.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e4faf8f26d441f487b8d830e02e74bf5b7089f236c4847481cfddac40cf475"}},{"ruleId":"D2","level":"warning","message":{"text":"MColoring.isColoringPossible (cognitive 21): MColoring.isColoringPossible has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/backtracking/MColoring.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3815bc3b6f5467b0ce4e569764e298aae6367c916d9480d3fb644567897cd7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SudokuSolver.solve (cognitive 21): SudokuSolver.solve has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 3 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/backtracking/SudokuSolver.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8233fe58f906b7472dd19a1ce5dc791533b27fe03ca44824d9515d7a0d29dd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Base64.decode (cognitive 21): Base64.decode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 8). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/conversions/Base64.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7408ab0c15b084ec16a104cb3a56b0c6bee4cb52de5481a1b67750515fbf7749"}},{"ruleId":"D2","level":"warning","message":{"text":"LongestValidParentheses.getLongestValidParentheses (cognitive 21): LongestValidParentheses.getLongestValidParentheses has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/LongestValidParentheses.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e35663b31de8105c936a5e5ed7af6f56f225966667ac1a11daf6fc65e0f9be"}},{"ruleId":"D2","level":"warning","message":{"text":"PalindromicPartitioning.minimalPartitions (cognitive 21): PalindromicPartitioning.minimalPartitions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7efe05f2ec5292a80dd138d1f5351390e48ee3164142e0a90d657dc2dcc9b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Adwin.detectChange (cognitive 21): Adwin.detectChange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/Adwin.java"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c3a686473ddadb6449ae947c726b724c4e458eae239acff9fdd6dcf3701886"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimalBinarySearchTree.findOptimalCost (cognitive 20): OptimalBinarySearchTree.findOptimalCost has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 2 (8 pts), loops 4 (7 pts), if/else 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/OptimalBinarySearchTree.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e976af0f337398cfb41dbf3969157c8c125210e8fb999441fb27b5ccb6d98b"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexMatching.regexBU (cognitive 20): RegexMatching.regexBU has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ededc1ed4e582a9c7f086b88e5748ca3b6a617c3c00508c2832c5dc5d9f24"}},{"ruleId":"D2","level":"warning","message":{"text":"EdmondsKarp.maxFlow (cognitive 20): EdmondsKarp.maxFlow has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 5 (8 pts), boolean chains 3 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/EdmondsKarp.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d46fef1399fd9e1b57c85e2a6415bc0a808d0767ba33847a9d502a6a993d87"}},{"ruleId":"D2","level":"warning","message":{"text":"YensKShortestPaths.dijkstra (cognitive 20): YensKShortestPaths.dijkstra has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/YensKShortestPaths.java"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8794f538dcf4ccdce0b1e784bbda70d14b85b33204205c2abdecc935592bb162"}},{"ruleId":"D2","level":"warning","message":{"text":"RabinKarpAlgorithm.search (cognitive 20): RabinKarpAlgorithm.search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/searches/RabinKarpAlgorithm.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d63808bef18578a8a15694292bab8e79531e2da73b62a822860342b2885718"}},{"ruleId":"D2","level":"warning","message":{"text":"InfixToPostfix.infix2PostFix (cognitive 20): InfixToPostfix.infix2PostFix has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/InfixToPostfix.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0906113f56c228c24ed38dae28f8260b726c20ce22148afaace3223fd84a49e0"}},{"ruleId":"D2","level":"warning","message":{"text":"RottingOranges.run (cognitive 19): RottingOranges.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/RottingOranges.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f9c460e3cccc091d569da0981140792f8885993df34063159a168eab81c0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"SortedLinkedList.delete (cognitive 19): SortedLinkedList.delete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/lists/SortedLinkedList.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"028758b2ed9630190146806b65f200943c4bbdb41b97d909ef98c9df534daea0"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackBST.insert (cognitive 19): RedBlackBST.insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c608d4e239641590cec4288c64b0d658a891df20ca255a7d23a2aa4ecc8e1aba"}},{"ruleId":"D2","level":"warning","message":{"text":"MedianOfTwoSortedArrays.findMedianSortedArrays (cognitive 19): MedianOfTwoSortedArrays.findMedianSortedArrays has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/MedianOfTwoSortedArrays.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6372c37298d2b567a40025f7368d970382d51c4cb3be76469793dd3713751c"}},{"ruleId":"D2","level":"warning","message":{"text":"SolveSystem.solveSystem (cognitive 19): SolveSystem.solveSystem has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/SolveSystem.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4ebd348bb0618921637be871adfb96fb20cb4296a67bf046e436c1e469740e"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArray.buildSuffixArray (cognitive 19): SuffixArray.buildSuffixArray has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (11 pts), loops 3 (4 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 8). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/SuffixArray.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c68c0a48bbf391a56a68ea4af8e44469c28412f4ea1bcab005ff9e0a1f1388"}},{"ruleId":"D2","level":"warning","message":{"text":"HuffmanCoding.decode (cognitive 18): HuffmanCoding.decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/compression/HuffmanCoding.java"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caf2472553799c5746111344169ba4049806a46198e957251f24019b37242d8"}},{"ruleId":"D2","level":"warning","message":{"text":"LFUCache.addNodeWithUpdatedFrequency (cognitive 18): LFUCache.addNodeWithUpdatedFrequency has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/LFUCache.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9669f5b1d4d11af5ee11e4fa2c7c4d2aa03554d9216993f2b056ec30ded19bce"}},{"ruleId":"D2","level":"warning","message":{"text":"BellmanFord.go (cognitive 18): BellmanFord.go has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde0ecbe844b11ee5fb042a41d255a730592c15a42671302384c61dc1a5142a5"}},{"ruleId":"D2","level":"warning","message":{"text":"FordFulkerson.networkFlow (cognitive 18): FordFulkerson.networkFlow has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/FordFulkerson.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0c45a6c5f2f867c4cb36c40b17bbc0a59591dc30e25db2514ff0c4c2e5979c"}},{"ruleId":"D2","level":"warning","message":{"text":"AVLTree.insert (cognitive 18): AVLTree.insert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/AVLTree.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4f2e921651129664790c6d76965859fdce3c44953f971c316d7c3a795bb073"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackBST.fixTree (cognitive 18): RedBlackBST.fixTree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c035fd2787007f4baf6e9b6a41356be8d0b6998edfdef135608ff72f53001f10"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosestPair.bruteForce (cognitive 18): ClosestPair.bruteForce has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198863f0ab08f2ce51f6dc59a96b201990b7ee01c9abdf26083cbe2f6cbadb0"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexMatching.regexRecursion (cognitive 18): RegexMatching.regexRecursion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc70539ac08c366050fc14ea9fd1c655bd5d449c84257c48fb17411b9f56ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"Dinic.maxFlow (cognitive 18): Dinic.maxFlow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e805963808dae381d0cdae26ad17e6c9c6bd6abf0a6620d892c0bc58242559"}},{"ruleId":"D2","level":"warning","message":{"text":"InverseOfMatrix.gaussian (cognitive 18): InverseOfMatrix.gaussian has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 2 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/InverseOfMatrix.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f9cbd50e57764b2873878bafea56f6bf3d45b3181952572f2a03331f17d45"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeInSortedArray.alteredBinSearchIter (cognitive 18): RangeInSortedArray.alteredBinSearchIter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/misc/RangeInSortedArray.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac852138e0761485edeb45e0e85d3ff11d56adbe24203f213d62666334c2c55"}},{"ruleId":"D2","level":"warning","message":{"text":"LookScheduling.execute (cognitive 18): LookScheduling.execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/scheduling/diskscheduling/LookScheduling.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b02bb66c0fba1e25f156b95da93c86dd7741c822eaabedb9db03458b1fdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"SmoothSort.sort (cognitive 18): SmoothSort.sort has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/SmoothSort.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd82f14535ca743641c017845cc4e20d86d965a7739b06fc5eea63b995d71d06"}},{"ruleId":"D2","level":"warning","message":{"text":"MaximumMinimumWindow.calculateMaxOfMin (cognitive 18): MaximumMinimumWindow.calculateMaxOfMin has cognitive complexity 18 (threshold 15). Drivers by points: loops 10 (12 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7476a3792be10ccd94b67e6bd84ddd9a23908ecc6e1de670ca03ca9f5ee61b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundaryTraversal.iterativeBoundaryTraversal (cognitive 17): BoundaryTraversal.iterativeBoundaryTraversal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BoundaryTraversal.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a813d44a9387d4d614dc8a69abf95324400e806f2b45b0523ac6b627ca05a8"}},{"ruleId":"D2","level":"warning","message":{"text":"AllConstruct.allConstruct (cognitive 17): AllConstruct.allConstruct has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/AllConstruct.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f819b1b9db3dfa676dee44786ef78891e549a3b07b2da90c90f97f1864ef61c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexMatching.regexRecursion (cognitive 16): RegexMatching.regexRecursion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (RegexMatching.regexRecursion) 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":"src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"806021463c0e1d95b81cc52937a5e733f502a4f068f9ea33374483b789531421"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexMatching.regexRecursion (cognitive 16): RegexMatching.regexRecursion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (RegexMatching.regexRecursion) 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":"src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"038913b24ed30189eeb0e940117beb58a71c26e19a54734302faf4799ec3af17"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountMerge.mergeAccounts (cognitive 16): AccountMerge.mergeAccounts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/AccountMerge.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"06effbf7024324ce06fd6fc21d0bb8034c5ebd3d164292ac645c6560ffc94945"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstrainedShortestPath.solve (cognitive 16): ConstrainedShortestPath.solve has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 2 (7 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/ConstrainedShortestPath.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c367d9ab2110730d9d2dd5d52685dd980b44a5c6ad8fe8da7c337ca1968aed"}},{"ruleId":"D2","level":"warning","message":{"text":"LUDecomposition.decompose (cognitive 16): LUDecomposition.decompose has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/LUDecomposition.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"229262a731fbce949714fd249790e5ff356d2cb8995ef4eee504d552c4b02112"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintAMatrixInSpiralOrder.print (cognitive 16): PrintAMatrixInSpiralOrder.print has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/PrintAMatrixInSpiralOrder.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dd7f6af5cffa0d9bbd95bee007f4f621de7fb0c48a4ca1979363220a8f9261"}},{"ruleId":"D2","level":"warning","message":{"text":"RotatedBinarySearch.find (cognitive 16): RotatedBinarySearch.find has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/searches/RotatedBinarySearch.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"565767f46b373747258fb17c1b352e045f997e39b366493d5949381b2e9eb9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateBrackets.check (cognitive 16): DuplicateBrackets.check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"def356266fea84e719b07f10e36d689b7f9b3d1d386d5e3a6db557481798c566"}},{"ruleId":"D2","level":"warning","message":{"text":"KasaiAlgorithm.kasai (cognitive 16): KasaiAlgorithm.kasai has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/KasaiAlgorithm.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0167551a41212cdce64723ad45e4a9521570d63a8ae6417e5363cf53cebc889"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"src/main/java/com/thealgorithms/maths/MathBuilder.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fe6d9a8b303d8cc986bfe85ded8d9d16310854f9108b8a9487955e320748ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:39-62 | src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:13-37 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c0db9a920f1d743e53a1e30ac158d3bed0d1fa8bc866a65083bea7c96cd90e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/main/java/com/thealgorithms/ciphers/AES.java:2569-2598 | src/main/java/com/thealgorithms/ciphers/AES.java:2604-2633 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/AES.java"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0b91d5af6feaf425749fdee68c5def1ce96eecea4742dc1c02a145c557a816"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/thealgorithms/graph/Dinic.java:37-76 | src/main/java/com/thealgorithms/graph/EdmondsKarp.java:35-84 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:54-69 | src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java:131-149 | src/main/java/com/thealgorithms/graph/PushRelabel.java:143-161 | src/main/java/com/thealgorithms/graph/YensKShortestPaths.java:112-134 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6d212b9ba9ba9eb3952a02d6d8576e1b5ba824c6cafc2b7177bb9a41ab580e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/thealgorithms/graph/Dinic.java:37-76 | src/main/java/com/thealgorithms/graph/EdmondsKarp.java:35-84 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:80-107 | src/main/java/com/thealgorithms/graph/PushRelabel.java:34-83 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8543ba6547256c06edff4807a564035be9de4f96425219ed148991559d9b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/HillCipher.java:7-36 | src/main/java/com/thealgorithms/ciphers/HillCipher.java:40-69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/HillCipher.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4772ca4bc34979b0370fd1e75223863e19324af3d8b565f29affe7a1449c729d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/trees/BSTRecursiveGeneric.java:71-93 | src/main/java/com/thealgorithms/datastructures/trees/BSTRecursiveGeneric.java:103-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BSTRecursiveGeneric.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8995293f579c104d51dc282dd25d79b2da3d21b635c433e5ce76ade5aba90afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): src/main/java/com/thealgorithms/maths/AliquotSum.java:40-60 | src/main/java/com/thealgorithms/maths/PerfectNumber.java:45-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/AliquotSum.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"011f77526dc47eb00cc13c371ffb8664bbde236ca25f281033eee031bf030e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/main/java/com/thealgorithms/others/MosAlgorithm.java:51-72 | src/main/java/com/thealgorithms/others/MosAlgorithm.java:117-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/others/MosAlgorithm.java:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/MosAlgorithm.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d853de68f4216ea76492ed83d40e1f3abb97710e84bf7d0cdeb1d1749e9cb23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/main/java/com/thealgorithms/graph/EdmondsKarp.java:87-106 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:110-127 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/graph/EdmondsKarp.java\u0060 and \u0060src/main/java/com/thealgorithms/graph/GomoryHuTree.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/EdmondsKarp.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac44be83bd0f003e477b2eb087fe23c3a3e5293bfcac120ddedfe1d5190758a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java:122-140 | src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java:155-173 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c79ea263c43a43fd6a94a6952fab2ca31ba6ca07ec10d4fa46fdf9568189b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/queues/SlidingWindowMaximum.java:44-62 | src/main/java/com/thealgorithms/slidingwindow/MaximumSlidingWindow.java:38-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/queues/SlidingWindowMaximum.java:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/queues/SlidingWindowMaximum.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3424c9148e9dd477fbfddfa21a2c35d0f2b920c0f621e852680b394854dd8d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/main/java/com/thealgorithms/graph/EdmondsKarp.java:65-81 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:87-102 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/graph/EdmondsKarp.java\u0060 and \u0060src/main/java/com/thealgorithms/graph/GomoryHuTree.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/EdmondsKarp.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74529bf722f9d8f2c184491938ca4c14508faf3b1b497f868a373b18c19c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/main/java/com/thealgorithms/maths/FindKthNumber.java:44-60 | src/main/java/com/thealgorithms/randomized/RandomizedQuickSort.java:39-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/randomized/RandomizedQuickSort.java:39\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/FindKthNumber.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2913fc4e6783547977b9dd5d69cca69cb342fb82443dca6631f4e9e21023bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/main/java/com/thealgorithms/strings/Anagrams.java:77-93 | src/main/java/com/thealgorithms/strings/Anagrams.java:134-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/Anagrams.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2888396341ccb6715804bd38ce14648a3c509898eab2e361e8e6902f1807cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/thealgorithms/slidingwindow/MaxSumKSizeSubarray.java:29-44 | src/main/java/com/thealgorithms/slidingwindow/MinSumKSizeSubarray.java:31-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/slidingwindow/MaxSumKSizeSubarray.java:29\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/slidingwindow/MaxSumKSizeSubarray.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a5bac433474a07fb08b6a7288d781cc139786de92126cef16d29c4b9b9dba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/main/java/com/thealgorithms/sorts/LinkListSort.java:21-35 | src/main/java/com/thealgorithms/sorts/LinkListSort.java:50-64 | src/main/java/com/thealgorithms/sorts/LinkListSort.java:80-94 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/thealgorithms/sorts/LinkListSort.java:79\u0060 calls \u0060Task2\u0060 and \u0060src/main/java/com/thealgorithms/sorts/LinkListSort.java:49\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/LinkListSort.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be79f18dc4e43460ad263c96e8554caebf2a8025c0aacd520e70343c1fc90bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:298-312 | src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java:311-325 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c64d566564d39b91a7db21ade9224588433d06290dc5fd7021e5fa9fb26f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java:153-167 | src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java:117-130 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d76e6fbd881f11f4da2879529aaf6b76f3f0b45bd9a26f2becfd97de27f84c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java:83-97 | src/main/java/com/thealgorithms/datastructures/lists/CircularDoublyLinkedList.java:80-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f889205978d2c3232fba92f89e2761500712a46103d812ebe8c143f52de4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/PostfixEvaluator.java:31-45 | src/main/java/com/thealgorithms/stacks/PrefixEvaluator.java:33-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/stacks/PostfixEvaluator.java:31\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/PostfixEvaluator.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6cd537a06061ead2edfa27ee13099a610bd9949f1f6cec7aabb3b998bae64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java:78-91 | src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java:123-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"620e45759a4c534cdcab0a98faa7c1c99830496f09c72204e3393b227acffcf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/thealgorithms/maths/PadovanSequence.java:29-42 | src/main/java/com/thealgorithms/maths/PerrinNumber.java:39-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/maths/PadovanSequence.java:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/PadovanSequence.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce84e68e196877c80c5613940bdc9dfde2bd2c739c88ab89b19610bf222f7598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/main/java/com/thealgorithms/others/SkylineProblem.java:68-80 | src/main/java/com/thealgorithms/others/SkylineProblem.java:82-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/others/SkylineProblem.java:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/SkylineProblem.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"442538ac78a9907bfb27e6d546dc8d2d8d246f6cf7ad0480e1352c4648adfd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/InfixToPostfix.java:44-57 | src/main/java/com/thealgorithms/stacks/InfixToPrefix.java:57-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/stacks/InfixToPostfix.java:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/thealgorithms/stacks/InfixToPrefix.java:55\u0060 calls \u0060StringBuilder\u0060, \u0060reverse\u0060, \u0060toString\u0060 and \u0060src/main/java/com/thealgorithms/stacks/InfixToPostfix.java:42\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/InfixToPostfix.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aafdd8266ecbfe3dcb99fae4e564a0e455d90c8c2020321a5360fab34b27a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/AES.java:2745-2757 | src/main/java/com/thealgorithms/ciphers/AES.java:2761-2773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/AES.java:2745\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/AES.java"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b462c88eba1ef49aecd78bf9ff2d5ad424909776d67a04f6cea609d9e7a4e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:23-35 | src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:60-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb9f7afae13311aa471accbf3a24189021016336a9ce209333f421a3773b098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/trees/AVLTree.java:201-213 | src/main/java/com/thealgorithms/datastructures/trees/AVLTree.java:226-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/trees/AVLTree.java:201\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/AVLTree.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ef987b8c3d4a827091798062fb0c32e9847108e15c00e648044c0b64fd1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:223-234 | src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:280-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:280\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d84c1ad6e6e5de898a7ad005247f2596c8d7672872a16b873a82820c1752bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/thealgorithms/matrix/QRDecomposition.java:117-129 | src/main/java/com/thealgorithms/matrix/utils/MatrixUtil.java:30-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/QRDecomposition.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d4b379a0942540f364081bdebc210a1ece374ab2321c3713e579eea311ce1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/AES.java:2570-2581 | src/main/java/com/thealgorithms/ciphers/AES.java:2605-2616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/AES.java"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad41d7e15c951c91294be5c91fb8c41d9b230f0d3821a588860f080bed09bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:87-98 | src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:114-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java:87\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/ClosestPair.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"775c86500331051fc742f0dfced0d652f9446fb3ddfaad215f96d7bfe4d59f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java:59-69 | src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java:88-98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff4ee2519af6a1cf375e6211ab39c91aca7ebb32f81e5e74d289e25846d7ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:114-124 | src/main/java/com/thealgorithms/datastructures/caches/RRCache.java:113-123 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/RRCache.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac929340701d534dcd521e30c3eff51a7455168abf39c79e6edd1455f7df25dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:353-363 | src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java:367-377 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"610cef3b67abc5f4a406613c8e0031b514c3bfe115469e785963ddb43ea212c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/graph/Dinic.java:44-54 | src/main/java/com/thealgorithms/graph/PushRelabel.java:150-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/graph/Dinic.java:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbcaae95eaeaf34238f2f2e352f8cfc61489897ad35a511c4142c107c17af09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/greedyalgorithms/BandwidthAllocation.java:47-57 | src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java:43-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/greedyalgorithms/BandwidthAllocation.java:47\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/greedyalgorithms/BandwidthAllocation.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea0d405abd85faf4bdbb64fdb4b8f43111cf78cfabcb8f543e7d04c91f3da41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/main/java/com/thealgorithms/machinelearning/KNearestNeighbors.java:64-74 | src/main/java/com/thealgorithms/others/Huffman.java:81-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/machinelearning/KNearestNeighbors.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8786bd65f3d0049b6707168e8ce2c9f5674719133c569231aab8d253caa73f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:388-397 | src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java:402-411 | src/main/java/com/thealgorithms/datastructures/caches/RRCache.java:328-337 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:388\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b026f47abb06623b943bbfff5986cf6be54dd6d904f43fb3bc86384fcc102c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/main/java/com/thealgorithms/datastructures/trees/Trie.java:90-98 | src/main/java/com/thealgorithms/datastructures/trees/Trie.java:115-123 | src/main/java/com/thealgorithms/datastructures/trees/Trie.java:168-177 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/Trie.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b4389b0f2097d5b2007e78b27515aa0521f895685439a68a6ec0b0993af552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/AES.java:2589-2598 | src/main/java/com/thealgorithms/ciphers/AES.java:2624-2633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/AES.java:2589\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/AES.java"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fa8b1a66954c00939c2109424e4e7cdef195ef94cabf70b8a0c52e40e4a3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/AES.java:2639-2648 | src/main/java/com/thealgorithms/ciphers/AES.java:2663-2672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/AES.java:2639\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/AES.java"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0232613d35eefc764ff1c68f115ce4bca6c8d6d39f5f553ad7a32f44aa904d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/Blowfish.java:1210-1219 | src/main/java/com/thealgorithms/ciphers/Blowfish.java:1234-1243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/Blowfish.java:1210\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/Blowfish.java"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"07942717c860e4f7fdd4da94fb7583f64ddbed2323aee4849ac4c82a2a20aadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:17-26 | src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:42-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70b5cfa2fc41c3451093cc21dbd061015e53e568da4a9dad59a704340c296b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/Vigenere.java:47-56 | src/main/java/com/thealgorithms/ciphers/Vigenere.java:85-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/Vigenere.java:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/Vigenere.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6897390602fadbb12945d0ea0c9317874b92f01da7fde9bee86567f34994a52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/main/java/com/thealgorithms/conversions/OctalToDecimal.java:23-32 | src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java:24-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/conversions/OctalToDecimal.java:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/conversions/OctalToDecimal.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfaf050043db7ec586f12020fcfa99c6b6831e30242cb3cecfc666a922fc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/IndexedPriorityQueue.java:236-245 | src/main/java/com/thealgorithms/datastructures/heaps/IndexedPriorityQueue.java:258-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/IndexedPriorityQueue.java"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff93fe28b4f73bbb2ae2ccf143be89736be3bf4aa30b7a8a1dd0c0ac897d151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/others/BankersAlgorithm.java:137-146 | src/main/java/com/thealgorithms/others/BankersAlgorithm.java:148-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/BankersAlgorithm.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f183f7d83ea8eb870c6ccf25cc4cb3788cbc9aca1a2e0ecec9b460151486970b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java:52-61 | src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java:68-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a7e4a4a36c044b5b8ad1420cb16a721ce3db843ee23572c3d87724ffd1ccc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/main/java/com/thealgorithms/graph/Dinic.java:43-51 | src/main/java/com/thealgorithms/graph/EdmondsKarp.java:42-50 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:60-68 | src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java:140-148 | src/main/java/com/thealgorithms/graph/PushRelabel.java:149-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/graph/Dinic.java:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/thealgorithms/graph/PushRelabel.java:159\u0060 calls \u0060IllegalArgumentException\u0060 and \u0060src/main/java/com/thealgorithms/graph/HungarianAlgorithm.java:149\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"153bcc6a27b56f7b27f84778432e629c14e2ea06156203d1cb56b05a9023d79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/Caesar.java:23-31 | src/main/java/com/thealgorithms/ciphers/Caesar.java:51-58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/Caesar.java:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/Caesar.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8343eefa1bf38a90105c9796d17e406268a6ed280ed3fadd1fa129595364104d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:41-49 | src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:76-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java:41\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/SimpleSubCipher.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecdb8939d67034335a11c7c181f46e067fa472b8ccbf1500ed1681a73fef46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/main/java/com/thealgorithms/graph/Dinic.java:55-63 | src/main/java/com/thealgorithms/graph/PushRelabel.java:37-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eede9f0f555ffd1cedf38bcad706bf35dd3c0e0f9c9cde91e84470d4d17cc33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/main/java/com/thealgorithms/others/Verhoeff.java:97-105 | src/main/java/com/thealgorithms/others/Verhoeff.java:126-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/Verhoeff.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9902c812a69ba947a58063040b5f46ef73a2bac0b181e0940c15da489605bb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java:40-48 | src/main/java/com/thealgorithms/searches/RotatedBinarySearch.java:24-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c5339d19d05a60745c6352cdd464415d6a38d5e357e81e8e2672a843bd806e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/ConcurrentMergeSort.java:133-141 | src/main/java/com/thealgorithms/sorts/LinkListSort.java:199-207 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/sorts/ConcurrentMergeSort.java:133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/ConcurrentMergeSort.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"81953238f578f86306c117598a5b88bf45f8aaa30c15dc684434332c02c561bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/IntrospectiveSort.java:86-93 | src/main/java/com/thealgorithms/sorts/SpreadSort.java:215-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/sorts/IntrospectiveSort.java:86\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/IntrospectiveSort.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226d94b78a303bfc2bd54fa69114abbe21309b0eb69b177fad3486a7ed408ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/LinkListSort.java:38-46 | src/main/java/com/thealgorithms/sorts/LinkListSort.java:97-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/LinkListSort.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2fccc76074a8ff80b65d40f80460feb2a0b4c2894af7b84a8ec3bd9a600722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/TreeSort.java:73-81 | src/main/java/com/thealgorithms/sorts/TreeSort.java:101-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/sorts/TreeSort.java:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/TreeSort.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"738b10ab27edf9e75c9ff363b1f5cfb74a2ea28f0fc0da82556eb08534cc9892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/streaming/ExtendedKalmanFilter.java:316-324 | src/main/java/com/thealgorithms/streaming/ExtendedKalmanFilter.java:331-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/streaming/ExtendedKalmanFilter.java:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/ExtendedKalmanFilter.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"633951abe1cfe540aa037c9b623a2f75e35ce8f3c3a582c8db8df162d19663d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/strings/KMP.java:30-38 | src/main/java/com/thealgorithms/strings/KMP.java:53-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/strings/KMP.java:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/KMP.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"599e9c5a303bfbe1491e067a31889654c8a651f8e15aa4e4b39e1920222aca48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:30-37 | src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:55-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java:30\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/PlayfairCipher.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cc12c840084f0a3ef3865ca4b8679a1dc8ed8d514920daa71bf37ab0d31ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/graph/PushRelabel.java:144-151 | src/main/java/com/thealgorithms/graph/YensKShortestPaths.java:113-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/graph/PushRelabel.java:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/PushRelabel.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c06805d00777c098020da817aba6706c517a9e9f71fa58df58b7f0a18f1fcee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): src/main/java/com/thealgorithms/randomized/RandomizedMatrixMultiplicationVerification.java:32-39 | src/main/java/com/thealgorithms/randomized/RandomizedMatrixMultiplicationVerification.java:40-47 | src/main/java/com/thealgorithms/randomized/RandomizedMatrixMultiplicationVerification.java:48-52 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/randomized/RandomizedMatrixMultiplicationVerification.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbee200bb68ce4fdc91d3675c034709207416d6adf343f51f4cfc5c67e9f22f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/OddEvenSort.java:32-39 | src/main/java/com/thealgorithms/sorts/OddEvenSort.java:43-50 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/sorts/OddEvenSort.java:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/OddEvenSort.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab049c6e370b70d570066685cecee02dc729e51e57a99f67d33f1f1d1110eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/NextGreaterElement.java:30-37 | src/main/java/com/thealgorithms/stacks/StockSpanProblem.java:35-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/stacks/NextGreaterElement.java:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/NextGreaterElement.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c676c99a865e592e39fce539b54a8b1fa7936a099b2291986a54c48ac38b8b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java:36-42 | src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java:61-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java:36\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c1368ab3a82c852fdeef90c5b15d3ae42ed7fa720f09d09b4f4faeec13c0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java:185-191 | src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java:194-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc1199234cab5426327740e0b29e0c83f40cd37d8a362d83d92eeedf1bd9753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java:102-108 | src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java:118-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfddf23781a7923e6eaa87a7937a40f872b843b167a1d74daa569d9abfdb04e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java:30-36 | src/main/java/com/thealgorithms/dynamicprogramming/NeedlemanWunsch.java:32-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"db858d11ab123c6ad09019c662d87ff0829d28b3d9f2b350fa8b46bf1a717501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java:54-60 | src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java:58-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"088796c25a8076401560fa71847e71c0f81df6e65549cef51b402d3ff1d37e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/streaming/CusumDetector.java:93-99 | src/main/java/com/thealgorithms/streaming/EwmaChangeDetector.java:90-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/streaming/CusumDetector.java:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/CusumDetector.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e788f01e8bff92c967f401c11b6fddebfbdcf748a16162ecf7bc36c592275a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:104-109 | src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:158-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab24ca280f581d28a2e113466a34bcb86c57d30f22640c4e577be110d70754e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/graph/Dinic.java:61-66 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:83-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e1432c9f4343d6c05717ef56e222eb778dc4277bb38d3ac4b2c0a26deccc10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/thealgorithms/graph/Dinic.java:61-65 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:83-87 | src/main/java/com/thealgorithms/graph/PushRelabel.java:42-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48f3d83d383b05bc8d0e897fa5d5d2bf3f1d534b1d508ad4d641143a8d03475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/thealgorithms/graph/Dinic.java:81-85 | src/main/java/com/thealgorithms/graph/EdmondsKarp.java:90-95 | src/main/java/com/thealgorithms/graph/GomoryHuTree.java:112-116 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/graph/EdmondsKarp.java\u0060 and \u0060src/main/java/com/thealgorithms/graph/GomoryHuTree.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/graph/Dinic.java:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/Dinic.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c780e45cc6ac0e5f5db76fe8f89d5a551b6eb38f2e75c4955669bf0963310686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/ciphers/PermutationCipher.java:42-46 | src/main/java/com/thealgorithms/ciphers/PermutationCipher.java:71-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/ciphers/PermutationCipher.java:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/ciphers/PermutationCipher.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"912eb13acbe8dc05ccab39e78ce2d1d416cf89bf1703dc3f0b2968f56722d4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:96-100 | src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:150-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c2d067df8e1e08e4be3fe1d6d1e6df1a073661eab9967484818203d135878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java:21-25 | src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java:53-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd51f3f6e4850010640938ef892bca1d41796eb81416c199c8951050d5d94f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplication.java:128-132 | src/main/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplication.java:137-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplication.java:128\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/divideandconquer/StrassenMatrixMultiplication.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3789fcf954d884c6361c3ed933f4ccf36fd3759ee7703c199fa6f57fc93351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java:53-57 | src/main/java/com/thealgorithms/maths/ConvolutionFFT.java:57-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99950325867116ca2835e2211fa5ac04a1aabe90cdbe67a15d9a3098d7bddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): src/main/java/com/thealgorithms/maths/EulerMethod.java:30-34 | src/main/java/com/thealgorithms/maths/EulerMethod.java:37-41 | src/main/java/com/thealgorithms/maths/EulerMethod.java:43-44 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/thealgorithms/maths/EulerMethod.java:36\u0060 calls \u0060eulerFull\u0060 and \u0060src/main/java/com/thealgorithms/maths/EulerMethod.java:44\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/EulerMethod.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be95313111d76b633c82f82effa899a429391a61a634b4fad933bf06fb9c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:254-262 | src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java:267-275 | src/main/java/com/thealgorithms/datastructures/caches/RRCache.java:240-248 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c135ee662248c7d7ce01e274f510a20228e41092e746fd0f2f3f706c2b2f6366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java:65-72 | src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java:68-75 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb894c24ae7c62954f25562dbf7b205c78232cec48c2b716c79d905f139f12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java:174-184 | src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java:137-147 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e35c4eb985240dcd73b74c80d4dec861dd893dfe18b5e55db48a91d70f2a31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/trees/BSTRecursive.java:140-147 | src/main/java/com/thealgorithms/datastructures/trees/BSTRecursiveGeneric.java:339-346 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060int\u0060 in one and \u0060T\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/trees/BSTRecursive.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a1eb3e82ad2b3b1b1ba94e66349f94f32c396d292bdebd6d75c2fdf1dad28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/graph/AccountMerge.java:103-108 | src/main/java/com/thealgorithms/randomized/KargerMinCut.java:89-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/AccountMerge.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a5a6514c9fb48651b32835a0ab89997530233f0565e0ee303356a44a93492e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/graph/ConstrainedShortestPath.java:25-30 | src/main/java/com/thealgorithms/graph/HierholzerEulerianPath.java:51-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/graph/ConstrainedShortestPath.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5303656087375b0903f575c7a548c18e7f4402299a2064cc516afcd5979b0d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java:23-30 | src/main/java/com/thealgorithms/maths/ConvolutionFFT.java:23-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"76567ba6500e46d2a9dea4d15ab6458f5b512130e718136681d0e2ae894e42c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/maths/Combinations.java:16-21 | src/main/java/com/thealgorithms/recursion/FactorialRecursion.java:12-17 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/maths/Combinations.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad0a7e77a0710852fc710e1c6693c54222fa88dd9489e57cd9e7b71dd81296d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/matrix/QRDecomposition.java:131-138 | src/main/java/com/thealgorithms/matrix/utils/MatrixUtil.java:44-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/QRDecomposition.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28cbdae2b0a95ede236abda7796c3679732e333ec211f05b3fe4b97a377218f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/matrix/QRDecomposition.java:140-148 | src/main/java/com/thealgorithms/matrix/utils/MatrixUtil.java:60-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/matrix/QRDecomposition.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc0a89a548861e7596c77fac35f0987ae75c24f0937b71a506eafbf1ed16d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/others/Damm.java:106-111 | src/main/java/com/thealgorithms/others/Verhoeff.java:161-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/Damm.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea11b3a269f495a341108212b969a0891b1e482c7b04077b531363860b426a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/thealgorithms/others/Damm.java:84-94 | src/main/java/com/thealgorithms/others/Verhoeff.java:139-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/others/Damm.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"835db75aeef808be0f3ce126eec9157f435f4cea128b443ae47dae788802ac07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/sorts/CountingSort.java:46-50 | src/main/java/com/thealgorithms/sorts/FlashSort.java:149-153 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/sorts/CountingSort.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1661012ac8118ce7185d44d2d91f208b94b956e2c1d600a24610f8deed0a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/InfixToPostfix.java:97-101 | src/main/java/com/thealgorithms/stacks/InfixToPrefix.java:111-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/InfixToPostfix.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeefb70ce10fa3a46b82a536811279729b907275883ecaa11fe0d3f8192c71c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/InfixToPostfix.java:81-88 | src/main/java/com/thealgorithms/stacks/InfixToPrefix.java:95-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/InfixToPostfix.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf12eb99f9bd370becabc59dbee1bf560dfe9fd9c576c000ed0207f8f25ce18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/PostfixEvaluator.java:65-73 | src/main/java/com/thealgorithms/stacks/PrefixEvaluator.java:67-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/PostfixEvaluator.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2feebebdb82a1fefb888e6ad0aecd0f07a54b14d77f1ec48fef76385c8eb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/streaming/ComplementaryFilter.java:234-238 | src/main/java/com/thealgorithms/streaming/KalmanFilter.java:273-277 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/ComplementaryFilter.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1b1a4fa009b8d8507ac5298d6751739e274866015a65326c10e8603b67c948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/streaming/CusumDetector.java:144-150 | src/main/java/com/thealgorithms/streaming/EwmaChangeDetector.java:144-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/CusumDetector.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f3aedaba546625bcf3d4b35e094d9417369c6c4a64d1b71525288c4d7cd9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/streaming/HampelFilter.java:130-136 | src/main/java/com/thealgorithms/streaming/MedianFilter.java:94-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/streaming/HampelFilter.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"97235f9645583c4b9b1ea3e9fc9f3863d505a07d48f577b5e51e3b5a249e522a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java:107-114 | src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java:95-102 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/caches/MRUCache.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/caches/LRUCache.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9f83a22e7a30b49eeadf860bbdef526e3d35f0c5f38fee1488a5bd9b7b1b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java:175-182 | src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java:198-205 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c73588ccf6fe393816eb699202ff06486c591592b8175fbd8390511e4c496a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java:97-102 | src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java:74-79 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b56baa80bb806876df98ed1fab5f3243866240f458a507c0c683f619f1595e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java:111-116 | src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java:88-93 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bca371ee882935ca792f538d3840c30166b32519419b0c84ac4f1799db0de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java:188-194 | src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java:211-217 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"58837d9249e96023a720f837b751ef789ba278fb14b3d23e1eeccb7ae9bc7045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java:124-128 | src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java:101-105 \u2014 before extracting anything, compare \u0060src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java\u0060 and \u0060src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1958a41537ceaf2e65311ed20598160be4b497f6addfe4fff2e665b610d05eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/dynamicprogramming/MinimumSumPartition.java:26-30 | src/main/java/com/thealgorithms/sorts/BeadSort.java:20-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/dynamicprogramming/MinimumSumPartition.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db77d9cd97d2020cbcea868cdbb6fc07b7481c23c7ccaa7f691dac07ec7dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/thealgorithms/stacks/GreatestElementConstantTime.java:52-61 | src/main/java/com/thealgorithms/stacks/SmallestElementConstantTime.java:52-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/stacks/GreatestElementConstantTime.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba763e80d93ae89538cc9d81dc8ef51ae56a51a968f496f6fed8a456573fcf06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/thealgorithms/strings/Lower.java:10-15 | src/main/java/com/thealgorithms/strings/Upper.java:10-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/strings/Lower.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adb155c4a830a2980c56946705c08e28b4e37bb905ae1c378f92fcdb9659e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/thealgorithms/misc/ThreeSumProblem.java:20-24 | src/main/java/com/thealgorithms/misc/ThreeSumProblem.java:45-49 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/thealgorithms/misc/ThreeSumProblem.java:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/thealgorithms/misc/ThreeSumProblem.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5200e0a308b54d310a3c82a07ff9e390d3e95b66a12057bfcece2d82259ca01"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSolveSuccessful: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/backtracking/KnightsTourTest.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bccdf7e6090c6c39873e2c66c4d9655039de7fe2bdf6a10c3af97666288a7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTraversals: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/bitmanipulation/BitRotateTest.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6150fac5e5c628ff35a3e96b88d78fa6734afbeb60a04cb7667210c93ba93"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLowestSetBitWithNegativeNumber: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/bitmanipulation/LowestSetBitTest.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c73ddf254f9736d8fd7ebbabaa3162bdad2e54c2638c668a577f68956a133db"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEncryptAllOnesInput: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/ciphers/a5/A5CipherTest.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2f767f870581edede8832e07b3ebd588b4c146e2a4eeee0235febd3028778f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBlockShorterThanKey: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/ciphers/PermutationCipherTest.java"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"75272085e48d24fa7e20e5c88513b516e27891210adf30deaa8533f37da83783"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidCompressedData: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/compression/LZWTest.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25795ea67892791ce499069fc4ac847a46010b9f3b668661a44c6422c1b1de2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matchesBruteForceMaximum: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/buffers/SlidingWindowAggregatorTest.java"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a379018853d788cf5a3c4935b1cabe95a83c065db9ba0414c03eb67619f0df5d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matchesBruteForceMinimum: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/buffers/SlidingWindowAggregatorTest.java"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc9b005822efe2b062b9aa80001e4aeb1c679a14565369328ffbd30ffbcf9f8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: matchesBruteForceSum: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/buffers/SlidingWindowAggregatorTest.java"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9555a274a937134143e4f502ce97c781f7da4ee396ef1b254955f6731359c2d0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDefaultStrategyIsImmediateEvictionStrategy: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/caches/LIFOCacheTest.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac86bb7d15704e9a1522d844fb07e04b38b652b1924dba69ecccb762f3e3935"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSingleVertexGraph: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/graphs/DijkstraAlgorithmTest.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9780dda919e3d570406bc1f3cff7146478728129df4735c7ea45f25934af64"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDisplay: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/hashmap/hashing/HashMapTest.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602cd26a9c4309453d03a17acb1ec4e3dc5ae14325ecaa11e74b91ff4294196"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDirectMutationWithoutChangeKeyDoesNotReheapByDesign: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/heaps/IndexedPriorityQueueTest.java"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"247826c3aa9b3c93ac7c9d5985dbc2cf34af21a186f864eaa7e728e5a561f243"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testToString: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/stacks/NodeStackTest.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d986049fd162b10e4cf4b013f802e3d7740bed42ec94c47892b72cf5307b28cd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDeleteNonExistentKey: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/BTreeTest.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"362b95ba959edf6b66fbae10f57793187d9c88af97c0a8b68647436bf73f32ea"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidNodeInEdge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/CentroidDecompositionTest.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e856e83d75146ca114000e0e5db7f59dbc8338a67dfee348e2dc0d7c46fcb41"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOnLeftSkewedTreeShouldCreateCorrectTree: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorderTest.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece05379e73ad32cbb145aae26161a6a6a683f07c6a99db59fc5338e4698ef05"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOnNormalTreeShouldCreateCorrectTree: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorderTest.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f6778e7a59ba918f7154fa955ec80c9aa81c08d97077bf31abeb58202d22b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOnRightSkewedTreeShouldCreateCorrectTree: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorderTest.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e26799b6adebf6b8cc42651b8580b10f1b6bec1cb488a5b6475976acddd41e5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOnSingleNodeTreeShouldCreateCorrectTree: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorderTest.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfc166d53aa2c7729d7784436290de6972e6f86172c6b5fb5ab80c018c79348"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFibBinet: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/dynamicprogramming/FibonacciTest.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66e27be4447eefc3a5ba39e5bac86b80433415f7910954dea42dfe3cc7a447d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCollinearOverlapWithInteriorPoint: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/geometry/BentleyOttmannTest.java"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab0c3ab2aea8d83e25f5335a698beebde16a5b13808db02c925e565fb16a1b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConvexHullRecursive: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/geometry/ConvexHullTest.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aabf6518dfe234177105b3c01c98afe8485e809a04b2c81df6b5ca3042696e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: randomSmallGraphs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/graph/GomoryHuTreeTest.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4949ae0f1faed86dc72bd12d2c67d3487b1e9b17760388e89111d27f48169"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: triangleGraph: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/graph/GomoryHuTreeTest.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e242468b6c62ba9d94cc54569f3636eb1c4cff8c34c4ad050a59e4e013214f5e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoEulerianPathExists: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/graph/HierholzerEulerianPathTest.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c973bced353653da2000f6496e17a6f7d63b53229d85e8a1dd289e62927488cb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSimpleGraphWithOneBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/graph/TarjanBridgesTest.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f762c741ec504d0074b70c88fc574b237f3cad59b9f4bf037225ca0af376c40"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: laplaceSmoothingKeepsZeroCountFeatureLogProbabilityFinite: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/machinelearning/MultinomialNaiveBayesClassifierTest.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dab4a6f66e0b2f0610560ae24a13ed57701665db34fd23352edafd0cea88f1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testShouldThrowExceptionWhenInvalidNumbersProvided: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/AmicableNumberTest.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f7361b12c66bc2de117068bb3505c6c2d56758df199bc710250dd9b0712a2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testShouldThrowExceptionWhenInvalidRangeProvided: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/AmicableNumberTest.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ab72eb5dca86ff3973b9f549c0cc858a7f6126db32ee155fa8791e95fb60e0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testConvolutionFFT: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/ConvolutionFFTTest.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab819fd3babc0fbe96ffdc887928c74871db26e4037e912d3405dc3bb8576391"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck100thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"569819ac5b33f9bb0501fdd418eaa7adb475a3f091811d42bd89c73c5e21a73a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck10thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e738a2b7d14617419030431f6ffb8e101df7277ed33ce97d90adf2705ae5c00"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck200thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"102e362378a944fce5bff5e1c1183f2efb884038bcc8c935f4760942d68c9fcb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck20thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f395408e75227eb99c2d22b8f5d560729359bf1569c3941cf83634d219a8227"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck30thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc77f7dd417eed6fe52f2e2cc695dbdc70e0c201837dcb1a3c7c8993e44791bd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck40thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a6f7fc293bd817836ef0d7237583046c2136f9d35dcb636fae6c97f3c4a948"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheck50thSequenceElement: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b019f4fff83edb2e38a165f4270e27b26dbf787758d2f5e0d7303879f868ca89"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheckTheFirst4SequenceElements: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/FibonacciJavaStreamsTest.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"684844f7502dc8b143c278a940830cd08c660b5c198fccbd78b2f1a1c52a312a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMaxLongValue: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/maths/HarshadNumberTest.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"344b4733b56dd8cc7355218b5f3ee6c39ebe2891407951c21971acc3f84de35d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvert: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/matrix/InverseOfMatrixTest.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f73dadf96d4544f628a34153d22e6fc74f527e8b7f58c4a96bdb1dec87a633"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMultiply1by1: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/matrix/MatrixMultiplicationTest.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f029a619f7a5466860f99256c43d659df8f39958e191e317a68564722e133b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMultiply2by2: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/matrix/MatrixMultiplicationTest.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"22535b8fc73ba529e8a349c62bbcccf3e3075d39e1cb982c124a421b19634a38"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMultiply3by2and2by1: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/matrix/MatrixMultiplicationTest.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d89024014ee63296674fc8d88925661e7495f79d2462f19076017ae1f69607"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMultiplyNonRectangularMatrices: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/matrix/MatrixMultiplicationTest.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c17419512166a799d5a093dd569fe1bb54d62f618c888e7afe0e4f65911a5c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSetScoresWithNegativeLength: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/others/MiniMaxAlgorithmTest.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"673b8755eed31e514df062e5f932711a1eaceda3813b24a4ee24526e0bbebe08"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyInput: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/recursion/GenerateSubsetsTest.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"93997fdb7f443771ca666db23da1acf376f109135c056554d1224cba02df282e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSubsetsOfABC: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/recursion/GenerateSubsetsTest.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d0ba10832610c386d979339a9cd082dc4bf3e722732a3b0869371ffee5ffe"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSubsetsOfCBF: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/recursion/GenerateSubsetsTest.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c6c5c2960ba4ec6f0ba5f721d3fc51dfc9f1c14f45bfff9cabc4a2aeb2eaad"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSubsetsWithDuplicateChars: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/recursion/GenerateSubsetsTest.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a48e30a7a415ff4bfdaa13c07565f730c18ff2ecabee83e3e4f7ff4c9a30b97"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCircularLookSchedulingPrintStatus: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/scheduling/diskscheduling/CircularLookSchedulingTest.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"320b27e4b098f171eb8087efcab559f311b7bc2031ce2a7760ce37e505a4bd52"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testProcessMissedDeadline: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/scheduling/EDFSchedulingTest.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec9eeb7b2abe6f365ac783a21d4c83584f6a01d19bde5555ac50422f5137461"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSearchValueThatNotExists: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/searches/BreadthFirstSearchTest.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2531c8b01714370c26482897771e86e725367d16d0e9361d9e45f18e0e869783"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSearchValueThatNotExists: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/searches/DepthFirstSearchTest.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f1b367f8ccb36d0604b58be5e13a152bd564d34002a606ad910f9fd7b65742"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLargeRandomArray: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/ConcurrentMergeSortTest.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037bd9d7501c87a3bec56deed298880d27a79d48aabb19f4621bfecdc44379c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: dynamicTestsForSorting: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/FlashSortTest.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bc7f41ebd3d950981e0e2e578a226d17d1395ddcc52dccc5db7888545d8bc9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalForArrayWithDuplicateValuesShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cdf9860d4a18237a61b5da1596faa460d8cb0f8f497d966ae1388c188fa6b7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalForArrayWithNegativeValuesShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073fb97440f254a0e896b87eafb0faf79187060553d6c38516998392ad79732"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalSortSingleValueArrayShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c52be29ed9854e4d6d7f925beca41964456ee25beb64d0454b83e66e3758e8b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalWithIntegerArrayShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee23bdd1895ea9b77cf5b902d1e499d3e37a527a541fa2c9021650a50aa97d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalWithRandomArrayPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a570361469b8d4a95ae01c6b9a689b22c327b495f62ee117480b1ddc25e8ceb8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortClassicalWithStringArrayShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"079b59b427a2d5d71e9178101c25309c21d439ed60226bf3f6e8ace2123d132b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: insertionSortSortEmptyArrayShouldPass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/InsertionSortTest.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12222586cb087c0529b1befe00472f42b28d701e4648e2415e91729403f9368"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRightSearchRunsOffTheEnd: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/sorts/LibrarySortTest.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed47fa97471b847b1d99d88bd93ed8dd2dc13957eea523cf2cd22f55dc1428"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOriginalStackIsModified: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/stacks/SortStackTest.java"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b9af67a6ac4d74b2f79c8b0d78a136efe40bafabcd618de4e19f941a425e0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: findsASingleOutlier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/streaming/GeneralizedEsdTest.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43823aa2e532c15f0f6f439b235fbd4c30e9c8af3725328982b1df271592009"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: findsOutliersOnBothSides: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/streaming/GeneralizedEsdTest.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"94072ffd39ecdb8982614e55911e70bfa682cee9f7ecd2bff18dc4b1ffa48144"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: findsOutliersThatMaskEachOther: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/streaming/GeneralizedEsdTest.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e462c942c70fb7ced8bf9c7f9b69d3f5603601d2ca88048cbd6ad74f18baf02e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: survivesLargeOffsets: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/streaming/WelfordAlgorithmTest.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc96b74db2bd545092a18b001c698c3a90cb3683995bbe9bc9eedb126b13099e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: isAlphabeticalTest: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/strings/AlphabeticalTest.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00547270d4521c8ccc2cf107e08e7f588de50a34f3bedec900dd6855aa9861"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nullInputTest: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/thealgorithms/strings/AlphabeticalTest.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee201c960834e21c2c43cc21c312a858fbcd2521b5ac71946690f0195fb4be8c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java, src/main/java/com/thealgorithms/divideandconquer/SkylineAlgorithm.java, src/main/java/com/thealgorithms/datastructures/queues/PriorityQueues.java, src/main/java/com/thealgorithms/datastructures/trees/AVLSimple.java, src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java, src/main/java/com/thealgorithms/dynamicprogramming/BoundaryFill.java, src/main/java/com/thealgorithms/devutils/nodes/SimpleTreeNode.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"326716f7b268e43f68a76cc4f07eb7346dbcacdab7515521db94b5d8d16dd748"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: src/main/java/com/thealgorithms/sorts/LibrarySort.java, src/main/java/com/thealgorithms/machinelearning/MultinomialNaiveBayesClassifier.java, src/main/java/com/thealgorithms/machinelearning/LinearRegression.java, src/main/java/com/thealgorithms/maths/SociableNumber.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93af89a367f9e28d7a6041cd6650dd56bf4ce91a12f50494912ba5ca1316ac18"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: src/main/java/com/thealgorithms/compression/HuffmanCoding.java, src/main/java/com/thealgorithms/ciphers/ElGamalCipher.java, src/main/java/com/thealgorithms/prefixsum/DifferenceArray.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4bb934b07d68cebd73e27d6c21b6d71fcd241dba4c0b031b39ebedd9e2f75fb2"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 23 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (43 single-owned of 407 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 407 of the 812 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)) (\u002B17 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9603565aa6069e0abcf535dcde33980e7f55a15fa6af1c7abedeeffe7f52bf08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60ff13006ff8a39cc5b05a057e59865d7f1dd94049f2abbb6ac0649ae1c1ba56"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a91d554305aa441d442d2724475b729f0b60223514085dab60a57ddc0be4e50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4415bfa6e0a5a6f326e3c30c6ab29d8baaae2b92be7266b16f47ace462fb7f3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e70370835a6098b047e3f89b14be691b6deae1472ae895a8d4c3ac163ee3faee"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"032c9a3db9d6ce5fb42c6c50301eb9fcbb5efc9a238e49b0423d95df4306fbdb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e8ccafb26092fb76543c2ec6b5d8fbd00910e0f8d13577667c5839e4e778304"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b59af0d07a9a668fe5105492a97655f8517b05e7ba37a3648abfb88b059ec50b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76cc5c42a7ec41776acb0e00279192e12f76f91c8b32c2ce5e815465deef685e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aae6eecaa998f9740ae0988ea97a794fbf79a42e94989268ab570377d4bfaa09"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b5e199346e2ab37e5dbc57d2bc295a71dff277ecbd89421bdc5abc956d539e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d500395d3eee0a2d219cdcb3022d959bface3bfb5010932197b38468b843f338"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbaab9089b019a51eab890348b9d25fc8f9c7a9c492736515fdb514aa864ce32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86920d42295131e36275a6031f0045acb75e0639cf74c1cbe9876c011fc42db7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da60217f6d31fcad7cbc9d96782a07bb8cedc6f83cb86f4403f8791df47102ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ff7cd3e40fe6d9a53b268900f02d191a4642eba6cd8d945fd692465784d80ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3859673fd1696b23a2cadc904ad58a6c8c9286dd8a35a441a04402914c485eac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e326fc9048de6f9753eadaea053dfe214dba3bc90d9a7e3d9136f85e46291e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47c286f3a45bc6788ba5f796534b1693789c6af712cf46ea06ee569903179b53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6166824e185d1b7c62508d94218e5359d2b19fcfc16ad8fd9ea707085dca3a28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3565f3709c86cf0f02e44cf7837dcb81f4d45a0f7506287eb25947a9f3015cdc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4aecac6953144534300a4bfdc8337ddaac9267cf3a8d26c2e186b426ea55bd37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f568851c905580731c6de32f34f692393119a47c9cea68ffcb1e9c14d49599ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e195dc025e75c90fcc3104265dd7b61292f5d29279e5edce8687084a7c8bb996"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bb30f7d21db3fd6f8375984dcc272dadadbd3e10642068edabf7dc90c1d2a8d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01d05365c56035d17d8191af063eefa18979828b732e57db85f653c3dbc5a228"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D32","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea390a0a43dfcd483fc6af7488a8ce313053a6959780dc9127c8e465b74657f6"}},{"ruleId":"D32","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80f22d5f3938c3714699200ba828a2ba8d67c1a185d887fed6c99c9c0c91abca"}},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 273 of 407 significant files have no living knowledge, while the repository is still being changed at a low rate (77 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 273 separate risks. Counted over 407 of the 812 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"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":"src/main/java/com/thealgorithms/ciphers/Blowfish.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bc81f7293063bbf12fca184fa05b5cf4eefd222f83a13f36614f68c5ec0518"}},{"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":"src/main/java/com/thealgorithms/datastructures/caches/LIFOCache.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"179b61afd867c6d6a20e9c7ab6d7a514b8bcffa6662cf3a3d3ede59a9dfd41d2"}},{"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":"src/main/java/com/thealgorithms/datastructures/caches/FIFOCache.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"990318e705514a9ad899284ba563083a39dac8aa48278d1c1e7642093c3e400e"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 89 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, 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":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M1","level":"warning","message":{"text":"README may be stale: 94 code files changed in the last 6 months but the README was not touched \u2014 it may no longer reflect the system."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e973e7a8d5d866995cbf78b120250fe7f132bf928812d48ca62e69aba11b9910"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":30,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}