{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"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"}]}},"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 396): Node.knn has cognitive complexity 396 (threshold 15). Drivers by points: if/else 381, boolean chains 6, ternaries 6, loops 3 (nesting depth added 299). 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/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 38, loops 30, ternaries 23, 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 30, loops 15, 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 20, if/else 8, 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 15, loops 13 (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 15, loops 10, 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":"SplayTree.splayUtil (cognitive 25): SplayTree.splayUtil has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, ternaries 4, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/SplayTree.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb000ff94f004ab268914e61d274082cc4ea1f13037f25f108a34133daed57"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTableOpenAddressingBase.put (cognitive 25): HashTableOpenAddressingBase.put has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f830c215a82ed96dca3e4bba5fe84cd4fb997d8b829cc7b79657aeda8c157d"}},{"ruleId":"D2","level":"warning","message":{"text":"SuffixArrayFast.construct (cognitive 25): SuffixArrayFast.construct has cognitive complexity 25 (threshold 15). Drivers by points: loops 16, if/else 8, 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 15, loops 6, 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 16, if/else 8, 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 16, if/else 8, 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 16, if/else 8, 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":"AVLTreeRecursiveOptimized.remove (cognitive 24): AVLTreeRecursiveOptimized.remove has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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/datastructures/balancedtree/AVLTreeRecursiveOptimized.java"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6592728b20b84c03ea6060360671958fe525831b9e634267fc24e4b26b8dc25"}},{"ruleId":"D2","level":"warning","message":{"text":"ModularLinearAlgebra.rref (cognitive 24): ModularLinearAlgebra.rref has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, loops 11, 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":"SparseTable.init (cognitive 23): SparseTable.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 5 (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/sparsetable/SparseTable.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef19b73671b7654032ca07dbb4204962ef3fb4a3ad17f661d84655d5398d9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection (cognitive 23): LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 6, ternaries 4 (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 15, loops 5, 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 12, loops 11 (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 12, loops 11 (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":"AStar_GridHeuristic.astar (cognitive 22): AStar_GridHeuristic.astar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 4, 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 12, if/else 9, 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":"ZAlgorithm.calculateZ (cognitive 22): ZAlgorithm.calculateZ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, loops 10, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/ZAlgorithm.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e61af7db1364029ddcc18c53479aa16410b01257f481b7b53496810192fd82"}},{"ruleId":"D2","level":"warning","message":{"text":"CoinChange.coinChangeSpaceEfficient (cognitive 21): CoinChange.coinChangeSpaceEfficient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, loops 6, 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 12, if/else 9 (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 9, ternaries 7, loops 3, 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 9, loops 7, 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 12, if/else 8 (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 12, if/else 8 (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":"FibonacciHeap.consolidate (cognitive 18): FibonacciHeap.consolidate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 7 (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":"HashTableOpenAddressingBase.containsKey (cognitive 18): HashTableOpenAddressingBase.containsKey has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e6aeaec051625d05ad84b6af3a602c8fbdb0d0047ad28f1cfdff80a7976dc"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTableOpenAddressingBase.get (cognitive 18): HashTableOpenAddressingBase.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d289910c2c94e2f05d94be51f327d4897441c68696546158c438968ba7610"}},{"ruleId":"D2","level":"warning","message":{"text":"LineSegmentLineSegmentIntersection.getCommonEndpoints (cognitive 18): LineSegmentLineSegmentIntersection.getCommonEndpoints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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/geometry/LineSegmentLineSegmentIntersection.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b1ad131c57d6518ee49a15f4a18ec1930c58d8591533afd1fb7582e7146900"}},{"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 14, loops 4 (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 15, loops 3 (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 17 (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/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 12, 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 10, loops 4, 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 12, loops 3, 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 8, loops 7, if/else 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 12, loops 3, 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":"SuffixArrayMed.construct (cognitive 16): SuffixArrayMed.construct has cognitive complexity 16 (threshold 15). Drivers by points: loops 7, if/else 5, ternaries 3, 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 9, loops 6, 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 9, loops 6, 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 15, 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 7, if/else 5, ternaries 3, 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":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239-264 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:242-267 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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":"9201225941874d0661e4f66b842a4630a58062649568729a1eff9139e6a4e8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:149-170 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:142-163 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/balancedtree/AVLTreeRecursive.java:149\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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5fab1a064e9cd76bac4f87203903ed3b19c3f23bdf17374c01aabb83545eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:158-178 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:74-94 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3663fb26c17c1484134c36ec58d9d4c3041530981e7bf1abb8638b9201f5307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 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":"5f2b2bc60b9c713645f842d2e6f180b467bd1774e243c4f6df6a963869742623"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/MaxQuerySumUpdateSegmentTree.java:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be2624963bde6e8a7fd901a0ec784dde0c76fef3f73d07c66aca55f4945af4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:325-340 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:332-347 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/balancedtree/AVLTreeRecursive.java:325\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/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05878ff4de52fde9d920771b4b8dad0acb57794950956b0cc14aa7c4954e0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java:150-165 | src/main/java/com/williamfiset/algorithms/geometry/PointRotation.java:25-40 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/geometry/CircleCircleIntersectionArea.java"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddde1fdd514989219fd04a3af5ea50556c665481cf8a9a1d4b15e9a03659731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:138-152 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:154-168 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/priorityqueue/BinaryHeap.java:138\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/priorityqueue/BinaryHeap.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"852801eab311615639d499db6ebae6b42926b8ffb462e74ef9ff55c6d39923ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:204-218 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:121-135 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/MinimumWeightPerfectMatching.java:204\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/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f0796fc4fb7bf3a8e71a313e13e72239f9b13405969a4c7cebd7ea6ba7af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:160-174 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:179-193 \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/analysis/PrimsGraphRepresentationAnaylsis.java:160\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/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9158c121fcdc48ac661488df1548d387b866db9b39459b7588185b5b0ca3c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213-226 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:261-274 \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":"81811b05e9ab09a3dc82f6af8b06600af3ead83bd0053f177cbbdcc5a6329381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:225-238 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:362-375 \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/dp/WeightedMaximumCardinalityMatchingRecursive.java:225\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/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6779f64bf549b7061b5cc8a4d855a66a67c4bd069a8c38286d8539f0957b2fa1"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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":"741834eed07ac2dd3452318c4efe6dacf4a128d03149b6f9c47e8f6eb74a3ad2"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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":"a303180d0e4667411555599cd1af2a284ed3dbc152165a058c7b52414a5561e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:85-97 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:270-283 \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/suffixarray/SuffixArrayMed.java:85\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/suffixarray/SuffixArrayMed.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4443b32d8114ed0082cabdcc1bf1af6d83d03af524fc779a8f337041fc624b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:226-238 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:77-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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:226\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/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f1ee2b7e8154ad005f05f8689e2cbcd44ba76c0bb80393c975c4e5315f7b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:209-221 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/EdmondsKarpAdjacencyList.java:59-72 \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/examples/EdmondsKarpExample.java:209\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/graphtheory/networkflow/examples/EdmondsKarpExample.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"198e8a8b25bea6d79a3ba97a9042eca6303f3ada4527bac0a845f2b6a4f9f270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:101-113 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:127-139 \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/networkflow/CapacityScalingSolverAdjacencyList.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6195d8e5e8d48c41d1613ec3df703760bf52621a6f6a8aba7ed20b17ad445059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:210-221 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:295-306 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:210\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/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a26f803afd31bda52129322dec0ffb672b6b249e92efb3bc88dad8353c6d87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:172-183 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:309-320 \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/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdcbc2123b2155fe7a4b9b55be827da54f4dc309fec5e38737aee56562d25ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:183-194 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:148-159 \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/analysis/PrimsGraphRepresentationAnaylsis.java:183\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":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcf609795eb0247b1669693ddce2b24dcc12f6f20f3c2929e569fefc7ed25f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:260-271 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:228-239 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be5066681fc0bc2fec4079c8ec34c0a3dfc6c58897769a6b55d3ef33e7fa616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:187-198 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:252-263 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/examples/FordFulkersonExample.java:187\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/graphtheory/networkflow/examples/FordFulkersonExample.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6177ef77b4b06cf216f4db3d5ac5a10af31b11b10570d637dcdc18b7127dd345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:218-229 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:92-103 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:218\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/math/ChineseRemainderTheorem.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd3b69650d2e6968168c9282afef76c7e754998c5aefa6ec692d29796b58b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:205-215 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:235-245 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/priorityqueue/BinaryHeap.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad8928bb07d37daa26adbbcdb89c06c63a9899f96b88f4282a49ae807386cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:69-79 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java:39-51 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:69\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/graphtheory/networkflow/MinCostMaxFlowJohnsons.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7351fe57fce9c4cffd158ad0b73655a83a9adea8dcda911a83d9dcda0fee39e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:144-154 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:168-178 \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":"50912c9002c06c3f6651b65814d8e60800bafa1a8e8ac0774db02897637515fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/sorting/QuickSelect.java:31-41 | src/main/java/com/williamfiset/algorithms/sorting/QuickSort.java:33-43 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/sorting/QuickSelect.java:31\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/sorting/QuickSelect.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef8d5438aee958233cc9b550e8a89062c474d3c3ab79009c14765c5c4e60a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:143-152 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:209-218 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:257-266 \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: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/hashtable/HashTableOpenAddressingBase.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a2d32172b92cbf537cee5518a8c214998db1941e839d2d54bb452f628f7f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:61-70 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:81-90 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:206-215 \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:61\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/examples/MinSparseTable.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df9977aae31bd9712a6062b9b5fb571f4ac08cf0838fe6ae093a2534f32bd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150-159 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:144-153 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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":"56ebd87dde29ac87314ea79ede1c1273909449d0ee8075a8fac488d78b9e3915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:58-67 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:245-254 \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/suffixarray/SuffixArrayMed.java:58\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":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc497fa104964a95044a0c629ae204ea9e8239da62ff07db53283324509fcba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:101-110 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:238-247 \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/dp/WeightedMaximumCardinalityMatchingRecursive.java:101\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/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db895dd5646447c6222a6cdab4172169e5ab6edd8c3064622e8fa41e589915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:22-31 | src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:80-89 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/AngleBetweenVectors2D.java:22\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/geometry/AngleBetweenVectors2D.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad9ea40bae09fd9e31843e485aa00c6f2071d0f4ddaf8483a102c2e3030985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:184-193 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:150-159 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:184\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/graphtheory/Boruvkas.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b7a4ffa633a858b9e3c1c1acaee2be150a31500f6b65333c78bcc1ce751b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:207-216 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:225-234 \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":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ed76fbd1fba07c9fbf722ecd2e4ae74d825f0313898341856b9db554e5d385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:184-193 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:57-66 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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:184\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/math/ChineseRemainderTheorem.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d5c529b3ab61f63cf33bf454df502beded510aa809f46ab58eceb8ad4af2f"}},{"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 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/graphtheory/Kosaraju.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8634cc66a22fc83d8067e362f6d055925180d1b805244478958575e3b271d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:51-59 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:420-428 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:227-235 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:169-178 \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/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbdcda3a6e7b171936657d1307f4c3e8aaaf8b85d1f23e70493a83a488ddce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:122-130 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:491-499 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:298-306 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:242-250 \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/datastructures/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b2076aaf471289fc6ec97a92fad24a6b84fa68e8b198b7b368024d3697172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): 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 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:151-159 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:163-171 \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. 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/graphtheory/networkflow/examples/DinicsExample.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafd03bd089e52b57604a4b279909a140cb38f007e6d68a3a0de8c6998873a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:71-79 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:75-83 | src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:73-81 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/strings/LongestCommonPrefixArray.java:71\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/strings/LongestCommonPrefixArray.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06942df6a851cca8a4a6fd5826075d970f3093c62bed796883edc5c03256245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:313-321 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:255-263 \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/AVLTreeRecursiveOptimized.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. 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/AVLTreeRecursiveOptimized.java"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb07e56f2ab607d0a2612cdae83792a06496cbbc186a8374cd5f0f908606c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:229-237 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:338-346 \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/binarysearchtree/BinarySearchTree.java:229\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/binarysearchtree/BinarySearchTree.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"883b5bba9ffb9479756a7cd819ed000d95c43f664fb2bcf459c3a562e4cffd44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:59-67 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:34-42 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"23833ac038e671d9a932e407ef87d749cc44e2d8945a5d8e12ab75fd67ab3ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:157-165 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:294-302 \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/dp/WeightedMaximumCardinalityMatchingRecursive.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b06cdce4aa244909e20569624c0a1fe9d69d2d1f504af79a584685188c67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:207-215 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:82-90 \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/examples/DinicsExample.java:207\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/graphtheory/networkflow/examples/DinicsExample.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcb87adfa8a5af28d88f094b4d76b6eb66ccc69ed8499882be6072d99567b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:89-97 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:147-155 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/RootingTree.java:89\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/graphtheory/treealgorithms/RootingTree.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081b365c11abb38031ed1727729729889a9994362ad4bcd75ff9085d0b87399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:144-154 | src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:166-174 \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/ArticulationPointsAdjacencyList.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"886f60dee9194e12d5544a1044cee135ecf6df0b5b5132dd98deec1e216d1891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:38-50 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:55-63 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/GaussianElimination.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"899fcb1fc2733ff7774db457457fa67d6be7309c461d12923c16603cbf99b56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100-108 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:109-117 \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/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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"248e4ceed36a95510d4e7769d2912999cdb991c909b0865b117a0d38b7480e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:232-240 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:107-115 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/math/ChineseRemainderTheorem.java"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2552a9310a3cc2b30e2e3577da984b3d21732db000d766bc31c0247871888da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51a79c6177f1e91eb245d49369b326fef16624ec2dab0280ca99693b3d2d3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:227-234 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:244-251 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:213-220 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:136-143 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/FordFulkersonDfsSolverAdjacencyList.java:146-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f35ff0834f929b3dd579ab733ff1b6a7641fae98e8f0bbcae3c15caa80842f"}},{"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 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/graphtheory/EagerPrimsAdjacencyList.java"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e335c54c8eba37b649e43e4da821f121559b3c0b2577a92db3ae680494a65c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:128-136 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:137-145 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:146-153 \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: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6b5d3ccf8962b32dde74eb21db172175e113ae4973d91c54577178f5e53fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:132-139 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:124-131 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da89289b6ac44769487b7b1949f8077a649dc851e4174d1f338654ee386edb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:92-99 | src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:103-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":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"40293b51d6fa948912e4477b5315fe6636598a4e6a60ccf67a0b64d651d2be73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:158-165 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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":"1431c2c0695e3733730a4ed93652a4d393f588d3b2d210f50c51d603014d773b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:10-17 | src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java:43-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ab57dd1e58ca046175409d59e3c26b781f1e08a8afdc708508f429f80d56da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227-234 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:143-151 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/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. 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/dp/MinimumWeightPerfectMatching.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8298fd121da87f46a9fe7a2d5a57d3ec666a4b01609d3b071af29d0111db5bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:187-195 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:63-70 \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/examples/DinicsExample.java:187\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/graphtheory/networkflow/examples/DinicsExample.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90bb5b15d1ae5947c2c2e9f9b15ff69bab2c6f085002a22f0d7cc1192d7323d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:84-91 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java:111-119 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ab73765aa76faea566be9cfdcfc0810d0a901fcfa89ec5b40dc16938a1612a"}},{"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: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"da728ef027bafb43c281c207d0d4f9a7fd2bd6fd0746e7213ca9ffd8a81f817e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 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":"2fde2099ec09b6d73837cce68979f29d001ba5a7e28100ece7b6842d95c8f425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MaximumCardinalityBipartiteMatchingAugmentingPathAdjacencyList.java:92-98 | src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:136-142 | src/main/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyList.java:138-144 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:134-140 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:152-158 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:173-179 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:191-197 | src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:211-217 | src/main/java/com/williamfiset/algorithms/graphtheory/TarjanSccSolverAdjacencyList.java:127-133 \u2014 there are 9 copies across 5 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MaximumCardinalityBipartiteMatchingAugmentingPathAdjacencyList.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ac8b689e4eaadec596ff17e2f61d53252f76cfbe81ff0d59a4c418f19dd811"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a817d64ed0c3757bc2035f3925d68c1752a529e7f35a4b24673b5028677e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:386-392 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:171-177 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:253-259 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:170-176 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryAssignUpdateSegmentTree.java:171-177 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:177-183 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:159-165 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa7f17abfd47bb0de993efed8ed5a5619b35a4ca0d88f5bc491e943e43248c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): 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 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:106-112 \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. 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:119\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/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c6821668a58a24a8a83fd3910886b5cd534a0dbf6fcfca3a99c5e3aa61b0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:91-99 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:69-75 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:73-79 | src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:71-77 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:91\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/SuffixArrayFast.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff61f498a9ea7b0534baa0578cb0d2d3d95aa41d2d90da4179b6eaf3c942373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java:49-55 | src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:45-53 | src/main/java/com/williamfiset/algorithms/dp/Knapsack_01.java:91-97 \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":"14fff91ecf34b315905a4027cf9a1627de34c6aa955d0f6e2e9f275f9dead01d"}},{"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 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c37955e67e15692329545da7b363ef50091e04a0735c5c5a53af31af8421bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:76-82 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:104-110 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"78238fc686c67f9e3226323c6ae9d6255afb49ad434e5cabb5c6bf49f8ad3c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:89-96 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:106-112 | src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:121-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":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b67aedd36016e377395acb9a773a467095a68e2a8f832966b7821c6a20f166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:457-463 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:475-481 \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/segmenttree/GenericSegmentTree.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9573c56da518bb91457e36b84be11cc0cd61b4834ae0def923b3c7a6ff55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:166-172 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:236-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:166\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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb298187e3b119b13ba4f892bd74e56670c3db90d923bb47ce4fe34f1fea02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92-98 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:132-138 \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/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. 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/suffixarray/SuffixArray.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d45893efd67ee30bf8787dcfc06c587aeaff65ddf8b2eb65485f13ca925f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:90-96 | src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:114-120 \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":"e458dce1bb13efcab6cc7d758bbaaf4c33e30c3ce57d9df354e44785378a7789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:166-172 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java:40-46 \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/examples/DinicsExample.java:166\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/networkflow/examples/DinicsExample.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8dbeea4844a236ed4392f73222e4b602384c3ee3964ebe5222c0a6a4c12ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:266-272 | src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java:126-132 \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/treealgorithms/LowestCommonAncestorEulerTour.java"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3182b6c0d2d23dc5d8bf5a693600a12fab36990d94462634b5bd245fa8b5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:75-81 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:88-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f8ae2c113287d6f16415d0504a9648e6ae8ca45d680cf8950050dea3f0c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:90-96 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:132-138 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/DijkstrasShortestPathAdjacencyList.java:90\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/graphtheory/DijkstrasShortestPathAdjacencyList.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"10935c339149f910d9e3aa8636d522a9991bdfef8dfd691378625e43e89e2455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:246-252 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:168-174 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/EagerPrimsAdjacencyList.java:246\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/EagerPrimsAdjacencyList.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdb23098abd4c2e6b34c83b00b4c04e538278f080234c63ce392897dafcc875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:30-36 | 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 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc291009bcc9a6ec890175b128d2cf28cf2edc0c5a04e3cd6eba11347dae077d"}},{"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:53-58 | src/main/java/com/williamfiset/algorithms/math/ModularInverse.java:37-42 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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 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/math/ChineseRemainderTheorem.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d0d493900d6f824ea3475ac40e45332dfb0a0312387219c1e93cc201b851af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:247-252 | src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:616-621 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:423-428 \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/priorityqueue/MinIndexedDHeap.java:247\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/priorityqueue/MinIndexedDHeap.java"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"547bbba3ea2925a7750f7d404fb1aa9df9da9e4bb128d8deb6cab3d5cd49ceda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 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: extract the block into a single shared function in that directory and call it from each site, 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":"7ec089b432033d577bb90143a4dded8a440c117ff865b8bac2cce26edc2924da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): 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 \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/narrowartgallery/NarrowArtGalleryRecursive.java"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7cba0da5e2bed3643640e57566e17b52e9d5357581f912ab56ebf4462478e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:64-69 | src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:74-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":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4783656091951ec43d33139eec876cc41c4facb89864939cd559d9f8aeca5c0"}},{"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":"b76b1f268076f965cfe6d9f2c264801209a540bc438680b628c2e43b5c999df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:40-45 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:119-126 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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. 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/graphtheory/treealgorithms/TreeCenter.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a2835f68a76f4660869c234213c85802d2deff919509356984ee8181b3d77b"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/GaussianElimination.java:80\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/linearalgebra/GaussianElimination.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"193dcd1cba21d865c49aa7f0002c285f129775fc7053c25a09a5d35b8c78930d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:86-91 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:124-129 \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/strings/RabinKarp.java:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f0e488598a96e5615ba766f440a0c0a50f34c5d0c69cbb6d585d7cacc3120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:55-59 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:52-56 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:54-58 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:53-57 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java:118-122 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/NetworkFlowSolverBase.java:46-50 \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. 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:55\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/graphtheory/networkflow/examples/CapacityScalingExample.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"47840028a8dd25b70e2c39b8a2416bf80ce90cf8a43c8e1f9fe1c9be306d8da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:219-223 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:228-232 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:237-241 | src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:246-250 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/CoinChange.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3be14c0e2c3e2b27e66aa31192e68fb8f248c2c10171d270033c3c06cf08be"}},{"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":"d94c6c1afe0db7723afb659d164556a9f41393eb50597b1505d42a2f2f4faad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:189-193 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:274-278 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:111-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a92caa078c057dd818f42b2ca78edbed5c0180e2e6a22f156dce6b4bcf0674"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1897778def9c22880bdeed8c3f07f1521ec0b6e24cddaa2be0dbcd219e44e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235-239 | src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:298-302 \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":"8c401472f8a94679f249a1b6331c81b80e29abc7273783a7309c7467948d70ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:245-251 | src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:308-312 \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:245\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/datastructures/quadtree/QuadTree.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"429470ae11384ed22b975412f24cb6c7e86593f4b2284ad46ff9e8d88b5967a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:428-432 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:442-446 \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/segmenttree/GenericSegmentTree.java"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0faf285169f7fcd818af00a09c83b5763ea60f85b43c1b0818c6479b5a176a"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/MinQueryAssignUpdateSegmentTree.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/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ea4895de5d7620294104b49422c722d5590b847e4bf39d44c0f9470761267c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:270-274 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:290-295 \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/segmenttree/MinQueryAssignUpdateSegmentTree.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4ad02618f3792c3e795ac6cc7411931362dbce964354aaad8f8d37a940acaa"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/SumQueryMultiplicationUpdateSegmentTree.java:165\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/SumQueryMultiplicationUpdateSegmentTree.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ef6e2e5ad8cd36e2d134b7654054e1c88a7e4bf561179be68c03044ad9796c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:98-102 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:106-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:98\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":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16b3cf03960a6c1afd259dcb2f5ecd19dd243fde003c01314fb84a956ed1ed6"}},{"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 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/suffixarray/SuffixArray.java:63\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/suffixarray/SuffixArray.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"913cf487e0e3138ff8f4b033d98fc0ab350c58b1fc5ce4aa8a3888212335d0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:83-87 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:124-128 \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/suffixarray/SuffixArray.java:83\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/SuffixArray.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6772f57c66eb6d453fa6f9554f4a607c96dc96ac6bf2b273d295ad9cda6f4ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:45-49 | src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:58-63 \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/BellmanFordEdgeList.java:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9f7c0d212cec481d732315c7bf6765d22fea4a824b05f374cc8bf17ad1380d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:129-133 | src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:154-158 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ab15e299007bd99beb643fe27ba2528da68e578e99c975c931c466d9d2d9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:93-97 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:103-108 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/GaussianElimination.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4813bd97a45bce5db9244f511a8350e4e519932064787d4f81a9970254fb35d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:30-35 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:64-68 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cdc1662d4b311453638c2155e9cae8faf9bbf78f315d1f8ac2822cbd4e2795"}},{"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: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177ba1ef4949796dce2c102ee18d0ecb4810391467ac62fb1af1c77b73d3802"}},{"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: extract the block into a single shared function in that directory and call it from each site, 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 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/linearalgebra/MatrixMultiplication.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cc2706222bd139bacd4321e73c8503e96b7fbc5fe06c1a1cd9b4b3a6c5f696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:14-18 | src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java:12-16 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/sorting/BucketSort.java:14\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/sorting/BucketSort.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3859e706ae245c0ce45d8db2375d438f5cd85083e505a10cf9190ebac68163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:90-94 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:94-98 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/strings/LongestCommonPrefixArray.java:90\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/strings/LongestCommonPrefixArray.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a67bab0b3d71b146f82ffb0c6e46dc10727c8c24fdcb4ba05d51d0e1b9c779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:97-101 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:125-129 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, 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/strings/LongestCommonPrefixArray.java:97\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/strings/LongestCommonPrefixArray.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89130ed68b7c7cd901a327d9124cd6143bd04fe0df48238edb7330fabb28fda"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 51 significant file(s) lose their only recent owner: src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java, src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java, src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java, src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java, src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java, src/main/java/com/williamfiset/algorithms/dp/CoinChange.java, src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/RedBlackTree.java, src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java (\u002B43 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"562c58b472ee6b9f17c06b08db031ac5c1484e34ece42bb8c80fc057d2b2f533"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (52 single-owned of 96 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9b844b6c8c1cd10c637ec0a93e254d503dd4fd0ae1081566e79ce9e5ec0ef8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb57567b34b0d39512f09f110dfeae51385ede280168252cabcaa95323c9ad3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bddb7126630b2f678b3eca0512fcf3cd2a75818cdac7098492f39aa32fe670e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a057389323341aef23e637450745d61661459f58d8313bae8fd4899da344bd0e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 49 of 145 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 largest first: src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java, src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java, src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java (and 46 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":5,"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."]}]}