Public report — algorithms, published 6 Aug 2026.
Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version;
ask the repo owner for the full report.
175findings with an exact file:lineof 182 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
19/93dimensions across the health lenses26361 LoC — wide & deep
Executive summary
Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.
williamfiset/algorithms is sound in substance but carries real gaps (65%). It is not in crisis, but the issues below raise the cost of changing it — friction its consumers ultimately inherit.
It is strongest in Architecture (100%) — the structure is clean and changes stay contained. Code Health (75%) is solid too.
The area that most needs attention is Maturity (55%) — onboarding is slow and knowledge is concentrated in too few people (a bus-factor risk). Readiness (70%) is the next concern — releases are harder to depend on — versioning, release notes and dependency hygiene are thin, so consumers can't easily tell what changed or trust an upgrade.
Leadership focus, highest impact first: Record significant decisions one document per decision (Architecture documentation); 'Testing' section to the root README (Documentation (README)); 1 Further orphaned files (smaller) finding(s) in Knowledge… (Knowledge Freshness).
For scale: Medium (~26,361 production lines); rebuilding it from scratch would take roughly ~0.3 person-years (~1 engineer). Approximate, ±~30%.
Encouragingly, the gaps are in documentation and release process — not in the code's correctness, structure or security, which are strong. They're low-risk to close, and doing so would lift the grade without re-engineering anything that already works.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
0.9× (at 65% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.3 person-years of build effort (about ~€49,000 to rebuild). Its weakest lens is Maturity at 55% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 0.9× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness.
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Value concentrated against a weak lens · Medium · Value at risk
This is a Medium asset (~0.3 person-years to rebuild), and its weakest lens is Maturity at 55%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Maturity first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form). The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 6.7/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 3–7% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4 code quality: averaging 6.7/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
The top fix pays for itself · Medium · Economics
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 0.1–0.3 engineer-days every year, paid as drag on the ~677 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 36–648 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 3–7% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 167 line(s) changed over a 90-day window ⇒ ~677/year · D1/D2/D4 code quality: averaging 6.7/10 ⇒ a 3–7% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 648 months.
Architecture — module dependency matrix
48 modules, 16 dependencies — every dependency points down the layering, so there are no cycles. Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2021 — Injection
5
High / Critical
Roadmap
Begin by establishing an architecture decision record system to capture significant design choices and their consequences. Next, update the root README to include a dedicated section on how to run the test suite. Then, address knowledge freshness by resolving orphaned files to ensure all code is properly linked. After that, continue improving the overall quality and clarity of the existing documentation. Finally, reduce single points of failure by addressing sole ownership of critical code to improve team resilience.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness.
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 17 of 19 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 2 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.4 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 19 dimensions across the health lenses
D1D2D3D4D13D15D16D19D21D28D29D34D35M1M2M3M4P1P3
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 175 of 182 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D30 Dependency Vulnerabilities — scanner not present in this environment — The backing tool was not installed where this scan ran, so this dimension was not scored. Install the tool (or run in the hosted environment, where it is always present) for a graded result.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity (jscpd) — it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 2 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Node.knn (cyclomatic 91) finding(s) in Cyclomatic Complexity — start with QuadTree.java. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 GenericSegmentTree.<init> (cyclomatic 31) finding(s) in Cyclomatic Complexity — start with GenericSegmentTree.java. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 TreePrinter.getTreeDisplay (cyclomatic 27) finding(s) in Cyclomatic Complexity — start with TreePrinter.java. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 40 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 3 SuffixArray.construct (cognitive 25) finding(s) in Cognitive Complexity — start with LongestCommonPrefixArray.java, LongestRepeatedSubstring.java, SubstringVerificationSuffixArray.java. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 Node.knn (cognitive 396) finding(s) in Cognitive Complexity — start with QuadTree.java. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 TreePrinter.getTreeDisplay (cognitive 92) finding(s) in Cognitive Complexity — start with TreePrinter.java. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes10.0 / 10Exemplary✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
+ 32 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 19 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with QuadTree.java (2), MinQueryAssignUpdateSegmentTree.java (2), SuffixArray.java (2). — One of this dimension's main actionable groups (19 warning-level).
Resolve the 10 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with AVLTreeRecursiveOptimized.java, BinarySearchTree.java, MinimumWeightPerfectMatching.java. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 9 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with AVLTreeRecursive.java, IntQueue.java, MinQuerySumUpdateSegmentTree.java. — One of this dimension's main actionable groups (9 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
52 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The Algorithms repository's documentation is clear and complete for a project that demonstrates data structures and algorithms. The README gives an excellent rationale (algorithms are fundamental to exemplary programming) plus runnable Bazel examples for running single algorithms and all tests, with a companion video link. A dedicated References section points readers to competitive-programming resources. Each major algorithm topic (Red-Black Tree, Quad Tree, Fenwick Tree) is documented in its own README file, covering the implementation, an example, and a description of the data structure's purpose.
What to do
Improve Documentation Quality — currently 8.0/10. — The Algorithms repository's documentation is clear and complete for a project that demonstrates data structures and algorithms. The README gives an excellent rationale (algorithms are fundamental to exemplary programming) plus runnable Bazel examples for running single algorithms and all tests, with a companion video link. A dedicated References section points readers to competitive-programming resources. Each major algorithm topic (Red-Black Tree, Quad Tree, Fenwick Tree) is documented in its own README file, covering the implementation, an example, and a description of the data structure's purpose.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
High: dependabot-missing-cooldown · ×5.github/dependabot.yml:3detected by semgrep finding
What to do
Resolve the 5 High finding(s) in Static Analysis (SAST) — start with main.yml (2), readme-url-checker.yml (2), dependabot.yml. — One of this dimension's main actionable groups (5 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
49 of 145 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java.
Further orphaned files (smaller)
What to do
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling; coupling through a build step, config, or non-source file isn't seen.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a 'Testing' section to the root README — how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no `NNNN-title.md` documents and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/PlantUML/Mermaid diagram or architecture.md — the high-level shape isn't documented.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (or `semgrep --config=auto`, which runs on any language) as a CI step.
What to do
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Not included — 74 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX10 Code composition — not assessed — code composition is computed by ROLE over a document set that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~15317 lines of test source are present (.java) but the test-quality collector reads C# only, so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included
D12 Dependency Hygiene — Dependency hygiene not measured — no supported dependency manifest was read
D14 License Compliance — Not scored — this repository's package manifest is not parsed for licence data yet. A gap in the analyzer's language coverage, NOT a finding that the repository's licenses are compliant (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)), which this pass does not parse yet — so this dimension asserts nothing about this repository's licensing in either direction.
D17 Explicit Debt — explicit-debt markers are read through a C# workspace today, so they were not read for this repository's language — this asserts nothing about how many markers the code carries. Not scored — this is a gap in the analyzer, not a finding about this repository
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — No exposed public API
D23 Boundary Type-Coupling — Production source is present (.java, .kt) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — No calls could be sampled, so navigability was not assessed — tracing effort is measured over resolved call sites and this target exposed none. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet) — where an OSV-supported manifest exists, dependency vulnerabilities for this repository are reported under D38 instead.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
D32 Data Compliance (PII/GDPR) — No PII/GDPR-handling patterns detected (p/gdpr ruleset) — no data-compliance surface to assess.
D33 JS/npm Dependency Vulnerabilities — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D38 OSV Dependency Vulnerabilities — No supported non-.NET dependency lockfile found outside build output (npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven pom.xml, Gradle lockfiles, Python requirements.txt/poetry.lock/Pipfile.lock/pdm.lock, PHP composer.lock, Ruby Gemfile.lock, Elixir mix.lock, Dart pubspec.lock, Swift Package.resolved); nothing for OSV to scan. A NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
D6 Cohesion (LCOM4) — Cohesion (LCOM4) is measured over a C#/VB class graph, and this repository's production source is .java, .kt, which this pass does not read — so no class could be assessed. Not scored — this is a gap in the analyzer, not a finding about this repository.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
D9 Test Distribution — Test source is present (.java) but the test-pyramid classifier reads C# only, so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this check looks for (4 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this check looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this check looks for
GD1 Unfinished & placeholder code — no source files
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
P6 Release Hygiene — not evidenced — no changelog, version stamp or semver release tag in the repo
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — not assessed — schema-migration practice is read from a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (JaCoCo XML — `mvn jacoco:report` or the Gradle `jacocoTestReport` task) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
High: dependabot-missing-cooldown .github/dependabot.yml:3— This Dependabot configuration does not set a cooldown period. Newly published packages can be malicious or unstable. Add a `cooldown` block with `default-days: 7` to each `package-ecosystem` entry under `updates` to wait 7 days before proposing updates to newly published package versions. Reference: https://docs.github.com/en/code-security/dependabot/dependabot-version-updates/configuration-options-for-the-dependabot.yml-file#cooldown. This is a semgrep security-AUDIT rule reporting a POLICY that is absent or weaker than its recommendation, not an exploitable defect. Confirm whether the current setting is a deliberate decision for this repository — and apply the change where it is not; where it is (a policy your release process already enforces elsewhere, or one this repository has consciously opted out of), record the decision and leave the configuration as it is.
High: github-actions-mutable-action-tag .github/workflows/main.yml:14— GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v4`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v4 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/main.yml:17— GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: bazelbuild/setup-bazelisk@<40-character SHA>`. This step references `bazelbuild/setup-bazelisk@v3`; resolve the SHA it points at today with `gh api repos/bazelbuild/setup-bazelisk/commits/v3 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/readme-url-checker.yml:14— GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: actions/checkout@<40-character SHA>`. This step references `actions/checkout@v3`; resolve the SHA it points at today with `gh api repos/actions/checkout/commits/v3 --jq .sha`.
High: github-actions-mutable-action-tag .github/workflows/readme-url-checker.yml:17— GitHub Actions step uses a mutable tag or branch reference. Tags and branch names can be silently repointed by the action owner, enabling supply-chain attacks — as seen in the trivy-action and kics-github-action compromises. Pin the reference to a full 40-character commit SHA instead, e.g. `uses: ruby/setup-ruby@<40-character SHA>`. This step references `ruby/setup-ruby@v1`; resolve the SHA it points at today with `gh api repos/ruby/setup-ruby/commits/v1 --jq .sha`.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:355— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:355-359 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:357-361 — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235— src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235-239 | src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:298-302 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:235` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:245— src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:245-251 | src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:308-312 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:245` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:428— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:428-432 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:442-446 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:153— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:153-157 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:158-162 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:153` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:270— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:270-274 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:290-295 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:165— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:165-169 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:147-151 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:165` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:98— src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:98-102 | src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:106-110 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:98` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:63— src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:63-67 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:104-108 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:63` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:83— src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:83-87 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:124-128 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:83` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:45— src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:45-49 | src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:58-63 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java:45` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:129— src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:129-133 | src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:154-158 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:129` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:93— src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:93-97 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:103-108 — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:30— src/main/java/com/williamfiset/algorithms/linearalgebra/LinearRecurrenceSolver.java:30-35 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:64-68 — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:35— src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:35-39 | src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:82-86 — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:35— src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:35-39 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixPower.java:67-71 — 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 `src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixMultiplication.java:35` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:14— src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:14-18 | src/main/java/com/williamfiset/algorithms/sorting/CountingSort.java:12-16 — 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 `src/main/java/com/williamfiset/algorithms/sorting/BucketSort.java:14` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:90— src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:90-94 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:94-98 — 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 `src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:90` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:97— src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:97-101 | src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:125-129 — 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 `src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:97` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:313— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:313-321 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:255-263 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:313` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:229— src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:229-237 | src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:338-346 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/BinarySearchTree.java:229` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:59— src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:59-67 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:34-42 — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:157— src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:157-165 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:294-302 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:207— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:207` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:89— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:89-97 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:147-155 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:89` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:144— src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:144-154 | src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:166-174 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:38— src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:38-50 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:55-63 — 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.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100— src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100-108 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:109-117 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:100` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:232— src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:232-240 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:107-115 — 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.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:132— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:132-139 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:124-131 — 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.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:92— src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:92-99 | src/main/java/com/williamfiset/algorithms/datastructures/queue/IntQueue.java:103-110 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151-158 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:158-165 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:151` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:10— src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:10-17 | src/main/java/com/williamfiset/algorithms/dp/EditDistanceRecursive.java:43-50 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227— src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227-234 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:143-151 — 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 `src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:227` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:187— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:84— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:84-91 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java:111-119 — 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.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:103— src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsDfs.java:103-110 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:89-96 — 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.
Duplicated block (8 lines × 2) src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:75— src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:75-83 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:114-121 — both copies are in the same file, so extract the block into one function there and call it from each site — 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.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:457— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:457-463 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:475-481 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:166— src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:166-172 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:236-242 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:166` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92— src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92-98 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:132-138 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArray.java:92` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:90— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:166— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:166` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:266— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/LowestCommonAncestorEulerTour.java:266-272 | src/main/java/com/williamfiset/algorithms/graphtheory/BreadthFirstSearchAdjacencyList.java:126-132 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:75— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:75-81 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeDiameter.java:88-95 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:90— src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:90-96 | src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:132-138 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyList.java:90` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (7 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:246— src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:246-252 | src/main/java/com/williamfiset/algorithms/graphtheory/LazyPrimsAdjacencyList.java:168-174 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:246` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150-159 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:144-153 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:150` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:58— src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:58-67 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:245-254 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:58` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:101— src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:101-110 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:238-247 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:101` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:22— src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:22-31 | src/main/java/com/williamfiset/algorithms/geometry/CircularSegmentArea.java:80-89 — 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 `src/main/java/com/williamfiset/algorithms/geometry/AngleBetweenVectors2D.java:22` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:184— src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:184-193 | src/main/java/com/williamfiset/algorithms/graphtheory/ConnectedComponentsUnionFind.java:150-159 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:207— src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:207-216 | src/main/java/com/williamfiset/algorithms/graphtheory/EulerianPathDirectedEdgesAdjacencyList.java:225-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:184— src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:184-193 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:57-66 — 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 `src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:326— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:326-331 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/RangeQueryPointUpdateSegmentTree.java:173-181 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:326` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:157— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:64— src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:64-69 | src/main/java/com/williamfiset/algorithms/geometry/ConvexPolygonArea.java:74-79 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:191— src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/BipartiteGraphCheckAdjacencyList.java:191-196 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:131-136 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:40— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:40-45 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphism.java:119-126 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java:40` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:80— src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:80-85 | src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:89-95 — 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 `src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:80` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (6 lines × 2) src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:86— src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:86-91 | src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:124-129 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/strings/RabinKarp.java:86` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:93— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:93-105 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQuerySumUpdateSegmentTree.java:103-115 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MinQueryAssignUpdateSegmentTree.java:93` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:112— src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:112-124 | src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQuerySumUpdateSegmentTree.java:92-104 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/SumQueryMultiplicationUpdateSegmentTree.java:112` it does not close everything it opens, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:85— src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:85-97 | src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:270-283 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:85` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:226— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:226` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:209— 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 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java:209` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (13 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:101— src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:101-113 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/CapacityScalingSolverAdjacencyList.java:127-139 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:210— src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:210-221 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:295-306 — 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 `src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:210` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:172— src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:172-183 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:309-320 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:183— src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:183-194 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:148-159 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:183` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:260— 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 — 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.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:187— 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 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (12 lines × 2) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:218— src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:218-229 | src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:92-103 — 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 `src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:218` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (11 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:205— src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:205-215 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:235-245 — 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.
Duplicated block (11 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:69— src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:69-79 | src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowWithBellmanFord.java:39-51 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MinCostMaxFlowJohnsons.java:69` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:144— src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:144-154 | src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:168-178 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/RootingTree.java:144` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) src/main/java/com/williamfiset/algorithms/sorting/QuickSelect.java:31— src/main/java/com/williamfiset/algorithms/sorting/QuickSelect.java:31-41 | src/main/java/com/williamfiset/algorithms/sorting/QuickSort.java:33-43 — 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 `src/main/java/com/williamfiset/algorithms/sorting/QuickSelect.java:31` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java:49— 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 — there are 3 copies across 2 file(s) — 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 `src/main/java/com/williamfiset/algorithms/dp/KnapsackUnbounded.java:49` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:149— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:76— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) src/main/java/com/williamfiset/algorithms/graphtheory/Kahns.java:89— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
SuffixArray.construct (cognitive 25) src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:54— 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.
SuffixArray.construct (cognitive 25) src/main/java/com/williamfiset/algorithms/strings/LongestRepeatedSubstring.java:58— 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.
SuffixArray.construct (cognitive 25) src/main/java/com/williamfiset/algorithms/strings/SubstringVerificationSuffixArray.java:56— 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.
Duplicated block (15 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:138— src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:138-152 | src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeapQuickRemovals.java:154-168 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/BinaryHeap.java:138` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:204— src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:204-218 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:121-135 — 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 `src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:204` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:160— src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:160-174 | src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:179-193 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/analysis/PrimsGraphRepresentationAnaylsis.java:160` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 4) src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:51— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (9 lines × 4) src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:122— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (9 lines × 4) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:241— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:325— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:325-340 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:332-347 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:325` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java:150— src/main/java/com/williamfiset/algorithms/geometry/CircleCircleIntersectionArea.java:150-165 | src/main/java/com/williamfiset/algorithms/geometry/PointRotation.java:25-40 — 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.
Duplicated block (14 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213— src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213-226 | src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:261-274 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:213` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 2) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:225— src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:225-238 | src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:362-375 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingRecursive.java:225` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:143— 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 — 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 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 3) src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:61— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/examples/MinSparseTable.java:61` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 3) src/main/java/com/williamfiset/algorithms/datastructures/stack/IntStack.java:95— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:189— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Node.knn (cyclomatic 91) src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:166— 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.
GenericSegmentTree.<init> (cyclomatic 31) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:141— GenericSegmentTree.<init> 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 — the same kind of value, with no behaviour of its own — 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.
TreePrinter.getTreeDisplay (cyclomatic 27) src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java:23— TreePrinter.getTreeDisplay has cyclomatic complexity 27 (threshold 15). This file's 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 — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
TspDynamicProgrammingIterative.solve (cyclomatic 22) src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java:88— 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.
Solution.f (cyclomatic 21) src/main/java/com/williamfiset/algorithms/dp/examples/dominoandtrominotiling/Solution.java:17— 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.
LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection (cyclomatic 19) src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:41— 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.
CoinChange.coinChange (cyclomatic 17) src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:56— 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.
Node.knn (cognitive 396) src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:166— 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.
TreePrinter.getTreeDisplay (cognitive 92) src/main/java/com/williamfiset/algorithms/datastructures/utils/TreePrinter.java:23— 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's 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 — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
TspDynamicProgrammingIterative.solve (cognitive 48) src/main/java/com/williamfiset/algorithms/graphtheory/TspDynamicProgrammingIterative.java:88— 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.
RedBlackTree.deleteFix (cognitive 31) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/RedBlackTree.java:160— 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.
Simplex.simplex (cognitive 28) src/main/java/com/williamfiset/algorithms/linearalgebra/Simplex.java:39— 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.
ChineseRemainderTheorem.reduce (cognitive 27) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:63— 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.
SplayTree.splayUtil (cognitive 25) src/main/java/com/williamfiset/algorithms/datastructures/binarysearchtree/SplayTree.java:198— 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.
HashTableOpenAddressingBase.put (cognitive 25) src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:134— 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.
SuffixArrayFast.construct (cognitive 25) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:53— 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.
CoinChange.coinChange (cognitive 25) src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:56— 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.
AVLTreeRecursiveOptimized.remove (cognitive 24) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:220— 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.
ModularLinearAlgebra.rref (cognitive 24) src/main/java/com/williamfiset/algorithms/linearalgebra/ModularLinearAlgebra.java:32— 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.
SparseTable.init (cognitive 23) src/main/java/com/williamfiset/algorithms/datastructures/sparsetable/SparseTable.java:70— 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.
LineSegmentLineSegmentIntersection.lineSegmentLineSegmentIntersection (cognitive 23) src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:41— 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.
Boruvkas.solve (cognitive 23) src/main/java/com/williamfiset/algorithms/graphtheory/Boruvkas.java:73— 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.
GaussianElimination.solve (cognitive 23) src/main/java/com/williamfiset/algorithms/linearalgebra/GaussianElimination.java:35— 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.
MatrixInverse.solve (cognitive 23) src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixInverse.java:52— 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.
AStar_GridHeuristic.astar (cognitive 22) src/main/java/com/williamfiset/algorithms/graphtheory/AStar_GridHeuristic.java:57— 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.
FloydWarshallSolver.solve (cognitive 22) src/main/java/com/williamfiset/algorithms/graphtheory/FloydWarshallSolver.java:68— 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.
ZAlgorithm.calculateZ (cognitive 22) src/main/java/com/williamfiset/algorithms/strings/ZAlgorithm.java:13— 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.
CoinChange.coinChangeSpaceEfficient (cognitive 21) src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:129— 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.
ChinesePostmanProblem.<init> (cognitive 21) src/main/java/com/williamfiset/algorithms/graphtheory/ChinesePostmanProblem.java:35— ChinesePostmanProblem.<init> 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.
Solution.f (cognitive 20) src/main/java/com/williamfiset/algorithms/dp/examples/dominoandtrominotiling/Solution.java:17— 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 — 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.
EditDistance.micahEditDistance (cognitive 20) src/main/java/com/williamfiset/algorithms/dp/examples/editdistance/EditDistance.java:59— 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.
ClosestPairOfPoints.closestPair (cognitive 20) src/main/java/com/williamfiset/algorithms/geometry/ClosestPairOfPoints.java:54— 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.
BellmanFordAdjacencyList.bellmanFord (cognitive 20) src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java:48— 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.
SteinerTree.floydWarshall (cognitive 20) src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:92— 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.
FibonacciHeap.consolidate (cognitive 18) src/main/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeap.java:258— 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.
HashTableOpenAddressingBase.containsKey (cognitive 18) src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:200— 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.
HashTableOpenAddressingBase.get (cognitive 18) src/main/java/com/williamfiset/algorithms/datastructures/hashtable/HashTableOpenAddressingBase.java:248— 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.
LineSegmentLineSegmentIntersection.getCommonEndpoints (cognitive 18) src/main/java/com/williamfiset/algorithms/geometry/LineSegmentLineSegmentIntersection.java:157— 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.
AStar_GridHeuristic.dijkstra (cognitive 18) src/main/java/com/williamfiset/algorithms/graphtheory/AStar_GridHeuristic.java:216— 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.
DijkstrasShortestPathAdjacencyListWithDHeap.dijkstra (cognitive 18) src/main/java/com/williamfiset/algorithms/graphtheory/DijkstrasShortestPathAdjacencyListWithDHeap.java:73— 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.
Node.add (cognitive 17) src/main/java/com/williamfiset/algorithms/datastructures/quadtree/QuadTree.java:88— 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.
GenericSegmentTree.<init> (cognitive 17) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:141— GenericSegmentTree.<init> 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.
LongestCommonSubsequence.lcs (cognitive 17) src/main/java/com/williamfiset/algorithms/dp/LongestCommonSubsequence.java:47— 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.
ChineseRemainderTheorem.isPrime (cognitive 17) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:199— 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.
FastFourierTransform.transform (cognitive 17) src/main/java/com/williamfiset/algorithms/math/FastFourierTransform.java:74— 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.
PrimeFactorization.isPrime (cognitive 17) src/main/java/com/williamfiset/algorithms/math/PrimeFactorization.java:72— 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.
SuffixArrayMed.construct (cognitive 16) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayMed.java:53— 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.
MinimumWeightPerfectMatching.solveIterative (cognitive 16) src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:157— 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.
WeightedMaximumCardinalityMatchingIterative.solve (cognitive 16) src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:73— 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.
SteinerTree.minLengthSteinerTree (cognitive 16) src/main/java/com/williamfiset/algorithms/graphtheory/SteinerTree.java:26— 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.
SuffixArrayImpl.construct (cognitive 16) src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java:239— 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.
Duplicated block (26 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239-264 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:242-267 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:239` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (22 lines × 2) src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:149— src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:149-170 | src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursiveOptimized.java:142-163 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java:149` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (21 lines × 2) src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:158— src/main/java/com/williamfiset/algorithms/dp/MinimumWeightPerfectMatching.java:158-178 | src/main/java/com/williamfiset/algorithms/dp/WeightedMaximumCardinalityMatchingIterative.java:74-94 — 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.
Duplicated block (18 lines × 2) src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:99— 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 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `src/main/java/com/williamfiset/algorithms/dp/examples/narrowartgallery/NarrowArtGalleryRecursive.java:99` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 6) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:44— 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 — 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 `src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/MaxQuerySumUpdateSegmentTree.java:44` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 5) src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:137— 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 — 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 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/Kosaraju.java:137` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 3) src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:71— 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 — 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 `src/main/java/com/williamfiset/algorithms/strings/LongestCommonPrefixArray.java:71` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 8) src/main/java/com/williamfiset/algorithms/graphtheory/ArticulationPointsAdjacencyList.java:133— 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 — there are 8 copies across 4 file(s) — 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.
Duplicated block (8 lines × 5) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java:227— 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 — 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 — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (8 lines × 4) src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:162— 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 — 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 — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/EagerPrimsAdjacencyList.java:162` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 3) src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:128— 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 — 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 — 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 `src/main/java/com/williamfiset/algorithms/linearalgebra/MatrixDeterminantLaplaceExpansion.java:128` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 9) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/MaximumCardinalityBipartiteMatchingAugmentingPathAdjacencyList.java:92— 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 — there are 9 copies across 5 file(s) — 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.
Duplicated block (7 lines × 8) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:300— 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 — 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.
Duplicated block (7 lines × 7) src/main/java/com/williamfiset/algorithms/datastructures/segmenttree/GenericSegmentTree.java:386— 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 — 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.
Duplicated block (7 lines × 6) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:119— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:119` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 4) src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:91— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/suffixarray/SuffixArrayFast.java:91` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 7) src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java:30— 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 — there are 7 copies across 4 file(s) — 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.
Duplicated block (6 lines × 4) src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:144— 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 — 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 `src/main/java/com/williamfiset/algorithms/math/ChineseRemainderTheorem.java:144` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (6 lines × 3) src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:247— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/datastructures/priorityqueue/MinIndexedDHeap.java:247` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (5 lines × 6) src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:55— 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 — 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 — a location they all depend on today, or a new shared one if there is none — 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 `src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java:55` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — 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.
Duplicated block (5 lines × 4) src/main/java/com/williamfiset/algorithms/dp/CoinChange.java:219— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Recommendation — 5 finding(s)
D11 · Test Reliability· Test reliability not included · ×1
Test reliability not included — Test source is present (.java) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
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 (+43 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
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 — 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)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above.
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 49 of 145 analysed file(s) have no living knowledge left — 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 — 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.
Coverage not included — suite not readable by the collector — Coverage NOT MEASURED: test source is present (.java) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (JaCoCo XML — `mvn jacoco:report` or the Gradle `jacocoTestReport` task) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored.
Info — 2 finding(s)
D12 · Dependency Hygiene· Dependency hygiene not measured · ×1
Dependency hygiene not measured — no supported dependency manifest was read — No dependency manifest this pass reads for hygiene (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)) was found in this repository, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D38 wherever the manifest is OSV-readable.
D22 · Internal API Consistency· No exposed public API · ×1
No exposed public API — No intentionally-exposed types (IsPackable or .Contracts) to evaluate.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
trivy: not applicable — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
provenance: not applicable — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release).
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
0
—
Run 019fd777-e716-79dc-8f11-e0b9b934511c · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 5 · Warnings: 170 · Recommendations: 5 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 06-08-2026 @ 14:26 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.