Public report of numaproj/numaflow, published 17 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 17 November 2026, 08:04 UTC · Survey ID cd_e6751df1ab084657b3482129613b2828

numaproj/numaflow

Measured 17 November 2026, 08:03 UTC, at code version 1811b47

First survey, so nothing to compare with yet
CAI score 46.3out of 100 At risk

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A large codebase: 156,502 lines of product code in 17 projects, tests not counted · Estimated rebuild effort: about 1.8 person-years · Weakest lens: Architecture, 39.0

Findings by how serious they are

216 critical 1010 serious 297 minor

10 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 08:03 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

82of 82 dimensions measured by tools.
1461of 1523 findings point to an exact file and line, so you can open each one in the code. The other 62 concern the repository as a whole, such as missing documentation.
82dimensions across 7 lenses, read from 156,502 lines of product code in 17 projects.
Chapters

Executive summary

numaproj/numaflow is rated At risk because critical security findings are open, most of them in the build pipeline. Its score is held back in part because it has production projects that depend on test code. It scores 46.3 out of 100, which the At risk rating leaves unchanged.

Architecture, at 39.0, is the weakest lens and counts most in the score. The best first step is respecting the front end's boundaries, worth about 4.9 points. Checking whether the largest projects should be split comes next, worth about 2.2 points. Raising Architecture to 70 would lift the score to about 52.2.

Ninety-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Thirty-one settings leave the servers or containers unsafe, and twenty connections skip the certificate check, so they accept any server. Pinning each tool to an exact version, correcting the unsafe settings and switching the certificate checks back on would close these risks. Updating the vulnerable packages would fix the 20 packages with a known security hole, and limiting each secret to its own step would deal with the 15 secrets exposed to more of the pipeline than needed. The 12 labels or groups of fields with no name need connecting to their fields or naming.

The product code is 156,502 lines, about €270,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Architecture 39.0 · counts for 46%Code Health 46.8 · counts for 25%Production Readiness 50.6 · counts for 14%Accessibility 50.7 · counts for 8%Security and Compliance 67.6 · counts for 4%Maturity 75.1 · counts for 2%Performance 100.0 · counts for 1%

If Architecture rose from 39.0 to 70, the lowest score rated Strong, the score would rise from 46.3 to about 52.2.

Code composition: what the lines of code are
Product code 76%Tests 24%
Rebuild cost: about €270,000 · Estimate
Cost to rebuild€89,000 to €440,000, for 1,476 to 4,681 hours of work, about 1.8 person-years for 1 to 4 engineers
Difficulty of the problemHigh, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 46. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 156,502 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Fix the listed violations: move the shared test helper into a source directory production code may depend on (16 rows); import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (1 row).
Raises the score by about 4.9 points · Medium effort · Import Boundaries
2
Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml, package.json.
Raises the score by about 2.2 points · Low effort · Project Cohesion
3
Remove every production → test project reference: extract any shared test helper into a production support library (which the tests reference), or invert the dependency so the test project depends on production — not the reverse.
Raises the score by about 4.1 points · Medium effort · Test isolation

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €270,000 to build again, about 1.8 person-years of work. Its weakest lens is Architecture, at 39.0 (Weak). Architecture is about whether the structure holds up as the product grows, and when the structure is weak, a change in one place ripples into many others. Because the weakest lens counts most in the score, work on Architecture also moves the score most.
Based on: the rebuild estimate · the Architecture grade · how much each lens counts
What to do: Start with the Architecture actions in Top priorities.
If you do one thing first · First action
Fix the listed violations: move the shared test helper into a source directory production code may depend on (16 rows); import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (1 row). Of all the actions in this report, it raises the score most for the work it takes: about 4.9 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 41,646 lines over the last 90 days, which is about 168,898 lines a year. At that pace, the extra work comes to an estimated 8.4 to 56.3 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch backoff backoff github.com/numaproj/numaflow numaflow numaflow numaflow numaflow-core numaflow-core numaflow->numaflow-core numaflow-daemon numaflow-daemon numaflow->numaflow-daemon numaflow-sideinput numaflow-sideinput numaflow->numaflow-sideinput serving serving numaflow->serving numaflow-core->backoff numaflow-http numaflow-http numaflow-core->numaflow-http numaflow-kafka numaflow-kafka numaflow-core->numaflow-kafka numaflow-models numaflow-models numaflow-core->numaflow-models numaflow-nats numaflow-nats numaflow-core->numaflow-nats numaflow-pb numaflow-pb numaflow-core->numaflow-pb numaflow-pulsar numaflow-pulsar numaflow-core->numaflow-pulsar numaflow-shared numaflow-shared numaflow-core->numaflow-shared numaflow-sqs numaflow-sqs numaflow-core->numaflow-sqs numaflow-throttling numaflow-throttling numaflow-core->numaflow-throttling numaflow-core->serving numaflow-daemon->numaflow-pb numaflow-kafka->numaflow-shared numaflow-models->numaflow-shared numaflow-nats->backoff numaflow-nats->numaflow-shared numaflow-pulsar->numaflow-shared numaflow-shared->backoff numaflow-sideinput->backoff numaflow-sideinput->numaflow-models numaflow-sideinput->numaflow-pb numaflow-sideinput->numaflow-shared numaflow-throttling->numaflow-models numaflow-throttling->numaflow-shared numaflow-ui-test numaflow-ui-test serving->backoff serving->numaflow-models serving->numaflow-pb serving->numaflow-shared

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

492 modules, with 721 dependencies between them. 4 loops run through 31 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 452 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 github.com/numaproj/numaflow/pkg/apis/numaflow/v1alpha12 numaflow_core.config.components.reduce3 numaflow_core.config.pipeline.isb4 numaflow_core.error5 numaflow_models.models.abstract_sink6 numaflow_models.models.container7 numaflow_models.models.container_template8 numaflow_models.models.metadata9 numaflow_models.models.source10 numaflow_models.models.tls11 numaflow_throttling12 numaflow_core.config.pipeline.watermark13 numaflow_core.sinker.sink.serve14 numaflow_core.tracker15 numaflow_models.models.sink16 numaflow_core.config.components.sink17 numaflow_models.models.abstract_vertex18 numaflow_models.models.mono_vertex_spec19 numaflow_models.models.vertex_spec20 numaflow_core.config.pipeline21 numaflow_models.models.pipeline_spec22 numaflow_core.config.monovertex23 numaflow_core.watermark.processor.manager24 numaflow_core.sinker.sink25 numaflow_core.monovertex.bypass_router26 numaflow_core.mapper.map27 numaflow_core.message28 numaflow_core.pipeline.isb.writer29 numaflow_core.watermark.isb30 numaflow_core.watermark.source31 numaflow_core.pipeline.isb.reader32 numaflow_core.reduce.reducer.unaligned.reducer33 numaflow_core.source34 numaflow_core.config.components.source35 numaflow_core.metrics36 numaflow_core.pipeline.forwarder.map_forwarder37 numaflow_core.pipeline.forwarder.reduce_forwarder38 numaflow_core.pipeline.forwarder.sink_forwarder39 numaflow_core.pipeline.forwarder.source_forwarder40 numaflow_core.shared.create_components
1 github.com/numaproj/numaflow/pkg/apis/numaflow/v1alpha1
2 numaflow_core.config.components.reduce
3 numaflow_core.config.pipeline.isb
4 numaflow_core.error
5 numaflow_models.models.abstract_sink
6 numaflow_models.models.container
7 numaflow_models.models.container_template
8 numaflow_models.models.metadata
9 numaflow_models.models.source
10 numaflow_models.models.tls
11 numaflow_throttling
12 numaflow_core.config.pipeline.watermark1
13 numaflow_core.sinker.sink.serve1
14 numaflow_core.tracker3
15 numaflow_models.models.sink1
16 numaflow_core.config.components.sink1
17 numaflow_models.models.abstract_vertex11111
18 numaflow_models.models.mono_vertex_spec11111
19 numaflow_models.models.vertex_spec11111
20 numaflow_core.config.pipeline23111
21 numaflow_models.models.pipeline_spec1
22 numaflow_core.config.monovertex111
23 numaflow_core.watermark.processor.manager11
24 numaflow_core.sinker.sink114
25 numaflow_core.monovertex.bypass_router223
26 numaflow_core.mapper.map2333
27 numaflow_core.message1
28 numaflow_core.pipeline.isb.writer343
29 numaflow_core.watermark.isb22212
30 numaflow_core.watermark.source2123
31 numaflow_core.pipeline.isb.reader51342
32 numaflow_core.reduce.reducer.unaligned.reducer113
33 numaflow_core.source111511
34 numaflow_core.config.components.source1
35 numaflow_core.metrics1112
36 numaflow_core.pipeline.forwarder.map_forwarder11122121
37 numaflow_core.pipeline.forwarder.reduce_forwarder21211
38 numaflow_core.pipeline.forwarder.sink_forwarder11122121
39 numaflow_core.pipeline.forwarder.source_forwarder122111
40 numaflow_core.shared.create_components2111111111
Uses a module listed above itPart of a loopThe module itself
1 github.com/numaproj/numaflow/pkg/apis/numaflow/v1alpha12 numaflow_core.config.components.reduce3 numaflow_core.config.pipeline.isb4 numaflow_core.error5 numaflow_models.models.abstract_sink6 numaflow_models.models.container7 numaflow_models.models.container_template8 numaflow_models.models.metadata9 numaflow_models.models.source10 numaflow_models.models.tls11 numaflow_throttling12 numaflow_core.config.pipeline.watermark13 numaflow_core.sinker.sink.serve14 numaflow_core.tracker15 numaflow_models.models.sink16 numaflow_core.config.components.sink17 numaflow_models.models.abstract_vertex18 numaflow_models.models.mono_vertex_spec19 numaflow_models.models.vertex_spec20 numaflow_core.config.pipeline21 numaflow_models.models.pipeline_spec22 numaflow_core.config.monovertex23 numaflow_core.watermark.processor.manager24 numaflow_core.sinker.sink25 numaflow_core.monovertex.bypass_router26 numaflow_core.mapper.map27 numaflow_core.message28 numaflow_core.pipeline.isb.writer29 numaflow_core.watermark.isb30 numaflow_core.watermark.source31 numaflow_core.pipeline.isb.reader32 numaflow_core.reduce.reducer.unaligned.reducer33 numaflow_core.source34 numaflow_core.config.components.source35 numaflow_core.metrics36 numaflow_core.pipeline.forwarder.map_forwarder37 numaflow_core.pipeline.forwarder.reduce_forwarder38 numaflow_core.pipeline.forwarder.sink_forwarder39 numaflow_core.pipeline.forwarder.source_forwarder40 numaflow_core.shared.create_componentsgithub.com/numaproj/numaflow/pkg/apis/numaflow/v1alpha11numaflow_core.config.components.reduce2numaflow_core.config.pipeline.isb3numaflow_core.error4numaflow_models.models.abstract_sink5numaflow_models.models.container6numaflow_models.models.container_template7numaflow_models.models.metadata8numaflow_models.models.source9numaflow_models.models.tls10numaflow_throttling11numaflow_core.config.pipeline.watermark12numaflow_core.sinker.sink.serve13numaflow_core.tracker14numaflow_models.models.sink15numaflow_core.config.components.sink16numaflow_models.models.abstract_vertex17numaflow_models.models.mono_vertex_spec18numaflow_models.models.vertex_spec19numaflow_core.config.pipeline20numaflow_models.models.pipeline_spec21numaflow_core.config.monovertex22numaflow_core.watermark.processor.manager23numaflow_core.sinker.sink24numaflow_core.monovertex.bypass_router25numaflow_core.mapper.map26numaflow_core.message27numaflow_core.pipeline.isb.writer28numaflow_core.watermark.isb29numaflow_core.watermark.source30numaflow_core.pipeline.isb.reader31numaflow_core.reduce.reducer.unaligned.reducer32numaflow_core.source33numaflow_core.config.components.source34numaflow_core.metrics35numaflow_core.pipeline.forwarder.map_forwarder36numaflow_core.pipeline.forwarder.reduce_forwarder37numaflow_core.pipeline.forwarder.sink_forwarder38numaflow_core.pipeline.forwarder.source_forwarder39numaflow_core.shared.create_components4011311111111111111111231111111111142232333134322212212351342113111511111121112212121211111221211221112111111111+452 more modules (most-connected shown)

At a glance — Code Health · 46.8 · Weak · gated by R10 ·

At a glance — Architecture · 39.0 · Weak · gated by R11, R9, AX8 ·

At a glance — Maturity · 75.1 · Strong ·

At a glance — Readiness · 50.6 · Adequate · gated by R8, P7 ·

At a glance — Security · 67.6 · Adequate · gated by D29, D31 ·

At a glance — Accessibility · 50.7 · Adequate · gated by AC2, AC4 ·

At a glance — Performance · 100.0 · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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 categoryFindingsSeverity
A02:2025 — Security Misconfiguration288High / Critical
A05:2025 — Injection176High / Critical
A03:2025 — Software Supply Chain Failures82High / Critical

Roadmap

Top priorities: Fix the listed violations: move the shared test helper into a source directory production code may depend on (16 rows); import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (1 row); Remove every production → test project reference: extract any shared test helper into a production support library (which the tests reference), or invert the dependency so the test project depends on production — not the reverse; Break each cycle by extracting the shared piece into a module both sides can import.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Fix the listed violations: move the shared test helper into a source directory production code may depend on (16 rows); import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (1 row).+4.9 ptsMediumImport Boundaries
Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml, package.json.+2.2 ptsLowProject Cohesion
Remove every production → test project reference: extract any shared test helper into a production support library (which the tests reference), or invert the dependency so the test project depends on production — not the reverse.+4.1 ptsMediumTest isolation
Break each cycle by extracting the shared piece into a module both sides can import.+3.9 ptsMediumCircular Imports
Resolve the 1 Dependency pinned to a stale untagged commit finding(s) in Dependency Hygiene.+1.5 ptsLowDependency Hygiene
Go: guard the state handlers share with a sync.Mutex held for the whole update (`mu.Lock(); defer mu.Unlock()`), make counters sync/atomic types (atomic.Int64) and caches a sync.Map, or keep per-request data in locals and the request context. `go test -race` over a handler test confirms the race and then its fix.+2.2 ptsMediumStateful singletons
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.+1.9 ptsMediumCode Duplication
Resolve the 2 Off the main sequence finding(s) in Coupling.+0.9 ptsLowCoupling

File quality

Per-file score 0–10 — a quality signature. Of 255 files carrying findings, judged against the Production bar: 9% slop · 61% mixed · 30% near-clean.

FileScoreBandWorst signal
REDACTED0.0SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.0SlopDependency Vulnerabilities: High CVE: REDACTED
REDACTED0.0SlopDependency Vulnerabilities: High CVE: REDACTED
REDACTED0.0SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.2SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.2SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.3SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.4SlopIaC & Container Security: High IaC: REDACTED
REDACTED0.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.2SlopIaC & Container Security: Critical IaC: REDACTED
REDACTED1.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.6SlopIaC & Container Security: High IaC: REDACTED
REDACTED1.6SlopIaC & Container Security: High IaC: REDACTED
REDACTED1.6SlopIaC & Container Security: High IaC: REDACTED
REDACTED1.7SlopIaC & Container Security: High IaC: REDACTED
REDACTED1.7SlopIaC & Container Security: High IaC: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 216

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 1010

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 297

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 10

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

This survey 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. All 82 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

Every figure here is one of two 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. 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.

What we checked — 82 dimensions across the health lenses
D1D2D3D4D5D6D10D12D13D14D15D16D17D19D20D21D22D24D26D28D29D30D31D34D35D36D37D40D41D42D43D44AC1AC2AC3AC4AC5AC6AX10AX2AX3AX5AX8AX9C2GD1IC1M1M2M3P1P10P2P3P4P6P7PF3R1R10R11R2R3R4R6R7R8R9S1X1X12X16X18X2X21X23X25X27X28X29X4X5

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
  1. 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, 1461 of 1523 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1e888-b3bb-7439-928c-dfb62897deeb.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

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.

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Rust half could not be measured — the Cargo suite in rust did not build, so it was never run. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo — a coverage step in CI (`grcov .`), uploaded by `codecov/codecov-action` and a Codecov configuration (.codecov.yml) shows coverage is measured in your own CI.
  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 456 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 133 test source file(s) (.go, .rs) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source includes .rs, and the rust executor ran against the .rs half and never executed — so reliability was not measured for the repository as a whole. The Go (github.com/numaproj/numaflow): measured (0 flaky) suite(s) did re-run, and came back with 0 flaky across 1 measured tier(s) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted. The half was driven by a runner we ship, so this is not a missing-runner gap.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Go module (REDACTED/go.sum), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its Go dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (start). the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • C2 Access Controls — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • ED5 Idempotency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check decides whether a handler's mutation is safe to re-run by recognising its persistence writes (a database save, a repository write, an event publish) and its guards. Those markers are .NET member names, so in this repository's language a write such as `repository.save(order)` is not recognised and a same-named call on an unrelated library type could be. The handlers were found; their idempotency was neither confirmed nor ruled out.
  • R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 48 further occurrence(s) are not listed individually; the score already reflects all 88.
  • X26 Unsynchronised callback handoff — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X27 Collection changed while being enumerated — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X3 Exception handling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X4 Structured logging — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 30 further occurrence(s) are not listed individually; the score already reflects all 70.
  • X5 Nullable reference types — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 278 further occurrence(s) are not listed individually; the score already reflects all 318.

Repo exclusion declarations: 4 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do 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 — an in-process token-stream comparison over sliding windows, with type-aware normalization — so 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.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • 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").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • 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.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D22 Internal API Consistency: API consistency compares the call shapes of members that play the same role on the exposed C# surface: whether the API suits its callers is not measured, and surfaces in other languages are not measured.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • 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").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • 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.
  • D40 Network Egress Confinement: Egress confinement is read from committed Kubernetes manifests — a policy applied out-of-band (cluster-default deny, a service mesh, or a cloud firewall/security group off-repo) is invisible, and a present NetworkPolicy is declared config, not proof the cluster admission-controller actually enforces it at runtime.
  • D41 Kernel & Syscall Confinement: Syscall/MAC confinement is read from committed manifests — a profile applied by a cluster-wide PodSecurity default or a mutating webhook off-repo isn't seen, and a declared seccomp/AppArmor profile is config presence, not proof the node's kernel actually loaded and enforced it.
  • D42 Runtime Threat Enforcement: Runtime enforcement is read from committed policy files — a Tetragon/Falco/Kyverno stack installed cluster-wide (Helm release, platform add-on) with no in-repo trace can't be credited, and a committed policy is declared intent, not proof the engine is running and blocking in the live cluster.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (REDACTED, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity5.7 / 10Adequate✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 5.7 / 10 · rule-coverage 100% · ceiling Prevented

59 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was index.CustomNode at 76. A further 2 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being index.quantityToScalar at 20 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: ui/src/utils/index.tsx (index.quantityToScalar at 20). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

Source::streaming_read (cyclomatic 24) · ×2rust/numaflow-core/src/source.rs:486
index.CustomNode (cyclomatic 76)ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:75
index.VertexDetails (cyclomatic 68)ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126
index.PipelineCard (cyclomatic 57)ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47
index.CustomEdge (cyclomatic 52)ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56

+ 53 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 2 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with index.CustomNode (cyclomatic 76), index.VertexDetails (cyclomatic 68). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cyclomatic Complexity from 5.7 to about 6.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity4.7 / 10Weak✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 4.7 / 10 · rule-coverage 100% · ceiling Prevented

90 method(s) exceeded the cognitive complexity threshold of 15; the worst was index.CustomNode at 68.

Source::streaming_read (cognitive 65) · ×2rust/numaflow-core/src/source.rs:486
numaflow_core::config::components::parse_kafka_auth_config (cognitive 51) · ×2rust/numaflow-core/src/config/components.rs:18
JetStreamCallbackStore::spawn_central_watcher (cognitive 29) · ×2rust/serving/src/app/store/cbstore/jetstream_store.rs:73
JetStreamDataStore::process_entry (cognitive 22) · ×2rust/serving/src/app/store/datastore/jetstream.rs:232
UserDefinedBatchMap::batch (cognitive 21) · ×2rust/numaflow-core/src/mapper/map/batch.rs:390

+ 80 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 2 bodies over 60 down to 60 or less in Cognitive Complexity — start with index.CustomNode (cognitive 68), Source::streaming_read (cognitive 65). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 4.7 to about 5.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes7.9 / 10Strong✓ 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.

Maturity: Documented → Verified → Prevented · effective 7.9 / 10 · rule-coverage 100% · ceiling Prevented

85 god class(es) detected.

FunctionTooLong: index.PipelineCard · ×54ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47
FileTooLong: metrics/mod.rs · ×17rust/numaflow-core/src/metrics/mod.rs
MethodTooLong: PipelineConfig.load · ×11rust/numaflow-core/src/config/pipeline.rs:298
ClassTooLong: Source · ×3rust/numaflow-core/src/source.rs:246

What to do

  1. Resolve the 54 FunctionTooLong finding(s) in God Classes — start with REDACTED (36), pipelineViewFetch.ts (2), App.tsx (2). — One of this dimension's main actionable groups (54 warning-level).
  2. Resolve the 17 FileTooLong finding(s) in God Classes — start with REDACTED (6), source.rs (2), mod.rs. — One of this dimension's main actionable groups (17 warning-level).
  3. Resolve the 11 MethodTooLong finding(s) in God Classes — start with source.rs (4), pipeline.rs, mod.rs. — One of this dimension's main actionable groups (11 warning-level).

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication8.6 / 10Strong✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.6 / 10 · rule-coverage 100% · ceiling Verified

103 duplicated block group(s) detected. 3.4 % of the production lines (5,337 of 156,502) are in a reported copy. A further 77 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (11 lines × 2) · ×12rust/numaflow-core/src/config/pipeline.rs:320
Duplicated block (8 lines × 2) · ×8rust/numaflow-core/src/mapper/map/stream.rs:270
Duplicated block (13 lines × 2) · ×7rust/numaflow-core/src/mapper/map.rs:551
Duplicated block (12 lines × 2) · ×6rust/extns/numaflow-pulsar/src/source.rs:384
Edited copy of a member (25 corresponding lines) · ×4rust/extns/numaflow-kafka/src/sink.rs:177

+ 97 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 12 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with reducer.rs (2), pipeline.rs, map_forwarder.rs. — One of this dimension's main actionable groups (12 warning-level).
  2. Resolve the 8 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with reducer.rs (3), otel.rs (2), stream.rs. — One of this dimension's main actionable groups (8 warning-level).
  3. Resolve the 7 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with map_forwarder.rs (2), map.rs, metadata.rs. — One of this dimension's main actionable groups (7 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling9.1 / 10Stronggated by 2 serious findings✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 9.1 / 10 · rule-coverage 100% · ceiling Prevented

17 production modules (Cargo+npm+Go), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 3 module(s) off the main sequence, with abstractness counted on 15 of the 17 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

Off the main sequence: numaflow-http · ×2
Off the main sequence: numaflow-shared

What to do

  1. Resolve the 2 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 143 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D10 · Test Quality9.9 / 10Stronggated by 3 serious findings✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Prevented

2 skipped (2 with a documented reason), 3 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 456 tests. Measured on the JavaScript/TypeScript suite only — at least 133 test source file(s) (.go, .rs) went unread, so its test quality is unmeasured and is not in these counts.

No assertions: should not crash if data is null · ×3ui/src/components/pages/Pipeline/partials/Graph/index.test.tsx:719
Mock-dominated test: should pass · ×7ui/src/utils/fetcherHooks/pipelineViewFetch.test.ts:16
Skipped (documented): please update · ×2ui/src/App.test.tsx:15

What to do

  1. Resolve the 7 Mock-dominated test finding(s) in Test Quality — start with podsViewFetch.test.ts (4), pipelineViewFetch.test.ts (2), index.test.tsx. — One of this dimension's main actionable groups (7 recommendation-level).
  2. Resolve the 3 No assertions finding(s) in Test Quality — start with index.test.tsx (3). — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.

D12 · Dependency Hygiene7.8 7.3 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

Maturity: Documented → Verified → Prevented · effective 7.3 / 10 · rule-coverage 94% · ceiling Verified

45 outdated, 0 author-deprecated direct Go module(s), 1 pinning or checksum defect(s). 63 of 63 direct requirement(s) were graded against proxy.golang.org (0 not served there, 4 publishing no tagged release to be behind). Whether any of these modules is UNMAINTAINED is not graded — proxy.golang.org publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, not a registry one. Known CVEs in this module graph are D30's question, read from REDACTED and go.sum there.

Dependency pinned to a stale untagged commit: github.com/gin-contrib/static
Outdated: github.com/IBM/sarama · ×45

What to do

  1. Resolve the 1 Dependency pinned to a stale untagged commit finding(s) in Dependency Hygiene. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets. 1 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 494 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares a Go module (REDACTED/go.sum) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.7 / 10Stronggated by 14 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx (5×68=340); ui/src/components/common/SlidingSidebar/index.tsx (4×50=200); rust/numaflow-core/src/config/pipeline.rs (6×24=144) Repeated repair below the complexity floor: rust/extns/numaflow-pulsar/src/source.rs (3 of 5 changes were fixes); rust/numaflow-shared/src/isb/jetstream.rs (3 of 3 changes were fixes); pkg/apis/numaflow/v1alpha1/mono_vertex_types.go (3 of 3 changes were fixes)

Hotspot: ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx · ×11ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126
Repeated repair: rust/extns/numaflow-pulsar/src/source.rs · ×3rust/extns/numaflow-pulsar/src/source.rs:286

What to do

  1. Resolve the 11 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (5), source.rs (3), pipeline.rs. — One of this dimension's main actionable groups (11 warning-level).
  2. Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with source.rs, jetstream.rs, mono_vertex_types.go. — One of this dimension's main actionable groups (3 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor9.7 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Documented

7 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is rust/numaflow-core/src/shared/otel.rs. Counted over 268 of the 372 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt9.9 / 10Stronggated by 56 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Prevented

56 deducted task-comment markers across 156502 LoC (0.0/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×41ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:116
FixmeComment · ×15rust/serving/src/app/store/datastore.rs:46

What to do

  1. Resolve the 41 TodoComment finding(s) in Explicit Debt — start with REDACTED (4), source.rs (4), error.rs (3). — One of this dimension's main actionable groups (41 warning-level).
  2. Resolve the 15 FixmeComment finding(s) in Explicit Debt — start with append.rs (3), source.rs (3), monovertex.rs (2). — One of this dimension's main actionable groups (15 warning-level).

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 documentation facets pass in full. 122 document(s) read across 2 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs foundrust/numaflow-pb/Cargo.toml:1

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D21 · Naming Consistency3.3 / 10Weak✓ Tool-verified

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

Maturity: Documented → Verified → Prevented · effective 3.3 / 10 · rule-coverage 100% · ceiling Verified

2 naming inconsistencies among 30 declarations measured against a convention their peers follow.

`CtrUdf` spells `Udf` where 12 names in the project spell it `UDF`pkg/apis/numaflow/v1alpha1/const.go:63
`ServerUrl` spells `Url` where 16 names in the project spell it `URL`server/apis/v1/response_metrics.go:67

What to do

  1. Resolve the 1 `CtrUdf` spells `Udf` where 12 names in the project spell it `UDF` finding(s) in Naming Consistency — start with const.go. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 `ServerUrl` spells `Url` where 16 names in the project spell it `URL` finding(s) in Naming Consistency — start with response_metrics.go. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d21_recommendation.md · top locations in Appendix A, every location in findings.md.

D22 · Internal API Consistency10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the internal API surface is consistent and coherent.

Method: Call-shape rules (A1-A9) over the structured code model of the intentionally exposed C# surface: members of one type, overloads of one name and the same slot across sibling types are compared, and a member that makes a caller use a different convention for the same kind of operation is flagged. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 API inconsistencies among 195 exposed members measured against a convention their peers follow.

✓ On the Gold path — maintain.

Detailed fixes: d22_recommendation.md.

D24 · Comment Value3.1 3.0 / 10Weak✓ Tool-verified

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 3.0 / 10 · rule-coverage 97% · ceiling Documented

22 of 319 judged comments only repeat the code they sit on (6.9 %). 12 comment(s) in another language or script were not judged.

redundant comment · ×16ui/src/components/common/SlidingSidebar/index.test.tsx:39

What to do

  1. Resolve the 16 redundant comment finding(s) in Comment Value — start with index.test.tsx (11), REDACTED (4), monoVertexFetch.ts. — One of this dimension's main actionable groups (16 recommendation-level).

Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion7.6 / 10Strong✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 7.6 / 10 · rule-coverage 100% · ceiling Documented

2 of 17 build units (Cargo, Go, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×2rust/numaflow-core/Cargo.toml:1

What to do

  1. Resolve the 2 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml, package.json. — One of this dimension's main actionable groups (2 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.0 / 10Critical✓ Tool-verified

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).

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

176 finding(s): 0 critical, 131 high, 22 medium, 23 low. 91 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 4 file(s) — `hack/git/hooks/commit-msg` (line 10), `pkg/apis/numaflow/v1alpha1/zz_generated.deepcopy.go`, `pkg/apis/proto/isb/message.pb.go`, `ui/src/utils/fetcherHooks/pipelineViewFetch.ts` — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 4 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 13 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 20 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (20 issue-level).
  2. Resolve the 13 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (5), REDACTED (4), REDACTED (2). — One of this dimension's main actionable groups (13 issue-level).
  3. No action in Static Analysis (SAST) — all 91 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (91 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities0.0 / 10Critical✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

76 finding(s): 0 critical, 20 high, 49 medium, 7 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 3 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 18 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (14), REDACTED (4). — One of this dimension's main actionable groups (18 issue-level).
  2. Resolve the 18 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (8), REDACTED (6), REDACTED (4). — One of this dimension's main actionable groups (18 warning-level).
  3. Resolve the 2 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D31 · IaC & Container Security0.0 / 10Critical✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

288 finding(s): 3 critical, 28 high, 196 medium, 61 low.

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 196 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (28), REDACTED (27), REDACTED (26). — One of this dimension's main actionable groups (196 warning-level).
  2. Resolve the 28 High IaC finding(s) in IaC & Container Security — start with REDACTED (5), REDACTED (3), REDACTED (3). — One of this dimension's main actionable groups (28 issue-level).
  3. Resolve the 3 Critical IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness8.5 / 10Adequategated by 1 critical finding✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 8.5 / 10 · rule-coverage 100% · ceiling Documented

39 of 268 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx. Counted over 268 of the 372 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgeui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:1
Orphaned file · ×38rust/extns/numaflow-kafka/src/sink.rs:1
Further orphaned files (smaller)

What to do

  1. Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 38 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (13), lib.rs (2), sink.rs. — One of this dimension's main actionable groups (38 recommendation-level).
  3. 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.

D35 · Change Coupling9.8 / 10Stronggated by 5 serious findings✓ Tool-verified

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. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: map_forwarder.rs↔sink_forwarder.rs 73%; map_forwarder.rs↔source_forwarder.rs 71%; map_forwarder.rs↔reduce_forwarder.rs 71%

Change coupling: batch.rs ↔ stream.rs · ×4rust/numaflow-core/src/mapper/map/batch.rs:1
Change coupling clique: map_forwarder.rs, reduce_forwarder.rs, sink_forwarder.rs, source_forwarder.rsrust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs

What to do

  1. Resolve the 4 Change coupling finding(s) in Change Coupling — start with batch.rs, forwarder.rs, sqs.rs. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 1 Change coupling clique finding(s) in Change Coupling — start with map_forwarder.rs. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 5.0 / 10 · rule-coverage 100% · ceiling Documented

2/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

D40 · Network Egress Confinement6.0 / 10Adequate✓ Tool-verified

What it measures: Whether Kubernetes workloads restrict network EGRESS with a NetworkPolicy (or Cilium policy), limiting where a compromised pod can send data or reach a command-and-control server. Presence of committed egress-restricting policy, not runtime enforcement.

Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn — language-agnostic): Kubernetes workloads gate applicability; credits a NetworkPolicy / Cilium policy that restricts egress (policyTypes: [Egress] / egress rules). Reward-leaning (neutral floor climbing to 10, never a deduction — baseline misconfigs stay with D31). Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

0/2 network-egress controls present (network policy, egress restriction).

No network policy

What to do

  1. Resolve the 1 No network policy finding(s) in Network Egress Confinement. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d40_recommendation.md · top locations in Appendix A, every location in findings.md.

D41 · Kernel & Syscall Confinement6.0 / 10Adequate✓ Tool-verified

What it measures: Whether Kubernetes workloads confine the kernel boundary — a seccomp profile (RuntimeDefault/Localhost) plus an AppArmor/SELinux mandatory-access-control layer — shrinking the syscall attack surface a container escape would use. Presence of committed confinement config, not runtime enforcement.

Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn): on Kubernetes workloads, credits a seccomp profile (RuntimeDefault/Localhost) and an AppArmor/SELinux MAC layer. Reward-leaning (neutral floor climbing to 10); NotApplicable without workloads. Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

0/18 workload(s) run every container under a seccomp profile; 0/18 declare an AppArmor/SELinux profile.

No seccomp profile · ×18REDACTED:281

What to do

  1. Resolve the 18 No seccomp profile finding(s) in Kernel & Syscall Confinement — start with REDACTED (3), REDACTED (3), REDACTED. — One of this dimension's main actionable groups (18 recommendation-level).

Detailed fixes: d41_recommendation.md · top locations in Appendix A, every location in findings.md.

D42 · Runtime Threat Enforcement6.0 / 10Adequate✓ Tool-verified

What it measures: Whether the Kubernetes deployment wires runtime threat enforcement — a detection engine (Tetragon/Falco) and/or an admission-control policy gate (Kyverno / OPA Gatekeeper / PodSecurity). Presence of committed policy, not a runtime guarantee.

Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn): on Kubernetes workloads, credits a runtime threat-detection engine (Tetragon TracingPolicy / Falco) and an admission-control policy (Kyverno / OPA Gatekeeper / PodSecurity). Reward-leaning; NotApplicable without workloads. Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

0/2 runtime-enforcement controls present (threat detection, admission control).

No runtime threat detection
No admission-control policy

What to do

  1. Resolve the 1 No runtime threat detection finding(s) in Runtime Threat Enforcement. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 No admission-control policy finding(s) in Runtime Threat Enforcement. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d42_recommendation.md · top locations in Appendix A, every location in findings.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AC1 · Text alternatives7.3 / 10Strong✓ Tool-verified

Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.

  • An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. — REDACTED:398

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels3.3 / 10Weak✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. — ui/src/components/common/DebouncedSearchInput/index.tsx:48
  • This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×12) — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:185, ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:356, ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:400, …
  • This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. (×7) — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:188, ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:553, ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:579, …
  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. (×2) — REDACTED:314, REDACTED:346

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC4 · Keyboard semantics1.4 / 10Critical✓ Tool-verified

Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. (×11) — ui/src/components/common/SummaryPageLayout/index.tsx:265, ui/src/components/common/SummaryPageLayout/index.tsx:299, ui/src/components/pages/MonoVertex/index.tsx:165, …

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.

Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC6 · Visual & motion safety7.5 / 10Strong✓ Tool-verified

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • `.vertex-health-card-icon` moves (`transition: transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/vertexHealth.css:169

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AX10 · Code composition9.4 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

AX2 · Stateful singletons5.6 / 10Adequate✓ Tool-verified

Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.

Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.

  • `HealthChecker` is shared by every request (`updateUsageTimeline` is called per request from the gRPC service method `PipelineMetadataQuery.StartHealthCheck`, on the one `HealthChecker` value that handler's shared receiver holds) but writes its fields outside any lock (timelineData; e.g. `timelineData` in `updateUsageTimeline` at line 279). Unsynchronised concurrent writes are a data race in Go: an update is lost or a value tears, and a concurrent map write aborts the process. — pkg/daemon/server/service/health_status.go:119

What to do

  • Go: guard the state handlers share with a sync.Mutex held for the whole update (`mu.Lock(); defer mu.Unlock()`), make counters sync/atomic types (atomic.Int64) and caches a sync.Map, or keep per-request data in locals and the request context. `go test -race` over a handler test confirms the race and then its fix.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX5 · Architecture & structure10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.

Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.

AX8 · Test isolation2.5 / 10Weak✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

  • `numaflow-ui-test` ships in a production host and references `@testing-library/jest-dom`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`. — ui/package.json:35
  • `numaflow-ui-test` ships in a production host and references `@testing-library/react`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`. — ui/package.json:36
  • `numaflow-ui-test` ships in a production host and references `@testing-library/user-event`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`. — ui/package.json:37

What to do

  • Remove every production → test project reference: extract any shared test helper into a production support library (which the tests reference), or invert the dependency so the test project depends on production — not the reverse.
AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

C2 · Access Controls7.0 / 10Strong✓ Tool-verified

Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.

Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.

  • Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.

What to do

  • Name the access rules — roles and permissions declared once (an enum Role/Permission, actix-web-grants #[protect(…)], axum-login's permission_required!, a casbin or oso policy) and consulted where access is checked, so the rule set is reviewable and testable on its own.
GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue in this repository's Rust: functions whose whole body is still `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

IC1 · Incompleteness & stubs7.0 / 10Strong✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Rust: functions whose body is `todo!()`/`unimplemented!()` or only panics with a "not implemented" message, match arms and branches left as `todo!()`, functions that take inputs and return a constant (`Ok(())`, `None`, `Default::default()`, an empty `Vec`) or do nothing, and impls most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `pre_rebalance` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — rust/extns/numaflow-kafka/src/source.rs:68
  • `post_rebalance` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — rust/extns/numaflow-kafka/src/source.rs:72
  • `commit_callback` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — rust/extns/numaflow-kafka/src/source.rs:76
  • `mark_wip` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:155
  • `wait_for_paf_resolvers` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — rust/numaflow-core/src/pipeline/isb/writer.rs:406
  • `process_wal_stream` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:361
  • `build_aligned_compaction` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:421
  • `build_unaligned_compaction` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:474
  • `parse_deep_object` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled. — rust/numaflow-models/src/apis/mod.rs:92
  • `deregister` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — rust/numaflow-throttling/src/state/store/redis_store.rs:588
  • `health_check` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — rust/serving/src/app.rs:340

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
M1 · Documentation (README)8.1 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

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 numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability9.6 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • Only 13/15 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `rust/numaflow-pb`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
P3 · Security & performance tooling7.0 / 10Strong✓ Tool-verified

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.

What to do

  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

  • Deployment automation exists and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no manifest in this repository wires them into readiness/liveness probes, a rolling-update strategy, lifecycle hooks or a migration job — a bad release is harder to detect and reverse. If that wiring lives in a separate ops/Helm repository, document the pointer here so release safety is evidenced. — REDACTED:150

What to do

  • Wire the existing health endpoints into readiness/liveness probes and a rolling-update (or blue/green) strategy in the deployment manifests — or document where that wiring lives — so a bad release is caught and rolled back automatically.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

P7 · Outbound HTTP resilience3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.

Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.

  • `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×12) — REDACTED:51, REDACTED:71, REDACTED:58, …
  • `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — rust/numaflow-models/src/apis/configuration.rs:50

What to do

  • Give every `http.Client` an explicit `Timeout` (never call `http.Get`/`http.Post` or `http.DefaultClient`, which have none), or build each request with `http.NewRequestWithContext` under a `context.WithTimeout`; add retry with back-off (`hashicorp/go-retryablehttp`) and a breaker (`sony/gobreaker`) around dependencies that fail.
  • Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

R1 · Type Safety9.9 / 10Exemplary✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

R10 · Code Duplication0.0 / 10Critical✓ Tool-verified

React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.

  • 14 of the duplicated blocks reported below have copies in at least two of the sibling directories Cluster, MonoVertex, Namespace, Pipeline under ui/src/components/pages/. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — ui/src/components/pages/MonoVertex/index.tsx:65
  • 10 duplicated blocks under ui/src/components/pages/Namespace/partials/ have copies in at least two of the sibling directories MonoVertexCard, NamespaceListingWrapper, PipelineCard — 7 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45
  • 8 duplicated blocks under ui/src/components/common/SlidingSidebar/partials/ have copies in at least two of the sibling directories GeneratorDetails, ISBCreate, ISBUpdate, K8sEvents, PipelineCreate, PipelineISBDebugInfo (+2 more sibling(s) not listed) — 5 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1
  • 7 duplicated blocks under ui/src/components/ have copies in at least two of the sibling directories common, pages, plugin — 6 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78
  • ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 · ui/src/utils/fetcherHooks/pipelineViewFetch.ts:15 — the two spans are one implementation copied and then locally edited — 1124 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29
  • ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1 · ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:1 — these 2 files are line-for-line copies of one another — 172 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1
  • ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:76 · ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:48 — the two spans are one implementation copied and then locally edited — 760 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:76
  • ui/src/components/pages/MonoVertex/index.tsx:65 · ui/src/components/pages/Pipeline/index.tsx:72 — the two spans are one implementation copied and then locally edited — 583 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/pages/MonoVertex/index.tsx:65
  • ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:63 · ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:26 — the two spans are one implementation copied and then locally edited — 744 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:63
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:49 — the two spans are one implementation copied and then locally edited — 824 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45
  • ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78 · ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:96 — the two spans are one implementation copied and then locally edited — 604 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78
  • ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:99 · ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:158 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:99
  • ui/src/App.tsx:141 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:80 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/App.tsx:141
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:458 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:493 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:458
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:103 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelineListing/index.tsx:74 — the two spans are one implementation copied and then locally edited — 416 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:103
  • ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:2 · ui/src/utils/fetchWrappers/vertex.ts:2 — these 2 files are line-for-line copies of one another — 76 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:2
  • ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:24 · ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:102 — 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. — ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:24
  • ui/src/utils/fetchWrappers/monoVertexFetch.ts:14 · ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:15 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/utils/fetchWrappers/monoVertexFetch.ts:14
  • ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:47 · ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:57 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:47
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:275 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:311 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:275
  • ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:58 · ui/src/utils/fetchWrappers/pipelineHealthFetch.ts:61 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:58
  • ui/src/utils/fetchWrappers/monoVertexUpdateFetch.ts:1 · ui/src/utils/fetchWrappers/pipelineUpdateFetch.ts:1 — these 2 files are line-for-line copies of one another — 56 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — ui/src/utils/fetchWrappers/monoVertexUpdateFetch.ts:1
  • ui/src/components/common/Breadcrumbs/index.tsx:88 · ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx:33 — the two spans are one implementation copied and then locally edited — 209 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/components/common/Breadcrumbs/index.tsx:88
  • ui/src/components/pages/MonoVertex/partials/MonoVertexStatus/index.tsx:1 · ui/src/components/pages/Pipeline/partials/PipelineStatus/index.tsx:1 — these 2 files are line-for-line copies of one another — 55 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — ui/src/components/pages/MonoVertex/partials/MonoVertexStatus/index.tsx:1
  • ui/src/utils/fetchWrappers/errorsFetch.ts:48 · ui/src/utils/fetchWrappers/monoVertexFetch.ts:42 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/utils/fetchWrappers/errorsFetch.ts:48
  • ui/src/components/pages/Cluster/index.tsx:64 · ui/src/components/pages/Namespace/index.tsx:192 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents. — ui/src/components/pages/Cluster/index.tsx:64
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:222 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:639 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:222
  • ui/src/App.tsx:69 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:32 — the two spans are one implementation copied and then locally edited — 324 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/App.tsx:69
  • ui/src/utils/fetchWrappers/isbServiceDebugFetch.ts:19 · ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:38 — the two spans are one implementation copied and then locally edited — 226 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/src/utils/fetchWrappers/isbServiceDebugFetch.ts:19
  • ui/src/components/pages/MonoVertex/index.tsx:24 · ui/src/components/pages/Pipeline/index.tsx:33 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — ui/src/components/pages/MonoVertex/index.tsx:24
  • ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:8 · ui/src/utils/fetchWrappers/pipelineHealthFetch.ts:8 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:8
  • ui/src/components/pages/Cluster/index.tsx:115 · ui/src/components/pages/Namespace/index.tsx:251 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/pages/Cluster/index.tsx:115
  • ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:355 · ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:461 — 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. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:355
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:70 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelinesTypes.ts:110 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:70
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:111 · ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:148 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:111
  • ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:679 · ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:767 · ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:853 — 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. — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:679
  • ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:134 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:52 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:134
  • ui/src/utils/fetchWrappers/errorsFetch.ts:14 · ui/src/utils/fetchWrappers/monoVertexFetch.ts:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/utils/fetchWrappers/errorsFetch.ts:14
  • ui/src/App.tsx:383 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:263 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — ui/src/App.tsx:383
  • ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:399 · ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:435 — 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. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:399

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R11 · Import Boundaries0.0 / 10Critical✓ Tool-verified

React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).

Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.

  • ui/src/components/common/SlidingSidebar/index.tsx:22 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/index.tsx:22
  • ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/partials/GeneratorUpdate/index.tsx:3 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/partials/GeneratorUpdate/index.tsx:3
  • ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:4
  • ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:14 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:14
  • ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:4
  • ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:4
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:6 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:6
  • ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:7 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:7
  • ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:6 imports ui/src/components/common/SpecEditor/partials/ValidationMessage/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:6
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:34 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:34
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:14 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:14
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:13 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:13
  • ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:36 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:36
  • ui/src/components/pages/Pipeline/index.tsx:29 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Pipeline/index.tsx:29
  • ui/src/components/pages/Pipeline/partials/PipelineISBSummaryStatus/index.tsx:8 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Pipeline/partials/PipelineISBSummaryStatus/index.tsx:8
  • ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:12 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on. — ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:12
  • ui/src/types/declarations/pods.d.ts:1 imports @visx/event/lib/types, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead. — ui/src/types/declarations/pods.d.ts:1

What to do

  • Fix the listed violations: move the shared test helper into a source directory production code may depend on (16 rows); import through the target package's declared public entry rather than a deep path into its internals or a relative path into its directory (1 row).
R2 · Cyclomatic Complexity7.8 / 10Strong✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • CustomNode has cyclomatic complexity 60 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:75
  • backlogCard has cyclomatic complexity 38 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:538
  • PipelineCard has cyclomatic complexity 33 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47
  • lossCard has cyclomatic complexity 32 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:640
  • VertexDetails has cyclomatic complexity 30 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126
  • Flow has cyclomatic complexity 30 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Pipeline/partials/Graph/index.tsx:204
  • (anonymous) has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/index.tsx:210
  • errorsCard has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:788
  • (anonymous) has cyclomatic complexity 25 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts:193
  • (anonymous) has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SpecEditor/index.tsx:303
  • (anonymous) has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:122
  • (anonymous) has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56
  • CopyViewLinkButton has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/CopyViewLinkButton/index.tsx:24
  • (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetchWrappers/pipelineFetch.ts:69
  • PipelineISBDebugInfo has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:564
  • PodInspector has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/PodInspector.tsx:76
  • (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SpecEditor/index.tsx:159
  • NodeInfo has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:21
  • (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/index.tsx:289
  • load has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts:245
  • ISBUpdate has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:54
  • (anonymous) has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetchWrappers/clusterSummaryFetch.ts:34
  • (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/Breadcrumbs/index.tsx:19
  • latencyCard has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:426
  • (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:327
  • (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:201
  • trafficCard has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:479
  • fetchPipeline has cyclomatic complexity 12 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:56
  • (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:70
  • PodViewNext has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.tsx:63
  • (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SpecEditor/index.tsx:437
  • fetchPipeline has cyclomatic complexity 11 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetcherHooks/pipelineViewFetch.ts:60
  • (anonymous) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:182
  • classifyPod has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/podFleetModel.ts:83
  • Routes has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/Routes/index.tsx:11
  • ISBDebugInfo has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/partials/ISBDebugInfo/index.tsx:122
  • BodyCell has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:232
  • (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/src/components/common/SpecEditor/index.tsx:130
R3 · Large Files5.0 / 10Adequate✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • ui/src/components/pages/Pipeline/partials/Graph/index.tsx has 1001 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/pages/Pipeline/partials/Graph/index.tsx:1
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts has 862 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:1
  • ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx has 850 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:1
  • ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx has 835 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:1
  • ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx has 758 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:1
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:1
  • ui/src/utils/fetcherHooks/pipelineViewFetch.ts has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/utils/fetcherHooks/pipelineViewFetch.ts:1
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:1
  • ui/src/components/common/SpecEditor/index.tsx has 552 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SpecEditor/index.tsx:1
  • ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:1
  • REDACTED has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:1
  • ui/src/utils/fetcherHooks/monoVertexViewFetch.ts has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:1
  • ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:1
  • ui/src/utils/index.tsx has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/src/utils/index.tsx:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage9.4 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×7) — ui/src/components/plugin/NumaflowMonitorApp/App.tsx:1, ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx:1, ui/src/themes/index.ts:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • The package in `ui` declares the lint script `lint` (`eslint . --ext .tsx`), but no step of this repository's CI runs it, by name, through another script, a REDACTED target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs `npm run lint` in `ui` (or the workspace's task runner). — ui/package.json:93
R7 · Dead Code9.5 / 10Exemplary✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • Unreachable from the 32 application, 9 tooling and 77 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (32 application, 9 tooling, 77 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×3) — ui/src/components/plugin/NumaflowMonitorApp/App.tsx, ui/src/mockData.ts, ui/src/types/globals.ts
  • no import path from any entry point (32 application, 9 tooling, 77 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (ui/src/components/plugin/NumaflowMonitorApp/App.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it (×2) — ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx, ui/src/components/plugin/Routes/Routes.tsx
  • Nothing imports this binding — it is safe to review for removal. (×5) — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:1, ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelinesTypes.ts:1, ui/src/utils/monoVertexGraphLayout.ts:17, …

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene0.0 / 10Critical✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. (×3) — ui/src/utils/observabilityURLState.ts:1, ui/src/setupProxy.js:1, ui/src/App.tsx:15
  • Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×23) — ui/package.json:26, ui/package.json:27, ui/package.json:28, …
  • Only test files import it (first: ui/src/components/common/AccountMenu/index.test.tsx:2) — move it to devDependencies. — ui/package.json:36
  • Only test files import it (first: ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.test.tsx:6) — move it to devDependencies. — ui/package.json:37
  • Only test files import it (first: ui/src/utils/fetcherHooks/pipelineViewFetch.test.ts:3) — move it to devDependencies. — ui/package.json:77
  • Only test files import it (first: ui/src/components/pages/Pipeline/index.test.tsx:8) — move it to devDependencies. — ui/package.json:80

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports2.8 / 10Weak✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

  • ui/src/App.tsx → ui/src/components/common/AccountMenu/index.tsx → ui/src/App.tsx (one verified cycle inside a mutually-dependent group of 57 files) — ui/src/App.tsx:34

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

Other · Security — Read from this repository's Rust source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves HTTP itself (`axum_server::bind_rustls(` (rust/serving/src/app.rs:70)), so its Rust source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Rust spelling appears in production source, not proven on every route. A Rocket 0.5 application is credited the headers Rocket's default `Shield` sends unless it attaches its own, and its cookie jar's SameSite=Strict default; a session middleware its default cookie flags.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Rust server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: `axum_server::bind_rustls(` (rust/serving/src/app.rs:70).

What to do

  • Set security response headers on what the server sends — actix-web's `DefaultHeaders::new().add((header::X_CONTENT_TYPE_OPTIONS, "nosniff"))`, tower-http's `SetResponseHeaderLayer::overriding(…)` on an axum router, or keep Rocket's default `Shield` — with `Content-Security-Policy`, `X-Content-Type-Options` and a frame policy on every response.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation5.2 / 10Adequate✓ Tool-verified

Other · Code Health — Whether functions that make a cancellable request accept or pass on a context.Context or an AbortSignal (adoption curve).

Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.

  • Only 5/25 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial) accept a context.Context or an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` (Go: `ctx context.Context`) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `fetchData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. (×2) — ui/src/App.tsx:120, ui/src/utils/fetchWrappers/fetch.ts:28
  • `fetchPipeline` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. (×2) — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:56, ui/src/utils/fetcherHooks/pipelineViewFetch.ts:60
  • `fetchBuffers` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/src/utils/fetcherHooks/pipelineViewFetch.ts:117
  • `fetchPods` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/src/utils/fetcherHooks/podsViewFetch.ts:33
  • `getMetricsDiscoveryData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/src/utils/fetchWrappers/metricsDiscoveryDataFetch.ts:27
  • `patchStatus` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. (×3) — ui/src/components/pages/Pipeline/partials/Graph/index.tsx:294, ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:266, ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:180
  • `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. (×10) — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:71, ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:134, ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:93, …

What to do

  • Thread a context.Context or an AbortSignal through functions that make requests, so the work stops when its caller gives up.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob7.0 / 10Strong✓ Tool-verified

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

  • `NackOptions.max_deliveries` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — rust/numaflow-core/src/message.rs:538
  • `NackOptions.reason` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — rust/numaflow-core/src/message.rs:540
  • `NackOptions.nack_map` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing. — rust/numaflow-core/src/message.rs:542

What to do

  • Each finding names the spans that disagree — the knob the caller supplies and the site that ignores it, whether by re-spelling its default, by falling back under the wrong key, by parsing with no format provider at all, or by printing under whatever culture the host supplies. Confirm from those spans, then decide which of the two the type meant: read the knob at the named site, or drop the knob so the signature stops advertising something the type cannot feel. Leaving both is the one option that cannot be right.
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for … range` leaves the slice or map it is walking alone — Go raises nothing, but the walk and the collection part: a range evaluates its slice once, so an element appended in the body is never visited and a removal by reslicing (`s = append(s[:i], s[i+1:]...)`, `slices.Delete`) shifts the next element under the index, which is then skipped while the last is read twice; a reslice, a reassignment or a sort leaves every later `s[i]` naming another element; and a map's order is unspecified, so deleting another key (or clearing the map) changes from run to run which entries the loop still sees.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X4 · Structured logging5.7 / 10Adequate✓ Tool-verified

Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.

Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.

  • `info!` at line 290 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/config.rs:290
  • `debug!` at line 195 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/metrics.rs:195
  • `debug!` at line 304 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/app/jetstream_proxy.rs:304
  • `debug!` at line 339 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/app/jetstream_proxy.rs:339
  • `debug!` at line 424 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/app/jetstream_proxy.rs:424
  • `error!` at line 417 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/app/store/datastore/jetstream.rs:417
  • `error!` at line 479 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/serving/src/app/store/datastore/jetstream.rs:479
  • `warn!` at line 124 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-throttling/src/state.rs:124
  • `info!` at line 125 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-throttling/src/state/store/in_memory_store.rs:125
  • `info!` at line 159 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-throttling/src/state/store/in_memory_store.rs:159
  • `info!` at line 463 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-shared/src/server_info.rs:463
  • `debug!` at line 94 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-daemon/src/api.rs:94
  • `info!` at line 37 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-daemon/src/lib.rs:37
  • `info!` at line 161 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/lib.rs:161
  • `info!` at line 178 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/lib.rs:178
  • `error!` at line 567 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/source.rs:567
  • `error!` at line 844 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/source.rs:844
  • `error!` at line 1435 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/source.rs:1435
  • `error!` at line 395 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/transformer.rs:395
  • `info!` at line 150 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/watermark/source/source_wm_fetcher.rs:150
  • `debug!` at line 73 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/watermark/processor/timeline.rs:73
  • `info!` at line 263 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/watermark/isb/wm_fetcher.rs:263
  • `error!` at line 410 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/sinker/sink.rs:410
  • `info!` at line 23 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/sinker/sink/log.rs:23
  • `error!` at line 29 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/shared/metrics.rs:29
  • `error!` at line 78 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/app.rs:78
  • `error!` at line 291 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/runtime.rs:291
  • `error!` at line 312 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/runtime.rs:312
  • `error!` at line 358 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/runtime.rs:358
  • `error!` at line 447 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/runtime.rs:447
  • `error!` at line 452 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/runtime_server/runtime.rs:452
  • `info!` at line 412 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:412
  • `error!` at line 695 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:695
  • `info!` at line 213 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:213
  • `error!` at line 369 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:369
  • `error!` at line 556 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:556
  • `error!` at line 564 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:564
  • `error!` at line 117 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:117
  • `info!` at line 286 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:286
  • `info!` at line 324 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:324

What to do

  • Interpolated log message defeats structured logging
X5 · Nullable reference types8.9 / 10Strong✓ Tool-verified

Other · Code Health — Whether Rust's absent values are handled rather than forced — `Option` and `Result` make absence a value the caller must handle in every crate, and each `.unwrap()` or `.expect()` that no guard on its path proves present is a panic the first time the value is `None` or `Err`.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • `HeaderName::from_bytes(app.settings.tid_header.as_bytes())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `router_with_auth` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:148
  • `req.extensions().get::<Tid>()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `router_with_auth` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:173
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `graceful_shutdown` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:225
  • `signal::unix::signal(signal::unix::SignalKind::terminate())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `graceful_shutdown` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:230
  • `header.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `validate_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — rust/serving/src/app.rs:254, rust/serving/src/app.rs:261
  • `Response::builder().status(StatusCode::BAD_REQUEST).body(Body::from(format!("Header-ID should not contain '.', found {}",header.to_str().expect("header should be a string"))))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `validate_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:263
  • `Response::builder().status(401).body(Body::empty())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `auth_middleware` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — rust/serving/src/app.rs:291, rust/serving/src/app.rs:300
  • `auth_token.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `auth_middleware` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app.rs:294
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/callback.rs:99
  • `Utc::now().timestamp_nanos_opt()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/callback.rs:102
  • `serde_json::to_string(&callback_payload)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/callback.rs:107
  • `env_vars.get(ENV_MIN_PIPELINE_SPEC)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/config.rs:146
  • `env_vars.get(ENV_NUMAFLOW_POD)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/config.rs:272
  • `auth.token` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/config.rs:284
  • `encode(&mut buffer,&state)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `metrics_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/metrics.rs:194
  • `axum::http::Response::builder().status(StatusCode::OK).body(Body::from(buffer))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `metrics_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/metrics.rs:199
  • `request.uri().path_and_query()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `proxy` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/direct_proxy.rs:48
  • `Response::builder().status(StatusCode::NOT_FOUND).body(Body::new(format!("Failed to fetch response for {id} from store: {e}")))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `fetch` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:95
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sse_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:179
  • `publish_result` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `publish_to_jetstream` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:214
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:295
  • `HeaderName::from_str(proxy_state.tid_header)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:355
  • `HeaderValue::from_str(&id)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:356
  • `val` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `async_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:438
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `async_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/jetstream_proxy.rs:477
  • `sub_graph_generator.generate_subgraph_from_callbacks(msg_id.clone(),callbacks.clone())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `process_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/orchestrator.rs:107
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `process_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — rust/serving/src/app/orchestrator.rs:113, rust/serving/src/app/orchestrator.rs:117
  • `tx.send(Ok(graph))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `process_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/orchestrator.rs:122
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `retrieve_saved` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/orchestrator.rs:156
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `stream_response` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×3) — rust/serving/src/app/orchestrator.rs:233, rust/serving/src/app/orchestrator.rs:237, rust/serving/src/app/orchestrator.rs:254
  • `initial_status.clone().try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `register` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/store/status.rs:134
  • `request_type.try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `register` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/store/status.rs:150
  • `status.try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `update_status` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — rust/serving/src/app/store/status.rs:267
  • `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `spawn_central_watcher` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — rust/serving/src/app/store/datastore/jetstream.rs:140, rust/serving/src/app/store/datastore/jetstream.rs:194

What to do

  • Each row is a forced `Option`/`Result` no guard on its path proves present. Handle the absent case where it arises rather than forcing it: `?` to hand it to the caller, `if let` / `match` / `let … else` to branch on it, `unwrap_or` / `unwrap_or_default` / `unwrap_or_else` where a default is right. Where the value genuinely cannot be absent, say so in a way a reader can check from the line: test it first (`if x.is_none() { return … }`), look the key up with `contains_key` or the index against `len()`, or construct the value so it cannot be absent.

WCAG coverage — what static analysis assessed

Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only

Not statically assessed — these 40 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

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.

LensScoreRatingImpact
Code Health46.8Weak — gated by R10Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture39.0Weak — gated by R11, R9, AX8Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity75.1StrongSolid.
Readiness50.6Adequate — gated by R8, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security67.6Adequate — gated by D29, D31Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility50.7Adequate — gated by AC2, AC4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100.0ExemplaryStrongest area.
Unscored — 2 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 10 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 47 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.

  • AX1 Captive dependencies — Not applicable: this repository's Go imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX4 Dependency direction — not applicable to a CQRS architecture (the inward-dependency rule is for layered/clean styles)
  • AX6 Interface segregation — AX6 reached only 19% of this repository's production lines — rust (101,313 lines), lua (148 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not scored — polyglot repository, one half's runner produced no measurement
  • 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.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. 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"]`.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • 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 measured — Rust suite
  • DM1 Domain Modelling — applicable but not scored (1 of 2 signals for this style — below the bar we score at): 21 value object(s)
  • ED1 Handler temporal coupling — no events and no event/broker handlers detected — event-driven integration not assessable
  • ED2 Event/command shape — no events and no event/broker handlers detected — event-driven integration not assessable
  • ED3 Event naming — no events and no event/broker handlers detected — event-driven integration not assessable
  • ED4 Outbox / dual-write — no events and no event/broker handlers detected — event-driven integration not assessable
  • ED5 Idempotency — Not assessed, and this one is on us: 1 command handler(s) or message consumer(s) were found here, but this check does not yet recognise persistence writes in this repository's language. Idempotency was neither confirmed nor ruled out — this is a limit of the analyzer, not a finding about your code.
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • M4 Documentation accuracy — Not applicable: the 122 current-state document(s) make no claim of a kind M4 checks. 57 claim(s) of kinds M4 does not check were not checked (path 7, environment variable 46, setting 1, route 3); M4 checks only links and versions and artefact counts.
  • P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R5 Dependency Freshness — uses a yarn lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — X26 reached only 0% of this repository's production lines — rust (101,313 lines), typescript (23,656 lines), lua (148 lines), javascript (11 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X3 Exception handling — X3 reached only 19% of this repository's production lines — rust (101,313 lines), lua (148 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

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.

Critical — 216 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 66 more in this group — see findings.md.
D31 · IaC & Container Security · High IaC · ×28
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 3 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×18
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <label> that labels no control · ×12
  • <label> that labels no control ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:185 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:356 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:400 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:436 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:462 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:215 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:250 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:291 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control REDACTED:313 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control REDACTED:345 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:289 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:330 — This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC4 · Keyboard semantics · Click handler on a non-interactive <div> · ×8
  • Click handler on a non-interactive <div> ui/src/components/pages/MonoVertex/index.tsx:165 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:121 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Namespace/index.tsx:156 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Namespace/index.tsx:245 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Pipeline/index.tsx:229 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:298 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Pipeline/partials/PipelineISBSummaryStatus/index.tsx:117 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <div> ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:150 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
AC4 · Keyboard semantics · Click handler on a non-interactive <img> · ×3
  • Click handler on a non-interactive <img> ui/src/components/common/SummaryPageLayout/index.tsx:265 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <img> ui/src/components/common/SummaryPageLayout/index.tsx:299 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
  • Click handler on a non-interactive <img> ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:852 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
AX8 · Test isolation · Production project references a test package · ×3
  • Production project references a test package: numaflow-ui-test → @testing-library/jest-dom ui/package.json:35 — `numaflow-ui-test` ships in a production host and references `@testing-library/jest-dom`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`.
  • Production project references a test package: numaflow-ui-test → @testing-library/react ui/package.json:36 — `numaflow-ui-test` ships in a production host and references `@testing-library/react`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`.
  • Production project references a test package: numaflow-ui-test → @testing-library/user-event ui/package.json:37 — `numaflow-ui-test` ships in a production host and references `@testing-library/user-event`, a package that exists only to test. It puts a test framework, double or assertion library into the shipped product. Move the code that uses it into a test project, or replace it with production code. If `numaflow-ui-test` is itself a plugin, matcher or preset of the test framework, declare the framework under `peerDependencies` (and `devDependencies`) instead of `dependencies`.
D31 · IaC & Container Security · Critical IaC · ×3
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <input> without a programmatic label · ×2
  • <input> without a programmatic label REDACTED:314 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label REDACTED:346 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×2
  • REDACTED
  • REDACTED
AC1 · Text alternatives · <img> without a text alternative · ×1
  • <img> without a text alternative REDACTED:398 — An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×1
  • Orphaned knowledge ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
R8 · Dependency Hygiene · Unlisted import 'history' · ×1
  • Unlisted import 'history' ui/src/utils/observabilityURLState.ts:1 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'http-proxy-middleware' · ×1
  • Unlisted import 'http-proxy-middleware' ui/src/setupProxy.js:1 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'lodash' · ×1
  • Unlisted import 'lodash' ui/src/App.tsx:15 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R9 · Circular Imports · Import cycle (2 files) · ×1
  • Import cycle (2 files) ui/src/App.tsx:34 — ui/src/App.tsx → ui/src/components/common/AccountMenu/index.tsx → ui/src/App.tsx (one verified cycle inside a mutually-dependent group of 57 files)
Serious — 1010 finding(s)
D31 · IaC & Container Security · Medium IaC · ×196
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 171 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×54
  • FunctionTooLong: index.PipelineCard ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47 — FunctionTooLong — PipelineCard runs 613 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 513 over it, 6.13× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: pipelineViewFetch.usePipelineViewFetch ui/src/utils/fetcherHooks/pipelineViewFetch.ts:15 — FunctionTooLong — usePipelineViewFetch runs 496 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 396 over it, 4.96× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.MonoVertexCard ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:44 — FunctionTooLong — MonoVertexCard runs 479 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 379 over it, 4.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.VertexDetails ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126 — FunctionTooLong — VertexDetails runs 468 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 368 over it, 4.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.Login REDACTED:37 — FunctionTooLong — Login runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.Flow ui/src/components/pages/Pipeline/partials/Graph/index.tsx:204 — FunctionTooLong — Flow runs 405 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 305 over it, 4.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.K8sEvents ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:37 — FunctionTooLong — K8sEvents runs 403 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 303 over it, 4.03× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.NamespaceListingWrapper ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:113 — FunctionTooLong — NamespaceListingWrapper runs 319 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 219 over it, 3.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: monoVertexViewFetch.useMonoVertexViewFetch ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 — FunctionTooLong — useMonoVertexViewFetch runs 317 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 217 over it, 3.17× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.PipelineISBDebugInfo ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:564 — FunctionTooLong — PipelineISBDebugInfo runs 304 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 204 over it, 3.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.ISBUpdate ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:54 — FunctionTooLong — ISBUpdate runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.ClusterNamespaceListing ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:31 — FunctionTooLong — ClusterNamespaceListing runs 269 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 169 over it, 2.69× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: App.App ui/src/App.tsx:71 — FunctionTooLong — App runs 265 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 165 over it, 2.65× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.CustomEdge ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56 — FunctionTooLong — CustomEdge runs 264 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 164 over it, 2.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.Graph ui/src/components/pages/Pipeline/partials/Graph/index.tsx:716 — FunctionTooLong — Graph runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: ISBServiceCard.ISBServiceCard ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:30 — FunctionTooLong — ISBServiceCard runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.Pipeline ui/src/components/pages/Pipeline/index.tsx:41 — FunctionTooLong — Pipeline runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.NodeInfo ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:21 — FunctionTooLong — NodeInfo runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.SlidingSidebar ui/src/components/common/SlidingSidebar/index.tsx:93 — FunctionTooLong — SlidingSidebar runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.Buffers ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx:120 — FunctionTooLong — Buffers runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: App.App ui/src/components/plugin/NumaflowMonitorApp/App.tsx:34 — FunctionTooLong — App runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.PipelineListing ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelineListing/index.tsx:26 — FunctionTooLong — PipelineListing runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.PipelineUpdate ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:18 — FunctionTooLong — PipelineUpdate runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.PipelineCreate ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:44 — FunctionTooLong — PipelineCreate runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: index.PodViewNext ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.tsx:63 — FunctionTooLong — PodViewNext runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • + 29 more in this group — see findings.md.
D17 · Explicit Debt · TodoComment · ×41
  • TodoComment ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:116 — // const eventList = rawDataToEventListing(MOCK_DATA); // TODO REMOVE MOCK — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/utils/fetchWrappers/vertex.ts:100 — // const eventList = rawDataToEventListing(MOCK_DATA); // TODO REMOVE MOCK — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts:110 — // TODO how to map ISB to pipeline? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:81 — //TODO add check for healthy/unhealthy node and update imported images accordingly — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/components/pages/MonoVertex/index.tsx:32 — // TODO add health status + processing rate once implemented — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/components/common/AccountMenu/index.tsx:22 — // TODO on failure? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment ui/src/components/common/AccountMenu/index.tsx:24 — // TODO on failure? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/app.rs:38 — // TODO: merge message_path and tracker — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/error.rs:4 — // TODO: introduce module level error handling — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/error.rs:14 — // TODO: store the ID too? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/lib.rs:86 — // TODO: is try_join the best? we need to short-circuit at the first failure — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/app/direct_proxy.rs:19 — // TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/app/store/status.rs:142 — // TODO: This makes `discard` method trickier. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/serving/src/app/store/status.rs:212 — // TODO: There can be a case where the pod terminates without updating the request — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-throttling/src/state.rs:39 — /// TODO: Find a way to remove this as it is only being used to pass value from — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-shared/src/server_info.rs:412 — // TODO - remove all the extra check above once rust semver handles pre-release comparison the same way as golang. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-shared/src/server_info.rs:560 — // TODO: populate this from a static file and make it part of the release process — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-shared/src/isb/jetstream.rs:152 — // TODO: make these configurable. today this is hardcoded on Golang code too. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-daemon/src/service.rs:16 — /// TODO - switch to the full CR when we need more informations. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/source.rs:1642 — // TODO: flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/source/user_defined.rs:631 — // TODO: flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/sinker/sink/sqs.rs:477 — // TODO: flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs:903 — // TODO: flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/transformer.rs:340 — // TODO: emit nacked message metrics — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment rust/numaflow-core/src/watermark/idle/isb.rs:48 — // TODO(vigith): rename ISBIdleDetector to ISBIdleManager, it is not just detecting, but also managing the idle state. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 16 more in this group — see findings.md.
X5 · Nullable reference types · Symbol treated as nullable, then dereferenced unguarded · ×40
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:148 — `HeaderName::from_bytes(app.settings.tid_header.as_bytes())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `router_with_auth` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:173 — `req.extensions().get::<Tid>()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `router_with_auth` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:225 — `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `graceful_shutdown` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:230 — `signal::unix::signal(signal::unix::SignalKind::terminate())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `graceful_shutdown` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:254 — `header.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `validate_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:261 — `header.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `validate_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:263 — `Response::builder().status(StatusCode::BAD_REQUEST).body(Body::from(format!("Header-ID should not contain '.', found {}",header.to_str().expect("header should be a string"))))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `validate_request` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:291 — `Response::builder().status(401).body(Body::empty())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `auth_middleware` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:294 — `auth_token.to_str()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `auth_middleware` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app.rs:300 — `Response::builder().status(401).body(Body::empty())` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `auth_middleware` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/callback.rs:99 — `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/callback.rs:102 — `Utc::now().timestamp_nanos_opt()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/callback.rs:107 — `serde_json::to_string(&callback_payload)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `callback` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/config.rs:146 — `env_vars.get(ENV_MIN_PIPELINE_SPEC)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/config.rs:272 — `env_vars.get(ENV_NUMAFLOW_POD)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/config.rs:284 — `auth.token` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `try_from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/metrics.rs:194 — `encode(&mut buffer,&state)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `metrics_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/metrics.rs:199 — `axum::http::Response::builder().status(StatusCode::OK).body(Body::from(buffer))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `metrics_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/direct_proxy.rs:48 — `request.uri().path_and_query()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `proxy` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:95 — `Response::builder().status(StatusCode::NOT_FOUND).body(Body::new(format!("Failed to fetch response for {id} from store: {e}")))` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `fetch` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:179 — `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sse_handler` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:214 — `publish_result` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `publish_to_jetstream` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:295 — `` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:355 — `HeaderName::from_str(proxy_state.tid_header)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • Symbol treated as nullable, then dereferenced unguarded rust/serving/src/app/jetstream_proxy.rs:356 — `HeaderValue::from_str(&id)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `sync_publish` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`).
  • + 15 more in this group — see findings.md.
X2 · Cancellation propagation · Async function without AbortSignal · ×20
  • Async function without AbortSignal: fetchData ui/src/App.tsx:120 — `fetchData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchPipeline ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:56 — `fetchPipeline` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchPipeline ui/src/utils/fetcherHooks/pipelineViewFetch.ts:60 — `fetchPipeline` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchBuffers ui/src/utils/fetcherHooks/pipelineViewFetch.ts:117 — `fetchBuffers` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchPods ui/src/utils/fetcherHooks/podsViewFetch.ts:33 — `fetchPods` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: fetchData ui/src/utils/fetchWrappers/fetch.ts:28 — `fetchData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: getMetricsDiscoveryData ui/src/utils/fetchWrappers/metricsDiscoveryDataFetch.ts:27 — `getMetricsDiscoveryData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: patchStatus ui/src/components/pages/Pipeline/partials/Graph/index.tsx:294 — `patchStatus` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: patchStatus ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:266 — `patchStatus` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: patchStatus ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:180 — `patchStatus` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:71 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:134 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:93 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:146 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:116 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:169 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:115 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:174 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:51 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
  • Async function without AbortSignal: postData ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:110 — `postData` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
D30 · Dependency Vulnerabilities · Medium CVE · ×18
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · FileTooLong · ×17
  • FileTooLong: metrics/mod.rs rust/numaflow-core/src/metrics/mod.rs — FileTooLong — 1179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 679 over it, 2.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/source.rs rust/numaflow-core/src/source.rs — FileTooLong — 903 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: Source (2 blocks, 246-1451). The bar is 500 significant lines; this is 403 over it, 1.81× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: Graph/index.tsx ui/src/components/pages/Pipeline/partials/Graph/index.tsx — FileTooLong — 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: PipelineISBDebugInfo/index.tsx ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx — FileTooLong — 793 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 293 over it, 1.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: src/source.rs rust/extns/numaflow-sqs/src/source.rs — FileTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 272 over it, 1.54× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: CustomNode/index.tsx ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx — FileTooLong — 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: CustomNode (75-871). The bar is 500 significant lines; this is 214 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: PodViewNext/goldenSignalsModel.ts ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts — FileTooLong — 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: shared/create_components.rs rust/numaflow-core/src/shared/create_components.rs — FileTooLong — 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 155 over it, 1.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: PipelineCard/index.tsx ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx — FileTooLong — 655 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PipelineCard (47-781). The bar is 500 significant lines; this is 155 over it, 1.31× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: VertexDetails/index.tsx ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx — FileTooLong — 572 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: VertexDetails (126-689). The bar is 500 significant lines; this is 72 over it, 1.14× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: sinker/sink.rs rust/numaflow-core/src/sinker/sink.rs — FileTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 81% of them inside a single declaration: SinkWriter (2 blocks, 120-787). The bar is 500 significant lines; this is 71 over it, 1.14× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: src/lib.rs rust/extns/numaflow-http/src/lib.rs — FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 67 over it, 1.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: config/pipeline.rs rust/numaflow-core/src/config/pipeline.rs — FileTooLong — 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 69% of them inside a single declaration: PipelineConfig (3 blocks, 61-755). The bar is 500 significant lines; this is 49 over it, 1.10× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: shared/otel.rs rust/numaflow-core/src/shared/otel.rs — FileTooLong — 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 33 over it, 1.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: MonoVertexCard/index.tsx ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx — FileTooLong — 517 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MonoVertexCard (44-642). The bar is 500 significant lines; this is 17 over it, 1.03× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: fetcherHooks/pipelineViewFetch.ts ui/src/utils/fetcherHooks/pipelineViewFetch.ts — FileTooLong — 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: usePipelineViewFetch (15-690). The bar is 500 significant lines; this is 9 over it, 1.02× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: unaligned/reducer.rs rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs — FileTooLong — 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 2 over it, 1.00× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
R11 · Import Boundaries · Boundary violation [package · ×17
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/index.tsx:22 — ui/src/components/common/SlidingSidebar/index.tsx:22 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/partials/GeneratorUpdate/index.tsx:3 — ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/partials/GeneratorUpdate/index.tsx:3 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:4 — ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:14 — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:14 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:4 — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:4 — ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:4 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:6 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:6 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:7 — ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:7 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:6 — ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:6 imports ui/src/components/common/SpecEditor/partials/ValidationMessage/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:34 — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:34 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:14 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:14 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:13 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:13 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:36 — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:36 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Pipeline/index.tsx:29 — ui/src/components/pages/Pipeline/index.tsx:29 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Pipeline/partials/PipelineISBSummaryStatus/index.tsx:8 — ui/src/components/pages/Pipeline/partials/PipelineISBSummaryStatus/index.tsx:8 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:test-suite-dependency] ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:12 — ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:12 imports ui/src/components/common/SpecEditor/index.tsx, a module inside the test suite — test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on.
  • Boundary violation [package:third-party-deep-import] ui/src/types/declarations/pods.d.ts:1 — ui/src/types/declarations/pods.d.ts:1 imports @visx/event/lib/types, reaching past a declared dependency's public entry into its build output — that path is the package's toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package's documented entry point instead.
D30 · Dependency Vulnerabilities · Medium advisory (unsound) · ×16
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D17 · Explicit Debt · FixmeComment · ×15
  • FixmeComment rust/serving/src/app/store/datastore.rs:46 — /// FIXME: make pod_hash optional — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/serving/src/app/store/datastore/user_defined.rs:36 — // FIXME(serving): we need to return the origin details along with the payload — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-throttling/src/state.rs:27 — // FIXME: use me — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/monovertex.rs:283 — // FIXME: we need to have a better way, this is flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/monovertex.rs:290 — // FIXME: we need to have a better way, this is flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/metrics/mod.rs:2007 — // FIXME: we need to have a better way, this is flaky — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/reduce/wal/segment/append.rs:511 — // FIXME: why does this hang? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/reduce/wal/segment/append.rs:568 — // FIXME: why does this hang? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/reduce/wal/segment/append.rs:661 — // FIXME: why does this hang? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/pipeline/isb/inmemory/buffer.rs:142 — // FIXME: this does not look very efficient since we will be calling reclaim_acked — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/numaflow-core/src/config/components/sink.rs:47 — // FIXME(cr): why is sink.fallback Box<AbstrackSink> vs. sink Box<Sink>. This is coming from — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/extns/numaflow-pulsar/src/source.rs:311 — // FIXME: add error metrics. Also, respect the timeout — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/extns/numaflow-pulsar/src/source.rs:332 — //FIXME: NACK the message — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/extns/numaflow-pulsar/src/source.rs:341 — // FIXME: This is partition key. Identify the correct option. Also, there is a partition_key_b64_encoded boolean option in Pulsar metadata — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment rust/extns/numaflow-http/src/lib.rs:205 — // FIXME: As of today we have a hard timeout of 30 secs from K8s, we have not exposed a way to increase it. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×13
  • Outbound HTTP without resilience REDACTED:51 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:71 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:58 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:111 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:54 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:94 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:51 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:59 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:58 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:109 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:54 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:94 — `http.Client{` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience rust/numaflow-models/src/apis/configuration.rs:50 — `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×12
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/config/pipeline.rs:320 — rust/numaflow-core/src/config/pipeline.rs:320-330 | rust/numaflow-shared/src/isb/jetstream.rs:220-230 — 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 `rust/numaflow-core/src/config/pipeline.rs:320` 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 first that the copies are not typed on the same thing: the declarations holding them bind `env_vars` to `impl IntoIterator<Item = (impl Into<String>, impl Into<String>)>` in one and `HashMap<String, String>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:317 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:317-327 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:311-321 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/pipeline/isb/inmemory/error_injector.rs:170 — rust/numaflow-core/src/pipeline/isb/inmemory/error_injector.rs:170-180 | rust/numaflow-shared/src/kv/inmemory/error_injector.rs:172-182 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:645 — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:645-655 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:667-677 — 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 `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:645` 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) rust/numaflow-core/src/shared/grpc.rs:159 — rust/numaflow-core/src/shared/grpc.rs:159-169 | rust/numaflow-sideinput/src/manager/client.rs:87-97 — 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 (11 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:687 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:687-697 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:821-831 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/monovertex/bypass_router.rs:246 — rust/numaflow-core/src/monovertex/bypass_router.rs:246-257 | rust/numaflow-core/src/sinker/sink.rs:239-249 — 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 `rust/numaflow-core/src/monovertex/bypass_router.rs: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. Note first that the copies are not typed on the same thing: the declarations holding them bind `messages_stream` to `ReceiverStream<MessageToSink>` in one and `ReceiverStream<MessageHandle>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (11 lines × 2) rust/numaflow-core/src/monovertex/forwarder.rs:127 — rust/numaflow-core/src/monovertex/forwarder.rs:127-137 | rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:78-88 — 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 `rust/numaflow-core/src/monovertex/forwarder.rs:127` 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) rust/numaflow-core/src/pipeline/isb/reader.rs:265 — rust/numaflow-core/src/pipeline/isb/reader.rs:265-275 | rust/numaflow-core/src/pipeline/isb/reader.rs:297-307 — 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 `rust/numaflow-core/src/pipeline/isb/reader.rs:265` 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) rust/extns/numaflow-nats/src/jetstream.rs:368 — rust/extns/numaflow-nats/src/jetstream.rs:368-378 | rust/extns/numaflow-nats/src/jetstream.rs:395-405 — 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 `rust/extns/numaflow-nats/src/jetstream.rs:368` 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) rust/extns/numaflow-pulsar/src/source.rs:372 — rust/extns/numaflow-pulsar/src/source.rs:372-382 | rust/extns/numaflow-pulsar/src/source.rs:404-414 — 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 `rust/extns/numaflow-pulsar/src/source.rs:372` 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) rust/numaflow-core/src/pipeline/isb/compression.rs:90 — rust/numaflow-core/src/pipeline/isb/compression.rs:90-100 | rust/numaflow-core/src/pipeline/isb/compression.rs:104-114 — 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 `rust/numaflow-core/src/pipeline/isb/compression.rs: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.
D15 · Churn × Complexity Hotspots · Hotspot · ×11
  • Hotspot: ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in index.VertexDetails at line 126. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: ui/src/components/common/SlidingSidebar/index.tsx ui/src/components/common/SlidingSidebar/index.tsx:93 — ui/src/components/common/SlidingSidebar/index.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in index.SlidingSidebar at line 93. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/common/SlidingSidebar/index.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rust/numaflow-core/src/config/pipeline.rs rust/numaflow-core/src/config/pipeline.rs:298 — rust/numaflow-core/src/config/pipeline.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PipelineConfig::load at line 298. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/numaflow-core/src/config/pipeline.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: ui/src/components/pages/Pipeline/partials/Graph/index.tsx ui/src/components/pages/Pipeline/partials/Graph/index.tsx:716 — ui/src/components/pages/Pipeline/partials/Graph/index.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in index.Graph at line 716. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/pages/Pipeline/partials/Graph/index.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rust/numaflow-core/src/config/components/source.rs rust/numaflow-core/src/config/components/source.rs:184 — rust/numaflow-core/src/config/components/source.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SourceType::try_from at line 184. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/numaflow-core/src/config/components/source.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pkg/reconciler/validator/pipeline_validate.go pkg/reconciler/validator/pipeline_validate.go:802 — pkg/reconciler/validator/pipeline_validate.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in validator.validateSQSSource at line 802. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- pkg/reconciler/validator/pipeline_validate.go`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rust/numaflow-core/src/source.rs rust/numaflow-core/src/source.rs:486 — rust/numaflow-core/src/source.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Source::streaming_read at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/numaflow-core/src/source.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts:131 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in useVertexHealthData.useVertexHealthData at line 131. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx:120 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in index.Buffers at line 120. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: ui/src/components/common/CopyViewLinkButton/index.tsx ui/src/components/common/CopyViewLinkButton/index.tsx:24 — ui/src/components/common/CopyViewLinkButton/index.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in index.CopyViewLinkButton at line 24. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- ui/src/components/common/CopyViewLinkButton/index.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: rust/extns/numaflow-sqs/src/source.rs rust/extns/numaflow-sqs/src/source.rs:816 — rust/extns/numaflow-sqs/src/source.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SqsSourceBuilder::build at line 816. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/extns/numaflow-sqs/src/source.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · MethodTooLong · ×11
  • MethodTooLong: PipelineConfig.load rust/numaflow-core/src/config/pipeline.rs:298 — MethodTooLong — load runs 330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 230 over it, 3.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Source.streaming_read rust/numaflow-core/src/source.rs:486 — MethodTooLong — streaming_read runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: MonoVtxMetrics.new rust/numaflow-core/src/metrics/mod.rs:779 — MethodTooLong — new runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: MonovertexConfig.load rust/numaflow-core/src/config/monovertex.rs:93 — MethodTooLong — load runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Source.streaming_source rust/numaflow-core/src/source.rs:798 — MethodTooLong — streaming_source runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SinkWriterBuilder.build rust/numaflow-core/src/sinker/builder.rs:191 — MethodTooLong — build runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SinkActor.write_messages_with_retry rust/numaflow-core/src/sinker/actor.rs:57 — MethodTooLong — write_messages_with_retry runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SqsSourceBuilder.build rust/extns/numaflow-sqs/src/source.rs:816 — MethodTooLong — build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Settings.try_from rust/serving/src/config.rs:136 — MethodTooLong — try_from runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: Transformer.transform_batch rust/numaflow-core/src/transformer.rs:165 — MethodTooLong — transform_batch runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • MethodTooLong: SqsActor.get_messages rust/extns/numaflow-sqs/src/source.rs:234 — MethodTooLong — get_messages runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D30 · Dependency Vulnerabilities · Medium vulnerability · ×11
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×8
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/mapper/map/stream.rs:270 — rust/numaflow-core/src/mapper/map/stream.rs:270-277 | rust/numaflow-core/src/mapper/map/unary.rs:266-273 — before extracting anything, compare `rust/numaflow-core/src/mapper/map/stream.rs` and `rust/numaflow-core/src/mapper/map/unary.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map/stream.rs:270` 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 first that the copies are not typed on the same thing: the declarations holding them bind `sender_map` to `&Arc<Mutex<StreamSenderMapState>>` in one and `&Arc<Mutex<UnarySenderMapState>>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:518 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:518-525 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:636-643 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:518` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:516` calls `timestamp_millis` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:634` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:580 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:580-587 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:711-718 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/shared/otel.rs:616 — rust/numaflow-core/src/shared/otel.rs:616-623 | rust/numaflow-core/src/shared/otel.rs:713-720 — 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 `rust/numaflow-core/src/shared/otel.rs:616` 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) rust/numaflow-core/src/shared/otel.rs:646 — rust/numaflow-core/src/shared/otel.rs:646-653 | rust/numaflow-core/src/shared/otel.rs:742-750 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `rust/numaflow-core/src/shared/otel.rs:655` calls `into` and `rust/numaflow-core/src/shared/otel.rs:752` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/source.rs:610 — rust/numaflow-core/src/source.rs:610-617 | rust/numaflow-core/src/source.rs:891-898 — 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 `rust/numaflow-core/src/source.rs:610` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `rust/numaflow-core/src/source.rs:900` calls `drop` and `rust/numaflow-core/src/source.rs:618` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:592 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:592-599 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:722-729 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
  • Duplicated block (8 lines × 2) rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:59 — rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:59-66 | rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs:48-55 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:59` 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.
AC2 · Forms & labels · <Select> field component without a label · ×7
  • <Select> field component without a label ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:188 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:553 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:579 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:606 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:685 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:714 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
  • <Select> field component without a label ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:743 — This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role="combobox" (or role="button"), and those roles take their name from the AUTHOR, not from their content — so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
D29 · Static Analysis (SAST) · REDACTED · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×7
  • Duplicated block (13 lines × 2) rust/numaflow-core/src/mapper/map.rs:551 — rust/numaflow-core/src/mapper/map.rs:551-563 | rust/numaflow-core/src/transformer/user_defined.rs:58-70 — before extracting anything, compare `rust/numaflow-core/src/mapper/map.rs` and `rust/numaflow-core/src/transformer/user_defined.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `UserDefinedMessage<'_>` in one and `UserDefinedTransformerMessage<'_>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (13 lines × 2) rust/numaflow-core/src/metadata.rs:62 — rust/numaflow-core/src/metadata.rs:62-74 | rust/numaflow-core/src/metadata.rs:80-92 — 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 `rust/numaflow-core/src/metadata.rs:62` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 first that the copies are not typed on the same thing: the declarations holding them bind `metadata` to `metadata::Metadata` in one and `Metadata` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (13 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:222 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:222-234 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:211-223 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:222` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (13 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:267 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:267-279 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:261-273 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:267` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:258` calls `clone` and `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:266` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (13 lines × 2) rust/numaflow-core/src/reduce/pbq.rs:167 — rust/numaflow-core/src/reduce/pbq.rs:167-179 | rust/numaflow-core/src/reduce/pbq.rs:216-228 — 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 (13 lines × 2) rust/numaflow-core/src/reduce/wal/segment/compactor.rs:201 — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:201-213 | rust/numaflow-core/src/reduce/wal/segment/compactor.rs:243-255 — 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 `rust/numaflow-core/src/reduce/wal/segment/compactor.rs:201` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 (13 lines × 2) rust/serving/src/app/orchestrator.rs:81 — rust/serving/src/app/orchestrator.rs:81-93 | rust/serving/src/app/orchestrator.rs:196-208 — 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 `rust/serving/src/app/orchestrator.rs:81` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind `self` to `crate) async fn process_request( &mut` in one and `crate) async fn stream_response( &mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
R4 · Test Coverage · No test reaches this file · ×7
  • No test reaches this file ui/src/components/plugin/NumaflowMonitorApp/App.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/themes/index.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/index.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/components/plugin/Routes/Routes.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/reportWebVitals.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file ui/src/setupProxy.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×6
  • Duplicated block (12 lines × 2) rust/extns/numaflow-pulsar/src/source.rs:384 — rust/extns/numaflow-pulsar/src/source.rs:384-395 | rust/extns/numaflow-pulsar/src/source.rs:416-427 — 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 `rust/extns/numaflow-pulsar/src/source.rs:384` 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) rust/numaflow-core/src/config/components/reduce.rs:179 — rust/numaflow-core/src/config/components/reduce.rs:179-190 | rust/numaflow-core/src/config/components/reduce.rs:194-205 — 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 `rust/numaflow-core/src/config/components/reduce.rs:179` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (12 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:103 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:103-114 | rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs:78-89 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (12 lines × 2) rust/numaflow-core/src/watermark/idle/isb.rs:101 — rust/numaflow-core/src/watermark/idle/isb.rs:101-112 | rust/numaflow-core/src/watermark/idle/isb.rs:169-180 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `self` to `crate) async fn reset_idle(&mut` in one and `crate) async fn update_idle_metadata(&mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (12 lines × 2) rust/numaflow-core/src/watermark/source/source_wm_publisher.rs:97 — rust/numaflow-core/src/watermark/source/source_wm_publisher.rs:97-108 | rust/numaflow-core/src/watermark/source/source_wm_publisher.rs:199-210 — 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 `rust/numaflow-core/src/watermark/source/source_wm_publisher.rs: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 (12 lines × 2) rust/serving/src/app.rs:57 — rust/serving/src/app.rs:57-68 | rust/serving/src/app.rs:100-111 — 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 `rust/serving/src/app.rs:57` 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.
D29 · Static Analysis (SAST) · REDACTED · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
IC1 · Incompleteness & stubs · Unfinished branch · ×5
  • Unfinished branch — a todo!() / unimplemented!() arm in a real function rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:155 — `mark_wip` does real work, but one of its branches is `Err` with a "not implemented" message — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
  • Unfinished branch — a todo!() / unimplemented!() arm in a real function rust/numaflow-core/src/reduce/wal/segment/compactor.rs:361 — `process_wal_stream` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
  • Unfinished branch — a todo!() / unimplemented!() arm in a real function rust/numaflow-core/src/reduce/wal/segment/compactor.rs:421 — `build_aligned_compaction` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
  • Unfinished branch — a todo!() / unimplemented!() arm in a real function rust/numaflow-core/src/reduce/wal/segment/compactor.rs:474 — `build_unaligned_compaction` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
  • Unfinished branch — a todo!() / unimplemented!() arm in a real function rust/numaflow-models/src/apis/mod.rs:92 — `parse_deep_object` does real work, but one of its branches is `unimplemented!` — a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled.
D29 · Static Analysis (SAST) · REDACTED · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×4
  • Change coupling: batch.rs ↔ stream.rs rust/numaflow-core/src/mapper/map/batch.rs:1 — `rust/numaflow-core/src/mapper/map/batch.rs` and `rust/numaflow-core/src/mapper/map/stream.rs` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `f5da84f4` feat: reconnect on map(udf) failures (#3488); `5e6779c5` feat: introduce a generic map for per message nack options (#3539); `d8f95220` feat: add spans for tracing (#3397) — run `git show` on any of them.
  • Change coupling: forwarder.rs ↔ user_defined.rs rust/numaflow-core/src/monovertex/forwarder.rs:1 — `rust/numaflow-core/src/monovertex/forwarder.rs` and `rust/numaflow-core/src/sinker/sink/user_defined.rs` change together 57% of the time (13 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `f5da84f4` feat: reconnect on map(udf) failures (#3488); `fad583cf` chore: update to latest numaflow-rs commit (#2992) (at that commit the file was still `rust/numaflow-core/src/sink/user_defined.rs`); `f6dbe861` chore: Batch ack requests and sink responses for better performance #… (at that commit the file was still `rust/numaflow-core/src/sink/user_defined.rs`) — run `git show` on any of them.
  • Change coupling: sqs.rs ↔ sqs.rs rust/numaflow-core/src/sinker/sink/sqs.rs:1 — `rust/numaflow-core/src/sinker/sink/sqs.rs` and `rust/numaflow-core/src/source/sqs.rs` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `c1429a11` feat: support micro batching alternative at source (#3450); `0fd8e0e2` feat: SQS System Attributes and Custom Attributes Propagation (#3095); `26be9e50` feat: Mvtx short-circuiting using a bypass router struct (#3126) — run `git show` on any of them.
  • Change coupling: user_defined.rs ↔ user_defined.rs rust/numaflow-core/src/source/user_defined.rs:1 — `rust/numaflow-core/src/source/user_defined.rs` and `rust/numaflow-core/src/transformer/user_defined.rs` change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `f5da84f4` feat: reconnect on map(udf) failures (#3488); `5e6779c5` feat: introduce a generic map for per message nack options (#3539); `df926936` feat: keep numa alive across source, transformer, and sink UDF failur… — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×4
  • Edited copy of a member (25 corresponding lines) rust/extns/numaflow-kafka/src/sink.rs:177 — rust/extns/numaflow-kafka/src/sink.rs:177-201 | rust/extns/numaflow-kafka/src/source.rs:682-710 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (25 corresponding lines) rust/numaflow-core/src/pipeline/isb/reader.rs:260 — rust/numaflow-core/src/pipeline/isb/reader.rs:260-284 | rust/numaflow-core/src/pipeline/isb/reader.rs:292-321 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (25 corresponding lines) rust/numaflow-core/src/source.rs:1189 — rust/numaflow-core/src/source.rs:1189-1213 | rust/numaflow-core/src/source.rs:1220-1245 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (25 corresponding lines) rust/numaflow-core/src/reduce/wal/segment/compactor.rs:189 — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:189-213 | rust/numaflow-core/src/reduce/wal/segment/compactor.rs:231-255 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×4
  • Edited copy of a member (23 corresponding lines) rust/numaflow-core/src/source/http.rs:86 — rust/numaflow-core/src/source/http.rs:86-108 | rust/numaflow-core/src/source/http.rs:110-132 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (23 corresponding lines) rust/serving/src/app/store/cbstore/jetstream_store.rs:275 — rust/serving/src/app/store/cbstore/jetstream_store.rs:275-297 | rust/serving/src/app/store/datastore/jetstream.rs:204-229 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (23 corresponding lines) rust/extns/numaflow-sqs/src/source.rs:612 — rust/extns/numaflow-sqs/src/source.rs:612-634 | rust/extns/numaflow-sqs/src/source.rs:682-711 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (23 corresponding lines) rust/numaflow-core/src/mapper/map/stream.rs:288 — rust/numaflow-core/src/mapper/map/stream.rs:288-310 | rust/numaflow-core/src/mapper/map/unary.rs:284-308 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×4
  • Edited copy of a member (15 corresponding lines) rust/numaflow-core/src/lib.rs:253 — rust/numaflow-core/src/lib.rs:253-267 | rust/numaflow-core/src/lib.rs:269-283 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) rust/numaflow-core/src/metadata.rs:60 — rust/numaflow-core/src/metadata.rs:60-74 | rust/numaflow-core/src/metadata.rs:78-92 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) rust/numaflow-core/src/mapper/map.rs:424 — rust/numaflow-core/src/mapper/map.rs:424-438 | rust/numaflow-core/src/mapper/map.rs:450-470 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) rust/numaflow-core/src/sinker/sink.rs:793 — rust/numaflow-core/src/sinker/sink.rs:793-813 | rust/numaflow-core/src/mapper/map.rs:401-415 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×4
  • Edited copy of a member (7 corresponding lines) rust/extns/numaflow-kafka/src/source.rs:639 — rust/extns/numaflow-kafka/src/source.rs:639-645 | rust/extns/numaflow-nats/src/nats.rs:192-198 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) rust/numaflow-core/src/source/http.rs:69 — rust/numaflow-core/src/source/http.rs:69-75 | rust/numaflow-core/src/source/nats.rs:52-58 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:36 — rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:36-42 | rust/numaflow-core/src/reduce/reducer/unaligned/windower/session.rs:58-64 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) rust/numaflow-core/src/monovertex.rs:34 — rust/numaflow-core/src/monovertex.rs:34-40 | rust/numaflow-core/src/pipeline/forwarder.rs:83-89 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×4
  • Duplicated block (15 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:114 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:114-128 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:101-115 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:114` 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) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:184 — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:184-198 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:298-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 `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:184` 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 (15 lines × 2) rust/serving/src/app/jetstream_proxy.rs:262 — rust/serving/src/app/jetstream_proxy.rs:262-276 | rust/serving/src/app/jetstream_proxy.rs:409-423 — 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 `rust/serving/src/app/jetstream_proxy.rs:262` 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) rust/serving/src/app/store/cbstore/jetstream_store.rs:231 — rust/serving/src/app/store/cbstore/jetstream_store.rs:231-245 | rust/serving/src/app/store/cbstore/jetstream_store.rs:248-262 — 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 `rust/serving/src/app/store/cbstore/jetstream_store.rs:231` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×4
  • Duplicated block (14 lines × 2) rust/numaflow-core/src/config/components/sink.rs:91 — rust/numaflow-core/src/config/components/sink.rs:91-104 | rust/numaflow-core/src/config/components/sink.rs:133-146 — 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 `rust/numaflow-core/src/config/components/sink.rs: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 (14 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:285 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:285-298 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:278-291 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:285` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:284` calls `clone` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:277` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (14 lines × 2) rust/numaflow-core/src/source.rs:550 — rust/numaflow-core/src/source.rs:550-563 | rust/numaflow-core/src/source.rs:827-840 — 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 `rust/numaflow-core/src/source.rs:550` 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) rust/serving/src/app/jetstream_proxy.rs:247 — rust/serving/src/app/jetstream_proxy.rs:247-260 | rust/serving/src/app/jetstream_proxy.rs:394-407 — 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.
D10 · Test Quality · No assertions · ×3
  • No assertions: should not crash if data is null ui/src/components/pages/Pipeline/partials/Graph/index.test.tsx:719 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: Tests handleTabChange ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.test.tsx:284 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: Drag slider ui/src/components/common/SlidingSidebar/index.test.tsx:496 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
D15 · Churn × Complexity Hotspots · Repeated repair · ×3
  • Repeated repair: rust/extns/numaflow-pulsar/src/source.rs rust/extns/numaflow-pulsar/src/source.rs:286 — rust/extns/numaflow-pulsar/src/source.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is ConsumerReaderActor::get_messages at line 286), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: skip already-settled offsets on pulsar ack/nack retry. Fixes #3659 (#3713)”; “fix: report Pulsar subscription backlog as pending (#3781)”; “fix: redact secrets in logs (v2) (#3719)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/extns/numaflow-pulsar/src/source.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: rust/numaflow-shared/src/isb/jetstream.rs rust/numaflow-shared/src/isb/jetstream.rs:17 — rust/numaflow-shared/src/isb/jetstream.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is numaflow_shared::isb::jetstream::log_nats_event at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: redact secrets in logs (v2) (#3719)”; “fix: store the pending future back in jetstreamwatcher (#3683)”; “fix: log NATS server errors and disconnects at ERROR level (#3646)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- rust/numaflow-shared/src/isb/jetstream.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: pkg/apis/numaflow/v1alpha1/mono_vertex_types.go pkg/apis/numaflow/v1alpha1/mono_vertex_types.go:572 — pkg/apis/numaflow/v1alpha1/mono_vertex_types.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is MonoVertexSpec.buildContainers at line 572), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(monovertex): keep spec.replicas in sync with real replica count (#3687)”; “fix: remove default replicas value from mvtx/vtx CRD (#3709)”; “fix: daemon should not be recreated on scale changes (#3638)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 15:44:11 +00:00' --until='2026-11-16 15:44:11 +00:00' --full-history --no-merges -- pkg/apis/numaflow/v1alpha1/mono_vertex_types.go`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · ClassTooLong · ×3
  • ClassTooLong: Source rust/numaflow-core/src/source.rs:246 — ClassTooLong — 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 246-1451. The bar is 400 significant lines; this is 346 over it, 1.87× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: SinkWriter rust/numaflow-core/src/sinker/sink.rs:120 — ClassTooLong — 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 16 methods, 2 blocks, lines 120-787. The bar is 400 significant lines; this is 62 over it, 1.16× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: ISBReaderOrchestrator rust/numaflow-core/src/pipeline/isb/reader.rs:50 — ClassTooLong — 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 18 methods, 3 blocks, lines 50-663. The bar is 400 significant lines; this is 9 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Edited copy of a member (26 corresponding lines) · ×3
  • Edited copy of a member (26 corresponding lines) rust/extns/numaflow-nats/src/jetstream.rs:365 — rust/extns/numaflow-nats/src/jetstream.rs:365-390 | rust/extns/numaflow-nats/src/jetstream.rs:392-417 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (26 corresponding lines) rust/extns/numaflow-nats/src/jetstream.rs:299 — rust/extns/numaflow-nats/src/jetstream.rs:299-324 | rust/extns/numaflow-pulsar/src/source.rs:243-271 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (26 corresponding lines) rust/numaflow-core/src/mapper/map/batch.rs:361 — rust/numaflow-core/src/mapper/map/batch.rs:361-386 | rust/numaflow-core/src/mapper/map/unary.rs:378-405 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×3
  • Edited copy of a member (21 corresponding lines) rust/numaflow-sideinput/src/manager/client.rs:64 — rust/numaflow-sideinput/src/manager/client.rs:64-84 | rust/serving/src/app/store/datastore/user_defined.rs:68-89 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) rust/serving/src/app/store/cbstore/jetstream_store.rs:38 — rust/serving/src/app/store/cbstore/jetstream_store.rs:38-69 | rust/serving/src/app/store/datastore/jetstream.rs:98-118 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:133 — rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:133-153 | rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:204-224 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×3
  • Edited copy of a member (9 corresponding lines) rust/numaflow-core/src/shared/otel.rs:152 — rust/numaflow-core/src/shared/otel.rs:152-162 | rust/numaflow-core/src/shared/otel.rs:210-218 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:579 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:579-587 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:710-718 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:606 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:606-614 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:736-747 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×3
  • Duplicated block (16 lines × 2) rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:128 — rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:128-143 | rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:263-278 — 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 `rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs: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 (16 lines × 2) rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:221 — rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:221-236 | rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:355-370 — 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 `rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:221` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (16 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:138 — rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:138-153 | rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:209-224 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:138` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×3
  • Duplicated block (13–14 lines × 2) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:177 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:177-189 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:165-178 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:177` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (13–14 lines × 2) rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:207 — rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:207-220 | rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:287-299 — 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 `rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:207` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:203` calls `to_string` and `rust/numaflow-core/src/pipeline/isb/jetstream/js_writer.rs:284` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (13–14 lines × 2) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:97 — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:97-110 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:219-231 — 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 `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs: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.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×3
  • Duplicated block (10 lines × 2) rust/numaflow-core/src/source/user_defined.rs:107 — rust/numaflow-core/src/source/user_defined.rs:107-116 | rust/numaflow-core/src/source/user_defined.rs:310-319 — 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 `rust/numaflow-core/src/source/user_defined.rs:107` 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) rust/numaflow-sideinput/src/manager/client.rs:65 — rust/numaflow-sideinput/src/manager/client.rs:65-74 | rust/serving/src/app/store/datastore/user_defined.rs:69-78 — 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 `rust/numaflow-sideinput/src/manager/client.rs:65` 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) rust/numaflow-core/src/source.rs:1431 — rust/numaflow-core/src/source.rs:1431-1440 | rust/numaflow-core/src/transformer.rs:391-401 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/source.rs:1431` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×3
  • Duplicated block (7 lines × 3) rust/numaflow-core/src/shared/grpc.rs:161 — rust/numaflow-core/src/shared/grpc.rs:161-167 | rust/numaflow-sideinput/src/manager/client.rs:89-95 | rust/serving/src/app/store/datastore/user_defined.rs:95-101 — 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 `rust/numaflow-core/src/shared/grpc.rs:161` 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) rust/serving/src/app/jetstream_proxy.rs:146 — rust/serving/src/app/jetstream_proxy.rs:146-152 | rust/serving/src/app/jetstream_proxy.rs:246-252 | rust/serving/src/app/jetstream_proxy.rs:393-399 — 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) rust/numaflow-core/src/mapper/map/batch.rs:249 — rust/numaflow-core/src/mapper/map/batch.rs:249-255 | rust/numaflow-core/src/mapper/map/stream.rs:233-239 | rust/numaflow-core/src/mapper/map/unary.rs:232-238 — before extracting anything, compare `rust/numaflow-core/src/mapper/map/stream.rs` and `rust/numaflow-core/src/mapper/map/unary.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map/batch.rs:249` 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×3
  • Duplicated block (6 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:139 — rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:139-144 | rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/session.rs:136-141 — 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) rust/numaflow-core/src/pipeline/isb.rs:97 — rust/numaflow-core/src/pipeline/isb.rs:97-102 | rust/numaflow-core/src/pipeline/isb/inmemory/writer.rs:26-31 — 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) rust/numaflow-core/src/pipeline/isb/inmemory/error_injector.rs:203 — rust/numaflow-core/src/pipeline/isb/inmemory/error_injector.rs:203-208 | rust/numaflow-shared/src/kv/inmemory/error_injector.rs:205-210 — 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.
IC1 · Incompleteness & stubs · Empty method body · ×3
  • Empty method body — does nothing with its inputs rust/extns/numaflow-kafka/src/source.rs:68 — `pre_rebalance` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs rust/extns/numaflow-kafka/src/source.rs:72 — `post_rebalance` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs rust/extns/numaflow-kafka/src/source.rs:76 — `commit_callback` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
IC1 · Incompleteness & stubs · Hollow method · ×3
  • Hollow method — returns a constant without doing the work rust/numaflow-core/src/pipeline/isb/writer.rs:406 — `wait_for_paf_resolvers` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
  • Hollow method — returns a constant without doing the work rust/numaflow-throttling/src/state/store/redis_store.rs:588 — `deregister` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
  • Hollow method — returns a constant without doing the work rust/serving/src/app.rs:340 — `health_check` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
X25 · Inert configuration knob · Configuration option is read nowhere · ×3
  • Configuration option is read nowhere rust/numaflow-core/src/message.rs:538 — `NackOptions.max_deliveries` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere rust/numaflow-core/src/message.rs:540 — `NackOptions.reason` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
  • Configuration option is read nowhere rust/numaflow-core/src/message.rs:542 — `NackOptions.nack_map` is offered as a configuration-file option, so whoever configures the program can set it — but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect — or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing.
D1 · Cyclomatic Complexity · Source · ×2
  • Source::streaming_read (cyclomatic 24) rust/numaflow-core/src/source.rs:486 — Source::streaming_read has cyclomatic complexity 24 (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.
  • Source::streaming_source (cyclomatic 23) rust/numaflow-core/src/source.rs:798 — Source::streaming_source has cyclomatic complexity 23 (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.
D2 · Cognitive Complexity · Source · ×2
  • Source::streaming_read (cognitive 65) rust/numaflow-core/src/source.rs:486 — Source::streaming_read has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (31 pts), match/switch 6 (21 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 42). 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.
  • Source::streaming_source (cognitive 57) rust/numaflow-core/src/source.rs:798 — Source::streaming_source has cognitive complexity 57 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 6 (20 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · numaflow_core · ×2
  • numaflow_core::config::components::parse_kafka_auth_config (cognitive 51) rust/numaflow-core/src/config/components.rs:18 — numaflow_core::config::components::parse_kafka_auth_config has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (44 pts), match/switch 4 (7 pts) (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.
  • numaflow_core::metrics::expose_pending_metrics (cognitive 29) rust/numaflow-core/src/metrics/mod.rs:1721 — numaflow_core::metrics::expose_pending_metrics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (9 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · JetStreamCallbackStore · ×2
  • JetStreamCallbackStore::spawn_central_watcher (cognitive 29) rust/serving/src/app/store/cbstore/jetstream_store.rs:73 — JetStreamCallbackStore::spawn_central_watcher has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 4 (10 pts), boolean chains 1, 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.
  • JetStreamCallbackStore::watch_historical_callbacks (cognitive 18) rust/serving/src/app/store/cbstore/jetstream_store.rs:179 — JetStreamCallbackStore::watch_historical_callbacks has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (7 pts), loops 1 (nesting depth added 10). 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.
D2 · Cognitive Complexity · JetStreamDataStore · ×2
  • JetStreamDataStore::process_entry (cognitive 22) rust/serving/src/app/store/datastore/jetstream.rs:232 — JetStreamDataStore::process_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • JetStreamDataStore::spawn_central_watcher (cognitive 19) rust/serving/src/app/store/datastore/jetstream.rs:122 — JetStreamDataStore::spawn_central_watcher has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (8 pts), loops 1 (nesting depth added 12). 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.
D2 · Cognitive Complexity · UserDefinedBatchMap · ×2
  • UserDefinedBatchMap::batch (cognitive 21) rust/numaflow-core/src/mapper/map/batch.rs:390 — UserDefinedBatchMap::batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts), loops 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.
  • UserDefinedBatchMap::receive_batch_responses (cognitive 17) rust/numaflow-core/src/mapper/map/batch.rs:300 — UserDefinedBatchMap::receive_batch_responses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (2 pts), loops 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×2
  • Edited copy of a member (30 corresponding lines) rust/numaflow-core/src/config/components/sink.rs:72 — rust/numaflow-core/src/config/components/sink.rs:72-108 | rust/numaflow-core/src/config/components/sink.rs:110-150 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (30 corresponding lines) rust/numaflow-core/src/source.rs:1348 — rust/numaflow-core/src/source.rs:1348-1377 | rust/numaflow-core/src/source.rs:1379-1408 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) rust/numaflow-core/src/shared/create_components.rs:93 — rust/numaflow-core/src/shared/create_components.rs:93-152 | rust/numaflow-core/src/shared/create_components.rs:158-204 | rust/numaflow-core/src/shared/create_components.rs:210-259 | rust/numaflow-core/src/shared/create_components.rs:268-306 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
  • Members sharing a duplicated core (4 members, 50+ identical tokens) rust/numaflow-core/src/shared/grpc.rs:35 — rust/numaflow-core/src/shared/grpc.rs:35-50 | rust/numaflow-core/src/shared/grpc.rs:56-71 | rust/numaflow-core/src/shared/grpc.rs:77-92 | rust/numaflow-core/src/shared/grpc.rs:98-113 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (32 corresponding lines) · ×2
  • Edited copy of a member (32 corresponding lines) rust/numaflow-core/src/mapper/map.rs:535 — rust/numaflow-core/src/mapper/map.rs:535-566 | rust/numaflow-core/src/transformer/user_defined.rs:39-74 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (32 corresponding lines) rust/numaflow-core/src/sinker/sink.rs:699 — rust/numaflow-core/src/sinker/sink.rs:699-730 | rust/numaflow-core/src/sinker/sink.rs:737-768 — These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (33 corresponding lines) · ×2
  • Edited copy of a member (33 corresponding lines) rust/extns/numaflow-sqs/src/source.rs:1139 — rust/extns/numaflow-sqs/src/source.rs:1139-1171 | rust/extns/numaflow-sqs/src/source.rs:1174-1209 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (33 corresponding lines) rust/numaflow-throttling/src/lib.rs:395 — rust/numaflow-throttling/src/lib.rs:395-427 | rust/numaflow-throttling/src/lib.rs:507-539 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×2
  • Edited copy of a member (20 corresponding lines) rust/numaflow-core/src/tracker.rs:235 — rust/numaflow-core/src/tracker.rs:235-258 | rust/numaflow-core/src/tracker.rs:286-305 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (20 corresponding lines) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:316 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:316-335 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:310-329 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×2
  • Edited copy of a member (10 corresponding lines) rust/numaflow-core/src/metrics/mod.rs:1495 — rust/numaflow-core/src/metrics/mod.rs:1495-1508 | rust/serving/src/metrics.rs:191-200 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) rust/numaflow-core/src/watermark/isb.rs:405 — rust/numaflow-core/src/watermark/isb.rs:405-414 | rust/numaflow-core/src/watermark/source/source_wm_publisher.rs:73-84 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×2
  • Edited copy of a member (11 corresponding lines) rust/numaflow-core/src/tracker.rs:335 — rust/numaflow-core/src/tracker.rs:335-348 | rust/numaflow-core/src/tracker.rs:351-361 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) rust/numaflow-shared/src/kv/inmemory/store.rs:211 — rust/numaflow-shared/src/kv/inmemory/store.rs:211-221 | rust/numaflow-shared/src/kv/inmemory/store.rs:271-281 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (27 lines × 2) · ×2
  • Duplicated block (27 lines × 2) rust/extns/numaflow-nats/src/jetstream.rs:199 — rust/extns/numaflow-nats/src/jetstream.rs:199-225 | rust/extns/numaflow-nats/src/nats.rs:69-95 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (27 lines × 2) rust/numaflow-core/src/config/monovertex.rs:105 — rust/numaflow-core/src/config/monovertex.rs:105-131 | rust/numaflow-core/src/config/pipeline.rs:352-378 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) rust/numaflow-core/src/shared/create_components.rs:619 — rust/numaflow-core/src/shared/create_components.rs:619-639 | rust/numaflow-core/src/shared/create_components.rs:656-676 — 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 (21 lines × 2) rust/serving/src/app/orchestrator.rs:58 — rust/serving/src/app/orchestrator.rs:58-78 | rust/serving/src/app/orchestrator.rs:173-193 — 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 `rust/serving/src/app/orchestrator.rs: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. Note first that the copies are not typed on the same thing: the declarations holding them bind `self` to `crate) async fn process_request( &mut` in one and `crate) async fn stream_response( &mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) rust/numaflow-core/src/watermark/processor/manager.rs:236 — rust/numaflow-core/src/watermark/processor/manager.rs:236-253 | rust/numaflow-core/src/watermark/processor/manager.rs:351-368 — 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 `rust/numaflow-core/src/watermark/processor/manager.rs:236` 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 (18 lines × 2) rust/numaflow-throttling/src/lib.rs:397 — rust/numaflow-throttling/src/lib.rs:397-414 | rust/numaflow-throttling/src/lib.rs:509-526 — 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 `rust/numaflow-throttling/src/lib.rs:397` 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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) rust/extns/numaflow-sqs/src/source.rs:1155 — rust/extns/numaflow-sqs/src/source.rs:1155-1171 | rust/extns/numaflow-sqs/src/source.rs:1193-1209 — 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 `rust/extns/numaflow-sqs/src/source.rs:1155` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 first that the copies are not typed on the same thing: the declarations holding them bind `offsets` to `Vec<(String, Bytes)>` in one and `Vec<SqsNack>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (17 lines × 2) rust/serving/src/app/jetstream_proxy.rs:281 — rust/serving/src/app/jetstream_proxy.rs:281-297 | rust/serving/src/app/jetstream_proxy.rs:463-479 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/serving/src/app/jetstream_proxy.rs:457` calls `spawn`, `instrument` and `rust/serving/src/app/jetstream_proxy.rs:276` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×2
  • Duplicated block (10 lines × 3) rust/numaflow-core/src/source/kafka.rs:89 — rust/numaflow-core/src/source/kafka.rs:89-98 | rust/numaflow-core/src/source/pulsar.rs:75-84 | rust/numaflow-core/src/source/sqs.rs:138-147 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
  • Duplicated block (10 lines × 3) rust/numaflow-core/src/sinker/builder.rs:29 — rust/numaflow-core/src/sinker/builder.rs:29-38 | rust/numaflow-core/src/sinker/builder.rs:41-50 | rust/numaflow-core/src/sinker/builder.rs:53-62 — 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 `rust/numaflow-core/src/sinker/builder.rs:29` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×2
  • Duplicated block (9 lines × 2) rust/numaflow-core/src/reduce/wal/segment/compactor.rs:407 — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:407-415 | rust/numaflow-core/src/reduce/wal/segment/compactor.rs:450-458 — 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 `rust/numaflow-core/src/reduce/wal/segment/compactor.rs:407` 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) rust/numaflow-core/src/watermark/isb/wm_fetcher.rs:256 — rust/numaflow-core/src/watermark/isb/wm_fetcher.rs:256-264 | rust/numaflow-core/src/watermark/source/source_wm_fetcher.rs:143-151 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `offset` to `i64` in one and `Option<i64>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:91 — rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:91-97 | rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:119-125 — 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 `rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:91` 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) rust/extns/numaflow-sqs/src/source.rs:1147 — rust/extns/numaflow-sqs/src/source.rs:1147-1153 | rust/extns/numaflow-sqs/src/source.rs:1185-1191 — 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 `rust/extns/numaflow-sqs/src/source.rs:1147` 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • Duplicated block (5 lines × 2) rust/numaflow-core/src/tracker.rs:245 — rust/numaflow-core/src/tracker.rs:245-249 | rust/numaflow-core/src/tracker.rs:292-296 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `offset` to `&Offset` in one and `Offset` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) rust/numaflow-core/src/runtime_server/config.rs:4 — rust/numaflow-core/src/runtime_server/config.rs:4-8 | rust/serving/src/config.rs:33-37 — 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.
D5 · Coupling · Off the main sequence · ×2
  • Off the main sequence: numaflow-http — numaflow-http: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
  • Off the main sequence: numaflow-sqs — numaflow-sqs: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
R10 · Code Duplication · Duplicated block (75 lines × 2 locations) · ×2
  • Duplicated block (75 lines × 2 locations) ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:24 — ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:24 · ui/src/components/pages/Cluster/partials/NamespaceCard/index.tsx:102 — 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 (75 lines × 2 locations) ui/src/utils/fetchWrappers/monoVertexFetch.ts:14 — ui/src/utils/fetchWrappers/monoVertexFetch.ts:14 · ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:15 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (26 lines × 2 locations) · ×2
  • Duplicated block (26 lines × 2 locations) ui/src/App.tsx:383 — ui/src/App.tsx:383 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:263 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (26 lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:399 — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:399 · ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:435 — 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.
AC2 · Forms & labels · <TextField> field component without a label · ×1
  • <TextField> field component without a label ui/src/components/common/DebouncedSearchInput/index.tsx:48 — This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×1
  • Animation without a prefers-reduced-motion guard ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/vertexHealth.css:169 — `.vertex-health-card-icon` moves (`transition: transform 120ms ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
AX2 · Stateful singletons · Stateful handler dependency · ×1
  • Stateful handler dependency: HealthChecker pkg/daemon/server/service/health_status.go:119 — `HealthChecker` is shared by every request (`updateUsageTimeline` is called per request from the gRPC service method `PipelineMetadataQuery.StartHealthCheck`, on the one `HealthChecker` value that handler's shared receiver holds) but writes its fields outside any lock (timelineData; e.g. `timelineData` in `updateUsageTimeline` at line 279). Unsynchronised concurrent writes are a data race in Go: an update is lost or a value tears, and a concurrent map write aborts the process.
D1 · Cyclomatic Complexity · index.CustomNode (cyclomatic 76) · ×1
  • index.CustomNode (cyclomatic 76) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:75 — index.CustomNode has cyclomatic complexity 76 (threshold 15). Of this number, 58 points are the body's own statements and 18 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · index.VertexDetails (cyclomatic 68) · ×1
  • index.VertexDetails (cyclomatic 68) ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126 — index.VertexDetails has cyclomatic complexity 68 (threshold 15). Of this number, 30 points are the body's own statements and 38 belong to 14 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · index.PipelineCard (cyclomatic 57) · ×1
  • index.PipelineCard (cyclomatic 57) ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47 — index.PipelineCard has cyclomatic complexity 57 (threshold 15). Of this number, 33 points are the body's own statements and 24 belong to 11 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · index.CustomEdge (cyclomatic 52) · ×1
  • index.CustomEdge (cyclomatic 52) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56 — index.CustomEdge has cyclomatic complexity 52 (threshold 15). Of this number, 23 points are the body's own statements and 29 belong to 6 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · index.SlidingSidebar (cyclomatic 50) · ×1
  • index.SlidingSidebar (cyclomatic 50) ui/src/components/common/SlidingSidebar/index.tsx:93 — index.SlidingSidebar has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 10 of the 50 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 210, 170, 191, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.MonoVertexCard (cyclomatic 43) · ×1
  • index.MonoVertexCard (cyclomatic 43) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:44 — index.MonoVertexCard has cyclomatic complexity 43 (threshold 15). Of this number, 24 points are the body's own statements and 19 belong to 11 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · index.Flow (cyclomatic 42) · ×1
  • index.Flow (cyclomatic 42) ui/src/components/pages/Pipeline/partials/Graph/index.tsx:204 — index.Flow has cyclomatic complexity 42 (threshold 15). Of this number, 30 points are the body's own statements and 12 belong to 6 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · goldenSignalsModel.backlogCard (cyclomatic 40) · ×1
  • goldenSignalsModel.backlogCard (cyclomatic 40) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:538 — goldenSignalsModel.backlogCard has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
D1 · Cyclomatic Complexity · index.PipelineListing (cyclomatic 39) · ×1
  • index.PipelineListing (cyclomatic 39) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelineListing/index.tsx:26 — index.PipelineListing has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 55, 213, 85, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · goldenSignalsModel.lossCard (cyclomatic 38) · ×1
  • goldenSignalsModel.lossCard (cyclomatic 38) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:640 — goldenSignalsModel.lossCard has cyclomatic complexity 38 (threshold 15). Of this number, 32 points are the body's own statements and 6 belong to 4 function items inside it that branch. 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.
D1 · Cyclomatic Complexity · index.ISBUpdate (cyclomatic 38) · ×1
  • index.ISBUpdate (cyclomatic 38) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:54 — index.ISBUpdate has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 13 of the 38 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 96, 115, 282, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.Graph (cyclomatic 36) · ×1
  • index.Graph (cyclomatic 36) ui/src/components/pages/Pipeline/partials/Graph/index.tsx:716 — index.Graph has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 852, 786, 828, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.K8sEvents (cyclomatic 30) · ×1
  • index.K8sEvents (cyclomatic 30) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:37 — index.K8sEvents has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 327, 63, 213, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · pipelineViewFetch.usePipelineViewFetch (cyclomatic 29) · ×1
  • pipelineViewFetch.usePipelineViewFetch (cyclomatic 29) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:15 — pipelineViewFetch.usePipelineViewFetch has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 60, 117, 669, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · pipelineISBDebugFetch.usePipelineISBDebugFetch (cyclomatic 28) · ×1
  • pipelineISBDebugFetch.usePipelineISBDebugFetch (cyclomatic 28) ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:30 — pipelineISBDebugFetch.usePipelineISBDebugFetch has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 122, 111). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.ISBListing (cyclomatic 28) · ×1
  • index.ISBListing (cyclomatic 28) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:28 — index.ISBListing has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 93, 111, 103, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.Pipeline (cyclomatic 28) · ×1
  • index.Pipeline (cyclomatic 28) ui/src/components/pages/Pipeline/index.tsx:41 — index.Pipeline has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 150, 102, 256, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.Login (cyclomatic 28) · ×1
  • index.Login (cyclomatic 28) REDACTED:37 — index.Login has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 201, 153, 57, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · useVertexHealthData.useVertexHealthData (cyclomatic 26) · ×1
  • useVertexHealthData.useVertexHealthData (cyclomatic 26) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts:131 — useVertexHealthData.useVertexHealthData has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 245, 159, 166, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · namespaceSummaryFetch.useNamespaceSummaryFetch (cyclomatic 25) · ×1
  • namespaceSummaryFetch.useNamespaceSummaryFetch (cyclomatic 25) ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts:130 — namespaceSummaryFetch.useNamespaceSummaryFetch has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 193). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · App.App (cyclomatic 25) · ×1
  • App.App (cyclomatic 25) ui/src/App.tsx:71 — App.App has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 95, 210, 120, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · PipelineConfig · ×1
  • PipelineConfig::load (cyclomatic 24) rust/numaflow-core/src/config/pipeline.rs:298 — PipelineConfig::load has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · goldenSignalsModel.errorsCard (cyclomatic 24) · ×1
  • goldenSignalsModel.errorsCard (cyclomatic 24) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:788 — goldenSignalsModel.errorsCard has cyclomatic complexity 24 (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.
D1 · Cyclomatic Complexity · index.NodeInfo (cyclomatic 24) · ×1
  • index.NodeInfo (cyclomatic 24) ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:21 — index.NodeInfo has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · SourceType · ×1
  • SourceType::try_from (cyclomatic 23) rust/numaflow-core/src/config/components/source.rs:184 — SourceType::try_from has cyclomatic complexity 23 (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.
D1 · Cyclomatic Complexity · index.VertexUpdate (cyclomatic 23) · ×1
  • index.VertexUpdate (cyclomatic 23) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:30 — index.VertexUpdate has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 60, 71, 134, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.Buffers (cyclomatic 23) · ×1
  • index.Buffers (cyclomatic 23) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx:120 — index.Buffers has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 219, 189, 165, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.PipelineUpdate (cyclomatic 23) · ×1
  • index.PipelineUpdate (cyclomatic 23) ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:18 — index.PipelineUpdate has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 93, 55, 47, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · pipelineViewFetch.usePipelineViewFetch.edges (cyclomatic 23) · ×1
  • pipelineViewFetch.usePipelineViewFetch.edges (cyclomatic 23) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:528 — pipelineViewFetch.usePipelineViewFetch.edges has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 537, 565, 617, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · SinkActor · ×1
  • SinkActor::write_messages_with_retry (cyclomatic 22) rust/numaflow-core/src/sinker/actor.rs:57 — SinkActor::write_messages_with_retry 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.
D1 · Cyclomatic Complexity · SinkWriterBuilder · ×1
  • SinkWriterBuilder::build (cyclomatic 22) rust/numaflow-core/src/sinker/builder.rs:191 — SinkWriterBuilder::build has cyclomatic complexity 22 (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.
D1 · Cyclomatic Complexity · numaflow_core · ×1
  • numaflow_core::config::components::parse_kafka_auth_config (cyclomatic 22) rust/numaflow-core/src/config/components.rs:18 — numaflow_core::config::components::parse_kafka_auth_config 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.
D1 · Cyclomatic Complexity · index.SummaryPageLayout (cyclomatic 22) · ×1
  • index.SummaryPageLayout (cyclomatic 22) ui/src/components/common/SummaryPageLayout/index.tsx:203 — index.SummaryPageLayout has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 241, 317, 219, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.CopyViewLinkButton (cyclomatic 22) · ×1
  • index.CopyViewLinkButton (cyclomatic 22) ui/src/components/common/CopyViewLinkButton/index.tsx:24 — index.CopyViewLinkButton has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · index.PipelineCreate (cyclomatic 22) · ×1
  • index.PipelineCreate (cyclomatic 22) ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:44 — index.PipelineCreate has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 116, 78, 70, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · monoVertexViewFetch.useMonoVertexViewFetch (cyclomatic 22) · ×1
  • monoVertexViewFetch.useMonoVertexViewFetch (cyclomatic 22) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 — monoVertexViewFetch.useMonoVertexViewFetch has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 56, 122, 135, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.ISBDebugInfo (cyclomatic 21) · ×1
  • index.ISBDebugInfo (cyclomatic 21) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/partials/ISBDebugInfo/index.tsx:122 — index.ISBDebugInfo has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body's own statements and 10 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · index.PodViewNext (cyclomatic 20) · ×1
  • index.PodViewNext (cyclomatic 20) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.tsx:63 — index.PodViewNext has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body's own statements and 8 belong to 3 function literals inside it that branch. 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.
D1 · Cyclomatic Complexity · SqsSourceBuilder · ×1
  • SqsSourceBuilder::build (cyclomatic 19) rust/extns/numaflow-sqs/src/source.rs:816 — SqsSourceBuilder::build 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.
D1 · Cyclomatic Complexity · index.ProcessingRates (cyclomatic 19) · ×1
  • index.ProcessingRates (cyclomatic 19) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/ProcessingRates/index.tsx:35 — index.ProcessingRates has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 54, a function literal at line 45, formatRate, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · podsViewFetch.usePodsViewFetch (cyclomatic 19) · ×1
  • podsViewFetch.usePodsViewFetch (cyclomatic 19) ui/src/utils/fetcherHooks/podsViewFetch.ts:13 — podsViewFetch.usePodsViewFetch has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 6 function items inside it that branch (fetchPods, a function literal at line 143, a function literal at line 67, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · pipelineFetch.usePipelineSummaryFetch (cyclomatic 19) · ×1
  • pipelineFetch.usePipelineSummaryFetch (cyclomatic 19) ui/src/utils/fetchWrappers/pipelineFetch.ts:11 — pipelineFetch.usePipelineSummaryFetch has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.MonoVertex (cyclomatic 19) · ×1
  • index.MonoVertex (cyclomatic 19) ui/src/components/pages/MonoVertex/index.tsx:33 — index.MonoVertex has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 104, 73, 177, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.PipelineISBDebugInfo (cyclomatic 18) · ×1
  • index.PipelineISBDebugInfo (cyclomatic 18) ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:564 — index.PipelineISBDebugInfo has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · ComponentHealthChecks · ×1
  • ComponentHealthChecks::ready (cyclomatic 17) rust/numaflow-core/src/metrics/mod.rs:295 — ComponentHealthChecks::ready 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.
D1 · Cyclomatic Complexity · PodInspector.PodInspector (cyclomatic 17) · ×1
  • PodInspector.PodInspector (cyclomatic 17) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/PodInspector.tsx:76 — PodInspector.PodInspector has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · index.NamespaceListingWrapper (cyclomatic 17) · ×1
  • index.NamespaceListingWrapper (cyclomatic 17) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:113 — index.NamespaceListingWrapper has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 219, 449, 137, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.Namespaces (cyclomatic 17) · ×1
  • index.Namespaces (cyclomatic 17) ui/src/components/pages/Namespace/index.tsx:47 — index.Namespaces has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 67, 253, 164, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics (cyclomatic 17) · ×1
  • monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics (cyclomatic 17) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:168 — monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 182, 237, 175). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · numaflow_http · ×1
  • numaflow_http::data_handler (cyclomatic 16) rust/extns/numaflow-http/src/lib.rs:652 — numaflow_http::data_handler has cyclomatic complexity 16 (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.
D1 · Cyclomatic Complexity · SqsSource · ×1
  • SqsSource::read_messages (cyclomatic 16) rust/extns/numaflow-sqs/src/source.rs:1003 — SqsSource::read_messages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RedisStore · ×1
  • RedisStore::make_client (cyclomatic 16) rust/numaflow-throttling/src/state/store/redis_store.rs:296 — RedisStore::make_client has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.ClusterNamespaceListing (cyclomatic 16) · ×1
  • index.ClusterNamespaceListing (cyclomatic 16) ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:31 — index.ClusterNamespaceListing has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 51, 70, 85, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · clusterSummaryFetch.rawDataToClusterSummary (cyclomatic 16) · ×1
  • clusterSummaryFetch.rawDataToClusterSummary (cyclomatic 16) ui/src/utils/fetchWrappers/clusterSummaryFetch.ts:13 — clusterSummaryFetch.rawDataToClusterSummary has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 34). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.DeleteModal (cyclomatic 16) · ×1
  • index.DeleteModal (cyclomatic 16) ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:22 — index.DeleteModal has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 70, 35). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · pipelineViewFetch.usePipelineViewFetch.getVertexMetrics (cyclomatic 16) · ×1
  • pipelineViewFetch.usePipelineViewFetch.getVertexMetrics (cyclomatic 16) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:204 — pipelineViewFetch.usePipelineViewFetch.getVertexMetrics has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 234, 218, 221, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · App.App (cyclomatic 16) · ×1
  • App.App (cyclomatic 16) ui/src/components/plugin/NumaflowMonitorApp/App.tsx:34 — App.App has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 68, 149, 58, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D12 · Dependency Hygiene · Dependency pinned to a stale untagged commit · ×1
  • Dependency pinned to a stale untagged commit: github.com/gin-contrib/static — Direct dependency `github.com/gin-contrib/static` is required at `v0.0.2-0.20220606235426-ae09b2ea7e39` in REDACTED — a pseudo-version, which pins an UNTAGGED commit from 2022-06-06, 4.4 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of `github.com/gin-contrib/static` and has not moved this requirement in 4.4 years: every fix the module has published since that commit — including any security fix — is absent from this build, whether the module went quiet or moved on without you. Check whether `github.com/gin-contrib/static` now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit.
D2 · Cognitive Complexity · index.CustomNode (cognitive 68) · ×1
  • index.CustomNode (cognitive 68) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:75 — index.CustomNode has cognitive complexity 68 (threshold 15). Drivers by points: boolean chains 34, if/else 15 (18 pts), ternaries 12 (16 pts) (nesting depth added 7). Of this number, 49 points are the body's own statements and 19 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · index.PipelineListing (cognitive 59) · ×1
  • index.PipelineListing (cognitive 59) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelineListing/index.tsx:26 — index.PipelineListing has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 15 (34 pts), if/else 16 (19 pts), boolean chains 6 (nesting depth added 22). None of this is in the body itself: all 59 points belong to 9 function literals inside it that branch (lines 55, 213, 85, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.VertexDetails (cognitive 58) · ×1
  • index.VertexDetails (cognitive 58) ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126 — index.VertexDetails has cognitive complexity 58 (threshold 15). Drivers by points: boolean chains 27, if/else 19, ternaries 11, match/switch 1. Of this number, 23 points are the body's own statements and 35 belong to 14 function literals inside it that branch. 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.
D2 · Cognitive Complexity · pipelineViewFetch.usePipelineViewFetch (cognitive 58) · ×1
  • pipelineViewFetch.usePipelineViewFetch (cognitive 58) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:15 — pipelineViewFetch.usePipelineViewFetch has cognitive complexity 58 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 2, error handling 2 (nesting depth added 21). None of this is in the body itself: all 58 points belong to 8 function literals inside it that branch (lines 60, 117, 170, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.PipelineCard (cognitive 53) · ×1
  • index.PipelineCard (cognitive 53) ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47 — index.PipelineCard has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 26, if/else 16, ternaries 8 (10 pts), error handling 1 (nesting depth added 2). Of this number, 29 points are the body's own statements and 24 belong to 11 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · index.ISBListing (cognitive 52) · ×1
  • index.ISBListing (cognitive 52) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:28 — index.ISBListing has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (30 pts), ternaries 7 (19 pts), boolean chains 3 (nesting depth added 23). None of this is in the body itself: all 52 points belong to 8 function literals inside it that branch (lines 111, 93, 103, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.CustomEdge (cognitive 52) · ×1
  • index.CustomEdge (cognitive 52) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56 — index.CustomEdge has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (22 pts), ternaries 11 (18 pts), boolean chains 12 (nesting depth added 8). Of this number, 16 points are the body's own statements and 36 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · index.SlidingSidebar (cognitive 49) · ×1
  • index.SlidingSidebar (cognitive 49) ui/src/components/common/SlidingSidebar/index.tsx:93 — index.SlidingSidebar has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 12, ternaries 6 (8 pts), match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 10 of the 49 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 210, 170, 191, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · PipelineConfig · ×1
  • PipelineConfig::load (cognitive 47) rust/numaflow-core/src/config/pipeline.rs:298 — PipelineConfig::load has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (34 pts), match/switch 4 (10 pts), loops 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · monoVertexViewFetch.useMonoVertexViewFetch (cognitive 46) · ×1
  • monoVertexViewFetch.useMonoVertexViewFetch (cognitive 46) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 — monoVertexViewFetch.useMonoVertexViewFetch has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 3, error handling 1 (nesting depth added 18). None of this is in the body itself: all 46 points belong to 7 function literals inside it that branch (lines 56, 122, 128, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · goldenSignalsModel.lossCard (cognitive 45) · ×1
  • goldenSignalsModel.lossCard (cognitive 45) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:640 — goldenSignalsModel.lossCard has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 20 (31 pts), boolean chains 10, if/else 4 (nesting depth added 11). Of this number, 38 points are the body's own statements and 7 belong to 4 function items inside it that branch. 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.
D2 · Cognitive Complexity · index.ISBUpdate (cognitive 44) · ×1
  • index.ISBUpdate (cognitive 44) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:54 — index.ISBUpdate has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 9 (12 pts), boolean chains 9, error handling 4 (nesting depth added 4). Most of this is not in the body itself: 15 of the 44 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 96, 115, 174, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · goldenSignalsModel.errorsCard (cognitive 41) · ×1
  • goldenSignalsModel.errorsCard (cognitive 41) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:788 — goldenSignalsModel.errorsCard has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 18 (37 pts), boolean chains 4 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · ComponentHealthChecks · ×1
  • ComponentHealthChecks::ready (cognitive 40) rust/numaflow-core/src/metrics/mod.rs:295 — ComponentHealthChecks::ready has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 26). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · SinkActor · ×1
  • SinkActor::write_messages_with_retry (cognitive 39) rust/numaflow-core/src/sinker/actor.rs:57 — SinkActor::write_messages_with_retry has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (13 pts), loops 4 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RedisStore · ×1
  • RedisStore::make_client (cognitive 39) rust/numaflow-throttling/src/state/store/redis_store.rs:296 — RedisStore::make_client has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · index.MonoVertexCard (cognitive 39) · ×1
  • index.MonoVertexCard (cognitive 39) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:44 — index.MonoVertexCard has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 18, if/else 13, ternaries 6 (7 pts), error handling 1 (nesting depth added 1). Of this number, 20 points are the body's own statements and 19 belong to 11 function literals inside it that branch. 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.
D2 · Cognitive Complexity · index.Graph (cognitive 39) · ×1
  • index.Graph (cognitive 39) ui/src/components/pages/Pipeline/partials/Graph/index.tsx:716 — index.Graph has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 12, ternaries 2 (nesting depth added 4). None of this is in the body itself: all 39 points belong to 13 function literals inside it that branch (lines 852, 786, 828, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.Flow (cognitive 38) · ×1
  • index.Flow (cognitive 38) ui/src/components/pages/Pipeline/partials/Graph/index.tsx:204 — index.Flow has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 16, ternaries 10 (13 pts), if/else 8, error handling 1 (nesting depth added 3). Of this number, 24 points are the body's own statements and 14 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · index.CopyViewLinkButton (cognitive 36) · ×1
  • index.CopyViewLinkButton (cognitive 36) ui/src/components/common/CopyViewLinkButton/index.tsx:24 — index.CopyViewLinkButton has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 16 (31 pts), boolean chains 3, error handling 1, if/else 1 (nesting depth added 15). Of this number, 33 points are the body's own statements and 3 belong to 2 function literals inside it that branch. 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.
D2 · Cognitive Complexity · goldenSignalsModel.backlogCard (cognitive 36) · ×1
  • goldenSignalsModel.backlogCard (cognitive 36) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:538 — goldenSignalsModel.backlogCard has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 15, ternaries 13, if/else 8. Of this number, 34 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
D2 · Cognitive Complexity · pipelineViewFetch.usePipelineViewFetch.getVertexMetrics (cognitive 36) · ×1
  • pipelineViewFetch.usePipelineViewFetch.getVertexMetrics (cognitive 36) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:204 — pipelineViewFetch.usePipelineViewFetch.getVertexMetrics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 4 (nesting depth added 19). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 234, 211, 218, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics (cognitive 36) · ×1
  • monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics (cognitive 36) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:168 — monoVertexViewFetch.useMonoVertexViewFetch.getVertexMetrics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 4 (nesting depth added 19). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 182, 175, 237). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · ProcessorManager · ×1
  • ProcessorManager::start_ot_watcher (cognitive 35) rust/numaflow-core/src/watermark/processor/manager.rs:304 — ProcessorManager::start_ot_watcher has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). 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.
D2 · Cognitive Complexity · pipelineViewFetch.usePipelineViewFetch.edges (cognitive 35) · ×1
  • pipelineViewFetch.usePipelineViewFetch.edges (cognitive 35) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:528 — pipelineViewFetch.usePipelineViewFetch.edges has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 4 (10 pts), boolean chains 5 (nesting depth added 14). Most of this is not in the body itself: 4 of the 35 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 537, 565, 629, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · podsViewFetch.usePodsViewFetch (cognitive 34) · ×1
  • podsViewFetch.usePodsViewFetch (cognitive 34) ui/src/utils/fetcherHooks/podsViewFetch.ts:13 — podsViewFetch.usePodsViewFetch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), error handling 3 (9 pts), boolean chains 2, ternaries 2 (nesting depth added 13). None of this is in the body itself: all 34 points belong to 6 function items inside it that branch (fetchPods, a function literal at line 143, a function literal at line 67, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · AlignedReducer · ×1
  • AlignedReducer::start (cognitive 32) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:446 — AlignedReducer::start has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.SummaryPageLayout (cognitive 32) · ×1
  • index.SummaryPageLayout (cognitive 32) ui/src/components/common/SummaryPageLayout/index.tsx:203 — index.SummaryPageLayout has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 14 (25 pts), if/else 5, boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 15 of the 32 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 241, 317, 219, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · MapBatchTask · ×1
  • MapBatchTask::execute (cognitive 31) rust/numaflow-core/src/mapper/map/batch.rs:65 — MapBatchTask::execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (11 pts), loops 4 (8 pts) (nesting depth added 20). 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.
D2 · Cognitive Complexity · MapStreamTask · ×1
  • MapStreamTask::execute (cognitive 31) rust/numaflow-core/src/mapper/map/stream.rs:69 — MapStreamTask::execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (11 pts), loops 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · useVertexHealthData.useVertexHealthData (cognitive 31) · ×1
  • useVertexHealthData.useVertexHealthData (cognitive 31) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts:131 — useVertexHealthData.useVertexHealthData has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 13 (17 pts), if/else 10, boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 245, 166, 159, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.Login (cognitive 31) · ×1
  • index.Login (cognitive 31) REDACTED:37 — index.Login has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 10, error handling 4 (nesting depth added 3). None of this is in the body itself: all 31 points belong to 6 function literals inside it that branch (lines 201, 57, 153, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · SourceType · ×1
  • SourceType::try_from (cognitive 30) rust/numaflow-core/src/config/components/source.rs:184 — SourceType::try_from has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, loops 2 (3 pts), match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UnalignedReducer · ×1
  • UnalignedReducer::start (cognitive 30) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:565 — UnalignedReducer::start has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.K8sEvents (cognitive 30) · ×1
  • index.K8sEvents (cognitive 30) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:37 — index.K8sEvents has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 11, ternaries 5 (6 pts) (nesting depth added 2). Most of this is not in the body itself: 6 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 327, 63, 213, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.PipelineUpdate (cognitive 28) · ×1
  • index.PipelineUpdate (cognitive 28) ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:18 — index.PipelineUpdate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15, ternaries 3 (5 pts), boolean chains 4, error handling 4 (nesting depth added 2). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 93, 55, 146, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · SqsSourceBuilder · ×1
  • SqsSourceBuilder::build (cognitive 27) rust/extns/numaflow-sqs/src/source.rs:816 — SqsSourceBuilder::build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.PipelineCreate (cognitive 27) · ×1
  • index.PipelineCreate (cognitive 27) ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:44 — index.PipelineCreate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, boolean chains 4, error handling 4, ternaries 2 (4 pts) (nesting depth added 2). None of this is in the body itself: all 27 points belong to 11 function literals inside it that branch (lines 116, 78, 169, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · ISBWatermarkFetcher · ×1
  • ISBWatermarkFetcher::fetch_head_idle_wmb (cognitive 26) rust/numaflow-core/src/watermark/isb/wm_fetcher.rs:176 — ISBWatermarkFetcher::fetch_head_idle_wmb has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). 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.
D2 · Cognitive Complexity · App.App (cognitive 26) · ×1
  • App.App (cognitive 26) ui/src/App.tsx:71 — App.App has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 95, 120, 210, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · numaflow_http · ×1
  • numaflow_http::data_handler (cognitive 25) rust/extns/numaflow-http/src/lib.rs:652 — numaflow_http::data_handler has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 10 (17 pts), if/else 6 (7 pts), loops 1 (nesting depth added 8). 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.
D2 · Cognitive Complexity · BypassRouterReceiver · ×1
  • BypassRouterReceiver::streaming_bypass_write (cognitive 25) rust/numaflow-core/src/monovertex/bypass_router.rs:239 — BypassRouterReceiver::streaming_bypass_write has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), match/switch 4 (10 pts), if/else 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.VertexUpdate (cognitive 25) · ×1
  • index.VertexUpdate (cognitive 25) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:30 — index.VertexUpdate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, boolean chains 5, error handling 4, ternaries 4. Most of this is not in the body itself: 8 of the 25 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 71, 134, 225, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · pipelineFetch.usePipelineSummaryFetch (cognitive 25) · ×1
  • pipelineFetch.usePipelineSummaryFetch (cognitive 25) ui/src/utils/fetchWrappers/pipelineFetch.ts:11 — pipelineFetch.usePipelineSummaryFetch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · SqsActor · ×1
  • SqsActor::get_messages (cognitive 24) rust/extns/numaflow-sqs/src/source.rs:234 — SqsActor::get_messages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · MessageGraph · ×1
  • MessageGraph::generate_subgraph (cognitive 24) rust/serving/src/app/tracker.rs:147 — MessageGraph::generate_subgraph has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), boolean chains 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.
D2 · Cognitive Complexity · KafkaActor · ×1
  • KafkaActor::read_messages (cognitive 23) rust/extns/numaflow-kafka/src/source.rs:285 — KafkaActor::read_messages has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 13). 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.
D2 · Cognitive Complexity · pipelineISBDebugFetch.usePipelineISBDebugFetch (cognitive 23) · ×1
  • pipelineISBDebugFetch.usePipelineISBDebugFetch (cognitive 23) ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:30 — pipelineISBDebugFetch.usePipelineISBDebugFetch has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6, ternaries 6. Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 122, 111). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · MapHandle · ×1
  • MapHandle::process_concurrent_messages (cognitive 22) rust/numaflow-core/src/mapper/map.rs:231 — MapHandle::process_concurrent_messages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (6 pts), 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.
D2 · Cognitive Complexity · index.Pipeline (cognitive 22) · ×1
  • index.Pipeline (cognitive 22) ui/src/components/pages/Pipeline/index.tsx:41 — index.Pipeline has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 10, ternaries 1. Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 150, 102, 256, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · SqsSource · ×1
  • SqsSource::read_messages (cognitive 21) rust/extns/numaflow-sqs/src/source.rs:1003 — SqsSource::read_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SideInputSynchronizer · ×1
  • SideInputSynchronizer::run (cognitive 21) rust/numaflow-sideinput/src/synchronize.rs:62 — SideInputSynchronizer::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · namespaceSummaryFetch.useNamespaceSummaryFetch (cognitive 21) · ×1
  • namespaceSummaryFetch.useNamespaceSummaryFetch (cognitive 21) ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts:130 — namespaceSummaryFetch.useNamespaceSummaryFetch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9 (nesting depth added 3). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 193). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.NodeInfo (cognitive 21) · ×1
  • index.NodeInfo (cognitive 21) ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:21 — index.NodeInfo has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 19, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · MapUnaryTask · ×1
  • MapUnaryTask::execute (cognitive 20) rust/numaflow-core/src/mapper/map/unary.rs:72 — MapUnaryTask::execute has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (6 pts), loops 3 (5 pts) (nesting depth added 11). 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.
D2 · Cognitive Complexity · index.Breadcrumbs (cognitive 20) · ×1
  • index.Breadcrumbs (cognitive 20) ui/src/components/common/Breadcrumbs/index.tsx:11 — index.Breadcrumbs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5 (nesting depth added 5). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 19). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.ISBDebugInfo (cognitive 20) · ×1
  • index.ISBDebugInfo (cognitive 20) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/partials/ISBDebugInfo/index.tsx:122 — index.ISBDebugInfo has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, ternaries 3, if/else 2. Of this number, 10 points are the body's own statements and 10 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · pipelineHealthFetch.usePipelineHealthFetch (cognitive 20) · ×1
  • pipelineHealthFetch.usePipelineHealthFetch (cognitive 20) ui/src/utils/fetchWrappers/pipelineHealthFetch.ts:12 — pipelineHealthFetch.usePipelineHealthFetch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 60). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · monoVertexHealthFetch.useMonoVertexHealthFetch (cognitive 20) · ×1
  • monoVertexHealthFetch.useMonoVertexHealthFetch (cognitive 20) ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:11 — monoVertexHealthFetch.useMonoVertexHealthFetch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 57). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · numaflow_kafka · ×1
  • numaflow_kafka::update_auth_config (cognitive 19) rust/extns/numaflow-kafka/src/lib.rs:98 — numaflow_kafka::update_auth_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ISBReaderOrchestrator · ×1
  • ISBReaderOrchestrator::wip_loop (cognitive 19) rust/numaflow-core/src/pipeline/isb/reader.rs:199 — ISBReaderOrchestrator::wip_loop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · metricsFetch.useMetricsFetch (cognitive 19) · ×1
  • metricsFetch.useMetricsFetch (cognitive 19) ui/src/utils/fetchWrappers/metricsFetch.ts:11 — metricsFetch.useMetricsFetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 24). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.PodViewNext (cognitive 19) · ×1
  • index.PodViewNext (cognitive 19) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.tsx:63 — index.PodViewNext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 4. Of this number, 10 points are the body's own statements and 9 belong to 3 function literals inside it that branch. 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.
D2 · Cognitive Complexity · pipelineViewFetch.usePipelineViewFetch.setPipelineDetails (cognitive 19) · ×1
  • pipelineViewFetch.usePipelineViewFetch.setPipelineDetails (cognitive 19) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:358 — pipelineViewFetch.usePipelineViewFetch.setPipelineDetails has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 391, 420, 360, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · monoVertexViewFetch.useMonoVertexViewFetch.edges (cognitive 19) · ×1
  • monoVertexViewFetch.useMonoVertexViewFetch.edges (cognitive 19) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:350 — monoVertexViewFetch.useMonoVertexViewFetch.edges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 399, 387). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Retry · ×1
  • Retry::poll (cognitive 18) rust/backoff/src/retry.rs:113 — Retry::poll has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 2 (5 pts) (nesting depth added 11). 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.
D2 · Cognitive Complexity · Transformer · ×1
  • Transformer::transform_batch (cognitive 18) rust/numaflow-core/src/transformer.rs:165 — Transformer::transform_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HealthCheckClients · ×1
  • HealthCheckClients::ready (cognitive 17) rust/numaflow-core/src/sinker/builder.rs:27 — HealthCheckClients::ready has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 4 (8 pts), boolean chains 1 (nesting depth added 4). 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.
D2 · Cognitive Complexity · index.Buffers (cognitive 17) · ×1
  • index.Buffers (cognitive 17) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Buffers/index.tsx:120 — index.Buffers has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4, ternaries 4. Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 189, 219, 243, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.ISBCreate (cognitive 17) · ×1
  • index.ISBCreate (cognitive 17) ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:34 — index.ISBCreate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), error handling 4 (nesting depth added 1). None of this is in the body itself: all 17 points belong to 7 function literals inside it that branch (lines 51, 110, 201, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.DeleteModal (cognitive 17) · ×1
  • index.DeleteModal (cognitive 17) ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:22 — index.DeleteModal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 pts), boolean chains 3, error handling 1, match/switch 1 (nesting depth added 2). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 70, 35). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Runtime · ×1
  • Runtime::get_application_errors (cognitive 16) rust/numaflow-core/src/runtime_server/runtime.rs:269 — Runtime::get_application_errors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.ProcessingRates (cognitive 16) · ×1
  • index.ProcessingRates (cognitive 16) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/ProcessingRates/index.tsx:35 — index.ProcessingRates has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 3, ternaries 3. Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 54, a function literal at line 45, formatRate, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · index.PipelineISBDebugInfo (cognitive 16) · ×1
  • index.PipelineISBDebugInfo (cognitive 16) ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:564 — index.PipelineISBDebugInfo has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (5 pts), if/else 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · podFleetModel.classifyPod (cognitive 16) · ×1
  • podFleetModel.classifyPod (cognitive 16) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/podFleetModel.ts:83 — podFleetModel.classifyPod has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 3, if/else 3 (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.
D2 · Cognitive Complexity · index.NamespaceListingWrapper (cognitive 16) · ×1
  • index.NamespaceListingWrapper (cognitive 16) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:113 — index.NamespaceListingWrapper has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 2 (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 219, 449, 137, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.Namespaces (cognitive 16) · ×1
  • index.Namespaces (cognitive 16) ui/src/components/pages/Namespace/index.tsx:47 — index.Namespaces has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 1. Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 67, 253, 164, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · pipelineViewFetch.usePipelineViewFetch.getPipelineWatermarks (cognitive 16) · ×1
  • pipelineViewFetch.usePipelineViewFetch.getPipelineWatermarks (cognitive 16) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:302 — pipelineViewFetch.usePipelineViewFetch.getPipelineWatermarks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 313, 320, 335). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.MonoVertex (cognitive 16) · ×1
  • index.MonoVertex (cognitive 16) ui/src/components/pages/MonoVertex/index.tsx:33 — index.MonoVertex has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 104, 177, 73, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · App.App (cognitive 16) · ×1
  • App.App (cognitive 16) ui/src/components/plugin/NumaflowMonitorApp/App.tsx:34 — App.App has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 68, 149, 58, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D35 · Change Coupling · Change coupling clique · ×1
  • Change coupling clique: map_forwarder.rs, reduce_forwarder.rs, sink_forwarder.rs, source_forwarder.rs rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs — 4 files — `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs`, `rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs`, `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs`, `rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs` — all change together with no explicit dependency: a fully-connected co-change clique, not 6 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (79 shared lines) · ×1
  • Near-duplicate member pair (79 shared lines) rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:101 — rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:101-240 | rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:249-374 — These two members are variants of one another: 79 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (66 shared lines) · ×1
  • Near-duplicate member pair (66 shared lines) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:96 — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:96-208 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:218-322 — These two members are variants of one another: 66 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (64 shared lines) · ×1
  • Near-duplicate member pair (64 shared lines) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:450 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:450-576 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:569-707 — These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (53 shared lines) · ×1
  • Near-duplicate member pair (53 shared lines) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:102 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:102-234 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:88-223 — These two members are variants of one another: 53 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (47 shared lines) · ×1
  • Near-duplicate member pair (47 shared lines) rust/serving/src/app/jetstream_proxy.rs:245 — rust/serving/src/app/jetstream_proxy.rs:245-382 | rust/serving/src/app/jetstream_proxy.rs:392-486 — These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Edited copy of a member (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) rust/numaflow/src/cmdline/sideinput.rs:21 — rust/numaflow/src/cmdline/sideinput.rs:21-49 | rust/numaflow/src/cmdline/sideinput.rs:71-99 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) rust/numaflow-core/src/mapper/map.rs:574 — rust/numaflow-core/src/mapper/map.rs:574-606 | rust/numaflow-core/src/sinker/sink/user_defined.rs:57-94 | rust/numaflow-core/src/source/user_defined.rs:90-125 | rust/numaflow-core/src/source/user_defined.rs:293-328 | rust/numaflow-core/src/transformer/user_defined.rs:135-168 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copy of a member (254 corresponding lines) · ×1
  • Edited copy of a member (254 corresponding lines) rust/numaflow-core/src/source.rs:490 — rust/numaflow-core/src/source.rs:490-796 | rust/numaflow-core/src/source.rs:805-1058 — These two members are one piece of code written twice and then edited apart: 254 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (76 corresponding lines) · ×1
  • Edited copy of a member (76 corresponding lines) rust/serving/src/app/orchestrator.rs:56 — rust/serving/src/app/orchestrator.rs:56-131 | rust/serving/src/app/orchestrator.rs:171-260 — These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (62 corresponding lines) · ×1
  • Edited copy of a member (62 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:622 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:622-683 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:755-817 — These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (53 corresponding lines) · ×1
  • Edited copy of a member (53 corresponding lines) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:251 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:251-303 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:240-299 — These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (47 corresponding lines) · ×1
  • Edited copy of a member (47 corresponding lines) rust/numaflow-core/src/sinker/sink.rs:477 — rust/numaflow-core/src/sinker/sink.rs:477-526 | rust/numaflow-core/src/sinker/sink.rs:533-579 — These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (36 corresponding lines) · ×1
  • Edited copy of a member (36 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:120 — rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:120-155 | rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/session.rs:119-160 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (48 corresponding lines) · ×1
  • Edited copy of a member (48 corresponding lines) rust/serving/src/app/store/datastore/jetstream.rs:382 — rust/serving/src/app/store/datastore/jetstream.rs:382-429 | rust/serving/src/app/store/datastore/jetstream.rs:441-491 — These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (38 corresponding lines) · ×1
  • Edited copy of a member (38 corresponding lines) rust/numaflow-core/src/reduce/wal/segment/compactor.rs:399 — rust/numaflow-core/src/reduce/wal/segment/compactor.rs:399-436 | rust/numaflow-core/src/reduce/wal/segment/compactor.rs:443-489 — These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) rust/extns/numaflow-pulsar/src/source.rs:370 — rust/extns/numaflow-pulsar/src/source.rs:370-400 | rust/extns/numaflow-pulsar/src/source.rs:402-432 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) rust/serving/src/app.rs:55 — rust/serving/src/app.rs:55-83 | rust/serving/src/app.rs:94-126 — These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 22+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 22+ corresponding lines) rust/numaflow-core/src/source/jetstream.rs:17 — rust/numaflow-core/src/source/jetstream.rs:17-42 | rust/numaflow-core/src/source/nats.rs:23-44 | rust/numaflow-core/src/source/pulsar.rs:15-40 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 27+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 27+ corresponding lines) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:51 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:51-93 | rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:52-91 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:49-79 | rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs:42-68 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (28 corresponding lines) · ×1
  • Edited copy of a member (28 corresponding lines) rust/numaflow-throttling/src/lib.rs:344 — rust/numaflow-throttling/src/lib.rs:344-371 | rust/numaflow-throttling/src/lib.rs:445-475 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) rust/numaflow-shared/src/kv/inmemory/store.rs:223 — rust/numaflow-shared/src/kv/inmemory/store.rs:223-246 | rust/numaflow-shared/src/kv/inmemory/store.rs:248-269 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 20+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 20+ corresponding lines) rust/numaflow-core/src/mapper/map/batch.rs:260 — rust/numaflow-core/src/mapper/map/batch.rs:260-279 | rust/numaflow-core/src/mapper/map/stream.rs:244-263 | rust/numaflow-core/src/mapper/map/unary.rs:243-262 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 15+ corresponding lines) rust/numaflow-core/src/shared/grpc.rs:158 — rust/numaflow-core/src/shared/grpc.rs:158-172 | rust/numaflow-sideinput/src/manager/client.rs:86-100 | rust/serving/src/app/store/datastore/user_defined.rs:92-106 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 25+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 25+ corresponding lines) rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:82 — rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:82-108 | rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:113-137 | rust/numaflow-core/src/pipeline/isb/inmemory/reader.rs:152-177 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×1
  • Edited copy of a member (18 corresponding lines) rust/numaflow-core/src/sinker/sink.rs:182 — rust/numaflow-core/src/sinker/sink.rs:182-199 | rust/numaflow-core/src/sinker/sink.rs:206-228 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) rust/numaflow-core/src/watermark/idle/isb.rs:100 — rust/numaflow-core/src/watermark/idle/isb.rs:100-119 | rust/numaflow-core/src/watermark/idle/isb.rs:168-186 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×1
  • Edited copy of a member (17 corresponding lines) rust/numaflow-core/src/pipeline/isb/reader.rs:357 — rust/numaflow-core/src/pipeline/isb/reader.rs:357-373 | rust/numaflow-core/src/pipeline/isb/reader.rs:375-391 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 9+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 9+ corresponding lines) rust/numaflow-core/src/shared/grpc.rs:205 — rust/numaflow-core/src/shared/grpc.rs:205-213 | rust/numaflow-core/src/shared/grpc.rs:223-231 | rust/numaflow-core/src/shared/grpc.rs:241-249 | rust/numaflow-core/src/shared/grpc.rs:259-267 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×1
  • Edited copy of a member (14 corresponding lines) rust/extns/numaflow-http/src/lib.rs:390 — rust/extns/numaflow-http/src/lib.rs:390-403 | rust/extns/numaflow-http/src/lib.rs:406-422 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) rust/numaflow-core/src/pipeline/isb/factory.rs:98 — rust/numaflow-core/src/pipeline/isb/factory.rs:98-109 | rust/numaflow-shared/src/isb.rs:44-55 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:212 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:212-230 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:411-426 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 12+ corresponding lines) rust/numaflow-core/src/mapper/map/batch.rs:282 — rust/numaflow-core/src/mapper/map/batch.rs:282-296 | rust/numaflow-core/src/mapper/map/batch.rs:517-528 | rust/numaflow-core/src/mapper/map/stream.rs:266-281 | rust/numaflow-core/src/mapper/map/unary.rs:265-277 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) rust/numaflow-core/src/source/jetstream.rs:81 — rust/numaflow-core/src/source/jetstream.rs:81-93 | rust/numaflow-core/src/source/jetstream.rs:95-108 | rust/numaflow-core/src/source/sqs.rs:159-170 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 11+ corresponding lines) rust/extns/numaflow-http/src/lib.rs:467 — rust/extns/numaflow-http/src/lib.rs:467-479 | rust/extns/numaflow-http/src/lib.rs:482-492 | rust/extns/numaflow-http/src/lib.rs:495-505 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (7 members, 7+ corresponding lines) · ×1
  • Edited copies of one member (7 members, 7+ corresponding lines) rust/extns/numaflow-kafka/src/source.rs:647 — rust/extns/numaflow-kafka/src/source.rs:647-656 | rust/extns/numaflow-kafka/src/source.rs:658-664 | rust/extns/numaflow-kafka/src/source.rs:666-672 | rust/extns/numaflow-nats/src/jetstream.rs:467-473 | rust/extns/numaflow-nats/src/jetstream.rs:475-484 | rust/extns/numaflow-nats/src/jetstream.rs:486-495 | rust/extns/numaflow-nats/src/jetstream.rs:497-503 — These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) rust/numaflow-core/src/mapper/map.rs:125 — rust/numaflow-core/src/mapper/map.rs:125-137 | rust/numaflow-core/src/transformer.rs:389-402 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (5 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (5 members, 10+ corresponding lines) rust/numaflow-core/src/sinker/sink.rs:165 — rust/numaflow-core/src/sinker/sink.rs:165-175 | rust/numaflow-core/src/source.rs:428-440 | rust/numaflow-core/src/source.rs:446-458 | rust/numaflow-core/src/source.rs:461-470 | rust/numaflow-core/src/source.rs:473-482 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×1
  • Edited copy of a member (5 corresponding lines) rust/numaflow-core/src/sinker/sink/serve/user_defined.rs:18 — rust/numaflow-core/src/sinker/sink/serve/user_defined.rs:18-22 | rust/serving/src/app/store/datastore/user_defined.rs:26-32 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (47 lines × 2) · ×1
  • Duplicated block (47 lines × 2) rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:145 — rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:145-191 | rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:280-326 — 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 `rust/numaflow-core/src/pipeline/forwarder/reduce_forwarder.rs:145` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (38–40 lines × 2) · ×1
  • Duplicated block (38–40 lines × 2) rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:121 — rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:121-160 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:242-279 — 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 `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:121` 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.
D4 · Code Duplication · Duplicated block (36 lines × 2) · ×1
  • Duplicated block (36 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:625 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:625-660 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:758-793 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:625` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:662` calls `timestamp_millis` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:795` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (32 lines × 2) · ×1
  • Duplicated block (32 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:477 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:477-508 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:596-627 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:477` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (29 lines × 2) · ×1
  • Duplicated block (29 lines × 2) rust/numaflow-core/src/source.rs:719 — rust/numaflow-core/src/source.rs:719-747 | rust/numaflow-core/src/source.rs:983-1011 — 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 `rust/numaflow-core/src/source.rs:719` 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.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:94 — rust/numaflow-core/src/reduce/reducer/aligned/windower/fixed.rs:94-121 | rust/numaflow-core/src/reduce/reducer/aligned/windower/sliding.rs:161-188 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (23–27 lines × 2) · ×1
  • Duplicated block (23–27 lines × 2) rust/numaflow-core/src/mapper/map/stream.rs:187 — rust/numaflow-core/src/mapper/map/stream.rs:187-209 | rust/numaflow-core/src/mapper/map/unary.rs:113-139 — before extracting anything, compare `rust/numaflow-core/src/mapper/map/stream.rs` and `rust/numaflow-core/src/mapper/map/unary.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map/stream.rs: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.
D4 · Code Duplication · Duplicated block (25–26 lines × 2) · ×1
  • Duplicated block (25–26 lines × 2) rust/extns/numaflow-pulsar/src/sink.rs:79 — rust/extns/numaflow-pulsar/src/sink.rs:79-103 | rust/extns/numaflow-pulsar/src/source.rs:172-197 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/extns/numaflow-pulsar/src/source.rs:172` 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 first that the copies are not typed on the same thing: the declarations holding them bind `config` to `Config` in one and `PulsarSourceConfig` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (25 lines × 3) · ×1
  • Duplicated block (25 lines × 3) rust/numaflow-core/src/sinker/builder.rs:221 — rust/numaflow-core/src/sinker/builder.rs:221-245 | rust/numaflow-core/src/sinker/builder.rs:276-300 | rust/numaflow-core/src/sinker/builder.rs:335-359 — 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 `rust/numaflow-core/src/sinker/builder.rs:221` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:452 — rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs:452-475 | rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs:571-594 — `rust/numaflow-core/src/reduce/reducer/aligned/reducer.rs` and `rust/numaflow-core/src/reduce/reducer/unaligned/reducer.rs` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 7 separate duplicated blocks between them, totalling at least 127 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
D4 · Code Duplication · Duplicated block (22–23 lines × 3) · ×1
  • Duplicated block (22–23 lines × 3) rust/numaflow-core/src/sinker/builder.rs:198 — rust/numaflow-core/src/sinker/builder.rs:198-219 | rust/numaflow-core/src/sinker/builder.rs:252-274 | rust/numaflow-core/src/sinker/builder.rs:311-333 — 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 `rust/numaflow-core/src/sinker/builder.rs:198` 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.
D4 · Code Duplication · Duplicated block (20–23 lines × 2) · ×1
  • Duplicated block (20–23 lines × 2) rust/numaflow-throttling/src/lib.rs:346 — rust/numaflow-throttling/src/lib.rs:346-365 | rust/numaflow-throttling/src/lib.rs:447-469 — 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 `rust/numaflow-throttling/src/lib.rs:346` 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.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • Duplicated block (20 lines × 2) rust/numaflow-core/src/lib.rs:286 — rust/numaflow-core/src/lib.rs:286-305 | rust/numaflow/src/main.rs:146-165 — 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
D4 · Code Duplication · Duplicated block (15–18 lines × 2) · ×1
  • Duplicated block (15–18 lines × 2) rust/serving/src/app/store/cbstore/jetstream_store.rs:276 — rust/serving/src/app/store/cbstore/jetstream_store.rs:276-290 | rust/serving/src/app/store/datastore/jetstream.rs:205-222 — 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 `rust/serving/src/app/store/cbstore/jetstream_store.rs:276` 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.
D4 · Code Duplication · Duplicated block (15–17 lines × 2) · ×1
  • Duplicated block (15–17 lines × 2) rust/serving/src/app/store/cbstore/jetstream_store.rs:53 — rust/serving/src/app/store/cbstore/jetstream_store.rs:53-69 | rust/serving/src/app/store/datastore/jetstream.rs:104-118 — 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 `rust/serving/src/app/store/cbstore/jetstream_store.rs:53` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
D4 · Code Duplication · Duplicated block (14–16 lines × 2) · ×1
  • Duplicated block (14–16 lines × 2) rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/accumulator.rs:148 — rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/accumulator.rs:148-161 | rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/session.rs:202-217 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/accumulator.rs:148` 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.
D4 · Code Duplication · Duplicated block (13–15 lines × 3) · ×1
  • Duplicated block (13–15 lines × 3) rust/numaflow-core/src/config/components.rs:33 — rust/numaflow-core/src/config/components.rs:33-45 | rust/numaflow-core/src/config/components.rs:57-71 | rust/numaflow-core/src/config/components.rs:84-98 — 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 `rust/numaflow-core/src/config/components.rs:33` 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 `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. 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.
D4 · Code Duplication · Duplicated block (12–13 lines × 4) · ×1
  • Duplicated block (12–13 lines × 4) rust/numaflow-core/src/shared/create_components.rs:102 — rust/numaflow-core/src/shared/create_components.rs:102-114 | rust/numaflow-core/src/shared/create_components.rs:165-177 | rust/numaflow-core/src/shared/create_components.rs:219-231 | rust/numaflow-core/src/shared/create_components.rs:274-285 — 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 `rust/numaflow-core/src/shared/create_components.rs:102` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (11–13 lines × 3) · ×1
  • Duplicated block (11–13 lines × 3) rust/numaflow-core/src/config/components/sink.rs:55 — rust/numaflow-core/src/config/components/sink.rs:55-65 | rust/numaflow-core/src/config/components/sink.rs:78-90 | rust/numaflow-core/src/config/components/sink.rs:120-132 — 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 `rust/numaflow-core/src/config/components/sink.rs: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.
D4 · Code Duplication · Duplicated block (11–12 lines × 3) · ×1
  • Duplicated block (11–12 lines × 3) rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:158 — rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:158-169 | rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs:147-157 | rust/numaflow-core/src/pipeline/forwarder/source_forwarder.rs:136-146 — before extracting anything, compare `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs` and `rust/numaflow-core/src/pipeline/forwarder/sink_forwarder.rs` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/pipeline/forwarder/map_forwarder.rs:158` 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.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1
  • Duplicated block (12 lines × 3) rust/numaflow/src/cmdline/sideinput.rs:38 — rust/numaflow/src/cmdline/sideinput.rs:38-49 | rust/numaflow/src/cmdline/sideinput.rs:58-69 | rust/numaflow/src/cmdline/sideinput.rs:88-99 — 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 `rust/numaflow/src/cmdline/sideinput.rs:38` 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.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×1
  • Duplicated block (11–12 lines × 2) rust/numaflow-core/src/sinker/sink.rs:478 — rust/numaflow-core/src/sinker/sink.rs:478-489 | rust/numaflow-core/src/sinker/sink.rs:534-544 — 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 `rust/numaflow-core/src/sinker/sink.rs:478` 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.
D4 · Code Duplication · Duplicated block (7–9 lines × 2) · ×1
  • Duplicated block (7–9 lines × 2) rust/numaflow-core/src/config/components/sink.rs:223 — rust/numaflow-core/src/config/components/sink.rs:223-231 | rust/numaflow-core/src/config/components/source.rs:421-427 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/config/components/sink.rs:223` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/config/components/sink.rs:215` calls `unwrap_or` and `rust/numaflow-core/src/config/components/source.rs:413` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 5) · ×1
  • Duplicated block (8 lines × 5) rust/numaflow-core/src/mapper/map.rs:589 — rust/numaflow-core/src/mapper/map.rs:589-596 | rust/numaflow-core/src/sinker/sink/user_defined.rs:74-83 | rust/numaflow-core/src/source/user_defined.rs:106-115 | rust/numaflow-core/src/source/user_defined.rs:309-318 | rust/numaflow-core/src/transformer/user_defined.rs:151-158 — before extracting anything, compare `rust/numaflow-core/src/mapper/map.rs` and `rust/numaflow-core/src/transformer/user_defined.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map.rs:589` 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.
D4 · Code Duplication · Duplicated block (5–7 lines × 2) · ×1
  • Duplicated block (5–7 lines × 2) rust/numaflow-core/src/mapper/map.rs:542 — rust/numaflow-core/src/mapper/map.rs:542-546 | rust/numaflow-core/src/transformer/user_defined.rs:46-52 — before extracting anything, compare `rust/numaflow-core/src/mapper/map.rs` and `rust/numaflow-core/src/transformer/user_defined.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map.rs:542` 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `value` to `UserDefinedMessage<'_>` in one and `UserDefinedTransformerMessage<'_>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) rust/numaflow-core/src/mapper/map/batch.rs:288 — rust/numaflow-core/src/mapper/map/batch.rs:288-294 | rust/numaflow-core/src/mapper/map/unary.rs:269-274 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `rust/numaflow-core/src/mapper/map/batch.rs:288` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (2–5 lines × 3) · ×1
  • Duplicated block (2–5 lines × 3) rust/numaflow-core/src/config/pipeline.rs:565 — rust/numaflow-core/src/config/pipeline.rs:565-566 | rust/numaflow-core/src/config/pipeline.rs:574-578 | rust/numaflow-core/src/config/pipeline.rs:604-608 — 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 `rust/numaflow-core/src/config/pipeline.rs:574` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/config/pipeline.rs:574` calls `leak`, `clone`, `into_boxed_str` and `rust/numaflow-core/src/config/pipeline.rs:565` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1
  • Duplicated block (6 lines × 4) rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:262 — rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:262-267 | rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/accumulator.rs:177-182 | rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/session.rs:256-261 | rust/serving/src/app/store/datastore/user_defined.rs:60-65 — 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 first that the copies are not typed on the same thing: the declarations holding them bind `self` to `crate) async fn ready(&mut` in one and `&mut` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `rust/numaflow-core/src/reduce/reducer/unaligned/user_defined/accumulator.rs:174` calls `Ok` and `rust/numaflow-core/src/reduce/reducer/aligned/user_defined.rs:259` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) rust/numaflow-core/src/shared/create_components.rs:821 — rust/numaflow-core/src/shared/create_components.rs:821-826 | rust/numaflow-throttling/src/state/store/redis_store.rs:544-549 | rust/serving/src/config.rs:303-308 — 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.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×1
  • Duplicated block (5 lines × 3) rust/extns/numaflow-kafka/src/source.rs:633 — rust/extns/numaflow-kafka/src/source.rs:633-637 | rust/extns/numaflow-nats/src/jetstream.rs:461-465 | rust/extns/numaflow-nats/src/nats.rs:186-190 — 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 `rust/extns/numaflow-kafka/src/source.rs:633` 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.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×1
  • Duplicated block (9 lines × 4) rust/numaflow-core/src/shared/grpc.rs:42 — rust/numaflow-core/src/shared/grpc.rs:42-50 | rust/numaflow-core/src/shared/grpc.rs:63-71 | rust/numaflow-core/src/shared/grpc.rs:84-92 | rust/numaflow-core/src/shared/grpc.rs:105-113 — 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 `rust/numaflow-core/src/shared/grpc.rs:42` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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 first that the copies are not typed on the same thing: the declarations holding them bind `client` to `&mut SourceClient<Channel>` in one and `&mut SinkClient<Channel>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (14 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (14 clone groups) ui/src/components/pages/MonoVertex/index.tsx:65 — 14 of the duplicated blocks reported below have copies in at least two of the sibling directories Cluster, MonoVertex, Namespace, Pipeline under ui/src/components/pages/. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 3 sibling directories (10 clone groups) · ×1
  • Duplication concentrated across 3 sibling directories (10 clone groups) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45 — 10 duplicated blocks under ui/src/components/pages/Namespace/partials/ have copies in at least two of the sibling directories MonoVertexCard, NamespaceListingWrapper, PipelineCard — 7 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 8 sibling directories (8 clone groups) · ×1
  • Duplication concentrated across 8 sibling directories (8 clone groups) ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1 — 8 duplicated blocks under ui/src/components/common/SlidingSidebar/partials/ have copies in at least two of the sibling directories GeneratorDetails, ISBCreate, ISBUpdate, K8sEvents, PipelineCreate, PipelineISBDebugInfo (+2 more sibling(s) not listed) — 5 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 3 sibling directories (7 clone groups) · ×1
  • Duplication concentrated across 3 sibling directories (7 clone groups) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78 — 7 duplicated blocks under ui/src/components/ have copies in at least two of the sibling directories common, pages, plugin — 6 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block with local edits (186 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (186 matched lines × 2 locations) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:29 · ui/src/utils/fetcherHooks/pipelineViewFetch.ts:15 — the two spans are one implementation copied and then locally edited — 1124 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (172 identical lines × 2 files) · ×1
  • Wholesale file copy (172 identical lines × 2 files) ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1 — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1 · ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:1 — these 2 files are line-for-line copies of one another — 172 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (165 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (165 matched lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:76 — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:76 · ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx:48 — the two spans are one implementation copied and then locally edited — 760 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (160 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (160 matched lines × 2 locations) ui/src/components/pages/MonoVertex/index.tsx:65 — ui/src/components/pages/MonoVertex/index.tsx:65 · ui/src/components/pages/Pipeline/index.tsx:72 — the two spans are one implementation copied and then locally edited — 583 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (158 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (158 matched lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:63 — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:63 · ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:26 — the two spans are one implementation copied and then locally edited — 744 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (147 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (147 matched lines × 2 locations) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45 — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:45 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:49 — the two spans are one implementation copied and then locally edited — 824 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (144 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (144 matched lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78 — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:78 · ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:96 — the two spans are one implementation copied and then locally edited — 604 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (136 lines × 2 locations) · ×1
  • Duplicated block (136 lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:99 — ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:99 · ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:158 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (95 lines × 2 locations) · ×1
  • Duplicated block (95 lines × 2 locations) ui/src/App.tsx:141 — ui/src/App.tsx:141 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:80 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (83 lines × 2 locations) · ×1
  • Duplicated block (83 lines × 2 locations) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:458 — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:458 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:493 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block with local edits (83 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (83 matched lines × 2 locations) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:103 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:103 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelineListing/index.tsx:74 — the two spans are one implementation copied and then locally edited — 416 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (76 identical lines × 2 files) · ×1
  • Wholesale file copy (76 identical lines × 2 files) ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:2 — ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:2 · ui/src/utils/fetchWrappers/vertex.ts:2 — these 2 files are line-for-line copies of one another — 76 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (74 lines × 2 locations) · ×1
  • Duplicated block (74 lines × 2 locations) ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:47 — ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:47 · ui/src/components/pages/Pipeline/partials/PipelineSummaryStatus/index.tsx:57 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (73 lines × 2 locations) · ×1
  • Duplicated block (73 lines × 2 locations) ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:275 — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:275 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:311 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (57 lines × 2 locations) · ×1
  • Duplicated block (57 lines × 2 locations) ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:58 — ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:58 · ui/src/utils/fetchWrappers/pipelineHealthFetch.ts:61 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Wholesale file copy (56 identical lines × 2 files) · ×1
  • Wholesale file copy (56 identical lines × 2 files) ui/src/utils/fetchWrappers/monoVertexUpdateFetch.ts:1 — ui/src/utils/fetchWrappers/monoVertexUpdateFetch.ts:1 · ui/src/utils/fetchWrappers/pipelineUpdateFetch.ts:1 — these 2 files are line-for-line copies of one another — 56 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (55 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (55 matched lines × 2 locations) ui/src/components/common/Breadcrumbs/index.tsx:88 — ui/src/components/common/Breadcrumbs/index.tsx:88 · ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx:33 — the two spans are one implementation copied and then locally edited — 209 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (55 identical lines × 2 files) · ×1
  • Wholesale file copy (55 identical lines × 2 files) ui/src/components/pages/MonoVertex/partials/MonoVertexStatus/index.tsx:1 — ui/src/components/pages/MonoVertex/partials/MonoVertexStatus/index.tsx:1 · ui/src/components/pages/Pipeline/partials/PipelineStatus/index.tsx:1 — these 2 files are line-for-line copies of one another — 55 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (51 lines × 2 locations) · ×1
  • Duplicated block (51 lines × 2 locations) ui/src/utils/fetchWrappers/errorsFetch.ts:48 — ui/src/utils/fetchWrappers/errorsFetch.ts:48 · ui/src/utils/fetchWrappers/monoVertexFetch.ts:42 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (49 lines × 2 locations) · ×1
  • Duplicated block (49 lines × 2 locations) ui/src/components/pages/Cluster/index.tsx:64 — ui/src/components/pages/Cluster/index.tsx:64 · ui/src/components/pages/Namespace/index.tsx:192 — the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour — the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator's options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents.
R10 · Code Duplication · Duplicated block (48 lines × 2 locations) · ×1
  • Duplicated block (48 lines × 2 locations) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:222 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:222 · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:639 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block with local edits (43 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (43 matched lines × 2 locations) ui/src/App.tsx:69 — ui/src/App.tsx:69 · ui/src/components/plugin/NumaflowMonitorApp/App.tsx:32 — the two spans are one implementation copied and then locally edited — 324 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (38 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (38 matched lines × 2 locations) ui/src/utils/fetchWrappers/isbServiceDebugFetch.ts:19 — ui/src/utils/fetchWrappers/isbServiceDebugFetch.ts:19 · ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:38 — the two spans are one implementation copied and then locally edited — 226 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (35 lines × 2 locations) · ×1
  • Duplicated block (35 lines × 2 locations) ui/src/components/pages/MonoVertex/index.tsx:24 — ui/src/components/pages/MonoVertex/index.tsx:24 · ui/src/components/pages/Pipeline/index.tsx:33 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (34 lines × 2 locations) · ×1
  • Duplicated block (34 lines × 2 locations) ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:8 — ui/src/utils/fetchWrappers/monoVertexHealthFetch.ts:8 · ui/src/utils/fetchWrappers/pipelineHealthFetch.ts:8 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (33 lines × 2 locations) · ×1
  • Duplicated block (33 lines × 2 locations) ui/src/components/pages/Cluster/index.tsx:115 — ui/src/components/pages/Cluster/index.tsx:115 · ui/src/components/pages/Namespace/index.tsx:251 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (30 lines × 2 locations) · ×1
  • Duplicated block (30 lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:355 — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:355 · ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:461 — 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.
R10 · Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (30 matched lines × 2 locations) ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:70 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:70 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelinesTypes.ts:110 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (29 lines × 2 locations) · ×1
  • Duplicated block (29 lines × 2 locations) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:111 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:111 · ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:148 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (28 lines × 3 locations) · ×1
  • Duplicated block (28 lines × 3 locations) ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:679 — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:679 · ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:767 · ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:853 — 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.
R10 · Code Duplication · Duplicated block (28 lines × 2 locations) · ×1
  • Duplicated block (28 lines × 2 locations) ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:134 — ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:134 · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:52 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (27 lines × 2 locations) · ×1
  • Duplicated block (27 lines × 2 locations) ui/src/utils/fetchWrappers/errorsFetch.ts:14 — ui/src/utils/fetchWrappers/errorsFetch.ts:14 · ui/src/utils/fetchWrappers/monoVertexFetch.ts:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function CustomNode (cyclomatic 60, cognitive 53) · ×1
  • Complex function CustomNode (cyclomatic 60, cognitive 53) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:75 — CustomNode has cyclomatic complexity 60 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function backlogCard (cyclomatic 38, cognitive 37) · ×1
  • Complex function backlogCard (cyclomatic 38, cognitive 37) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:538 — backlogCard has cyclomatic complexity 38 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function PipelineCard (cyclomatic 33, cognitive 29) · ×1
  • Complex function PipelineCard (cyclomatic 33, cognitive 29) ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:47 — PipelineCard has cyclomatic complexity 33 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function lossCard (cyclomatic 32, cognitive 29) · ×1
  • Complex function lossCard (cyclomatic 32, cognitive 29) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:640 — lossCard has cyclomatic complexity 32 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function VertexDetails (cyclomatic 30, cognitive 28) · ×1
  • Complex function VertexDetails (cyclomatic 30, cognitive 28) ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:126 — VertexDetails has cyclomatic complexity 30 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Flow (cyclomatic 30, cognitive 27) · ×1
  • Complex function Flow (cyclomatic 30, cognitive 27) ui/src/components/pages/Pipeline/partials/Graph/index.tsx:204 — Flow has cyclomatic complexity 30 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 27, cognitive 23) · ×1
  • Complex function (anonymous) (cyclomatic 27, cognitive 23) ui/src/components/common/SlidingSidebar/index.tsx:210 — (anonymous) has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function errorsCard (cyclomatic 25, cognitive 23) · ×1
  • Complex function errorsCard (cyclomatic 25, cognitive 23) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:788 — errorsCard has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 25, cognitive 21) · ×1
  • Complex function (anonymous) (cyclomatic 25, cognitive 21) ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts:193 — (anonymous) has cyclomatic complexity 25 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 25, cognitive 17) · ×1
  • Complex function (anonymous) (cyclomatic 25, cognitive 17) ui/src/components/common/SpecEditor/index.tsx:303 — (anonymous) has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 24, cognitive 21) · ×1
  • Complex function (anonymous) (cyclomatic 24, cognitive 21) ui/src/utils/fetchWrappers/pipelineISBDebugFetch.ts:122 — (anonymous) has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 23, cognitive 23) · ×1
  • Complex function (anonymous) (cyclomatic 23, cognitive 23) ui/src/components/pages/Pipeline/partials/Graph/partials/CustomEdge/index.tsx:56 — (anonymous) has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function CopyViewLinkButton (cyclomatic 19, cognitive 18) · ×1
  • Complex function CopyViewLinkButton (cyclomatic 19, cognitive 18) ui/src/components/common/CopyViewLinkButton/index.tsx:24 — CopyViewLinkButton has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 18, cognitive 24) · ×1
  • Complex function (anonymous) (cyclomatic 18, cognitive 24) ui/src/utils/fetchWrappers/pipelineFetch.ts:69 — (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function PipelineISBDebugInfo (cyclomatic 18, cognitive 16) · ×1
  • Complex function PipelineISBDebugInfo (cyclomatic 18, cognitive 16) ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:564 — PipelineISBDebugInfo has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function PodInspector (cyclomatic 17, cognitive 16) · ×1
  • Complex function PodInspector (cyclomatic 17, cognitive 16) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/PodInspector.tsx:76 — PodInspector has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 16, cognitive 17) · ×1
  • Complex function (anonymous) (cyclomatic 16, cognitive 17) ui/src/components/common/SpecEditor/index.tsx:159 — (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function NodeInfo (cyclomatic 16, cognitive 15) · ×1
  • Complex function NodeInfo (cyclomatic 16, cognitive 15) ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:21 — NodeInfo has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 15, cognitive 13) · ×1
  • Complex function (anonymous) (cyclomatic 15, cognitive 13) ui/src/utils/index.tsx:289 — (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function load (cyclomatic 14, cognitive 18) · ×1
  • Complex function load (cyclomatic 14, cognitive 18) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/useVertexHealthData.ts:245 — load has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function ISBUpdate (cyclomatic 14, cognitive 13) · ×1
  • Complex function ISBUpdate (cyclomatic 14, cognitive 13) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:54 — ISBUpdate has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 14, cognitive 9) · ×1
  • Complex function (anonymous) (cyclomatic 14, cognitive 9) ui/src/utils/fetchWrappers/clusterSummaryFetch.ts:34 — (anonymous) has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 13, cognitive 18) · ×1
  • Complex function (anonymous) (cyclomatic 13, cognitive 18) ui/src/components/common/Breadcrumbs/index.tsx:19 — (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function latencyCard (cyclomatic 13, cognitive 14) · ×1
  • Complex function latencyCard (cyclomatic 13, cognitive 14) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:426 — latencyCard has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 13, cognitive 13) · ×1
  • Complex function (anonymous) (cyclomatic 13, cognitive 13) ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:327 — (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 13, cognitive 12) · ×1
  • Complex function (anonymous) (cyclomatic 13, cognitive 12) REDACTED:201 — (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function trafficCard (cyclomatic 13, cognitive 10) · ×1
  • Complex function trafficCard (cyclomatic 13, cognitive 10) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:479 — trafficCard has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fetchPipeline (cyclomatic 12, cognitive 31) · ×1
  • Complex function fetchPipeline (cyclomatic 12, cognitive 31) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:56 — fetchPipeline has cyclomatic complexity 12 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 12, cognitive 13) · ×1
  • Complex function (anonymous) (cyclomatic 12, cognitive 13) ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:70 — (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function PodViewNext (cyclomatic 12, cognitive 11) · ×1
  • Complex function PodViewNext (cyclomatic 12, cognitive 11) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.tsx:63 — PodViewNext has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 12, cognitive 11) · ×1
  • Complex function (anonymous) (cyclomatic 12, cognitive 11) ui/src/components/common/SpecEditor/index.tsx:437 — (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fetchPipeline (cyclomatic 11, cognitive 28) · ×1
  • Complex function fetchPipeline (cyclomatic 11, cognitive 28) ui/src/utils/fetcherHooks/pipelineViewFetch.ts:60 — fetchPipeline has cyclomatic complexity 11 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 11, cognitive 21) · ×1
  • Complex function (anonymous) (cyclomatic 11, cognitive 21) ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:182 — (anonymous) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function classifyPod (cyclomatic 11, cognitive 14) · ×1
  • Complex function classifyPod (cyclomatic 11, cognitive 14) ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/podFleetModel.ts:83 — classifyPod has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Routes (cyclomatic 11, cognitive 13) · ×1
  • Complex function Routes (cyclomatic 11, cognitive 13) ui/src/components/common/Routes/index.tsx:11 — Routes has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function ISBDebugInfo (cyclomatic 11, cognitive 10) · ×1
  • Complex function ISBDebugInfo (cyclomatic 11, cognitive 10) ui/src/components/common/SlidingSidebar/partials/ISBUpdate/partials/ISBDebugInfo/index.tsx:122 — ISBDebugInfo has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function BodyCell (cyclomatic 11, cognitive 10) · ×1
  • Complex function BodyCell (cyclomatic 11, cognitive 10) ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:232 — BodyCell has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 11, cognitive 10) · ×1
  • Complex function (anonymous) (cyclomatic 11, cognitive 10) ui/src/components/common/SpecEditor/index.tsx:130 — (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · ui/src/components/pages/Pipeline/partials/Graph/index.tsx · ×1
  • ui/src/components/pages/Pipeline/partials/Graph/index.tsx: 1001 lines of code ui/src/components/pages/Pipeline/partials/Graph/index.tsx:1 — ui/src/components/pages/Pipeline/partials/Graph/index.tsx has 1001 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts · ×1
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts: 862 lines of code ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts:1 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/goldenSignalsModel.ts has 862 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx · ×1
  • ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx: 850 lines of code ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx:1 — ui/src/components/common/SlidingSidebar/partials/PipelineISBDebugInfo/index.tsx has 850 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx · ×1
  • ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx: 835 lines of code ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx:1 — ui/src/components/pages/Pipeline/partials/Graph/partials/CustomNode/index.tsx has 835 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx · ×1
  • ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx: 758 lines of code ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:1 — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx has 758 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx · ×1
  • ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx: 658 lines of code ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx:1 — ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/utils/fetcherHooks/pipelineViewFetch.ts · ×1
  • ui/src/utils/fetcherHooks/pipelineViewFetch.ts: 658 lines of code ui/src/utils/fetcherHooks/pipelineViewFetch.ts:1 — ui/src/utils/fetcherHooks/pipelineViewFetch.ts has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx · ×1
  • ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx: 619 lines of code ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:1 — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SpecEditor/index.tsx · ×1
  • ui/src/components/common/SpecEditor/index.tsx: 552 lines of code ui/src/components/common/SpecEditor/index.tsx:1 — ui/src/components/common/SpecEditor/index.tsx has 552 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx · ×1
  • ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx: 521 lines of code ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx:1 — ui/src/components/common/SlidingSidebar/partials/K8sEvents/index.tsx has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 516 lines of code REDACTED:1 — REDACTED has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx · ×1
  • ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx: 482 lines of code ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx:1 — ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/index.tsx has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/utils/fetcherHooks/monoVertexViewFetch.ts · ×1
  • ui/src/utils/fetcherHooks/monoVertexViewFetch.ts: 440 lines of code ui/src/utils/fetcherHooks/monoVertexViewFetch.ts:1 — ui/src/utils/fetcherHooks/monoVertexViewFetch.ts has 440 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx · ×1
  • ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx: 420 lines of code ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:1 — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · ui/src/utils/index.tsx · ×1
  • ui/src/utils/index.tsx: 416 lines of code ui/src/utils/index.tsx:1 — ui/src/utils/index.tsx has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · This package's lint script runs in no CI job · ×1
  • This package's lint script runs in no CI job ui/package.json:93 — The package in `ui` declares the lint script `lint` (`eslint . --ext .tsx`), but no step of this repository's CI runs it, by name, through another script, a REDACTED target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs `npm run lint` in `ui` (or the workspace's task runner).
R7 · Dead Code · Dead file (~290 LoC) · ×1
  • Dead file (~290 LoC) ui/src/components/plugin/NumaflowMonitorApp/App.tsx — no import path from any entry point (32 application, 9 tooling, 77 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~112 LoC) · ×1
  • Dead file (~112 LoC) ui/src/mockData.ts — no import path from any entry point (32 application, 9 tooling, 77 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~102 LoC) · ×1
  • Dead file (~102 LoC) ui/src/components/plugin/Breadcrumbs/Breadcrumbs.tsx — no import path from any entry point (32 application, 9 tooling, 77 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (ui/src/components/plugin/NumaflowMonitorApp/App.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~23 LoC) · ×1
  • Dead file (~23 LoC) ui/src/components/plugin/Routes/Routes.tsx — no import path from any entry point (32 application, 9 tooling, 77 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (ui/src/components/plugin/NumaflowMonitorApp/App.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~12 LoC) · ×1
  • Dead file (~12 LoC) ui/src/types/globals.ts — no import path from any entry point (32 application, 9 tooling, 77 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unused dependency '@emotion/react' · ×1
  • Unused dependency '@emotion/react' ui/package.json:26 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@emotion/styled' · ×1
  • Unused dependency '@emotion/styled' ui/package.json:27 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@material-ui/core' · ×1
  • Unused dependency '@material-ui/core' ui/package.json:28 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@mui/x-date-pickers' · ×1
  • Unused dependency '@mui/x-date-pickers' ui/package.json:32 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@stardazed/streams-polyfill' · ×1
  • Unused dependency '@stardazed/streams-polyfill' ui/package.json:33 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@tanstack/react-virtual' · ×1
  • Unused dependency '@tanstack/react-virtual' ui/package.json:34 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@visx/group' · ×1
  • Unused dependency '@visx/group' ui/package.json:51 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@visx/responsive' · ×1
  • Unused dependency '@visx/responsive' ui/package.json:52 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@visx/shape' · ×1
  • Unused dependency '@visx/shape' ui/package.json:53 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency '@visx/tooltip' · ×1
  • Unused dependency '@visx/tooltip' ui/package.json:54 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'bootstrap' · ×1
  • Unused dependency 'bootstrap' ui/package.json:56 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'bootstrap-daterangepicker' · ×1
  • Unused dependency 'bootstrap-daterangepicker' ui/package.json:57 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'd3-color' · ×1
  • Unused dependency 'd3-color' ui/package.json:58 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'd3-selection' · ×1
  • Unused dependency 'd3-selection' ui/package.json:60 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'date-fns' · ×1
  • Unused dependency 'date-fns' ui/package.json:62 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'dayjs' · ×1
  • Unused dependency 'dayjs' ui/package.json:63 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'jquery' · ×1
  • Unused dependency 'jquery' ui/package.json:64 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'msw' · ×1
  • Unused dependency 'msw' ui/package.json:68 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'react-bootstrap-daterangepicker' · ×1
  • Unused dependency 'react-bootstrap-daterangepicker' ui/package.json:70 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'react-datetime' · ×1
  • Unused dependency 'react-datetime' ui/package.json:71 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'react-datetime-picker' · ×1
  • Unused dependency 'react-datetime-picker' ui/package.json:72 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'react-highlight-words' · ×1
  • Unused dependency 'react-highlight-words' ui/package.json:74 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'recharts' · ×1
  • Unused dependency 'recharts' ui/package.json:79 — Declared in ui/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Minor — 249 finding(s)
D31 · IaC & Container Security · Low IaC · ×61
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 36 more in this group — see findings.md.
X4 · Structured logging · Interpolated log message defeats structured logging · ×40
  • Interpolated log message defeats structured logging rust/serving/src/config.rs:290 — `info!` at line 290 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/metrics.rs:195 — `debug!` at line 195 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/app/jetstream_proxy.rs:304 — `debug!` at line 304 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/app/jetstream_proxy.rs:339 — `debug!` at line 339 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/app/jetstream_proxy.rs:424 — `debug!` at line 424 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/app/store/datastore/jetstream.rs:417 — `error!` at line 417 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/serving/src/app/store/datastore/jetstream.rs:479 — `error!` at line 479 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-throttling/src/state.rs:124 — `warn!` at line 124 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `warn!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-throttling/src/state/store/in_memory_store.rs:125 — `info!` at line 125 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-throttling/src/state/store/in_memory_store.rs:159 — `info!` at line 159 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-shared/src/server_info.rs:463 — `info!` at line 463 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-daemon/src/api.rs:94 — `debug!` at line 94 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-daemon/src/lib.rs:37 — `info!` at line 37 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/lib.rs:161 — `info!` at line 161 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/lib.rs:178 — `info!` at line 178 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/source.rs:567 — `error!` at line 567 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/source.rs:844 — `error!` at line 844 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/source.rs:1435 — `error!` at line 1435 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/transformer.rs:395 — `error!` at line 395 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/watermark/source/source_wm_fetcher.rs:150 — `info!` at line 150 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/watermark/processor/timeline.rs:73 — `debug!` at line 73 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/watermark/isb/wm_fetcher.rs:263 — `info!` at line 263 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/sinker/sink.rs:410 — `error!` at line 410 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/sinker/sink/log.rs:23 — `info!` at line 23 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `info!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • Interpolated log message defeats structured logging rust/numaflow-core/src/shared/metrics.rs:29 — `error!` at line 29 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `error!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`.
  • + 15 more in this group — see findings.md.
D34 · Knowledge Freshness · Orphaned file · ×38
  • Orphaned file rust/extns/numaflow-kafka/src/sink.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-daemon/src/api.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/extns/numaflow-sqs/src/lib.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/plugin/NumaflowMonitorApp/App.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file server/apis/v1/promql_service.go:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/MonoVertex/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBListing/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-daemon/src/service.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/Namespace/partials/DeleteModal/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/Errors/partials/CollapsableError/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-daemon/src/lib.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-core/src/sinker/sink/kafka.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/MonoVertex/partials/MonoVertexSummaryStatus/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-core/src/pipeline/isb/dyn_adapter.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file server/apis/v1/test_utils.go:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file rust/numaflow-core/src/sinker/sink/serve.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/mockData.ts:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file ui/src/components/pages/Pipeline/partials/Graph/partials/EdgeInfo/index.tsx:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file pkg/shared/telemetry/otel.go:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 13 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED · ×22
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D41 · Kernel & Syscall Confinement · No seccomp profile · ×18
  • No seccomp profile REDACTED:281 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:471 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:83 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:482 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:17 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:39 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:41 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:2 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:2 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:2 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:2 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48555 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48657 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48745 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48428 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48529 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:48616 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
  • No seccomp profile REDACTED:105 — The workload runs a container with no seccomp profile in force (neither RuntimeDefault nor a Localhost profile, on the container or the pod), so Kubernetes runs it Unconfined. Seccomp blocks the syscalls a container never needs, shrinking the kernel attack surface a container escape would use.
D24 · Comment Value · redundant comment · ×16
  • redundant comment ui/src/components/common/SlidingSidebar/index.test.tsx:39 — 7 comments in this file only repeat the code they sit on (lines 39, 50, 61, 85, 96, 107, 118), for example "Mock vertex details". Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/index.tsx:172 — "Open close modal" repeats the code it sits on: 3 of its 3 words (open, close, modal) are already in `setModalOnCloseOpen(true);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/index.test.tsx:7 — "Mock GeneratorUpdate" repeats the code it sits on: 3 of its 3 words (mock, generator, update) are already in `jest.mock("./partials/GeneratorUpdate", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/GeneratorDetails/partials/GeneratorUpdate/index.test.tsx:7 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/ISBCreate/index.test.tsx:14 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.test.tsx:20 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.test.tsx:15 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.test.tsx:15 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.test.tsx:20 — "Mock SpecEditor" repeats the code it sits on: 3 of its 3 words (mock, spec, editor) are already in `jest.mock("../../../../../SpecEditor", () =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/pages/Cluster/partials/ClusterNamespaceListing/index.tsx:109 — "Set filtered namespaces with current page of namespaces" repeats the code it sits on: 4 of its 5 words (set, filtered, namespaces, page) are already in `setFilteredNamespaces(pages[page - 1] || []);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/pages/Login/index.test.tsx:31 — "Enable fetch mocks" repeats the code it sits on: 3 of its 3 words (enable, fetch, mocks) are already in `fetchMock.enableMocks();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:52 — "states for login form" repeats the code it sits on: 3 of its 3 words (states, login, form) are already in `const [formLoginError, setFormLoginError] = useState<string | undefined>();`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/pages/Namespace/index.test.tsx:392 — "Mocking namespaceSummaryFetch" repeats the code it sits on: 4 of its 4 words (mocking, namespace, summary, fetch) are already in `jest.mock("../../../utils/fetchWrappers/namespaceSummaryFetch");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/components/pages/Namespace/index.test.tsx:413 — "Mock useParam" repeats the code it sits on: 3 of its 3 words (mock, use, param) are already in `jest.mock("react-router-dom", () => ({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/utils/fetchWrappers/monoVertexFetch.ts:10 — "fetch monoVertex summary" repeats the code it sits on: 4 of its 4 words (fetch, mono, vertex, summary) are already in `export const useMonoVertexSummaryFetch = ({`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment ui/src/utils/index.tsx:192 — "icon maps for each status" repeats the code it sits on: 3 of its 3 words (icon, maps, status) are already in `export const IconsStatusMap: any = {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
X10 · Duplicated predicate · Duplicated predicate · ×10
  • Duplicated predicate ui/src/components/pages/MonoVertex/index.tsx:74 — `!namespaceId || !pipelineId || !setSidebarProps` appears character-identically in 2 files — ui/src/components/pages/MonoVertex/index.tsx, ui/src/components/pages/Pipeline/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:346 — `Number.isInteger(initialEndLine) && initialEndLine >= initialStartLine` appears character-identically in 2 files — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx, ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx:341 — `Number.isInteger(initialStartLine) && initialStartLine > 0` appears character-identically in 2 files — ui/src/components/common/SlidingSidebar/partials/ISBUpdate/index.tsx, ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/VertexUpdate/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:90 — `event.target.value === "pipeline" && setSidebarProps` appears character-identically in 2 files — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx, ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts:25 — `event.type && event.type.toLowerCase() === "normal"` appears character-identically in 2 files — ui/src/utils/fetchWrappers/namespaceK8sEventsFetch.ts, ui/src/utils/fetchWrappers/vertex.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx:235 — `isbData?.isbService?.status?.phase || UNKNOWN` appears character-identically in 2 files — ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx, ui/src/components/pages/Pipeline/partials/PipelineISBStatus/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/utils/fetchWrappers/clusterSummaryFetch.ts:149 — `options?.requestKey === "" || loadOnRefresh` appears character-identically in 3 files — ui/src/utils/fetchWrappers/clusterSummaryFetch.ts, ui/src/utils/fetchWrappers/namespaceSummaryFetch.ts, ui/src/utils/fetchWrappers/piplelineWatermarksFetch.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx:316 — `pipelineStatus === DELETING || !pipelineAbleToLoad` appears character-identically in 2 files — ui/src/components/pages/Namespace/partials/MonoVertexCard/index.tsx, ui/src/components/pages/Namespace/partials/PipelineCard/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:151 — `setModalOnClose && setModalOnClose(undefined)` appears character-identically in 3 files — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx, ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx, ui/src/components/common/SlidingSidebar/partials/VertexDetails/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx:150 — `submitPayload.metadata?.name || "default"` appears character-identically in 2 files — ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx, ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D10 · Test Quality · Mock-dominated test · ×7
  • Mock-dominated test: should pass ui/src/utils/fetcherHooks/pipelineViewFetch.test.ts:16 — This test sets up 10 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: refreshes data when refresh function is called ui/src/utils/fetcherHooks/pipelineViewFetch.test.ts:332 — This test sets up 3 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should pass ui/src/utils/fetcherHooks/podsViewFetch.test.ts:15 — This test sets up 4 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should fail ui/src/utils/fetcherHooks/podsViewFetch.test.ts:56 — This test sets up 4 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: should catch error ui/src/utils/fetcherHooks/podsViewFetch.test.ts:128 — This test sets up 4 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: does not fetch while the Pods tab is hidden ui/src/utils/fetcherHooks/podsViewFetch.test.ts:151 — This test sets up 3 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
  • Mock-dominated test: opens critical runtime metrics from the Errors card ui/src/components/common/SlidingSidebar/partials/VertexDetails/partials/PodViewNext/index.test.tsx:265 — This test sets up 3 test doubles (for example `jest.fn`) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own — the network, the clock, the file system.
D30 · Dependency Vulnerabilities · Low vulnerability · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Low CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×2
  • Projects may be oversized for their cohesion rust/numaflow-core/Cargo.toml:1 — `rust/numaflow-core` (70990 LoC, 73 module-visible types across 22 directories) overshoots its size bounds. 2 of 17 build unit(s) (Cargo, Go, npm) overshoot their size bounds, lowering Project Cohesion to 7.6/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
  • Projects may be oversized for their cohesion ui/package.json:1 — `ui` (23667 LoC, 219 module-visible types across 93 directories) overshoots its size bounds. 2 of 17 build unit(s) (Cargo, Go, npm) overshoot their size bounds, lowering Project Cohesion to 7.6/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
X7 · Silent fallback defaults · Silent fallback default on Err · ×2
  • Silent fallback default on Err rust/numaflow-core/src/config.rs:85 — `get_vertex_replica` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
  • Silent fallback default on Err rust/numaflow-core/src/reduce/wal/segment/replay.rs:131 — `parse_segment_create_micros` turns every `Err` into `0` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
C2 · Access Controls · No named authorization policies · ×1
  • No named authorization policies — Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) — this is NOT a claim that endpoints are unprotected. What's missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can't be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: ui/src/utils/fetcherHooks/monoVertexViewFetch.ts, ui/src/components/common/CopyViewLinkButton/index.tsx. Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 4 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 (7 single-owned of 268 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 268 of the 372 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: rust/numaflow-core/src/pipeline/isb/inmemory/error_injector.rs, rust/numaflow-core/src/pipeline/isb/error.rs, rust/numaflow-core/src/shared/otel.rs, REDACTED, rust/numaflow-core/src/metadata.rs.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found rust/numaflow-pb/Cargo.toml:1 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `rust/numaflow-pb/Cargo.toml` makes this repository a deployable product (line 1).
D21 · Naming Consistency · `CtrUdf` spells `Udf` where 12 names in the project spell it `UDF` · ×1
  • `CtrUdf` spells `Udf` where 12 names in the project spell it `UDF` pkg/apis/numaflow/v1alpha1/const.go:63 — 12 of 13 names in project github.com/numaproj/numaflow spell the token `UDF` (12 of 13; unit: names in project github.com/numaproj/numaflow containing `UDF`). Peers: PipelineStatus.MapUDFCount (pkg/apis/numaflow/v1alpha1/pipeline_types.go:759); PipelineStatus.ReduceUDFCount (pkg/apis/numaflow/v1alpha1/pipeline_types.go:761); UDF.getUDFContainer (pkg/apis/numaflow/v1alpha1/udf.go:53); v1alpha1.VertexTypeMapUDF (pkg/apis/numaflow/v1alpha1/vertex_types.go:53); v1alpha1.VertexTypeReduceUDF (pkg/apis/numaflow/v1alpha1/vertex_types.go:54). Rename to `CtrUDF`. [rule N6]
D21 · Naming Consistency · `ServerUrl` spells `Url` where 16 names in the project spell it `URL` · ×1
  • `ServerUrl` spells `Url` where 16 names in the project spell it `URL` server/apis/v1/response_metrics.go:67 — 16 of 17 names in project github.com/numaproj/numaflow spell the token `URL` (16 of 17; unit: names in project github.com/numaproj/numaflow containing `URL`). Peers: v1alpha1.EnvCallbackURL (pkg/apis/numaflow/v1alpha1/const.go:111); v1alpha1.EnvISBSvcJetStreamURL (pkg/apis/numaflow/v1alpha1/const.go:122); MonoVertex.GetDaemonServiceURL (pkg/apis/numaflow/v1alpha1/mono_vertex_types.go:196); Pipeline.GetDaemonServiceURL (pkg/apis/numaflow/v1alpha1/pipeline_types.go:236); SqsSource.EndpointURL (pkg/apis/numaflow/v1alpha1/sqs_source.go:54). Rename to `ServerURL`. [rule N6]
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 38 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: rust/extns/numaflow-kafka/src/sink.rs, rust/extns/numaflow-sqs/src/lib.rs, ui/src/components/pages/Pipeline/partials/Graph/partials/NodeInfo/index.tsx, ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.tsx, ui/src/components/plugin/NumaflowMonitorApp/App.tsx, ui/src/components/common/SlidingSidebar/partials/PipelineCreate/index.tsx, ui/src/components/common/SlidingSidebar/partials/PipelineUpdate/index.tsx, server/apis/v1/promql_service.go (and 30 more) (39 orphaned of 268 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 268 of the 372 production source files in this repository met that bar). 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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D40 · Network Egress Confinement · No network policy · ×1
  • No network policy — No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need.
D42 · Runtime Threat Enforcement · No runtime threat detection · ×1
  • No runtime threat detection — No runtime threat-detection engine (Tetragon TracingPolicy / Falco) is committed. These observe process, file and network activity in-kernel and can alert or kill on malicious behaviour a static scan cannot catch.
D42 · Runtime Threat Enforcement · No admission-control policy · ×1
  • No admission-control policy — No policy-enforcement gate (Kyverno / OPA Gatekeeper / PodSecurity admission) is committed. Admission control keeps workloads that violate your security baseline from ever reaching the cluster.
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P2 · Observability · Logging is not universal · ×1
  • Logging is not universal — Only 13/15 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `rust/numaflow-pb`.
P4 · Deployment & Rollback · No rollback/health safety · ×1
  • No rollback/health safety REDACTED:150 — Deployment automation exists and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no manifest in this repository wires them into readiness/liveness probes, a rolling-update strategy, lifecycle hooks or a migration job — a bad release is harder to detect and reverse. If that wiring lives in a separate ops/Helm repository, document the pointer here so release safety is evidenced.
R7 · Dead Code · Unused export 'ISBServiceListingData' · ×1
  • Unused export 'ISBServiceListingData' ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceTypes.ts:1 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'PipelinesData' · ×1
  • Unused export 'PipelinesData' ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/PipelinesTypes.ts:1 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'MONO_VERTEX_STAGE_Y' · ×1
  • Unused export 'MONO_VERTEX_STAGE_Y' ui/src/utils/monoVertexGraphLayout.ts:17 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'MONO_VERTEX_ONSUCCESS_FAN_OUT_Y' · ×1
  • Unused export 'MONO_VERTEX_ONSUCCESS_FAN_OUT_Y' ui/src/utils/monoVertexGraphLayout.ts:18 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'MONO_VERTEX_FALLBACK_FAN_OUT_Y' · ×1
  • Unused export 'MONO_VERTEX_FALLBACK_FAN_OUT_Y' ui/src/utils/monoVertexGraphLayout.ts:19 — Nothing imports this binding — it is safe to review for removal.
R8 · Dependency Hygiene · Test-only dependency '@testing-library/react' in production deps · ×1
  • Test-only dependency '@testing-library/react' in production deps ui/package.json:36 — Only test files import it (first: ui/src/components/common/AccountMenu/index.test.tsx:2) — move it to devDependencies.
R8 · Dependency Hygiene · Test-only dependency '@testing-library/user-event' in production deps · ×1
  • Test-only dependency '@testing-library/user-event' in production deps ui/package.json:37 — Only test files import it (first: ui/src/components/pages/Namespace/partials/NamespaceListingWrapper/ISBServiceCard/ISBServiceCard.test.tsx:6) — move it to devDependencies.
R8 · Dependency Hygiene · Test-only dependency 'react-test-renderer' in production deps · ×1
  • Test-only dependency 'react-test-renderer' in production deps ui/package.json:77 — Only test files import it (first: ui/src/utils/fetcherHooks/pipelineViewFetch.test.ts:3) — move it to devDependencies.
R8 · Dependency Hygiene · Test-only dependency 'resize-observer-polyfill' in production deps · ×1
  • Test-only dependency 'resize-observer-polyfill' in production deps ui/package.json:80 — Only test files import it (first: ui/src/components/pages/Pipeline/index.test.tsx:8) — move it to devDependencies.
S1 · Web-Security Posture · No security response headers detected · ×1
  • No security response headers detected — None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Rust server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: `axum_server::bind_rustls(` (rust/serving/src/app.rs:70).
X2 · Cancellation propagation · Not all functions that make a request accept a context.Context or an AbortSignal · ×1
  • Not all functions that make a request accept a context.Context or an AbortSignal — Only 5/25 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial) accept a context.Context or an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` (Go: `ctx context.Context`) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Minor — 48 finding(s)
D12 · Dependency Hygiene · Outdated · ×45
  • Outdated: github.com/IBM/sarama — `github.com/IBM/sarama` is required at v1.46.3 in REDACTED, but v1.61.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/IBM/sarama@v1.61.1 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/casbin/casbin/v2 — `github.com/casbin/casbin/v2` is required at v2.77.2 in REDACTED, but v2.135.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/casbin/casbin/v2@v2.135.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/coreos/go-oidc/v3 — `github.com/coreos/go-oidc/v3` is required at v3.10.0 in REDACTED, but v3.21.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/coreos/go-oidc/v3@v3.21.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/fsnotify/fsnotify — `github.com/fsnotify/fsnotify` is required at v1.7.0 in REDACTED, but v1.10.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/fsnotify/fsnotify@v1.10.1 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/gavv/httpexpect/v2 — `github.com/gavv/httpexpect/v2` is required at v2.16.0 in REDACTED, but v2.17.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/gavv/httpexpect/v2@v2.17.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/getkin/kin-openapi — `github.com/getkin/kin-openapi` is required at v0.149.0 in REDACTED, but v0.153.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/getkin/kin-openapi@v0.153.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/gin-contrib/cors — `github.com/gin-contrib/cors` is required at v1.7.1 in REDACTED, but v1.7.11 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/gin-contrib/cors@v1.7.11 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/gin-contrib/static — `github.com/gin-contrib/static` is required at v0.0.2-0.20220606235426-ae09b2ea7e39 in REDACTED, but v1.1.10 is the module's current release — so this build is missing every fix published since, including any security fix. This crosses a major version — v0 releases carry no compatibility promise, so read the changelog before taking it. Run `go get github.com/gin-contrib/static@v1.1.10 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/gin-gonic/gin — `github.com/gin-gonic/gin` is required at v1.10.1 in REDACTED, but v1.12.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/gin-gonic/gin@v1.12.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/go-openapi/inflect — `github.com/go-openapi/inflect` is required at v0.21.0 in REDACTED, but v1.0.1 is the module's current release — so this build is missing every fix published since, including any security fix. This crosses a major version — v0 releases carry no compatibility promise, so read the changelog before taking it. Run `go get github.com/go-openapi/inflect@v1.0.1 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/go-swagger/go-swagger — `github.com/go-swagger/go-swagger` is required at v0.31.0 in REDACTED, but v0.36.7 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/go-swagger/go-swagger@v0.36.7 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/goccy/go-json — `github.com/goccy/go-json` is required at v0.10.2 in REDACTED, but v0.12.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/goccy/go-json@v0.12.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/golang-jwt/jwt/v5 — `github.com/golang-jwt/jwt/v5` is required at v5.2.2 in REDACTED, but v5.3.1 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/golang-jwt/jwt/v5@v5.3.1 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/grpc-ecosystem/go-grpc-middleware — `github.com/grpc-ecosystem/go-grpc-middleware` is required at v1.3.0 in REDACTED, but v1.4.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/grpc-ecosystem/go-grpc-middleware@v1.4.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/grpc-ecosystem/grpc-gateway/v2 — `github.com/grpc-ecosystem/grpc-gateway/v2` is required at v2.27.2 in REDACTED, but v2.34.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/grpc-ecosystem/grpc-gateway/v2@v2.34.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/imdario/mergo — `github.com/imdario/mergo` is required at v0.3.16 in REDACTED, but v1.0.2 is the module's current release — so this build is missing every fix published since, including any security fix. This crosses a major version — v0 releases carry no compatibility promise, so read the changelog before taking it. Run `go get github.com/imdario/mergo@v1.0.2 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/nats-io/nats-server/v2 — `github.com/nats-io/nats-server/v2` is required at v2.11.15 in REDACTED, but v2.15.3 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/nats-io/nats-server/v2@v2.15.3 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/nats-io/nats.go — `github.com/nats-io/nats.go` is required at v1.49.0 in REDACTED, but v1.55.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/nats-io/nats.go@v1.55.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/prometheus/client_golang — `github.com/prometheus/client_golang` is required at v1.23.0 in REDACTED, but v1.25.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/prometheus/client_golang@v1.25.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/prometheus/client_model — `github.com/prometheus/client_model` is required at v0.6.2 in REDACTED, but v0.6.3 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/prometheus/client_model@v0.6.3 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/prometheus/common — `github.com/prometheus/common` is required at v0.65.0 in REDACTED, but v0.74.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/prometheus/common@v0.74.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/redis/go-redis/v9 — `github.com/redis/go-redis/v9` is required at v9.0.3 in REDACTED, but v9.23.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/redis/go-redis/v9@v9.23.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/spf13/cobra — `github.com/spf13/cobra` is required at v1.8.1 in REDACTED, but v1.10.2 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/spf13/cobra@v1.10.2 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/spf13/viper — `github.com/spf13/viper` is required at v1.18.2 in REDACTED, but v1.21.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/spf13/viper@v1.21.0 && go mod tidy` and commit the updated REDACTED and go.sum.
  • Outdated: github.com/tidwall/gjson — `github.com/tidwall/gjson` is required at v1.18.0 in REDACTED, but v1.20.4 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/tidwall/gjson@v1.20.4 && go mod tidy` and commit the updated REDACTED and go.sum.
  • + 20 more in this group — see findings.md.
D10 · Test Quality · Skipped (documented) · ×2
  • Skipped (documented): please update ui/src/App.test.tsx:15 — Skipped with a documented reason — a deferral, not lazy debt: declared with test.todo — a placeholder that registers a name and runs nothing
  • Skipped (documented): (unnamed test) ui/src/utils/fetchWrappers/clusterSummaryFetch.test.ts:95 — Skipped with a documented reason — a deferral, not lazy debt: declared with test.todo — a placeholder that registers a name and runs nothing
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: numaflow-shared — numaflow-shared: abstractness 0.10, instability 0.11, distance 0.79 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.

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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-da7f687f61d54c77bff40f5a3f6a017e/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-da7f687f61d54c77bff40f5a3f6a017e/history-1.json --exit-code 0 --source .2artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=1879" --report-format json --report-path /tmp/watchdog-gitleaks-da7f687f61d54c77bff40f5a3f6a017e/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-da7f687f61d54c77bff40f5a3f6a017e/tree.json --exit-code 0 --source .1artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude pkg/client/clientset/versioned/typed --exclude pkg/client/informers/externalversions/numaflow/v1alpha1 --exclude pkg/client/listers --exclude rust/numaflow-models/src/models --exclude rust/numaflow-pb/src/clients --exclude rust/numaflow-pb/src/common --exclude rust/numaflow-pb/src/objects --exclude rust/numaflow-pb/src/servers .176artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .76artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .288artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e888-b3bb-7439-928c-dfb62897deeb · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md