{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Node.knn (cyclomatic 91): Node.knn has cyclomatic complexity 91 (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/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a36d0dc9f250157744aadd4c7d56b8e3009a2e49c92ca905965f39a1bcbf8"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericSegmentTree.\u003Cinit\u003E (cyclomatic 31): GenericSegmentTree.\u003Cinit\u003E has cyclomatic complexity 31 (threshold 15). 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. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85769004751475bc8ba7b8264446fca42893afba8216fa448e3488eac51e9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"TreePrinter.getTreeDisplay (cyclomatic 27): TreePrinter.getTreeDisplay has cyclomatic complexity 27 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d317987742a6100c14fd3b54d7b034425bbd05ef4d62faaa8487940337cf243e"}},{"ruleId":"D1","level":"warning","message":{"text":"TspDynamicProgrammingIterative.solve (cyclomatic 22): TspDynamicProgrammingIterative.solve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25f7922c91389893468cd948f9bdb3a8d4ec92265fc74c552d63ce67b1fb377"}},{"ruleId":"D1","level":"warning","message":{"text":"Solution.f (cyclomatic 21): Solution.f has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/dominoandtrominotiling/Solution.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a6fd6dcd088076c9b6bf75f527866fac2d6bdb20b52dc9e8f32ae69029fccd"}},{"ruleId":"D1","level":"warning","message":{"text":"LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection (cyclomatic 19): LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection 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/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb859119ca83739fa3aa878f4a0628881e79e2f9d6a0cd1b0faa3de4e01569d"}},{"ruleId":"D1","level":"warning","message":{"text":"CoinChange.coinChange (cyclomatic 17): CoinChange.coinChange 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/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07ba06012602f67c9e1990a0ce117fec384a198693f5d04b963573e7f61f82b"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.knn (cognitive 341): Node.knn has cognitive complexity 341 (threshold 15). Drivers by points: if/else 86 (326 pts), boolean chains 6, ternaries 3 (6 pts), loops 2 (3 pts) (nesting depth added 244). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java holds 2 of the 45 methods over the threshold \u2014 including the worst \u2014 and 328 of the 674 points over it (49%), 4.3\u00D7 the next-largest file (src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java at 77). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4c0c4f19183cb9a60e61948773192c0404ef082121b2b4f0cb8950deab0666"}},{"ruleId":"D2","level":"warning","message":{"text":"TreePrinter.getTreeDisplay (cognitive 92): TreePrinter.getTreeDisplay has cognitive complexity 92 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 10 (30 pts), ternaries 4 (23 pts), boolean chains 1 (nesting depth added 64). 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/williamfiset/algorithms/datastructures/utils/TreePrinter.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a621b2c600449da0f9ea756acf198cecd81740455aabbee0cf5585b757cd8223"}},{"ruleId":"D2","level":"warning","message":{"text":"TspDynamicProgrammingIterative.solve (cognitive 48): TspDynamicProgrammingIterative.solve has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 8 (15 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3d45a00e89c4f68b5f99171a15f2d341a1a2cb0d4676f8a1b2687387cc0366"}},{"ruleId":"D2","level":"warning","message":{"text":"RedBlackTree.deleteFix (cognitive 31): RedBlackTree.deleteFix has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (20 pts), if/else 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/RedBlackTree.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4b73285b4af751688bc41beea6caadef7e0c723d8769889f0a397c5b280801"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplex.simplex (cognitive 28): Simplex.simplex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 6 (13 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/Simplex.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"edda0419e32211b909b932c5ab29d48dd6df8c5cae1f23af4ccc74827961bbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"ChineseRemainderTheorem.reduce (cognitive 27): ChineseRemainderTheorem.reduce has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (10 pts), boolean chains 2 (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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0a8d94d5dc0d79c3ac90515f4c11a2564f054858570cc924e420f70f276eac"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArrayFast.construct (cognitive 25): SuffixArrayFast.construct has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b4779cd304f1d8b3e5b1860087ecf1c75bb1dfbd9b39efe8f71b042c1d0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"CoinChange.coinChange (cognitive 25): CoinChange.coinChange has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (6 pts), boolean chains 4 (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/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e76bac38217eccef0de77f5d117b2ffe44442f7de1ce6e5c78cb03a5dd08736"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArray.construct (cognitive 25): SuffixArray.construct has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344e556f815384ede1cdfb7ed40ff3c9bc2695be671217a590098b64da819c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArray.construct (cognitive 25): SuffixArray.construct has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18bee8569eac5742f8b52acf7fba6cb418eae8a12d63f80d2cafe159189bde6"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArray.construct (cognitive 25): SuffixArray.construct has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a870d6f9095a3ae93466094e88bd1a2bebe83c2d84362a3679ed157446c4a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"SplayTree.splayUtil (cognitive 24): SplayTree.splayUtil has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/SplayTree.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb000ff94f004ab268914e61d274082cc4ea1f13037f25f108a34133daed57"}},{"ruleId":"D2","level":"warning","message":{"text":"ModularLinearAlgebra.rref (cognitive 24): ModularLinearAlgebra.rref has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (11 pts), boolean chains 2 (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/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95b377d4f80e031d2ebb65c1061b34d6a46f670c4a361d6df8ee1887014d6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection (cognitive 23): LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0005e4ab9355f2e92ad7ac1a6afa67e4ba7940d5925b9645b48da3c416729e15"}},{"ruleId":"D2","level":"warning","message":{"text":"Boruvkas.solve (cognitive 23): Boruvkas.solve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97e670a17c02d693750a25ecf2b46c552c537e30b7f6c9e81d8f140ad48f486"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussianElimination.solve (cognitive 23): GaussianElimination.solve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c34234837c2470db43c44634ad3be263e6d12be4840da59c94724407e04db6"}},{"ruleId":"D2","level":"warning","message":{"text":"MatrixInverse.solve (cognitive 23): MatrixInverse.solve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (11 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2138eed0cb0d125ab427b72b76884aa6ab50140c3d8d8602d4a200a984fdec44"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTableOpenAddressingBase.put (cognitive 22): HashTableOpenAddressingBase.put has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), 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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f830c215a82ed96dca3e4bba5fe84cd4fb997d8b829cc7b79657aeda8c157d"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseTable.init (cognitive 22): SparseTable.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef19b73671b7654032ca07dbb4204962ef3fb4a3ad17f661d84655d5398d9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"AStar_GridHeuristic.astar (cognitive 22): AStar_GridHeuristic.astar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (4 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/williamfiset/algorithms/graphtheory/AStar_GridHeuristic.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed385e8f1762be241359c4d18f4d38277735813209bf6a28df0380998e2f783"}},{"ruleId":"D2","level":"warning","message":{"text":"FloydWarshallSolver.solve (cognitive 22): FloydWarshallSolver.solve has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce00aa4edd1fce115b1b7343614e47958fb792719bb21a31f1441261b7b994"}},{"ruleId":"D2","level":"warning","message":{"text":"CoinChange.coinChangeSpaceEfficient (cognitive 21): CoinChange.coinChangeSpaceEfficient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1572f66d069bfd3805515e394acea74f0a6504219435510ec5b6c960e41da83"}},{"ruleId":"D2","level":"warning","message":{"text":"ChinesePostmanProblem.\u003Cinit\u003E (cognitive 21): ChinesePostmanProblem.\u003Cinit\u003E has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 4 (9 pts) (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/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aa28e1dff7000fa57e3f1fd6b72a8d8433e85c761e4e1db08e5374850af041"}},{"ruleId":"D2","level":"warning","message":{"text":"Solution.f (cognitive 20): Solution.f has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 9. 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/williamfiset/algorithms/dp/examples/dominoandtrominotiling/Solution.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e622582f685e473de05da8af738a06179179a21aa7592f04d4a4a23a45ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditDistance.micahEditDistance (cognitive 20): EditDistance.micahEditDistance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (7 pts), loops 2 (3 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/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f1be12290fc2c98d8c0108f2bbdcb5eba4777c56d62f95e9f845381e0987a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClosestPairOfPoints.closestPair (cognitive 20): ClosestPairOfPoints.closestPair has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 4 (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/williamfiset/algorithms/geometry/ClosestPairOfPoints.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae26c3563f9281ad249c47197d539b687f1c42998a58d238d242acf2d0f5aae"}},{"ruleId":"D2","level":"warning","message":{"text":"BellmanFordAdjacencyList.bellmanFord (cognitive 20): BellmanFordAdjacencyList.bellmanFord has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae77b2a474c65a458949ff68392be28b804e2ee366e63e646454a9729b681891"}},{"ruleId":"D2","level":"warning","message":{"text":"SteinerTree.floydWarshall (cognitive 20): SteinerTree.floydWarshall has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8ab0875be24da51816469761bf5f64980a28aa6ecd21aae98c445edd1fe27c"}},{"ruleId":"D2","level":"warning","message":{"text":"ZAlgorithm.calculateZ (cognitive 19): ZAlgorithm.calculateZ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (8 pts), boolean chains 2 (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/williamfiset/algorithms/strings/ZAlgorithm.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e61af7db1364029ddcc18c53479aa16410b01257f481b7b53496810192fd82"}},{"ruleId":"D2","level":"warning","message":{"text":"FibonacciHeap.consolidate (cognitive 18): FibonacciHeap.consolidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4404baa79081ff3c6f752273c3e8c2bca43061a1b922e6f13c3d81889386f7"}},{"ruleId":"D2","level":"warning","message":{"text":"AStar_GridHeuristic.dijkstra (cognitive 18): AStar_GridHeuristic.dijkstra has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/AStar_GridHeuristic.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a294dee2817c052a3be81882ba01eadab7aad945adb8841e7c06b1f7ee4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"DijkstrasShortestPathAdjacencyListWithDHeap.dijkstra (cognitive 18): DijkstrasShortestPathAdjacencyListWithDHeap.dijkstra has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9deab90daeabfa79ca284673c0c451455c15a43f927efe3ae06faa0d0eda294"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.add (cognitive 17): Node.add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java holds 2 of the 45 methods over the threshold \u2014 including the worst \u2014 and 328 of the 674 points over it (49%), 4.3\u00D7 the next-largest file (src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java at 77). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"117debf99fb60bf35e9efed10f6d69962f7e56653a9bf27b99d2c6ac205dc527"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericSegmentTree.\u003Cinit\u003E (cognitive 17): GenericSegmentTree.\u003Cinit\u003E has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 5 (nesting depth added 5). 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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"716a81c5eb76cc6789119568a7d8e03236832dee3e4b4d674c36606b4b0bbe42"}},{"ruleId":"D2","level":"warning","message":{"text":"LongestCommonSubsequence.lcs (cognitive 17): LongestCommonSubsequence.lcs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 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/williamfiset/algorithms/dp/LongestCommonSubsequence.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5151f533b548fc3be9c7bd914222a5dc2dce53f7128739a7ccf26cdce09aea7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChineseRemainderTheorem.isPrime (cognitive 17): ChineseRemainderTheorem.isPrime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e0ec54db875e1f00456b66b98c2bd2d1b6067c80ca61e66155e7c701ab0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"FastFourierTransform.transform (cognitive 17): FastFourierTransform.transform has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (8 pts), loops 4 (7 pts), if/else 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/williamfiset/algorithms/math/FastFourierTransform.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe39a8ca192791379716f10f0b64ca1786bef70cf7b94a07c26843718e567b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimeFactorization.isPrime (cognitive 17): PrimeFactorization.isPrime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98340c200e287ec95c840930ff0dab86d460afd9002fdb35d47862de8767468"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTableOpenAddressingBase.containsKey (cognitive 16): HashTableOpenAddressingBase.containsKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (HashTableOpenAddressingBase.get) 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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e6aeaec051625d05ad84b6af3a602c8fbdb0d0047ad28f1cfdff80a7976dc"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTableOpenAddressingBase.get (cognitive 16): HashTableOpenAddressingBase.get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (HashTableOpenAddressingBase.containsKey) 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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d289910c2c94e2f05d94be51f327d4897441c68696546158c438968ba7610"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArrayMed.construct (cognitive 16): SuffixArrayMed.construct has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 2 (5 pts), ternaries 1 (3 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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3137860038b331f3614aeb2ec41a5c954acb87298799cec1117779864c95c0b0"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWeightPerfectMatching.solveIterative (cognitive 16): MinimumWeightPerfectMatching.solveIterative has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"878c6f56b463e246ba988da2aa9a75a5865c951a0c7f421ff3f8173934ed832b"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightedMaximumCardinalityMatchingIterative.solve (cognitive 16): WeightedMaximumCardinalityMatchingIterative.solve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a03542fcb012ffe0fd4872cb39fd20c497e6b0639c3e2ba59d734841c3da481"}},{"ruleId":"D2","level":"warning","message":{"text":"SteinerTree.minLengthSteinerTree (cognitive 16): SteinerTree.minLengthSteinerTree has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2678a8830b90ed1816675106f9f66765d1600aeb5366206978952850285c35"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArrayImpl.construct (cognitive 16): SuffixArrayImpl.construct has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 2 (5 pts), ternaries 1 (3 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/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6c0821c3722beedb1e2c45ed3553a1ac262272a9d053b821ef1f3d11151045"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatrixDeterminantLaplaceExpansion.main: MethodTooLong \u2014 main runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b38fe9f6aa9b6fef112b025ab44a13ad47622bc20f6bbf414b8f6ff4ec28df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericSegmentTree.\u003Cinit\u003E: MethodTooLong \u2014 \u003Cinit\u003E runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b607844b18597cbc38ae054b78a3d08edf2375d4ae28755f187de00c9b3f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:43-65 | src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:89-121 \u2014 These two members are one piece of code written twice and then edited apart: 15 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/williamfiset/algorithms/dp/Knapsack_01.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f35546bb55be978d1e8d2526f4bdbedcd580f1af2a989fedc892da4252b5eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:299-308 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:70-80 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:61-71 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:71-81 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:121-131 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:67-77 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:80-90 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:60-70 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3435356b1d1391f568e1acb13ca9932586d177f6435b5eb76570dd1f7d6522e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:132-155 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:134-155 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:130-145 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:147-166 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:168-183 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:185-205 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:207-231 | src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java:123-153 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8422ce3122d7e579b097d1501b6cfc4b4904a42fc9e0acfeb979b246e03586e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:385-393 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:170-178 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:252-260 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:169-177 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:170-178 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:176-184 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:158-166 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a79e9af2742c21d50320c2a02bba42bb77f5ef5c3db498a64d39bfb7fe57bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:527-540 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:144-169 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:172-191 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:194-213 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:229-243 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:127-152 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:29-65 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afd8fcd793f4c89167684dc717164212627f8ab60d9756c82823179db07e145"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:304-344 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:311-351 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:223-250 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:253-295 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:298-329 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:332-359 \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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"346a448b1e3335145ab2755f35e350459c83f17090c9017b6c7b835d013434cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:43-60 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:33-51 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:44-61 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:39-57 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:53-70 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:33-50 \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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adebf15333b3967cc21896ceea527315eb6d3e282cf65233d51ff11c64d0bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:142-163 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:136-157 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:143-162 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:144-163 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:150-169 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:131-151 \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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3924d46680ba36737d38ebbb055c6fd437760bf7cd2300e9112623b09248b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:127-160 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:138-172 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:243-275 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:218-251 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:234-275 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:203-243 \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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61901fe2f2f81c9e7847c71921c802c84447c26f8612e0697be1286015ee61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:44-50 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:53-59 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:50-56 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:52-58 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:51-57 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:116-122 \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/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da9fa8ad5759967494ea196ec10d8156bcbaba24207ef27908f738356d5dc43"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:104-112 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:117-125 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:106-114 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:116-124 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:115-123 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:180-188 \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/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc99138654e82fc3d5577d36f62a80590eb9bce1d5d173ad156b799b0c8ef5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:50-67 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:168-186 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:285-300 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:419-436 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:226-243 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"babb2b994820b4960a8a8e2c29e8a0a63e0cb8dc6795f21e07fc76cdf3adb5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:121-132 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:241-252 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:337-347 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:490-501 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:297-308 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2188a62d29eb47e7e256ac0bc72642a26e5d6bad3da7ddf8f69727b954cea385"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:100-124 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:126-150 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:101-125 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:90-114 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:92-116 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b57d54ae38cc30698c691b2cd12c8ddeb37cf1e92738fbe0b1875eb0a6880e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:53-105 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:54-79 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:58-83 | src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:56-81 \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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f265ef6c4728f1a756768b4a6294ba3866698749394b26116cec62b476a247"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:218-225 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:227-234 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:236-243 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:245-252 \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/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df40a649b5b07dd5e00aed8ab2288fbe1446aa4a8f147662a24a75c34791c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:75-101 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:103-114 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:116-129 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:131-139 \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/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd622e6fc112c432452e48b6fa4e994612776bd5bff6f66c28009dd52484d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:141-149 | src/main/java/com/williamfiset/algorithms/math/ExtendedEuclideanAlgorithm.java:19-27 | src/main/java/com/williamfiset/algorithms/math/ModPow.java:55-63 | src/main/java/com/williamfiset/algorithms/math/ModularInverse.java:34-42 \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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e501e067605df65c09ed52cd5de80e015adc9c8f548d2cf6b94083d5d7df17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:157-218 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:73-135 \u2014 These two members are one piece of code written twice and then edited apart: 62 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5425a4552d1827cc9a8d5db89e226d48a068046e019ade5159e245836ab971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:53-103 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:239-296 \u2014 These two members are one piece of code written twice and then edited apart: 51 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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0832e17adf36639bfb3adf5916adf8d78a0082460fe5cb30ddb14742a82f5207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:53-84 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:198-229 \u2014 These two members are one piece of code written twice and then edited apart: 32 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/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba2a9af6d7ac21985c8bc627ec6d9a6e408770fe510f1f2c734e705edace24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:73-107 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:112-145 \u2014 These two members are one piece of code written twice and then edited apart: 34 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/williamfiset/algorithms/strings/RabinKarp.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b31bb016d9de87ef8e967a9fe3745252d7756625d3cb6b9ac301fb615609c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:43-80 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:194-229 \u2014 These two members are one piece of code written twice and then edited apart: 36 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/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"de877f5c0f2968fe14ae28c762fd76ef80690f2bd389d649e50c3a59cd8a3a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:186-221 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:271-306 \u2014 These two members are one piece of code written twice and then edited apart: 36 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"441e82b2a5803f71750fdd35906952fa73c96d3b448ad07b5067cbae705a8db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/ConvexHullGrahamScan.java:90-112 | src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:54-80 \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/williamfiset/algorithms/geometry/ConvexHullGrahamScan.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcc2b0e65cd16c24e904e1e3961a62283688d4c42ed04f741d7660202cf30d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:223-289 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:220-296 \u2014 These two members are one piece of code written twice and then edited apart: 67 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"192dd22a08bbebfea15c874aa9c022b9b8eb52eb12c38c10cb72e0f1f26630ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:29-49 | src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:76-99 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c67e61eba7682192a2c94e1340c0789d3c36d445521826a550395af23c1d907"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:29-54 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:103-137 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eb452298e66f1ed8df8432ae225553bc02c3f4f4a37c3b0caeecfe4927bfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:200-239 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:248-288 \u2014 These two members are one piece of code written twice and then edited apart: 40 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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7f28b5d46a6b3acfd427ebac55ef1abdb27129334d0738f279f6f7890bebfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java:67-89 | src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:38-55 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4273ca552ed3aca65bfac3f01cea8ac8e1b155618ce59ba5ab4905ff908a948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/DagDynamicProgramming.java:34-70 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:28-65 \u2014 These two members are one piece of code written twice and then edited apart: 37 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/williamfiset/algorithms/dp/DagDynamicProgramming.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fdde2e7e8daa60de618fec3a7f164146f8e150570273857deeafb0c5cde431"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:226-248 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:141-167 \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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346f19a528f89fe1dd82563357533dc4b0ae60bb5a2c67fac82a4a9a2e98dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java:48-73 | src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:33-71 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e14d86c9b15468a36df105ff07d6e2cd5c85cef6e6befd69fd855d9b5b15e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java:135-151 | src/main/java/com/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java:154-170 \u2014 These two members are one piece of code written twice and then edited apart: 17 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/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14a56d6127baf5a2210116ff94ad1794975b42c85e90b560e2c970b0def36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:177-206 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:142-171 \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/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b32b8b6562fd206e8f705da870064eec034de0d76767f8aa1be695c43d8a604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:75-87 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:82-94 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:116-128 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:86-98 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa23dfb1f9f352fbf4fbfe45c2d228e9d07587b05d4934214911dec663fa59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java:201-224 | src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingRecursive.java:118-139 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e5cd36114953c368f340af90f45cda675afc868a37408a2801263e43c857e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:102-122 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:88-108 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7f95a217e49a762de7efd5a4a55c6fb0bb7032ccc802b823f2dd79484dabaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java:122-141 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:262-284 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ef9bb06b992e7fb50adbf0bbf2da986687630b4aef33171d002eaab942e73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:46-75 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:34-60 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"402d0d709ac269a8a72a95b2d3f34d4818038b371d468033bd6855eded0ec83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:55-71 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:179-196 \u2014 These two members are one piece of code written twice and then edited apart: 17 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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"046dbbb13d2832b9d292918687ee90ba99ee99d9d6a0aa82031d47e7ac51337a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:85-112 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:284-312 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf02cef718748d1a165a1b918dcb018722f3f1924a1910f0c69f8419ff782e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:90-104 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:131-144 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:169-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec280c3b098dd5df355265da89bbb7a568c4a580c9880b281449b2fb7faf5010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:78-99 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:85-106 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4501b476504b3bc5924afaf582e884f550e6cba71b94a0d94b41bbd1648e369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/main/java/com/williamfiset/algorithms/other/Combinations.java:26-54 | src/main/java/com/williamfiset/algorithms/other/CombinationsWithRepetition.java:24-52 \u2014 These two members are one piece of code written twice and then edited apart: 29 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/williamfiset/algorithms/other/Combinations.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda6fb6b981ea30417cdd50fc9c7308bf02744bcc689a7e79eef4a3e15861cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java:89-113 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum.java:58-82 \u2014 These two members are one piece of code written twice and then edited apart: 25 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/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd7c846c2ae3e89be8543d3eb7875fcc764d47484edb697d0c8b02b44b5368c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 13\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:321-333 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:101-116 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:92-107 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:102-117 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:98-115 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:111-126 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:91-106 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9a593efe35efd67e104cbb5ea4585f538d1b4b53e4fbdc4ea86cd5a72e8e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:457-466 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:108-124 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e012fd9525b901ad692ba6736efbd1e45a59868b24ed1f7e7e2f903bdc4c7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:408-421 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:423-435 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:437-449 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:451-467 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:469-485 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:487-499 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee719fe7b6e409c4a61487a065413a2666136c152c73a5c0dd97a83e54f25a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java:103-115 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:575-585 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f171f0a254b4cbb8eb361bd51acfded33c9a13bf336bc197d1c7047c469876c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java:55-62 | src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java:62-69 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d5793375fe0ddd5d41e2914b7cf1cdd95b074943135e0effa745e9cfe197cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:71-92 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:208-223 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:237-253 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33898cde1542f3bd9bdfca15cd917b2132e961648e80b6af13d32ec019daf61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:91-101 | src/main/java/com/williamfiset/algorithms/geometry/CollinearPoints.java:66-84 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/williamfiset/algorithms/geometry/CircularSegmentArea.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc19dbecf0635a5c4b43b6d89d42b1564c43f3c4853664fa74287a295260f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:354-361 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:356-363 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c932f0cbe6f47afa35f9aa120d9c747aa527711d5fd8116d95ca7ae1e216c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:29-42 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:45-58 \u2014 These two members are one piece of code written twice and then edited apart: 14 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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374dc9f6d3b5c6d0a68711441d72619aa43b8750faa0fecb04c44e82fa3fcb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:28-40 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:29-39 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:63-71 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe69ce657cff90f4bf468a65b3e0264f89af9e06b0462dc7c10ea2ee84bd3d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:177-197 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:202-226 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae7f5f4b2945efb501dfe4a0929a08efa636c8aa45bb3ab459865f03a6ba7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:68-89 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:62-80 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:219-238 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9e4e4e24d6e621011093ce9b1a374efd0d29e43cde6ba5ef6d306f071524c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/TspBruteForce.java:61-70 | src/main/java/com/williamfiset/algorithms/other/Permutations.java:67-76 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/graphtheory/TspBruteForce.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d8250aa907c6d87b1d21da9f61fa55295553d68f49ee21b69c71b11ed17b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:203-219 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:232-249 \u2014 These two members are one piece of code written twice and then edited apart: 17 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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"34714babf5a08478cc272540d6d9f435740f9e2bf01a20cbc46e19842b4361c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:55-68 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableSeparateChaining.java:56-65 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeed04961166956810cde2a20cba3c7d90835972ea1d2c03a810de5a2c22f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:15-31 | src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors3D.java:16-31 | src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:73-89 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"295536d3424f3e24eadd8693b2be7048dd350f1900da4c0a92952ccf4a2f7513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:61-79 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java:32-51 \u2014 These two members are one piece of code written twice and then edited apart: 19 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/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd80c518b740d62d5ce1edbd2a737488e461a5f93cee46ea67aa1f39b56bc83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:55-76 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:63-83 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e310f1b322db3874b855a0628d4baec00d83b01d4a9fed607e36a67560534864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeQueryPointUpdate.java:27-42 | src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeUpdatePointQuery.java:23-41 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeQueryPointUpdate.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b09d876b48437144b4a82b37f21f0e26fe6bff300dfa66b1007ebff6b18b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:162-172 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:174-184 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:103-114 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:232-242 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d730ed4f9cfc193ba439d1027497c37bc3b01e164d31078322e6bd5a2e3b60ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/unionfind/UnionFind.java:93-111 | src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:181-194 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:146-160 | src/main/java/com/williamfiset/algorithms/graphtheory/KruskalsEdgeList.java:43-54 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/unionfind/UnionFind.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce54eaf09a45264005b80863f05dd698b8f533a9e4f4c6f9e78e71ba7350ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:96-103 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:124-131 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df27e580a519a7865d7c0adc34c4bb66dd99b9db82fb45e3cb66095bbd4cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:13-21 | src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java:11-19 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d503489b9c755ab0359c15c116bbe51b3e1eaf831d0d6c6b70e833a312f17bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java:45-58 | src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingRecursive.java:34-54 \u2014 These two members are one piece of code written twice and then edited apart: 14 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/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dbdd78caab4b6399462e7876ac02cd7e2d0aa93ad52eb6f7dbc53fda24e558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:122-128 | src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:130-136 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31dd0049024c63e4b3b2c33ad0d015a2463881042ba71ae5df70493ea429746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java:23-39 | src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java:42-55 \u2014 These two members are one piece of code written twice and then edited apart: 14 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/williamfiset/algorithms/geometry/PointInsideTriangle.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a497297ca1d71a646dcc6d215538dfc4824e1265a1a22b194d3832c402ffeb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:75-85 | src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:91-99 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:84-95 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:101-110 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a576d14fffc77b8fef88c71b2a1ff273c6d2fdf26fc80e6467a37b4a40982d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/CollinearPoints.java:57-63 | src/main/java/com/williamfiset/algorithms/geometry/ConvexHullGrahamScan.java:83-88 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/CollinearPoints.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf07ecf2d87dc8b2ad77d2fedf6e7d7ffe696e3a4521804ad1a548c9b40a442"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:440-455 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:90-102 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c3432ff957c54dc520a165bc4caff21298c55a02efe177f15b5ccc397d1688"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:131-140 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:122-132 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd51e1f9a051c9da9b18509d0adbadf0f99fc8b7bbf9c34784ac86ae3e53a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:102-113 | src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:116-125 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"659f1ab569936f36f0f0612c939ed7da32a17e660115b500640213f210cc956f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:245-252 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:614-621 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:421-428 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8f6a829a0863ebcb218db00d9160e06489d3cb3aaac6c1113d93d46dab0c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/linkedlist/DoublyLinkedList.java:61-70 | src/main/java/com/williamfiset/algorithms/datastructures/linkedlist/DoublyLinkedList.java:73-82 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/datastructures/linkedlist/DoublyLinkedList.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"396c2e7696a06a3039800a70692b6399d92a4adfdbb99ff216375ee575e9ed3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java:31-39 | src/main/java/com/williamfiset/algorithms/sorting/RadixSort.java:74-81 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f009a8129f9083ec3ab27cb0adb6029ee63f82918e939a61cc530831b3a46523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:327-334 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:337-344 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42f8b565abead05ee9c5fb5febaebe03805beb0b34d48bcbf5d2c1ac8db9258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableSeparateChaining.java:185-193 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableSeparateChaining.java:195-203 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableSeparateChaining.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d91834218b57bcb950ba1dff00b492a81a0cf063639829cec7f4d0bb3c56c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:195-202 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a709a0377eac1bf0b32ecd69bbb7d72eb144b2400f142fc3b1f3d1fd6033fca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/com/williamfiset/algorithms/geometry/ConvexHullMonotoneChainsAlgorithm.java:83-89 | src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:115-119 \u2014 These two members are one piece of code written twice and then edited apart: 5 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/williamfiset/algorithms/geometry/ConvexHullMonotoneChainsAlgorithm.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"098a2f3643ba851ceb189aa731985347147b7623ed2a900ea08aa9ba3ee79e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:62-67 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:103-108 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba87b76ff5b8217adb7f778764c56045924933698fa0b926034e0dadbdbfd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java:80-87 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:567-572 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af78c1054ae9bb752212d0e10c825774d3e00f0eb73ba97f4bbf16dd527ee80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:270-280 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:282-292 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:294-304 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7ca6839c2c0a60244de8b93909cf2797e1d235c27fdb4fdb7e5c9967ff1624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:141-147 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:171-178 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:190-198 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"203f29bc0f49cc7ed530fbfacf910e3aa89dfc6178912c2de9b3f8f247628ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:79-93 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/TreapTree.java:79-87 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:174-191 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f41c212c8ef01d974f0dcbfccb44f15423bfeeaa0fcebd7af917976cd175c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:127-140 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:468-477 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9ac4c006d83f8262748578328d40a87cde911609679d104ae452252892ab8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:61-74 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/RedBlackTree.java:231-244 \u2014 These two members are one piece of code written twice and then edited apart: 14 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"285629904b80a3ec66cc09797056b99ac7916767f119bc4b9217c2d6b18fef51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java:94-100 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:489-495 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8010bd3c4814cf5e946149ab199dda35e9c5a2fcf7f5f8a32edd7edb8bfff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/sorting/MergeSort.java:57-63 | src/main/java/com/williamfiset/algorithms/sorting/TimSort.java:83-89 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/sorting/MergeSort.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eb6a4f23a79f99386fb542bdcba4d1f00869c04867583f5581df39f5667937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java:181-184 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:156-160 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"161966b0602eb488ce7fdd4cf940891da6539d41eb27a4d5ad91401ddfe81861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:480-486 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:151-160 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d53c6bf5773ac3c98ffcae39d85ea9bfd2be6d0b155b69efcfc4be559e970bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:336-343 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:125-134 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:133-142 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:139-148 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c886128939a1f654443bdadd297b5a6e9458bc9ea11c1ea68ff50d4404aafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:45-49 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:50-56 \u2014 These two members are one piece of code written twice and then edited apart: 5 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/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5d0df8296b2664bb4c59df8212eb2928e2a1f3777a249e00ba256c35208bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:26-31 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:26-31 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2f5780675ee3fac0586b338b56cccb94fd8cdfce7b7bfde447d0adcb8227d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/TspBruteForce.java:72-75 | src/main/java/com/williamfiset/algorithms/other/Permutations.java:78-82 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspBruteForce.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abb84050fa4f1da39fcef17482df4ffbcf7ab9a076c4c420fe59ad9482b04a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/williamfiset/algorithms/other/SlidingWindowMaximum.java:28-39 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:512-521 \u2014 These two members are one piece of code written twice and then edited apart: 10 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/williamfiset/algorithms/other/SlidingWindowMaximum.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e702311a010cbe3431659302e56d0df85337a3935738b8687c10844452412875"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/JosephusProblem.java:15-19 | src/main/java/com/williamfiset/algorithms/utils/TestUtils.java:9-13 \u2014 These two members are one piece of code written twice and then edited apart: 5 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/williamfiset/algorithms/dp/JosephusProblem.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09d103324a4f1a70e37f255b2a31be5bf224c1cf5765a2a18546e149f61a51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:155-161 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:171-180 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97efb43bdffec1249e0ee691baf4eff4577143d2be3bc035f896942ef6a7e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:92-95 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:105-108 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:94-97 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:104-107 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:103-106 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:168-171 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc05c53a10478de20fba12016aa4d0f79bb270df209689a55ba40f3d45ba01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:197-199 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:319-321 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:386-388 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:566-568 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:373-375 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3aed0b839cb6c3771edbae832c3a576e357efd6ab2f94403e8f7dead3f561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java:59-62 | src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:33-36 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9c34516f7b9b808d2cf5e44f0871b9e46c4661f25525fc70be542d37bf67b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java:47-53 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:43-50 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a94b18eb5cd71c4d260f2813ea01d09f56951ab789e1600347e4377386a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java:158-161 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:169-172 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb99ad987a7cdeac952deadf38366e14f0a77b78117b38564490d50fc77742c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java:172-175 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:181-184 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e415ae9285c77cb2914093ca35cc62edeacadd027832e1979bb2534de43c59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java:148-151 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:148-151 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb52459fb49c7f624021cc882f83d0c8b4c0c065331413e8d486f85a87eea1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:414-419 | src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java:43-48 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca0758096b9faa9048de939bdd74de3a45c5048e3efcceffd5e1848e4c4ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:211-252 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:348-389 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d256a48a4c1d8b6d1f4413be9ff53356fa95ecd605e91a11125f729d7f01120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201333 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:37-69 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:54-78 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/linearalgebra/GaussianElimination.java:37\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/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec4ffbaff8f6d39be97693cf506387c604746dc8604073d4949d02cf2e271d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:230-258 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:100-130 \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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:230\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b654f5c4ad47d2212b691be660a22ffd436acbc163f0b857a554b7fb109801a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:200-229 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:73-103 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8835c3f3a37b469561dee44387865662ebfcc4f17f59531978b848ab0851227b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:310-334 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:315-341 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:257-285 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:310\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5daf0fede3bc4e96ad99394a4eee1cc40be1720d46183dcc1e14c35576866f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:52-80 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:202-229 \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/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:52\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/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2669fcb1ae570ddd59f5a1ee6bec7b35da316adcf2c068002f2acf6587fcfb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:145-171 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:138-164 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94d6571a28ac60072db23bcf52b1e4d7191460517f0e2c146b6820e614eab84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239-265 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:242-268 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239\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. 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96ae938bf1f520ca04a6891e73586d1eab9eecfe4089f5f95af364092ef8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:101-127 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:238-264 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"03502525e2d0398065911b53c860a72d658993126eabbca79bb452646164a426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:158-192 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:74-108 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:158\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d9a475be6701cf0c6698a0d82c597c0a47ea7855e24d8da4cd5afb97dbfbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:77-101 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:265-288 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:77\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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d28255c0cecd1372be0b6356f9c3db0b848fb3fd0ee600ae153c2024713395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:54-75 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:240-260 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:54\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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3154ce3c4baa6909003c3192a8fd324e96c3b968acc247175f90917a44cb4424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:197-218 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:114-135 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:197\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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"899471d16aac87a239278d65624fb50556b56d9d8cc3c881577e2885f36b453d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:178-199 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:143-164 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:178\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ba39a950349aab4da7e05d3e66a1ebabda85ae21908c37208a6928b59b7752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:172-193 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:45-66 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63f14ccb5d5c4ab4abcbf2a2d1b1772d8203a6a71447b1183b7979487395385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:134-152 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:148-168 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee5c72987d1c20e7295941c3597a5d6b8cfd0c682756bee5be1c1fa19f4f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:201-221 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:286-306 \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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe940c9644879384c5d074f7312d37fc686f2d9626090b12233ffcffba17721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:169-203 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:306-340 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb27683440cb6df02bffa74c5f61cdb441a8200d111e7d9ee7ae768c1583af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java:147-166 | src/main/java/com/williamfiset/algorithms/geometry/PointRotation.java:22-41 \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/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ff08c62f33962c35800c721602d7b1fc3df88046e2b1e725542a3d78d6fbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:155-174 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:174-193 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d38ca187e3196cba89e7cbd902a1a72fcce69d680c6f0300cdb6bbcbe5901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:179-198 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:244-263 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 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/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8c147fe79fe7641ad966c5c972b14a3beede8d2bb9dd0b171eacafda9fda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:99-116 | src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:125-143 \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/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:99\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/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fde0437dd0a26c5da6f1e0b0630202ef6fd5dcf482110ab68d011a25978b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:44-60 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:34-51 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:45-61 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:40-57 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:54-70 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:34-50 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07c8e6542c005ec446c2957c1e070205fd32989e89d6ca6c0c223ebe460094b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213-229 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:261-277 \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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213\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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"915420de6490102ba5c51d747e33583118d6fcfe4b4afbfe878f18eed320fbd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:74-90 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:199-215 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47ec0c191fc41bb5b36ed67ec79bbab52b9c9a548aed4eb36c7ed399de1a95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:65-79 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java:35-51 \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/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:65\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:62\u0060 calls \u0060init\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java:32\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/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd81324a924683bf1c7b061548eb23d56312332c052b1eaebc3e7c14f8c211ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:109-124 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:135-150 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:110-125 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:99-114 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:101-116 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:109\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/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b011955614949c0352e6ece00b78dd292e250724546507be74177608260e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:75-91 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:55-71 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:200-216 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:75\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/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a0f13008db0f42b805e2823b61b208211b18be265a6a2153272604210269bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:141-155 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:205-219 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:253-267 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:141\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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:138\u0060 calls \u0060resizeTable\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:202\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/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2ad9a2fe68c2053fd729176f9bc22f1d43fc33916000f040658ad975191b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:100-112 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:192-206 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:157-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:100\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/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cdbe2b14156bf1dff371f04c1d51a77024370af594bdf36f93bb24d131e7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:205-219 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:235-249 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97b4ba2f1e98cc08975d8ad60ebe870341a7a8bf6be90bbdad364a02ca3c452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:76-89 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:225-238 \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/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:76\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/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2890c15a367404f1460f4d27e800ca20366b0b6d05ab1ea888cfb317b3ecc703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:93-105 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:103-115 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 71 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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:93\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"80214f3027fa8167f8895a78b6623ead7a5b2727499982d8575960b5d87a3d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:112-124 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:92-104 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 72 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/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:112\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c1c7e418c7aa82a02c8db36125f7f4fa46e6938ea1610af078b2b5d55f6c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:60-71 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:184-196 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:60\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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"197cf6f82a3ec1b15b6f6cfd1cbd93db2bfea833233d13866182ae6d888d1435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:259-271 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:227-239 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 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/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe0b37e06fad58ba86078e60c3b77b598191f74d5ea2d1be2aa0f17b9ab2449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/sorting/QuickSelect.java:29-41 | src/main/java/com/williamfiset/algorithms/sorting/QuickSort.java:31-43 \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/williamfiset/algorithms/sorting/QuickSelect.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb02692128ca2c7fa675ab321486a2e1843f9c961a7a5a3287eba3a17b5ce2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:56-67 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:175-186 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:289-300 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:425-436 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:232-243 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:56\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:69\u0060 calls \u0060size\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:302\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/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f221bf5408b45ced008eab93ef6f35c68afe798f12be2bfbf087ee162226e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:88-102 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:66-76 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:70-80 | src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:68-78 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3355f1e245afa654ec8ad109bdd89775bf38bf57d4dc19950d23a85777a0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:456-467 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:474-485 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:492-499 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:456\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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c240480afa53d80b92ca16a60aa7161bdbb136db376e7b6b1ad7dbf7ac0cac1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:264-275 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:264-275 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:232-243 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 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/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:264\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:263\u0060 calls \u0060addEdge\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:261\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/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bef52e5e17a811cc81d21e05f7b4e176a6cf142a29e0a2ad3eaa780b74a6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:81-91 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java:108-119 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java:144-151 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f7b35bdd7539ec402f67ffb44cf16c2304a6beb5dbdb2afb86d9a67476185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201312 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:92-93 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:73-84 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:218-229 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:73\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. 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/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a25a2286a5c995e430c2313509c6133ab9d55b1651716a6784fe1acbab186f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:58-69 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:33-44 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f8585bdc15252ed62eb48e7f38ed292faa074860e753ebe384b97439ce5c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:20-31 | src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:78-89 \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/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f04573a8c7f893e881a5e11d8df56603d202e77fc629290f09e8bf734445fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:144-155 | src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:166-175 \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/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:144\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/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddb0d094d6612b8d43660124cfac1c33691ef1d93932bfa23a92ffe81d517a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:183-194 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:149-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/williamfiset/algorithms/graphtheory/Boruvkas.java:183\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/williamfiset/algorithms/graphtheory/Boruvkas.java"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4159dec6794fc76f76ae3726083a226683b55bf38bf9fb3b11c4c3d03e9eb58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:207-218 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:225-236 \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/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:207\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/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdbc0c462972f4c1e8e030fdb29309cc7ad1832b5d2b7c14f8bd4fa38035fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:144-155 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:168-179 \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/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.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/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cea7ff031bf2bfc4acc1ac89f25be1f26ff7f1b36696b2c97a5d47669ebdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:151-159 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:241-250 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:259-269 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:271\u0060 calls \u0060getGraph\u0060, \u0060toString\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:160\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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e4855dd8d26dcd9f7258695fef63b42ae1d4627600738b2dc22588559f7a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:87-97 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:146-155 \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/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e257967fec344e2f2ad72bb63a2876db84d3c1482c1f1690c2e706c178b922b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:313-322 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:320-329 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:230-238 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:262-271 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:312-320 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:339-347 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:313\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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd35fa9660ec2afbc417e441898947bb8bae71fa1d9e043fafde326b7113f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:124-132 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:244-252 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:338-347 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:493-501 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:300-308 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:124\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/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"566d4c65e6a622f9cbb80a00eee865bdb5cac0f13e3726d54a3d1ae3e8981fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:90-99 | src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca92f719b748154b8f7ccd474aa419630bd030cb38e51e36960a63ca42c3132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:157-166 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:294-303 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aeec8fb91783540d04fe624bc90db626be4f75d7c4141d51acddd16af1bfc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:90-98 | src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:113-122 \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/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3399a2366649096e183fc1e939543282cd4c24c061ddf637168d4cb35102bb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:232-241 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:107-116 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eb24d7efe629b2373ab315d63586853b45547e316a55da9bfc05dbc6586b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 8): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:133-140 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:135-142 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:131-138 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:148-156 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:169-177 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:188-195 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:208-215 | src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java:124-131 \u2014 there are 8 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 8 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:123\u0060 calls \u0060example1\u0060, \u0060exampleFromCp4\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:134\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/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ce84cb38bc65bd5411eff6f243d17c1d30ca3d9509316899db2c28385b4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:149-156 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:160-168 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:258-265 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:239-246 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:257-264 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:226-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:265\u0060 calls \u0060addEdge\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:269\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/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9447d25616cd7aabc05760ecbdf7398bf729703360eef73dc5b2e67a54ac84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:137-145 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:158-166 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:175-183 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:197-205 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:218-231 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:137\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:134\u0060 calls \u0060addEdge\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:170\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/williamfiset/algorithms/graphtheory/Kosaraju.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4465716eb103e3421fc771337b5baca07e3549af5b4f5770d54f40a701e124fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:132-140 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:124-132 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d46e307372ba800088890fc04594f667554e68dc8bfbf4378162b3c6fa01ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:326-331 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:173-181 \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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:326\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa26c32d093a4937208b12e1b9c0843f780f0aa7b8b79532bfeca05c828e885c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:144-152 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150\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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b248824137a7855756a833a500c292dc57fa427dc83992e4981dfd77e4eebc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java:43-51 | src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:10-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/williamfiset/algorithms/dp/EditDistanceRecursive.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d8b120114f64487c36c887e654c59c713a6858b9fd6e672a03d852b5eff848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:88-96 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:130-138 \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/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"873f4aabcba5b1108ab86fe8fbd1004f66b03b221734cfae2bec2836bc80fc1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:176-184 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:33-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9347937ad6ab16a6db722aa4c9eea985ec0d1aec70b4ea27a033aab231536cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:246-254 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:168-176 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060solver\u0060 to \u0060EagerPrimsAdjacencyList\u0060 in one and \u0060LazyPrimsAdjacencyList\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/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aad390ab9a9c2a124bce3bb8795a6cfb8e2bbab9084e3885a9bbba43e26972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:40-48 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:166-174 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2796e24c1e70347087ea6e4cd11da9bdd8a83c0ac002b06e314b1b3be88d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:75-83 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:114-121 \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/williamfiset/algorithms/strings/RabinKarp.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b371eaa0cb90cbea3af3acfb9475ca4dfdbf1f63b70247659c8864a2a61af47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:386-393 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:171-178 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:253-260 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:170-177 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:171-178 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:177-184 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:159-166 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"705fc683989ede49724f0666b0821cc1e67cd998ae2a24ad944ec75831a63cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 7): src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:528-533 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:145-151 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:173-179 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:195-201 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:230-237 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:128-134 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:30-36 \u2014 there are 7 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:180\u0060 calls \u0060addUndirectedEdge\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:534\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/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a74db7a5c506ebc9b616f8ef455d6f935f538397322ec4a21492151ef28a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:137-144 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:147-154 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:253-260 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:228-235 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:245-252 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:214-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab47e7863facaa3d72de83237b015c08d75fb2b8b76670d85695be6369b075c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:162-169 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:184-191 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:206-213 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:235-243 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:162\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/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa277a366948069f38635287eeca10c5cb89936855ca9454a4735442db09e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:188-195 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:294-301 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:153-160 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:188\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/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7fcd3a7d03f95f28bd06a364367aa300a18c34c63b36e7e837e3b589d4dd07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:143-150 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:144-151 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:143\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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3cb80b1e4b7408f5c0d6123153d77c448ea2ee2841642ad32d991b680051d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:64-71 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:74-81 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 71 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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:64\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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e090c79567d6a262830e72db99d228356408710d74188f2996ffdc7a6c5c3bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:83-90 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:63-70 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 72 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/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:83\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/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f924ae8b0acf66f68e33972e6443d3f9444bdffd147b29a5c045d835b47eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:165-172 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:235-242 \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/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:165\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/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0231a72da1220b45ed25b14846bb06f55122c7603a8f340c8d768168987b0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:103-110 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:89-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb26e6ed30283cdf137ba79876a8c8590694d06cba7b26b53d4774b73f9508ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:197-204 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:221-228 \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/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"973e79f7c4551252850004dbcf7d14fc4df6086224cd819e593ec43ebef971a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:93-99 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:103-110 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/linearalgebra/GaussianElimination.java:93\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/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"399edc7eb724c17e61083b5053079df2dd3ebb0474ab3ad4043a14d42c4865cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100-107 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:109-116 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:117-123 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5539bc08a8f765e2b57515d41d80c19921f1806dd8b48efa44f27b59a390f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:300-306 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:71-77 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:62-68 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:72-78 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:122-128 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:68-74 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:81-87 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:61-67 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f6b880690fa38e82d13a938a912af18f115def78305bb9f8f9ca7f34ea66db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:106-112 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:119-125 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:108-114 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:118-124 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:117-123 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:182-188 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 4 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/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:106\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/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d49be6914388a7ee578eb82e156de130189651a80af8dbe933c015a82453e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151-157 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:152-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:158-164 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:140-146 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 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/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151\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/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fba2cc9b1815698f1f405771a67d7e109e58d0dfea2cce0b9da3818267d05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:246-252 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:615-621 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:422-428 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b1d263fb52b8cdb3c4e5dd7ea3182ed605215a761aa1c9bb8ff2c66a1352bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:149-155 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:219-225 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:356-362 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30078d100ec52a97bdaf65faa18eaec1ecd3e1bbf9f461ac1fa302629d24f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:108-114 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:123-129 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:133-139 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:108\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/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a94805c96a04a05a2b073acbe36d69d6599928fa6155dcd5c4954d2ba25fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:128-135 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:137-144 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:146-152 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:153-158 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03189eecf42f83c31bb6a231dde5ee8dc2c7a428b88da62fe802936cf1e8057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:135-141 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:243-249 \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/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"810267eae474d98ab33a1497a20bbaaa32e40b3d66fe79a8c998e69fcc3a5de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:153-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:147-152 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:152-157 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:153-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:159-164 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:141-146 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:153\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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddcd294786cd72e2805ebf52880348871ecc7d7b1d9771e1278e67af2a2aaf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:144-149 | src/main/java/com/williamfiset/algorithms/math/ExtendedEuclideanAlgorithm.java:22-27 | src/main/java/com/williamfiset/algorithms/math/ModPow.java:58-63 | src/main/java/com/williamfiset/algorithms/math/ModularInverse.java:37-42 \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 4 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java:144\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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b754aeccf2dca7932a57377da4412bd4f40c674664b087d741ccac7b1a0689a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:97-101 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:77-82 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:222-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:77\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/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0729d11ac4ca3841c2216553aa93abb1d9f373d33ec8b42bce3170387b560130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java:49-54 | src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:45-52 | src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:91-96 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java:49\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/williamfiset/algorithms/dp/KnapsackUnbounded.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"034591a950bef3b7c23d45b548b1b874fbeb53b2330b81c17ed3a5d28fb08910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:76-81 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:104-109 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:117-122 \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/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e413254c5b44dba2f3ea533e8c8d7c59ada4564d41843da72372370ab8caa8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:90-96 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:107-112 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:122-127 \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/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"61433cf5046c6c78642fe823990dcaedf22317e7588b82f61c28d6f520f71f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235-240 | src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:298-303 \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/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235\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/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b857ce0468a27eca4c515fab98f66b8fe12e511d877c897b0bd6042d8ec05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:428-435 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:442-449 \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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:428\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/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"631e7ead89339dd979d7535e24c53077ce8ffff793335babe8393c94b98347e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92-97 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:132-137 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:172-174 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 4 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92\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/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:91\u0060 calls \u0060buildLcpArray\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:131\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/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5986db77d8b64d5b3c33667e94f60c2d6dec7ecce87c50cc353cc33095459cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227-232 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:143-149 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227\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/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ec9ad0389db9e6936c52d159c6f0ade3a079ff5c96dc7763fb94f3d7eccf5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:157-162 | src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:170-175 | src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:178-181 \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/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:163\u0060 calls \u0060ok\u0060, \u0060f\u0060 and \u0060src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:176\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/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3242bc6a953a75e58ec9177c1eda61c31401dc1de6d131754717ef821a83dac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:191-196 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:131-136 \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/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bf04ec0217d0e233b1cd29e63f693758a5047c8f3d0f75c92704de0f3729e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:80-85 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:89-95 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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/williamfiset/algorithms/linearalgebra/GaussianElimination.java:80\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/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c12736a5cc9b599ed3a2cc55ca22dcb17961f30b3e27888151f76296d7067a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:45-50 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:54-59 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:51-56 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:53-58 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:52-57 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:117-122 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java\u0060 as WHOLE FILES: this scan already matched 4 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. 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/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e939de82f1b8e430e80a4b764f4e80032c80afedf08da0fe70d12e4de4320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:153-157 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:158-162 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 71 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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a459be207c1f743f44156a18aab699283661982e996ac3953663572858b70ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:165-169 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:147-151 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 72 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/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:165\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/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"085f5a48857389fdbaae658fa28c8b6a324f71d391ac5b4dcf91bc58800e7b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:63-67 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:104-108 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 4 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"304e15a0b965b4a935d6b966b1323aa805aab92e3a21a25fb8538c6dab37ce87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:81-87 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:122-128 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 4 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:81\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:91\u0060 calls \u0060buildLcpArray\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:132\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/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4146f2f986f01e63ad6d09b83673a1e9b77802eedd84e9056d743d6e0ae4005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:65-69 | src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:75-79 \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/williamfiset/algorithms/geometry/ConvexPolygonArea.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740b623f211fc33873fa7e0fd7c33f9bb5bc10f741818f642b7f1f80b81f901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:40-44 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:119-125 \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/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceef0f3f0ce987f24be935f06e1f56c02b36010471b19203c1a7145c3aad807e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:35-39 | src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:82-86 \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/williamfiset/algorithms/linearalgebra/MatrixInverse.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"78815db27374cba2bf656849e6d81b97ee539fbfad104673f5be6d3347ff1f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:35-39 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:67-71 \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/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:35\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/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2323a8190850fad915c28c8162d0df35db8a73dccfec07e830022c5e63ec0d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:14-19 | src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java:12-17 \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/williamfiset/algorithms/sorting/BucketSort.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae69b6db686238cf7e21d09594c9e6917c1b58e90c30200bd0aa0a811557fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:88-94 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:92-98 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:88\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/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d99d8e85ebc3cc4dc6d33b8a9d5e4792abd6bf2d867c8110ea19aff8db79d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:97-103 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:125-131 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd619e953af80a9ea7a986bba800a59a30033f6277ad7814be6f510c375351a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:191-198 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:184-191 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e34c62c081cabca05eb9dd4fdc98fb412f093938a1b738813b2529c3eb15c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:200-207 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:193-200 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d054184431966f8edb9e3a3af7ad63f11a4e78cc6dec9aaa853af864361d441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:210-220 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/TreapTree.java:144-152 \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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3778378f7e9df936581b72aaffc13788d8fefc5a7eacfd3218f19fb1cbf3d67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:109-113 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:120-125 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:113\u0060 calls \u0060mapAdd\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:103\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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"834cea4ab2d3c6122de9c2ec3084412232b1d0708b1e8c64b0c07bb45ef17a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:116-130 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:128-144 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 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/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad62821cdc9a700ef3b8a230dbd95ea0c8738cc9da9cc44ee40d8362ae0ea9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinDHeap.java:70-76 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:165-171 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:285-291 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:349-355 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:534-540 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:341-347 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinDHeap.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4984cea07674cfb737143a53f8497142313aa15d99dee6f98af7e39e49e69689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinDHeap.java:78-83 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:173-178 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:293-298 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:357-362 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:542-547 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:349-354 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinDHeap.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2200b54c53e8f02b22d162551da71fd232ea8cfa01c8479ef36fa5ea726f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:105-112 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:224-232 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:474-481 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:281-288 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7df4c170f005793d821e35a985fb4157ba641d8a27a29f045248a0e810c349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:135-143 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:255-263 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:504-512 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:311-319 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"56065bbbe4649a43477acb68e89d2023fcedbb15c58a4fc29cd59facf8602ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:146-152 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:266-272 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:515-521 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:322-328 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"348aabbdbfe3adee115f5db076ea17d0e0f4ccdab7817fa3c8006a818f2cf16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:155-161 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:275-281 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:524-530 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:331-337 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d385a0b5d854c41043a8e7caee7a58404d692b6f510e54cc2c810f3ad55e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:181-185 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:301-307 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:550-554 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:357-361 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dccaf52d796ee91099e40a7c566f53a08fa49d3e3f3b9a4e7dedccadf39ad40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:187-193 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:309-315 | src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:377-383 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:556-562 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:363-369 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf49014175957fec9270fc3342a81550ae2a3b00f95e8c2acddbc6614cc10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:207-211 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:329-334 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:576-580 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:383-387 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f5d616c8ae91107189aeee3cd64ddc5f46c08b3757784d079ebb2d4a91076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:122-128 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:123-129 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:112-117 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c786c8cb78d8055a631862344a720422478818c8b3f2579b2ebcec75cb41e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:130-140 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:131-141 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 65 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/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d5253518733b91540ea42aa38ccd1a7a0c629c890c6b80f91e2c224ff21d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:26-31 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:27-32 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 71 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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ead75495d8b514cafa85cc236cd8c1a4cf972a9fc19c5272521d0daf78d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:118-123 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:126-131 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 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/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"989763396e2f078c8e554da839afbe783ff89baf6446d2266bfd1b797ab86c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:25-29 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:66-70 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 4 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d97bbebdd68229b5f46f886da0524babe19c84ead62d388c89c47883397409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:28-32 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:222-226 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ce40a20d08c577904b5307085266532c1fdd077463985636c9a585c78abea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/utils/TestUtils.java:17-22 | src/main/java/com/williamfiset/algorithms/utils/TestUtils.java:33-38 \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/williamfiset/algorithms/datastructures/utils/TestUtils.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c279478ed5b0325de782ddafd95dc1831547d90b90edf6db5b588a752502be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:57-65 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:194-202 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa41a3f613e1799ddfd4c4ce6e2b026f4dc7a129b79ab012cfc3c3a52ae4639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:89-95 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:226-232 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ff6d2d3de6845ce5d5c5a107a9cd8f6e8cc54b43f68f796c771923760d8401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:53-70 | src/main/java/com/williamfiset/algorithms/geometry/TriangleArea.java:30-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/williamfiset/algorithms/geometry/CircularSegmentArea.java:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/williamfiset/algorithms/geometry/CircularSegmentArea.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"120f6954dd6886c7ae285488674ac2f3ee3cb1a27f41c9b76d2faff4a49efae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:103-107 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:111-115 | src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java:111-116 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:85-89 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:165-169 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:101-105 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:58-62 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:109-113 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:180-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 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 9 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:111\u0060 calls \u0060get\u0060, \u0060add\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:120\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/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b636c57203c2d1ddd46cc505291d84ec97fcdac20bfd7305c0508f2867f67066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:164-172 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:129-137 \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/williamfiset/algorithms/graphtheory/Boruvkas.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a3010ef506b8a7562f4f2276867d55c36c150ceb55945d193202e11287c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:174-179 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:139-144 \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/williamfiset/algorithms/graphtheory/Boruvkas.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"428eecbe9ecb69673c7c25b1402ead88fc4920078554d828220404da906c5ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:110-116 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:124-130 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:110-116 | src/main/java/com/williamfiset/algorithms/graphtheory/DepthFirstSearchAdjacencyListRecursive.java:63-69 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:170-176 \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. 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/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1083466e8e7746292532d4efcad203e05731d7635cc6e9fa0010d8d200372ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:30-36 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:28-34 \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/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"34817d5bf25aa56c12099e4720e40c3124674070c7a286db02658ca57bd42828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:59-64 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:45-50 \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/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd4a918cc1f5adbd95ec9d77a395a5d9ac94ca29684f297b5646129e8f063d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:53-58 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:51-56 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:136-140 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:118-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde5f2988c4e41b2323a4f18fb4373021035ce94176d1895c128339709c53d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:115-120 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:104-109 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:211-215 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:70-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e656cf8beab36d5bc0fe83d6dd56282744b10004de3136f5406bd81bc54d7ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:95-101 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:94-100 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:93-99 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:158-164 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 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/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"567d8b30682eb8839cd170528e1081af39f3e08e20b408b7ca824e8225602371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:169-175 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:234-240 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 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/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08fed563aeed45c83e459a014a6ce96209063df61d5151cac35d6453b894ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:20-25 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:73-79 \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/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4811b9d3bb7d6c8ab098fb80c448079cc4d8a3ef60f84bdcfae25f9e643c7a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:151-157 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:23-30 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edaad9159a20ee0bbac94cbb865598f708365ba285d7bfe4bd5ebfe5c9d4123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:159-169 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:32-42 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff6b6dbc91464258f31d8fc8e481a2e09191ded1616821b41c66891f492ca94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:243-248 | src/main/java/com/williamfiset/algorithms/math/ModPow.java:70-75 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:119-124 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3d0db9cd700a159bfc9b034fcc413d332911385fe4398e8cda0cb2d88789c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/other/SlidingWindowMaximum.java:42-50 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:524-531 \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/williamfiset/algorithms/other/SlidingWindowMaximum.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a4d773872c9d45e4cd315338df8cd69c27333608fd1c99af04980e6f4e161f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:36-40 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:40-44 | src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:39-43 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111718bb30821047a914d32883f20be4875e32b8e03ac65e82f436e7fbb775f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:43-52 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:47-56 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4cd381977c72631433c013340ceb08a7e40eeec037b44aba06e18979d792cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/utils/TestUtils.java:9-13 | src/main/java/com/williamfiset/algorithms/utils/TestUtils.java:25-29 \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/williamfiset/algorithms/datastructures/utils/TestUtils.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c3feaad6e60c3ebce7b931e7243a068a2a0188367b34e38e755f93a24af39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/sorting/InsertionSort.java:37-44 | src/main/java/com/williamfiset/algorithms/sorting/SelectionSort.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/williamfiset/algorithms/sorting/InsertionSort.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59bbb4e6edaca5d4d2b943de7681c7b614e09386ab2e03a03921a53c0c3943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/sorting/QuickSort.java:52-59 | src/main/java/com/williamfiset/algorithms/sorting/QuickSort3.java:81-88 | src/main/java/com/williamfiset/algorithms/sorting/ShellSort.java:53-60 \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/williamfiset/algorithms/sorting/QuickSort.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15f4be0d468ddaf37a8af94f40b0bbd619729f16fcc2fc26f5bf5a9759eedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:355-359 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:357-361 \u2014 before extracting anything, compare \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java\u0060 and \u0060src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 123 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/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9de2e8d8940eed90a3cb5656c9008d07274b5f10965c4769e7c51b67ed5524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:124-128 | src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:132-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/williamfiset/algorithms/datastructures/queue/IntQueue.java:124\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/williamfiset/algorithms/datastructures/queue/IntQueue.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a09e84fce25ce66489f52988bfd759b3f254048c86b06eb71d633299dd5c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java:95-99 | src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java:102-106 | src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java:109-113 \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/williamfiset/algorithms/datastructures/stack/IntStack.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9899e5d1c7289f06c2baeffeab05701bd1b4aff175c3d3d5dfa88d0499c8a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:219-225 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:228-234 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:237-243 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:246-252 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eb45aeb60f4b30839587df6486ebb8a57d1834b47fc6b7e8e0218f1995f668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java:57-62 | src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java:64-69 \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/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java:57\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/williamfiset/algorithms/geometry/ConvexPolygonContainsPoint.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a1e42d05c7e3074c15e5ccef84faf3b7dc9cff2d5d0b599bcd6b651726f37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:87-91 | src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:94-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. 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/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"585588fecdc3601dc67e42351edc65f9029af7393cc8183addb2829b7ccb52dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:129-134 | src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:154-159 \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/williamfiset/algorithms/graphtheory/SteinerTree.java:129\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/williamfiset/algorithms/graphtheory/SteinerTree.java:160\u0060 calls \u0060minLengthSteinerTree\u0060 and \u0060src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:135\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/williamfiset/algorithms/graphtheory/SteinerTree.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4f31d74cf8db6afb66acd0dc37dca4c8f25649939c1de3232c9a25a21171fd"}},{"ruleId":"D5","level":"error","message":{"text":"Circular dependency: //src/main/java/com/williamfiset/algorithms/datastructures/sparsetable:sparsetable \u2192 //src/main/java/com/williamfiset/algorithms/datastructures/sparsetable:sparsetable"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1299da550bfa96bf56ad3c6284c4087cd89d6204038c71b951c118680b0bb9c6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenericSegmentTree (LCOM4 6): GenericSegmentTree\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"91726af7edfb244055e34a19d7b75cd40e6b1cc910b8b7fd45bbbe73a9520104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Add a test that compares this implementation of Boyermoore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/williamfiset/algorithms/strings/BoyerMooreStringSearchTest.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"af58b1043041b3ad3282b1fcb8b32a796b5269872ba6cfa5fffff94f4e7d9dcd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): crank up the numbers once implementation is faster. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/williamfiset/algorithms/strings/LongestCommonSubstringTest.java"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb729e3216a736a05ce4752341676d21d013c7391756cf3c946c0d78d5a1d74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): also verify the parent pointers are pointing at the correct nodes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTreeTest.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4363a54cec10e1cc14c1a16db8d288d85d0f4f338cb93cfd8c1144b554338bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(issue/67): Fix Bellman Ford mincost maxflow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowTests.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d5defca9be713bb508e05e665f9480e14a31f5b1623db358647961ec42810"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): support LCS with strings as int arrays for larger alphabet sizes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"603991f55922b08e6b4032dbcf0c6a77eb66a6bc167030befd7a0ca7e12a11eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): Avoid initializing a new hash set to count colors every method call. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b3b2850134f1b6a1ea04a0d338eafcec034a25f81799ccf3e46e3286ab0eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): Investigate if == can become \u003E= \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"751cbaffcca12c98a4dd8ca369529a32c0f463dee4e36b91cdfd3dca606ebdc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): Replace with SlidingWindowMinimum for speed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e9be327f47872842dcb875391c8f02c753fbaee9820834e480dc6a07836fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): refactor for better support of custom functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/search/TernarySearchDiscrete.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cea8677cea21b18166a52f5306979c7864a91a2002603b0339e0f1900698cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Make a copy of this graph. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5f4acfbe7386ac6b8cfb6189e380c620f1bf82c05102019679822b722b7333"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): check if graph has an Eulerian path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9942caa78d18e886cb1d3545b9e5c0ba3a51ff513de1209bad969de93ed74f94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): implement tests for this modified Eulerian path algo. It should be able to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9fe9b2daaafe9e71df8520194b0678515c9d11c311e019a4baf8a614d6e2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): handle the case where \u00600\u0060 starts on an island \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathUndirectedEdgesAdjacencyList.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae9c61e78df4c410a471cff094e3ef3393784b79f76b58ca93f0c01949bbf76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): Compute mincut. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e793edf5d2c42c65061a056cb2eb707f64110e8b9c6dbea590f291a889d59a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Define whether we\u0027re transforming a into b, or b into b. That should matter, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f638df7db188c12b29d8cc3c24f788b195430a6ccdc6ad01329498fea59895"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Lazily call init in query methods instead of initializing in constructor? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961e40841e1f8cbe6ffd9508d49c18b281cb22306094d27e7aaaa5b1a677d00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ac4db1dec8b6c5a02e1714f492b6394119be25cb590184bf5fd4bc1ce6fb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f935ff11bcacfad0966cf8bcfa97c7bcfef1213b35aee8caf0062ef11448ab3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc52f6f823781766c7a555617e0311eae81e9b25362ec39e795f94fe1da052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"346d2e017a602499fa99ed9802c5c7ba9a35be2921f30783d1eba6513d6c4dad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0c764e0c96cf29f66b2372db82fa34d40a96b7b4ba6c3474266a05b785b3d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b39462a77392c964eab6d440f11dd275fa1614cb487f80f30b5e8f370e9fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): Investigate to reduce this space. There are only 2n-1 segments, so we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a72f210f7160e4aba95f291d7acc58a3b77ddff8da194dcd3c13777f01b556d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): should this also used the minSegmentUpdateFn \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"866db2a7d240a494ead5ac10ede0d55d802ca4744b4e7e8a58e2ba38854f6e3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): should this also used the minSegmentUpdateFn \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d55964b000532e58c9888e5f97203b7c0509eaf981dbd433bb5d74271ef5d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): confirm if this is needed if we already propagated? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c1f67bb0f3dcec439daca9093550ea3db5cfb82ad28ff5fb7c6ccddf8ef236"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): confirm if this is needed if we already propagated? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f960b42c098a5e3444b9f7e95b9459d6bdd16840a7ab75b98690cbc1a1729a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): cleanup this function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3b354711753bbd945a614eabaf677883db58c57f5006802375ffa8f4237a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(william): cleanup this function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2480863d57212d578869f7d13bcdee4c7cd490ab1e88ad5242c248676b35793"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(williamfiset): Refactor. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf86e725b7ab1f8d6df9aad0d496311401ed0c0b50d4f11c576a678bf185799"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Finds the intersection(s) of a line segment and a circle\u0022 repeats the code it sits on: 4 of its 5 words (intersection, line, segment, circle) are already in \u0060function lineSegmentCircleIntersection(segment, circle)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/LineSegmentCircleIntersection.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868052482956c8cf4e0760ab8c8e323a488be6365d5a6e0dbe4b0a3f7d348e5"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"85596d040b50e8d06ccf83dadb684cc46fea9d38409df08516cf63f9eb339c7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f923a2b5f43aeb68e93ea135e10f341a1f16a576964ef4bb105818c43b74f48f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f42b162ee7964460020b6a262577deccd3e053cd5bdbefd9a2d257273d10ac2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd1c13a997c9b678feec05d62278b87b47e3b2537c824694ea187d4497deb30b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d2207e13abde49e236850aec18f087fa80cca4a18e46c9d891048a6bf624d70"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"d58c2af3ca81d908aec925c080f37dcd57652f84910d43db16adfd279dc9bcab"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 116 of 145 significant files have no living knowledge, while the repository is still being changed at a low rate (1 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 116 separate risks. Counted over 145 of the 226 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":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"931228aaa4095cdae5522750862eb03930c16e0f9dd1240c36c51136a028cd76"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a03b95101bc5ca742cc2c1eaeeba015268a7f4945e972e95a89fc4c71243e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfe87e828566f0c911d578c9891183a7dab3a66f91c081e454763df16bc3c08"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95923253710968b838246bd366413b4e9b115041a94901fbe0f7c63d1c0d5e64"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0e9dcd9114b3d3d70447be662ed8f57ef0c30de295ef238aba09fe8fed971c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9372b0ccbbfe5d1b01110bc0bee00a2589c06e1d1eb4d2e9bd90bfb6083b9c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bed7ff6841ed1af6372102e18d31676593254015f5384763c4dfbbc1bac0e83"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ef85851f065babb709fc97689c7c70e3e794fdd75ca0470218eb85703941f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff181966cff776b8c791e6b4db11b10d1eabe91a4edc2bf9dfd1290fc48884"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa2d6c59f5f9e961e6215055326e711f21cf53a01fd17d10d679fedb5ecdb40"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf4e079a5069aa204c4154271dece5c7a5057522d6b1b9e30ebb8e271d3680"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1a9eff07826b07213ba0f0dd545d94bbf50218f3532846bedffb6cf727288"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a7041fd3e547c5969cdb65780df308b959e8ff182e3ce1e8ba61c9a6efa943"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/SplayTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac649adcbbf062bf96a4de034ae9cd25e40c86504c81e83166e6c2110a0382"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6176832c8c7775541b9173c95b8f960d3c917d362b1827928aa4b4b0dc287d0e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/AStar_GridHeuristic.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176e3d35b48e4ee8b59d7df61379f2491ca64846d496907cee10b29ebc01c849"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b980567a8d8a264f332a9de380e91afd5e104b76b54cc611580e6db4fc94f57"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb8725cc5356dea09875227af9868892c367ed6d38d7f8dbb0ff6f6059ac270"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a216fc4f1a4be1f59982169a7fe889e31f516a35f671092a16a7e16e2a96ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f80c125a95677269820cc9819f9b561f5dbcd5fe4dcda78a3272c4af626190"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b7470c6d80469162dca4f81cd8d3c03d79db773521ac09b753d7f02a740eff"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aef23b86242ff9bd363fd180bb87126bd84a35552eb7b5bc99b0583ac1f16f1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64243ae24ad1b7de29b3f044885de7c3b8b97a0fc0a83ce3b423b85bcc695276"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/StringSet.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7624b1ec1bffbf3cc2ddb2c51422f14a916a30c17e74598c99389d47f858a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df2706ec7cc41cfb6edb75321e143e53284d253734c7a20925fa3dbdf7eca75"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3190ad950917a224984d9aacc8933ba5ea7ed543f6071c87bc93c041a168c01"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/kdtree/GeneralKDTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8e3b9f2405e8ac651c8adee831491ca3766d294152cecbd4e99d1290b035c4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ddf4693f72d84ca322ed965abbff2023397093ef4777cc0b1e036141a92784"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1a7656cdc6f3fdc49e367907bdf3cc5b75ae72bf0ed4c7c9bc2cf721bc7945"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac24878e9e83f8cbe0e52d362639655c23ccbb935a64209424565e2f8bf2df4f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"facdb1b75d954a522167cf6b0882237f808763afb77a1e214af1b477453c8062"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/linkedlist/DoublyLinkedList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caf8b5582c11b82d6942a9fb6dde12d62b2085c49a803b0f6279319eb1b192a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29451208cc263cf35ad00a38722b122a3e2094bedd978ba082398856f3bdc5cc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71311533fe9ad2910d5442e307a04d4266721909da8efdd402b92200772520"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/skiplist/SkipList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd95d2c829d037dda26663302ea28cee880cbb3ac2c21caaf3e0e2e577485d5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620e8ba0b48c3a48a76e009f2d4d9027a12159baf7d7902db28b088960c1c9c1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05093ca3ca48115f1acd34269462c4d58ce48db94ca032d9c01c0a0f63d2fa5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e2a16ac50cc20e693cb4eaf5af80d8d020c5841b1be0f01abf0f918d00d772"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"681e79751f545c2801d98a8bd613a671a9f8c458a8cbf0ce7c096f987713d3bb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176e6b3d35056f6023140bc2504ee22e2154227122b7ff462b290a3da3cfe117"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89336940ea001845f8d02111d5f6213cf995ef1df2549303aeb711d3b6bb07d1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77ef8b53e3e255a991613f227eaf1868769676d803cc24174b14fbe8809deab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c31f3b683e16a47883fbc535abebbf4133b802ae78c75c741b1208353907e50"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41303c8bcca4d28fdd147429c1168421516895c5895a62534cb4c1be0ffa28ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53006096c9252a835b1caa5dc9c918b2cc344763fa79be705ce1d089c5610267"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9979ce8d0d3b9122ff200dfeca1de9736267df0acf77eb332cf66d0a1221e5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93ff210239db363b114d66e935f4f64f834e0bfef4379b2dc3e483046bc987c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingRecursive.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5987d6e639e81c7f9ae3500521be5f90302ab0df66888d6914a3c0f4c2ec7f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6635b0d6ae40f7fb33a914dbc871c01c2c7b53f96c0909fd14de1f650e330"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb7b0f9f85d6b9735be28056a8ec4de80b12a5723d7ce9bf2f54b324a0f906b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ba13a5ba3c465803659b0bf36f0424f4f699561238e0ab70da90b30f5a44ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ac67677f43db508fe89b82700d13e238a85f55931f8e81119790ebe6d783b5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/other/Permutations.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"264a48b99640d9d0e9834485f61183af1c48c98f37b4ccd3443b10127e0ee580"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/CompactSegmentTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af611d3bf3c4753f01e1ba592e6ec36fd6be79d6e4b252f730e3428ac107a863"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"665dbe611079d1460d99f4db160951543870b69ac37a1df9e6b278ef280d323c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cf01e4116e3d8e6f16c3d7503aab4cab544e56769abd0232989d541c72c4a6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb79b447ae025888e63606e6aa98b80c97fc28ae649fcd31a871e457a031f01d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab723e6f5eb52ddd2004341ec46b67f71836e5d633e6ea21b0c1728912bbf0f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50ddd9d3d6867ec99ef6a3a5e78dc2905025f0c7e55aa3c75501878217ef378"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/dynamicarray/IntArray.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4ba3d933d266f502631a28d878ecbfcecc1f5ccf0804946cd98ce94cacf5d1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841ddb3881f7297a127a9c58ed01a684f3d88e5cdf50aea25f4c277791d0833"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e465d4b11b8f4f4aec2011620e0fee5493b2c4e5e0b3c13316d379fef354760"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2120ec8b7eff87a8f49a876ad74449f371bd74dfce1fa20ded703c6048c948"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonCutWithLineSegment.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e912053080a58ed6917d4c7cddf9083cc6f8bef28fdb2ecf9eb7e7911ed6a4a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98693893d2a8a51d4b79a29bc4355079099cebf179f86ff82184c4b42b189377"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/AnagramSet.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682240f2fbb16f2901682a17d05fa6c46c8dad877811e7bc8849505662de33a3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9897b82eb0564a14f2a64e720e295170391f4fdc82a4e0902fa9faf0ab034705"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a72575e80d81be40f43393b83021d8a56d1172238d44e4e8e55edc2ff06216"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathUndirectedEdgesAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1927a2839013a2327dfe7a80e5408640903e61a49bdf24c4f1b9fd1526aa012e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"370bb72314ed9336cab2a73b7f3c4cf87ad2f7479a29cca56233de1dccad91be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c377a0691d4f69313633480fa8c6764f835d38c47b593c326718b9d50399b08"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9561cb544ed4474e47747c81fe0f39ceab59574c15ed49161f266975a42e38"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec25c39bc645520d32521dffb47bd55f6ab3e562ec66e9723ca944228cf5429"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"875b1db007e8c8361e855abfd119467c73ec264d9198f9862d30eb09dc41245b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/math/FastFourierTransform.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a50c5874e48e7ef4fe9b947325d40ba7ddc1e5d2b97d934fa019f1d804a723c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704f29a479300513fdc2f80d8e8a049707998cb59cc6145cd007f617391c2002"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d390fd9e749752ff57a67fd3c153d8da9ca8f657c57065bcef1865473f8fc9f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/other/Combinations.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9d0ab7789ac00196cbb167877c9f4220237c1b5340157ec8aac61051f81a46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dea0f8efe7c381a04496d8be4b7aba6426bb9c1eac2a99ec6644fd17dcdde6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ConvexHullGrahamScan.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6626e292e205ce6940fcab5357b7ef076f3e7e1b37beddf53684b4383a6957eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/PointInsideTriangle.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4296c120eb6f8f3aa2892147e50c0536a3eb1fabfda90817578a631bc73c0fee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ConvexHullMonotoneChainsAlgorithm.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab57d792153a9d8b9d0457337dc5c1ca1f3c6d2e6a42ba509c9dcec927b2a6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4262264068fda1c52239a5a97e3d3c59c91bcc210395a316f8356beec69caf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ClosestPairOfPoints.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25de81606d87cd0e2352dd8f34796872b165bcbc3d5abb6bb11c2916d0621ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/EditDistanceIterative.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e84061a3f9a2817cf759ffa3a708f202f1ff0e4d53bb5813d80e9d14fe88d33"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1c8007d1e78fe44150567e37dfe77f9b9b0020ac9f632b1dfb17022310b9ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TwoSatSolverAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a45859c92bb45e160a9b28d87f1374df96dd9b3a88cfbb0bcfd9ec43ad8d0c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/CollinearPoints.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"191463c0797a96a916a722bf2de43bb3a24365eebdaafcc6be1b783942024138"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79f164d28e47a0096febd9dde4528c129141789e60755ab4bfee7c5209da1e4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/TspBruteForce.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf36b37d534e09a23f5d353e7030b977c9dcbc6d89f0f2db164890e0f861e83"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c33df8b34578a996fed06a8c738728a6c79f36fa7e21343d1b6a512d44f7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/Line.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e29c3dd76fbda8a3b6b071f24f05afb0f696826966b9443e90fe2d0d72ffee9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86af370bf95a78aeb4ba17f3e2e38a8c68ff8bcf6f69f858a529b24c42eba31b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/ManachersAlgorithm.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf570d63c3873fef1d7fbf1f7a80b4e8bf02df18ff350a1c1762538453e80e28"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MaximumCardinalityBipartiteMatchingAugmentingPathAdjacencyList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab1cd46afa42ac386fc2487bae2ecebce4ff0475f31755e7daa90b4b3d9ef2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcc9b5ec06742c67afeb3167c6d3259a4b5545ffb7c5b245e4ea9c3262427a8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"073fdf870c6ee129c78a9266182a82b57348e4895e3792c41e5b87ab18f4fd21"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/LongestCommonSubsequence.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69232e75c9ce7a1d91f87be081257ca89334cbfcf900aeae533c69de15635284"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/LongestPalindromeSubsequence.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903cf0e3a33b3929a048e37cdfc89bef3e1735c7aa8ed05f3b006ac8dd7a2163"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/LineCircleIntersection.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c08003b4aac6b3073fb39dfc7066301fa0ddfcf1d1e214ddf8117ec4b30045"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/search/BinarySearch.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a5a1de0a789a376ca927cf14463f6131363f9a72ed564fec488272cdf825e5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeQueryPointUpdate.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f3348de86cb79367582e257304ef1fbfe876ca66856e7dd2e87cfeb0be700d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/CoplanarPoints.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d3357d2a0f47144b16298c95ec2a4097e4d9838e4066754a4efe61f8b514c8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/other/CombinationsWithRepetition.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5082456511894ef7fe6df8003c5576d0524aee506c57c481d24bc38ce5b4cd7f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8791f48ffa41e05ec9279a70ca0571686f6677be858cb009f0bad51a9bd92436"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/PointCircleTangent.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea7e753b650fdadedfefe46ab15a5a723ebc11163d1f55f4c071d4804039eb2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/DagDynamicProgramming.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b4bbed0ba2bb1e2253f4169d16fff438ecfb2a2f22daa893cd16a74ceded83"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/boardtilings/BoardTilingsSolver.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bf9b56ed07ad15c1581b0b105f443a44581daf6cff66b6702d434ed514190c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/fenwicktree/FenwickTreeRangeUpdatePointQuery.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5a8ff6de9cd89a3f4187e2318504ba762ad4d0023bb1f46f3415a2d1412c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/sorting/TimSort.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"363362403ba40ac3ced513ac797c71a63f673472be1b5cf104336f823a579d22"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/hashtable/DoubleHashingTestObject.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"815d275ebdbe9a8c2c1488d9ad5bf63be04c3277bb4b4b339d78e8839487e1d2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/RotateSquareMatrixInplace.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c47e5bbc06c4c422cc0a0a8689413ad72f3ec516a7e76e4f4d2f357c96eb27"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/bloomfilter/BloomFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71427f1350eb4bd2d3f6dc74987c79e962154ed2a170220a9b9a10cd725220a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/Simplex.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64cc6ac0ad1c02a665d35f194c7dd50b29dd7e9c9c2dd8467b2da22f8cfd703"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e79b110ee65095ccbe9643cab13222b280675fce629542c665667a7472d61a4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/magicalcows/MagicalCows.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a09f2a5baa741c1566f2808c69f97fbc9396d32231e30e8636f2dabcb9cceb"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e759935bc673c1bbcc6c3a0b71d4c7fad5f018c82bda27e04c84ef98fe18b58"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc96764c24d7584dce4da6581edb93afa15f079008a05451af3eb7c24a0b3ee4"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX3","level":"error","message":{"text":"Project dependency cycle: The projects //src/main/java/com/williamfiset/algorithms/datastructures/sparsetable:sparsetable \u2192 //src/main/java/com/williamfiset/algorithms/datastructures/sparsetable:sparsetable form a reference cycle. Cyclic dependencies prevent independent build/test/deploy, blur ownership, and tend to grow into a big ball of mud. Break the cycle by extracting the shared types into a separate project both can reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"06ab53bf48f900cd058c3a245e9d464fe90285845f653aa8b4930ed0ff055650"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 exception: \u0060rangeUpdate\u0060 throws an exception whose message says it isn\u0027t finished \u2014 a not-implemented stub wearing an ordinary exception. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cacc168f75d57a578439d11d950f0b0988ca8fbc86075517f45f3c70450ad95"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/main.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!deque.isEmpty() \u0026\u0026 deque.peekFirst() \u003C lo\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/other/SlidingWindowMaximum.java, src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/other/SlidingWindowMaximum.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fed1a7f0211d833fbba3dec94c90ef335a0ca968c7e3c069ec91fdcea8cbde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(endNodes == 0 \u0026\u0026 startNodes == 0) || (endNodes == 1 \u0026\u0026 startNodes == 1)\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java, src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4371f63ebd36ba3f2143e22c36d66ca89627bda68019a0bcea08ff44327381"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(i \u002B len \u003C N) \u0026\u0026 (k \u002B len \u003C N) \u0026\u0026 T[i \u002B len] == T[k \u002B len]\u0060 appears character-identically in 4 files \u2014 src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java, src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java, src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java, src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"492f2048459f4976dfb2fc1fd6e6bcaabf4b35889fc0832ea68f3cb4d5f1792e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dp[newState] == null || newCost \u003C dp[newState]\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java, src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde6df0685de8f3e09daabe4e202de6ea034f6b4a0330b950af55a1049bfd563"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060graph == null || n \u003C= 0 || graph.size() != n\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java, src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3457f351ceb3dd0f54b9b5e9f499947ca2c458dc5778b4185845e9f0c3eae71b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isOdd \u0026\u0026 (leftNode == artificialNodeId || rightNode == artificialNodeId)\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java, src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ee097752c6f96cd896a2bcc64474ccdf00b25d860865a62322e187fe0e7cb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isValid \u0026\u0026 node.left.value.compareTo(val) \u003C 0\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java, src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b93a9efe8a2e2d99b68625b10f5942fc75a20b9515a656c91e8d82727fac47c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isValid \u0026\u0026 node.right.value.compareTo(val) \u003E 0\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java, src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe80fcbcaf31585369656fade83c14a999da01fb7b8aa4b0ec12ac4c4b4dd0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rank[sa[i - 1]] == rank[sa[i]] \u0026\u0026 sa[i - 1] \u002B p \u003C N \u0026\u0026 sa[i] \u002B p \u003C N \u0026\u0026 rank[sa[i - 1] \u002B p] == rank[sa[i] \u002B p]\u0060 appears character-identically in 4 files \u2014 src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java, src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java, src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java, src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07074de28a3e07e341b4ed8e80616e6fb716c704fb8b0de56fd3f650ce7a8da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Math.abs((x1-r)-x) \u003C EPS || Math.abs((x1\u002Br)-x) \u003C EPS\u0060 appears character-identically in 2 files \u2014 src/main/java/com/williamfiset/algorithms/geometry/LineCircleIntersection.js, src/main/java/com/williamfiset/algorithms/geometry/LineSegmentCircleIntersection.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/geometry/LineCircleIntersection.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7eac67ca701abdd3e7e5b87e4f2780c16b1e7f22d8f8fc935793d5b18bf38b"}},{"ruleId":"X5","level":"note","message":{"text":"Java packages are not null-marked everywhere: 0/47 of this repository\u0027s Java package directories are under a non-null default: a \u0060package-info.java\u0060 declaring \u0060@NullMarked\u0060 (JSpecify) or \u0060@NonNullApi\u0060, \u0060@ParametersAreNonnullByDefault\u0060, \u0060@NonNullByDefault\u0060, \u0060@DefaultQualifier(NonNull.class)\u0060; a \u0060module-info.java\u0060 declaring \u0060@NullMarked\u0060; every type in it \u0060@NullMarked\u0060; or a build that runs NullAway with the package in \u0060AnnotatedPackages\u0060, or the Checker Framework\u0027s \u0060NullnessChecker\u0060. Elsewhere every reference admits null and no checker warns on the dereference that throws a \u0060NullPointerException\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"419201f6fc7ba243aef2cfb154378641588a8190e6269cea04a7b48c3d343bd5"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":9,"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."]}]}