Public report of reflex-dev/reflex, published 16 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, 16 November 2026, 08:40 UTC · Survey ID cd_6ba1b23da3e549729cc53494a9a4060b

reflex-dev/reflex

Measured 16 November 2026, 08:39 UTC, at code version 8e5bb84

Code coverage is not measured: JavaScript/TypeScript suite (CouldNotMeasureNoCollector).

CAI score 54out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 2 since the last survey

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: 164,229 lines of product code in 29 projects, tests not counted · Estimated rebuild effort: about 2.2 person-years · Weakest lens: Code Health, 43

Findings by how serious they are

32 critical 666 serious 108 minor

9 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
16 November 2026, 08:39 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.

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 ▸

81of 81 dimensions measured by tools.
786of 806 findings point to an exact file and line, so you can open each one in the code. The other 20 concern the repository as a whole, such as missing documentation.
81dimensions across 8 lenses, read from 164,229 lines of product code in 29 projects.
Chapters

Executive summary

reflex-dev/reflex falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 54 out of 100 and is rated Adequate, and 23 of its 32 critical findings are security problems.

Code Health, at 43, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the package under a licence on your banned list, worth about 2 points. Adding type checking would lift Code Health itself, worth about 4 points. Raising Code Health to 70 would lift the score to about 61.

Eight places in the code run text as code, which an attacker could use. Five weaknesses in the code could be used by an attacker, and five settings leave the servers or containers unsafe. Replacing text run as code with direct calls, fixing the weaknesses the scanner points to and correcting the unsafe settings would close these risks. Updating the vulnerable packages would fix the package with a known security hole, and the three passwords or keys in the code's history need replacing, with the old ones switched off. The six sets of files in separate parts that keep changing together need that dependency made explicit.

The product code is 164,229 lines, about €320,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.
Code Health 43 · counts for 45%Production Readiness 47 · counts for 25%Security and Compliance 69 · counts for 14%Maturity 79 · counts for 8%Accessibility 81 · counts for 4%Performance 94 · counts for 2%Architecture 95 · counts for 1%Domain Modelling 100 · counts for 1%

If Code Health rose from 43 to 70, the lowest score rated Strong, the score would rise from 54 to about 61.

Code composition: what the lines of code are
Product code 51%Tests 49%
New since the last survey: 150 findings

These 150 critical or serious findings weren't in the previous survey, on 4 November 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Cyclomatic Complexity · connect (cyclomatic 44) REDACTED
  • Cyclomatic Complexity · applyEvent (cyclomatic 42) REDACTED
  • Cyclomatic Complexity · state.useEventLoop (cyclomatic 31) REDACTED
  • Cyclomatic Complexity · uploadFiles (cyclomatic 26) packages/reflex-frontend/src/utils/helpers/upload.js
  • Cyclomatic Complexity · state.replaceEqualDeep (cyclomatic 21) REDACTED
  • Cyclomatic Complexity · state.mergeSlotProps (cyclomatic 21) REDACTED
  • Cyclomatic Complexity · state.applyClientStorageDelta (cyclomatic 20) REDACTED
  • Cyclomatic Complexity · state.hydrateClientStorage (cyclomatic 18) REDACTED
  • Cyclomatic Complexity · vite-plugin-safari-cachebust.createSafariMiddleware.safariCacheBustMiddleware (cyclomatic 18) REDACTED
  • Cyclomatic Complexity · createSafariMiddleware (cyclomatic 18) REDACTED
  • Cyclomatic Complexity · BaseState.__init_subclass__ (cyclomatic 16) REDACTED
  • Cyclomatic Complexity · parseDatetime (cyclomatic 16) packages/reflex-frontend/src/utils/helpers/datetime.js
  • Cognitive Complexity · applyEvent (cognitive 71) REDACTED
  • Cognitive Complexity · connect (cognitive 52) REDACTED
  • Cognitive Complexity · state.replaceEqualDeep (cognitive 38) REDACTED
  • Cognitive Complexity · useEventLoop (cognitive 38) REDACTED
  • Cognitive Complexity · uploadFiles (cognitive 35) packages/reflex-frontend/src/utils/helpers/upload.js
  • Cognitive Complexity · mergeSlotProps (cognitive 29) REDACTED
  • Cognitive Complexity · applyClientStorageDelta (cognitive 26) REDACTED
  • Cognitive Complexity · state.hydrateClientStorage (cognitive 25) REDACTED
  • Cognitive Complexity · forms._iter_form_controls (cognitive 21) REDACTED
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py
  • Cognitive Complexity · utils._prune_stale_files (cognitive 18) reflex/compiler/utils.py
  • Cognitive Complexity · createSafariMiddleware (cognitive 18) REDACTED
  • Cognitive Complexity · EventNamespace.on_event (cognitive 17) REDACTED
  • Cognitive Complexity · serializers._serialize_sqlalchemy_model (cognitive 16) packages/reflex-base/src/reflex_base/utils/serializers.py
  • Cognitive Complexity · parseDatetime (cognitive 16) packages/reflex-frontend/src/utils/helpers/datetime.js
  • God Classes · FileTooLong: REDACTED REDACTED
  • God Classes · FunctionTooLong: state.applyEvent REDACTED
  • God Classes · FunctionTooLong: state.useEventLoop REDACTED
  • God Classes · FileTooLong: core/_upload.py packages/reflex-components-core/src/reflex_components_core/core/_upload.py
  • God Classes · FileTooLong: processor/base_state_processor.py packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py
  • God Classes · TooManyMethods: EventCallback packages/reflex-base/src/reflex_base/event/__init__.py
  • Code Duplication · Edited copy of a member (80 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py
  • Code Duplication · Edited copy of a member (105 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py
  • Code Duplication · Edited copy of a member (50 corresponding lines) docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py
  • Code Duplication · Edited copy of a member (48 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py
  • Code Duplication · Edited copy of a member (38 corresponding lines) reflex/reflex.py
  • Code Duplication · Edited copy of a member (72 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/templates/marketing_page.py
  • Code Duplication · Edited copy of a member (47 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py
  • Code Duplication · Edited copy of a member (44 corresponding lines) packages/reflex-base/src/reflex_base/plugins/compiler.py
  • Code Duplication · Edited copies of one member (3 members, 33+ corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py
  • Code Duplication · Edited copy of a member (26 corresponding lines) reflex/testing.py
  • Code Duplication · Edited copy of a member (36 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py
  • Code Duplication · Edited copy of a member (29 corresponding lines) packages/reflex-docgen/src/reflex_docgen/_class.py
  • Code Duplication · Edited copy of a member (36 corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py
  • Code Duplication · Edited copy of a member (28 corresponding lines) packages/reflex-docgen/src/reflex_docgen/markdown/transformer/_base.py
  • Code Duplication · Edited copy of a member (22 corresponding lines) packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py
  • Code Duplication · Edited copies of one member (3 members, 22+ corresponding lines) packages/reflex-base/src/reflex_base/components/component.py
  • Code Duplication · Edited copy of a member (31 corresponding lines) reflex/utils/js_runtimes.py
  • Code Duplication · Edited copy of a member (32 corresponding lines) packages/reflex-base/src/reflex_base/event/__init__.py
  • Code Duplication · Edited copy of a member (25 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py
  • Code Duplication · Edited copy of a member (26 corresponding lines) packages/reflex-base/src/reflex_base/plugins/compiler.py
  • Code Duplication · Edited copy of a member (14 corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/v2/project.py
  • Code Duplication · Edited copy of a member (11 corresponding lines) reflex/utils/frontend_skeleton.py
  • Code Duplication · Edited copy of a member (21 corresponding lines) reflex/compiler/plugins/builtin.py
  • Code Duplication · Edited copy of a member (15 corresponding lines) packages/reflex-base/src/reflex_base/vars/sequence.py
  • Code Duplication · Edited copy of a member (15 corresponding lines) packages/reflex-base/src/reflex_base/vars/sequence.py
  • Code Duplication · Edited copy of a member (28 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (11 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (22 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/components/blocks/typography.py
  • Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) packages/reflex-base/src/reflex_base/components/component.py
  • Code Duplication · Edited copy of a member (46 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py
  • Code Duplication · Edited copy of a member (19 corresponding lines) packages/reflex-base/src/reflex_base/components/memoize_helpers.py
  • Code Duplication · Edited copy of a member (11 corresponding lines) packages/reflex-bench/src/reflex_bench/suites/wire.py
  • Code Duplication · Edited copy of a member (8 corresponding lines) packages/reflex-components-core/src/reflex_components_core/base/bare.py
  • Code Duplication · Edited copy of a member (21 corresponding lines) reflex/utils/path_ops.py
  • Code Duplication · Edited copy of a member (20 corresponding lines) REDACTED
  • Code Duplication · Edited copy of a member (17 corresponding lines) .claude/skills/prerelease-test/scripts/check_release_versions.py
  • Code Duplication · Edited copies of one member (3 members, 14+ corresponding lines) packages/reflex-components-radix/src/reflex_components_radix/primitives/base.py
  • Code Duplication · Edited copy of a member (18 corresponding lines) docs/app/reflex_docs/utils/http.py
  • Code Duplication · Edited copy of a member (17 corresponding lines) docs/app/reflex_docs/pages/docs/recipes_overview.py
  • Code Duplication · Edited copy of a member (18 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (10 corresponding lines) packages/reflex-bench/src/reflex_bench/subjects.py
  • Code Duplication · Edited copy of a member (14 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (21 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (20 corresponding lines) packages/reflex-base/src/reflex_base/components/component.py
  • Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (12 corresponding lines) packages/reflex-base/src/reflex_base/vars/sequence.py
  • Code Duplication · Edited copy of a member (11 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (8 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/scroll_area.py
  • Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py
  • Code Duplication · Edited copy of a member (15 corresponding lines) REDACTED
  • Code Duplication · Duplicated block (18 lines × 2) packages/reflex-base/src/reflex_base/vars/number.py
  • Code Duplication · Duplicated block (12 lines × 3) packages/reflex-release/src/reflex_release/cli.py
  • Code Duplication · Duplicated block (16 lines × 2) packages/reflex-base/src/reflex_base/vars/sequence.py
  • Code Coverage · Coverage not measured — JavaScript/TypeScript suite
  • Churn × Complexity Hotspots · Hotspot: REDACTED REDACTED
  • Churn × Complexity Hotspots · Hotspot: reflex/compiler/plugins/memoize.py reflex/compiler/plugins/memoize.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-frontend/src/utils/helpers/upload.js packages/reflex-frontend/src/utils/helpers/upload.js
  • Churn × Complexity Hotspots · Hotspot: REDACTED REDACTED
  • Churn × Complexity Hotspots · Repeated repair: tests/units/reflex_base/client_event_queue_runtime.mjs tests/units/reflex_base/client_event_queue_runtime.mjs
  • Churn × Complexity Hotspots · Repeated repair: packages/reflex-components-core/src/reflex_components_core/core/_upload.py packages/reflex-components-core/src/reflex_components_core/core/_upload.py

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 60 findings

These 60 critical or serious findings were in the previous survey, on 4 November 2026, and are gone from this one.

  • Cyclomatic Complexity · applyEvent (cyclomatic 48) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · connect (cyclomatic 45) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · useEventLoop (cyclomatic 31) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · uploadFiles (cyclomatic 22) packages/reflex-base/src/reflex_base/.templates/web/utils/helpers/upload.js
  • Cyclomatic Complexity · replaceEqualDeep (cyclomatic 21) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · mergeSlotProps (cyclomatic 21) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · applyClientStorageDelta (cyclomatic 20) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · BaseStateEventProcessor._execute_event (cyclomatic 18) packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py
  • Cyclomatic Complexity · createSafariMiddleware (cyclomatic 18) packages/reflex-base/src/reflex_base/.templates/web/vite-plugin-safari-cachebust.js
  • Cyclomatic Complexity · hydrateClientStorage (cyclomatic 18) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cyclomatic Complexity · parseDatetime (cyclomatic 16) packages/reflex-base/src/reflex_base/.templates/web/utils/helpers/datetime.js
  • Cognitive Complexity · applyEvent (cognitive 84) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · connect (cognitive 53) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · replaceEqualDeep (cognitive 38) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · useEventLoop (cognitive 38) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · mergeSlotProps (cognitive 29) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · applyClientStorageDelta (cognitive 26) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · uploadFiles (cognitive 26) packages/reflex-base/src/reflex_base/.templates/web/utils/helpers/upload.js
  • Cognitive Complexity · hydrateClientStorage (cognitive 25) packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Cognitive Complexity · changed_paths.translate (cognitive 21) scripts/changed_paths.py
  • Cognitive Complexity · check_min_deps.main (cognitive 20) scripts/check_min_deps.py
  • Cognitive Complexity · check_min_deps.build_wheelhouse (cognitive 18) scripts/check_min_deps.py
  • Cognitive Complexity · createSafariMiddleware (cognitive 18) packages/reflex-base/src/reflex_base/.templates/web/vite-plugin-safari-cachebust.js
  • Cognitive Complexity · make_pyi.main (cognitive 16) scripts/make_pyi.py
  • Cognitive Complexity · parseDatetime (cognitive 16) packages/reflex-base/src/reflex_base/.templates/web/utils/helpers/datetime.js
  • God Classes · FileTooLong: REDACTED packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Code Duplication · Duplicated block (22 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py
  • Code Duplication · Duplicated block (18–21 lines × 2) packages/reflex-release/src/reflex_release/cli.py
  • Code Duplication · Duplicated block (17 lines × 2) packages/reflex-base/src/reflex_base/vars/number.py
  • Code Duplication · Duplicated block (14 lines × 2) docs/app/reflex_docs/pages/docs_landing/views/cta_artwork.py
  • Code Duplication · Duplicated block (13–14 lines × 2) packages/reflex-release/src/reflex_release/cli.py
  • Code Duplication · Duplicated block (12–13 lines × 2) docs/app/reflex_docs/views/docs_navbar.py
  • Code Duplication · Duplicated block (13 lines × 2) packages/reflex-release/src/reflex_release/cli.py
  • Code Duplication · Duplicated block (12 lines × 3) packages/reflex-release/src/reflex_release/cli.py
  • Code Duplication · Duplicated block (6 lines × 2) .claude/skills/prerelease-test/scripts/audit_pyi.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-base/src/reflex_base/.templates/web/utils/state.js packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Churn × Complexity Hotspots · Hotspot: REDACTED REDACTED
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-base/src/reflex_base/event/processor/event_processor.py packages/reflex-base/src/reflex_base/event/processor/event_processor.py
  • Churn × Complexity Hotspots · Hotspot: reflex/istate/manager/redis.py reflex/istate/manager/redis.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-release/src/reflex_release/scaffold.py packages/reflex-release/src/reflex_release/scaffold.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-components-code/src/reflex_components_code/code.py packages/reflex-components-code/src/reflex_components_code/code.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-release/src/reflex_release/cli.py packages/reflex-release/src/reflex_release/cli.py
  • Churn × Complexity Hotspots · Hotspot: packages/reflex-site-shared/src/reflex_site_shared/components/docs_api.py packages/reflex-site-shared/src/reflex_site_shared/components/docs_api.py
  • Churn × Complexity Hotspots · Repeated repair: REDACTED REDACTED
  • Churn × Complexity Hotspots · Repeated repair: reflex/istate/manager/__init__.py reflex/istate/manager/__init__.py
  • Explicit Debt · TodoComment tests/integration/test_dynamic_components.py
  • Explicit Debt · TodoComment tests/integration/test_dynamic_routes.py
  • Explicit Debt · TodoComment tests/integration/test_dynamic_routes.py
  • Explicit Debt · TodoComment tests/integration/test_upload.py
  • Explicit Debt · TodoComment reflex/reflex.py
  • Secrets (history) · REDACTED: algolia-api-key REDACTED
  • Static Analysis (SAST) · High: REDACTED packages/reflex-base/src/reflex_base/.templates/web/utils/state.js
  • Static Analysis (SAST) · Medium: REDACTED packages/reflex-base/src/reflex_base/.templates/web/vite-plugin-safari-cachebust.js
  • Dependency Vulnerabilities · Critical CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
  • Tooling · No lint or typecheck script
  • A11y enforcement · Accessibility enforcement below the top rung
Rebuild cost: about €320,000 · Estimate
Cost to rebuild€110,000 to €530,000, for 1,770 to 5,615 hours of work, about 2.2 person-years for 1 to 5 engineers
Difficulty of the problemStandard, 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.8 at a score of 54. 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: 164,229 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
Resolve the 1 Banned license finding(s) in License Compliance.
Raises the score by about 2 points · Low effort · License Compliance
2
Resolve the 1 finding(s) in Type Safety.
Raises the score by about 4 points · Medium effort · Type Safety
3
The findings name the configuration each number was taken from and, for the assertions, the files that hold them.
Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Raises the score by about 3 points · Medium effort · Nullable reference types

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 €320,000 to build again, about 2.2 person-years of work. Its weakest lens is Code Health, at 43 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Banned license finding(s) in License Compliance. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 License Compliance findings. 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.2 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 293,403 lines over the last 90 days, which is about 1,189,912 lines a year. At that pace, the extra work comes to an estimated 59.5 to 396.6 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 hatch-reflex-pyi hatch-reflex-pyi reflex (Python) reflex (Python) reflex (npm) reflex (npm) reflex-base reflex-base reflex-bench reflex-bench reflex-build-sdk reflex-build-sdk reflex-components-code reflex-components-code reflex-components-core reflex-components-core reflex-components-dataeditor reflex-components-dataeditor reflex-components-gridjs reflex-components-gridjs reflex-components-internal reflex-components-internal reflex-components-lucide reflex-components-lucide reflex-components-markdown reflex-components-markdown reflex-components-moment reflex-components-moment reflex-components-plotly reflex-components-plotly reflex-components-radix reflex-components-radix reflex-components-react-player reflex-components-react-player reflex-components-recharts reflex-components-recharts reflex-components-sonner reflex-components-sonner reflex-docgen reflex-docgen reflex-docgen->reflex (Python) __more__ +9 more projects

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.

487 modules, with 457 dependencies between them. 4 loops run through 32 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 447 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 packages.reflex-base.src.reflex_base.components.tags.tag2 packages.reflex-base.src.reflex_base.plugins.base3 packages.reflex-bench.src.reflex_bench.schema4 packages.reflex-build-sdk.src.reflex_build_sdk.transports._base5 packages.reflex-build-sdk.src.reflex_build_sdk.types6 packages.reflex-components-core.src.reflex_components_core.base.fragment7 packages.reflex-components-core.src.reflex_components_core.el.elements.base8 packages.reflex-components-internal.src.reflex_components_internal.components.component9 packages.reflex-components-radix.src.reflex_components_radix.primitives.base10 packages.reflex-components-radix.src.reflex_components_radix.themes.base11 reflex.state12 packages.reflex-base.src.reflex_base.vars.sequence13 packages.reflex-bench.src.reflex_bench.context14 packages.reflex-build-sdk.src.reflex_build_sdk._async.resources.apps15 packages.reflex-build-sdk.src.reflex_build_sdk._deploy16 packages.reflex-build-sdk.src.reflex_build_sdk._sync.resources.apps17 packages.reflex-components-internal.src.reflex_components_internal.components.base_ui18 reflex.istate.manager19 reflex.istate.manager.token20 packages.reflex-base.src.reflex_base.event.context21 packages.reflex-base.src.reflex_base.vars.number22 packages.reflex-bench.src.reflex_bench.registry23 packages.reflex-build-sdk.src.reflex_build_sdk._async._client24 packages.reflex-build-sdk.src.reflex_build_sdk._sync._client25 reflex.app26 packages.reflex-base.src.reflex_base.vars.base27 packages.reflex-bench.src.reflex_bench28 packages.reflex-bench.src.reflex_bench.suites29 reflex.utils30 packages.reflex-base.src.reflex_base.components.component31 packages.reflex-base.src.reflex_base.vars.function32 packages.reflex-base.src.reflex_base.vars.object33 packages.reflex-base.src.reflex_base.components34 packages.reflex-base.src.reflex_base.event35 packages.reflex-base.src.reflex_base.vars36 packages.reflex-base.src.reflex_base.registry37 packages.reflex-base.src.reflex_base.utils38 packages.reflex-base.src.reflex_base39 packages.reflex-base.src.reflex_base.event.processor.event_processor40 packages.reflex-base.src.reflex_base.event.processor.base_state_processor
1 packages.reflex-base.src.reflex_base.components.tags.tag
2 packages.reflex-base.src.reflex_base.plugins.base
3 packages.reflex-bench.src.reflex_bench.schema
4 packages.reflex-build-sdk.src.reflex_build_sdk.transports._base
5 packages.reflex-build-sdk.src.reflex_build_sdk.types
6 packages.reflex-components-core.src.reflex_components_core.base.fragment
7 packages.reflex-components-core.src.reflex_components_core.el.elements.base
8 packages.reflex-components-internal.src.reflex_components_internal.components.component
9 packages.reflex-components-radix.src.reflex_components_radix.primitives.base
10 packages.reflex-components-radix.src.reflex_components_radix.themes.base
11 reflex.state
12 packages.reflex-base.src.reflex_base.vars.sequence49
13 packages.reflex-bench.src.reflex_bench.context1
14 packages.reflex-build-sdk.src.reflex_build_sdk._async.resources.apps73
15 packages.reflex-build-sdk.src.reflex_build_sdk._deploy2
16 packages.reflex-build-sdk.src.reflex_build_sdk._sync.resources.apps73
17 packages.reflex-components-internal.src.reflex_components_internal.components.base_ui1
18 reflex.istate.manager1
19 reflex.istate.manager.token1
20 packages.reflex-base.src.reflex_base.event.context1
21 packages.reflex-base.src.reflex_base.vars.number13
22 packages.reflex-bench.src.reflex_bench.registry1
23 packages.reflex-build-sdk.src.reflex_build_sdk._async._client1
24 packages.reflex-build-sdk.src.reflex_build_sdk._sync._client1
25 reflex.app111
26 packages.reflex-base.src.reflex_base.vars.base249
27 packages.reflex-bench.src.reflex_bench1754
28 packages.reflex-bench.src.reflex_bench.suites56
29 reflex.utils1
30 packages.reflex-base.src.reflex_base.components.component13
31 packages.reflex-base.src.reflex_base.vars.function5
32 packages.reflex-base.src.reflex_base.vars.object225
33 packages.reflex-base.src.reflex_base.components5421
34 packages.reflex-base.src.reflex_base.event331
35 packages.reflex-base.src.reflex_base.vars1231231
36 packages.reflex-base.src.reflex_base.registry12
37 packages.reflex-base.src.reflex_base.utils212
38 packages.reflex-base.src.reflex_base11231
39 packages.reflex-base.src.reflex_base.event.processor.event_processor221
40 packages.reflex-base.src.reflex_base.event.processor.base_state_processor2112
Uses a module listed above itPart of a loopThe module itself
1 packages.reflex-base.src.reflex_base.components.tags.tag2 packages.reflex-base.src.reflex_base.plugins.base3 packages.reflex-bench.src.reflex_bench.schema4 packages.reflex-build-sdk.src.reflex_build_sdk.transports._base5 packages.reflex-build-sdk.src.reflex_build_sdk.types6 packages.reflex-components-core.src.reflex_components_core.base.fragment7 packages.reflex-components-core.src.reflex_components_core.el.elements.base8 packages.reflex-components-internal.src.reflex_components_internal.components.component9 packages.reflex-components-radix.src.reflex_components_radix.primitives.base10 packages.reflex-components-radix.src.reflex_components_radix.themes.base11 reflex.state12 packages.reflex-base.src.reflex_base.vars.sequence13 packages.reflex-bench.src.reflex_bench.context14 packages.reflex-build-sdk.src.reflex_build_sdk._async.resources.apps15 packages.reflex-build-sdk.src.reflex_build_sdk._deploy16 packages.reflex-build-sdk.src.reflex_build_sdk._sync.resources.apps17 packages.reflex-components-internal.src.reflex_components_internal.components.base_ui18 reflex.istate.manager19 reflex.istate.manager.token20 packages.reflex-base.src.reflex_base.event.context21 packages.reflex-base.src.reflex_base.vars.number22 packages.reflex-bench.src.reflex_bench.registry23 packages.reflex-build-sdk.src.reflex_build_sdk._async._client24 packages.reflex-build-sdk.src.reflex_build_sdk._sync._client25 reflex.app26 packages.reflex-base.src.reflex_base.vars.base27 packages.reflex-bench.src.reflex_bench28 packages.reflex-bench.src.reflex_bench.suites29 reflex.utils30 packages.reflex-base.src.reflex_base.components.component31 packages.reflex-base.src.reflex_base.vars.function32 packages.reflex-base.src.reflex_base.vars.object33 packages.reflex-base.src.reflex_base.components34 packages.reflex-base.src.reflex_base.event35 packages.reflex-base.src.reflex_base.vars36 packages.reflex-base.src.reflex_base.registry37 packages.reflex-base.src.reflex_base.utils38 packages.reflex-base.src.reflex_base39 packages.reflex-base.src.reflex_base.event.processor.event_processor40 packages.reflex-base.src.reflex_base.event.processor.base_state_processorpackages.reflex-base.src.reflex_base.components.tags.tag1packages.reflex-base.src.reflex_base.plugins.base2packages.reflex-bench.src.reflex_bench.schema3packages.reflex-build-sdk.src.reflex_build_sdk.transports._base4packages.reflex-build-sdk.src.reflex_build_sdk.types5packages.reflex-components-core.src.reflex_components_core.base.fragment6packages.reflex-components-core.src.reflex_components_core.el.elements.base7packages.reflex-components-internal.src.reflex_components_internal.components.component8packages.reflex-components-radix.src.reflex_components_radix.primitives.base9packages.reflex-components-radix.src.reflex_components_radix.themes.base10reflex.state11packages.reflex-base.src.reflex_base.vars.sequence12packages.reflex-bench.src.reflex_bench.context13packages.reflex-build-sdk.src.reflex_build_sdk._async.resources.apps14packages.reflex-build-sdk.src.reflex_build_sdk._deploy15packages.reflex-build-sdk.src.reflex_build_sdk._sync.resources.apps16packages.reflex-components-internal.src.reflex_components_internal.components.base_ui17reflex.istate.manager18reflex.istate.manager.token19packages.reflex-base.src.reflex_base.event.context20packages.reflex-base.src.reflex_base.vars.number21packages.reflex-bench.src.reflex_bench.registry22packages.reflex-build-sdk.src.reflex_build_sdk._async._client23packages.reflex-build-sdk.src.reflex_build_sdk._sync._client24reflex.app25packages.reflex-base.src.reflex_base.vars.base26packages.reflex-bench.src.reflex_bench27packages.reflex-bench.src.reflex_bench.suites28reflex.utils29packages.reflex-base.src.reflex_base.components.component30packages.reflex-base.src.reflex_base.vars.function31packages.reflex-base.src.reflex_base.vars.object32packages.reflex-base.src.reflex_base.components33packages.reflex-base.src.reflex_base.event34packages.reflex-base.src.reflex_base.vars35packages.reflex-base.src.reflex_base.registry36packages.reflex-base.src.reflex_base.utils37packages.reflex-base.src.reflex_base38packages.reflex-base.src.reflex_base.event.processor.event_processor39packages.reflex-base.src.reflex_base.event.processor.base_state_processor404917327311111311111124917545611352255421331123123112212112312212112+447 more modules (most-connected shown)

At a glance — Code Health · 43% · Weak · gated by R1, X4, X5 ·

At a glance — Architecture · 95% · Exemplary ·

At a glance — Maturity · 79% · Strong ·

At a glance — Readiness · 47% · Weak · gated by R4, P7, P8 ·

At a glance — Security · 69% · Adequate · gated by D29, D36 ·

At a glance — Domain Modelling · 100% · Exemplary ·

At a glance — Accessibility · 81% · Strong ·

At a glance — Performance · 94% · 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
A05:2025 — Injection46High / Critical
A02:2025 — Security Misconfiguration13High / Critical
A03:2025 — Software Supply Chain Failures6High / Critical
A07:2025 — Authentication Failures5High / Critical

Roadmap

Top priorities: Resolve the 1 finding(s) in Type Safety; The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`); Interpolated log message defeats structured logging.

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

Do thisHelpsEffortDimension
Resolve the 1 Banned license finding(s) in License Compliance.+2.5 ptsLowLicense Compliance
Resolve the 1 finding(s) in Type Safety.+3.7 ptsMediumType Safety
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).+3.1 ptsMediumNullable reference types
Interpolated log message defeats structured logging+2.5 ptsMediumStructured logging
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED.+0.8 ptsLowADR Quality
Pass `timeout=` on every `requests`/`httpx` call (requests has no default and will wait forever), mount an `HTTPAdapter(max_retries=Retry(...))` on shared sessions, and wrap calls to flaky dependencies in `tenacity` retries or a `pybreaker` circuit breaker.+1.5 ptsMediumOutbound HTTP resilience
Replace SQLAlchemy create_all() with Alembic (`alembic revision --autogenerate` + `alembic upgrade head`) so the production schema can evolve safely and reproducibly.+1.5 ptsMediumSchema migrations
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED.+0.3 ptsLowStatic Analysis (SAST)

File quality

Per-file score 0–10 — a quality signature. Of 194 files carrying findings, judged against the Production bar: 3% slop · 58% mixed · 39% near-clean.

FileScoreBandWorst signal
REDACTED0.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED1.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.4MixedIaC & Container Security: High IaC: REDACTED
packages/reflex-base/src/reflex_base/components/component.py4.8MixedCyclomatic Complexity: Component._post_init (cyclomatic 33)
REDACTED5.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedDependency Vulnerabilities: High CVE: REDACTED
REDACTED5.3MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.3MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.7MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.8MixedIaC & Container Security: High IaC: REDACTED
REDACTED5.8MixedIaC & Container Security: High IaC: REDACTED
packages/reflex-base/src/reflex_base/environment.py6.0MixedExplicit Debt: TodoComment
docs/app/reflex_docs/pages/docs/__init__.py6.0MixedExplicit Debt: TodoComment
packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py6.0MixedExplicit Debt: TodoComment

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 — 32

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 — 666

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 — 108

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

Could not be resolved — 9

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 81 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 — 81 dimensions across the health lenses
D1D2D3D4D5D6D10D11D13D14D15D16D17D19D20D24D26D27D28D29D30D31D34D35D36D37D43D44AC2AC3AC4AC5AC6AX10AX3AX4AX6C2DM6M1M2M3M4P1P10P2P3P4P5P6P7P8PF1PF3R1R10R2R3R4R5R6R7R8R9S1X1X12X13X14X17X19X21X23X24X25X27X28X3X30X4X5

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, 786 of 806 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 01a1e382-f4ef-7c24-9be0-87097f359f77.

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.

  • 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 157 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 575 test source file(s) (.py) 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.
  • D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 43 shipped Python distribution(s) across 25 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
  • 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.
  • 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. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
  • D21 Naming Consistency — 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — 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. 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.
  • D21 Naming Consistency — 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. 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 — 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. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (packages/reflex-workflow/pyproject.toml), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • 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.
  • D32 Data Compliance (PII/GDPR) — 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. `packages/reflex-base/src/reflex_base/event/__init__.py`, `packages/reflex-bench/src/reflex_bench/subjects.py`, `packages/reflex-components-core/src/reflex_components_core/core/match.py` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • C1 Data Protection — 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C3 Audit Trail — 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. 'sqlalchemy' is imported (reflex/model.py:21), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C4 Data Retention — 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. 'sqlalchemy' is imported (reflex/model.py:21), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C5 Data-Subject Rights — 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. 'sqlalchemy' is imported (reflex/model.py:21), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • GD1 Unfinished & placeholder code — 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 reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — 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 reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • X16 Unfloored truncation loop — 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.
  • X29 Per-element action decided by a fixed element — 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. 261 further occurrence(s) are not listed individually; the score already reflects all 301.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

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.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • D13 REDACTED Scanning: REDACTED 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.
  • 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.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • 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.
  • 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 (go.mod, 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.
  • 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.
  • DM6 Domain ↔ infrastructure boundary: Infrastructure reached through a hand-rolled wrapper, a domain-named facade, reflection, or a string-keyed service locator resolves to a non-infra type and isn't seen; the body scan is symbol resolution over syntax, not full dataflow. A clean result means "no resolved infra reference in a domain body", not a proof of purity.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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".
  • P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
  • 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 Complexity6.0 / 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 6.0 / 10 · rule-coverage 100% · ceiling Prevented

99 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was cli.deploy at 103. A further 1 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 cli.dispatch at 22 — 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: packages/reflex-release/src/reflex_release/cli.py (cli.dispatch at 22). 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.

Var.guess_type (cyclomatic 17) · ×6packages/reflex-base/src/reflex_base/vars/base.py:1221
cli.deploy (cyclomatic 103)packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:612
AlgoliaSearch.AlgoliaSearch (cyclomatic 66)REDACTED:260
types._isinstance (cyclomatic 61)REDACTED:1382
compiler.compile_app (cyclomatic 52)reflex/compiler/compiler.py:1233

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

What to do

  1. Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with cli.deploy (cyclomatic 103), AlgoliaSearch.AlgoliaSearch (cyclomatic 66), types._isinstance (cyclomatic 61). — 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 3 together lifts Cyclomatic Complexity from 6.0 to about 6.5/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.4 / 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.4 / 10 · rule-coverage 100% · ceiling Prevented

209 method(s) exceeded the cognitive complexity threshold of 15; the worst was cli.deploy at 170.

ObjectVar.__getattr__ (cognitive 18) · ×8packages/reflex-base/src/reflex_base/vars/object.py:294
Var.guess_type (cognitive 18) · ×6packages/reflex-base/src/reflex_base/vars/base.py:1221
cli.deploy (cognitive 170)packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:612
AlgoliaSearch.AlgoliaSearch (cognitive 112)REDACTED:260
types._isinstance (cognitive 110)REDACTED:1382

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

What to do

  1. Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with cli.deploy (cognitive 170). — Refactoring it lifts Cognitive Complexity from 4.4 to about 4.9/10.

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

D3 · God Classes8.6 / 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 8.6 / 10 · rule-coverage 100% · ceiling Prevented

55 god class(es) detected.

FileTooLong: vars/base.py · ×45packages/reflex-base/src/reflex_base/vars/base.py
TooManyMethods: BaseState · ×6REDACTED:589
FunctionTooLong: AlgoliaSearch.AlgoliaSearch · ×3REDACTED:260
ClassTooLong: AlgoliaSearchREDACTED:1

What to do

  1. Resolve the 45 FileTooLong finding(s) in God Classes — start with component.py (2), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (45 warning-level).
  2. Resolve the 6 TooManyMethods finding(s) in God Classes — start with REDACTED, component.py, sequence.py. — One of this dimension's main actionable groups (6 warning-level).
  3. Resolve the 3 FunctionTooLong finding(s) in God Classes — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 warning-level).

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

D4 · Code Duplication8.7 / 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.7 / 10 · rule-coverage 100% · ceiling Verified

88 duplicated block group(s) detected. 3.1 % of the production lines (5,149 of 164,229) are in a reported copy. A further 51 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (8 lines × 2) · ×12docs/app/reflex_docs/pages/docs/library.py:20
Duplicated block (8 lines × 4) · ×7packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:60
Duplicated block (14 lines × 2) · ×6docs/app/reflex_docs/templates/docpage/docpage.py:679
Edited copy of a member (11 corresponding lines) · ×4reflex/utils/frontend_skeleton.py:661
Duplicated block (8 lines × 3) · ×4packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:179

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

What to do

  1. Resolve the 12 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with context_menu.py (6), select.py (2), library.py. — One of this dimension's main actionable groups (12 warning-level).
  2. Resolve the 7 Duplicated block (8 lines × 4) finding(s) in Code Duplication — start with card.py (3), context_menu.py (3), input.py. — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 6 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with docpage.py, changelog.py, meta.py. — One of this dimension's main actionable groups (6 warning-level).

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

D5 · Coupling9.7 / 10Stronggated by 1 serious finding✓ 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.7 / 10 · rule-coverage 100% · ceiling Prevented

29 production modules (npm+Python), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 1 module(s) off the main sequence, with abstractness counted on 27 of the 29 (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: reflex (Python)

What to do

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

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

D6 · Cohesion (LCOM4)9.8 / 10Stronggated by 4 serious findings✓ 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 9.8 / 10 · rule-coverage 100% · ceiling Verified

4 of 230 classes have LCOM4 above 3.

Low cohesion: Tab (LCOM4 5) · ×4packages/reflex-bench/src/reflex_bench/drivers/browser.py:126

What to do

  1. Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with component.py (2), browser.py, REDACTED. — One of this dimension's main actionable groups (4 warning-level).

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

D10 · Test Quality10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 157 tests. Measured on the JavaScript/TypeScript suite only — at least 575 test source file(s) (.py) went unread, so its test quality is unmeasured and is not in these counts.

Mock-dominated test: preventDefault and stopPropagation act on the dom event among the argspackages/reflex-frontend/tests/state.test.js:533

✓ On the Gold path — maintain.

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

D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 2 measured tier(s). JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in packages/reflex-frontend/ (168 tests)): measured (0 flaky); Python (2 distributions): measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

D13 · REDACTED 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

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance8.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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 8.0 / 10 · rule-coverage 100% · ceiling Verified

1 of 102 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 43 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (60 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 3 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.

Banned license: psycopg

What to do

  1. Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).

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

D15 · Churn × Complexity Hotspots9.7 / 10Stronggated by 33 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: REDACTED (32×42=1344); REDACTED (22×61=1342); reflex/compiler/compiler.py (23×52=1196) Repeated repair below the complexity floor: packages/reflex-base/src/reflex_base/vars/number.py (4 of 6 changes were fixes); tests/units/reflex_base/client_event_queue_runtime.mjs (3 of 5 changes were fixes); packages/reflex-components-core/src/reflex_components_core/core/_upload.py (3 of 5 changes were fixes)

Hotspot: REDACTED · ×30REDACTED:1100
Repeated repair: packages/reflex-base/src/reflex_base/vars/number.py · ×3packages/reflex-base/src/reflex_base/vars/number.py:456

What to do

  1. Resolve the 30 Hotspot finding(s) in Churn × Complexity Hotspots — start with __init__.py (2), config.py (2), REDACTED. — One of this dimension's main actionable groups (30 warning-level).
  2. Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with number.py, client_event_queue_runtime.mjs, _upload.py. — 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 Factor8.9 / 10Strong✓ 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 8.9 / 10 · rule-coverage 100% · ceiling Documented

39 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is packages/reflex-release/src/reflex_release/commands.py. Counted over 369 of the 634 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 · ×4
Further sole-owners (lower concentration)

What to do

  1. Resolve the 4 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (4 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

D17 · Explicit Debt10.0 / 10Stronggated by 22 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 10.0 / 10 · rule-coverage 100% · ceiling Prevented

22 deducted task-comment markers across 164229 LoC (0.0/KLoC) → score 10.0. 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 · ×19tests/units/test_state.py:5548
XxxComment · ×2packages/reflex-components-sonner/src/reflex_components_sonner/toast.py:128
HackCommentREDACTED:981

What to do

  1. Resolve the 19 TodoComment finding(s) in Explicit Debt — start with dataeditor.py (3), shared.py (2), toast.py (2). — One of this dimension's main actionable groups (19 warning-level).
  2. Resolve the 2 XxxComment finding(s) in Explicit Debt — start with toast.py, reflex_docs.py. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 HackComment finding(s) in Explicit Debt — start with REDACTED. — One of this dimension's main actionable groups (1 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. 438 document(s) read across 3 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 foundREDACTED:88

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED. — 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.

D24 · Comment Value9.2 9.1 / 10Exemplary✓ 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 9.1 / 10 · rule-coverage 98% · ceiling Documented

2 of 260 judged comments only repeat the code they sit on (0.8 %). 5 comment(s) in another language or script were not judged.

redundant comment · ×2packages/reflex-frontend/src/utils/react-theme.js:70
doc comments repeat the namesREDACTED:915

✓ On the Gold path — maintain.

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

D26 · Project Cohesion5.1 / 10Adequate✓ 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 5.1 / 10 · rule-coverage 100% · ceiling Documented

7 of 28 build units (Python, npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion · ×7packages/reflex-base/pyproject.toml:1

What to do

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

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

D27 · Navigability9.8 / 10Exemplary✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

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

97 % of calls cross a namespace and 0 % go through an interface, but 96 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)7.0 / 10Adequategated by 3 critical findings✓ Tool-verified

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

Method: REDACTED 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 7.0 / 10 · rule-coverage 100% · ceiling Documented

4 finding(s): 0 critical, 3 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 3 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 1 Algolia API key used for search finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

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

D29 · Static Analysis (SAST)0.2 / 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.2 / 10 · rule-coverage 100% · ceiling Documented

46 finding(s): 0 critical, 14 high, 29 medium, 3 low. semgrep hit a parse error in 12 file(s) — `.claude/hooks/session-start.sh` (line 47), `.claude/skills/prerelease-test/scripts/bootstrap_envs.sh` (line 30, line 36, line 83), `REDACTED` (lines 27–61), `packages/reflex-base/src/reflex_base/event/__init__.py` (line 3154, line 3439, line 3477, …), `packages/reflex-bench/src/reflex_bench/subjects.py` (line 473, line 672), … (+7 more) — 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 1 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

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

What to do

  1. Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (6 issue-level).
  2. Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
  3. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

D30 · Dependency Vulnerabilities9.2 / 10Adequategated by 1 critical finding✓ 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 9.2 / 10 · rule-coverage 100% · ceiling Documented

2 finding(s): 0 critical, 1 high, 1 medium, 0 low.

REDACTED
REDACTED

What to do

  1. Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D31 · IaC & Container Security7.7 / 10Adequategated by 5 critical findings✓ 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 7.7 / 10 · rule-coverage 100% · ceiling Documented

13 finding(s): 0 critical, 5 high, 6 medium, 2 low.

REDACTED
REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness9.9 / 10Exemplary✓ 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 9.9 / 10 · rule-coverage 100% · ceiling Documented

3 of 369 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is packages/reflex-components-radix/src/reflex_components_radix/themes/layout/list.py. Counted over 369 of the 634 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×3packages/reflex-components-radix/src/reflex_components_radix/themes/layout/list.py:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

D35 · Change Coupling9.8 / 10Adequategated by 6 critical 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: installer.py↔tailwind_v4.py 71%; recharts.py↔installer.py 61%; __init__.py↔__init__.py 58%

Boundary-crossing change coupling: recharts.py ↔ installer.py · ×6packages/reflex-components-recharts/src/reflex_components_recharts/recharts.py:1
Change coupling: installer.py ↔ tailwind_v4.py · ×2reflex/constants/installer.py:1

What to do

  1. Resolve the 6 Boundary-crossing change coupling finding(s) in Change Coupling — start with __init__.py (2), recharts.py, plotly.py. — One of this dimension's main actionable groups (6 issue-level).
  2. Resolve the 2 Change coupling finding(s) in Change Coupling — start with installer.py, base.py. — One of this dimension's main actionable groups (2 warning-level).

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

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ 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 2.5 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-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.

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 2 platform declaration(s) and 43 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.

AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged

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.

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 semantics10.0 / 10Exemplary○ Nothing flagged

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

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 safety4.3 / 10Weak✓ 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.

  • <span> moves — its inline style sets `animation: delay` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — REDACTED:231
  • `.code-block` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — packages/reflex-site-shared/src/reflex_site_shared/styles/assets/tailwind-theme.css:1812
  • `.demo-code-block` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — packages/reflex-site-shared/src/reflex_site_shared/styles/assets/tailwind-theme.css:2005
  • `.docs-landing .marketing-footer-newsletter-field` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — docs/app/assets/docs-theme.css:213

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

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

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 — DRF permission classes, django-guardian or django-rules permissions, a casbin or oso policy, or roles and permissions declared once — and consult them where access is checked (permission_classes, @permission_required, Depends), so the rule set is reviewable and testable on its own.
DM6 · Domain ↔ infrastructure boundary10.0 / 10Exemplary✓ Tool-verified

Other · Domain Modelling — Whether the domain layer stays free of infrastructure dependencies — a domain aggregate fused to a persistence ORM (Django/SQLAlchemy) on its own declaration (active-record) couples the domain to infrastructure. The clean-architecture dependency rule.

Method: Roslyn (DDD-gated): domain-layer types scanned for infrastructure usage in member SIGNATURES and inside method/accessor BODIES — resolved calls and object-creations into EF/Marten/HTTP/Mongo/Redis/message-bus types (not just a namespace allowlist). Deterministic, symbol-resolved, exhaustive over domain-layer bodies, DDD-native.

Coverage: Domain layer identified by NAMESPACE heuristic; infrastructure then resolved by symbol in member SIGNATURES and method/accessor BODIES — rename the layer and the check evaporates.

M1 · Documentation (README)8.6 / 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.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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.8 / 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 12/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `packages/reflex-release`.

What to do

  • Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
P3 · Security & performance tooling8.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 & Rollback10.0 / 10Exemplary✓ 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.

P5 · DR & Backup4.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.

Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.

What to do

  • Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
  • Enable purge protection / soft-delete (and prevent_destroy on critical resources) so data stores can't be lost to an accidental or malicious delete.
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.

  • `aiohttp.ClientSession(` 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. — docs/app/reflex_docs/utils/http.py:40
  • `httpx.get(` 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. — packages/reflex-hosting-cli/src/reflex_cli/v2/deployments.py:172
  • `httpx.AsyncClient(` 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. (×3) — packages/reflex-site-shared/src/reflex_site_shared/backend/signup.py:36, packages/reflex-site-shared/src/reflex_site_shared/backend/signup.py:61, packages/reflex-site-shared/src/reflex_site_shared/backend/slack.py:40

What to do

  • Pass `timeout=` on every `requests`/`httpx` call (requests has no default and will wait forever), mount an `HTTPAdapter(max_retries=Retry(...))` on shared sessions, and wrap calls to flaky dependencies in `tenacity` retries or a `pybreaker` circuit breaker.
P8 · Schema migrations3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.

Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.

  • SQLAlchemy create_all() builds the schema from the model at startup and keeps no migration history, so there is no reviewed, repeatable upgrade path for an existing production database — a renamed column is dropped and re-added rather than migrated. Adopt Alembic (`alembic revision --autogenerate` + `alembic upgrade head`), so every schema change is a versioned file applied the same way in every environment. — packages/reflex-workflow/benchmarks/bench.py:159

What to do

  • Replace SQLAlchemy create_all() with Alembic (`alembic revision --autogenerate` + `alembic upgrade head`) so the production schema can evolve safely and reproducibly.
PF1 · Benchmark discipline9.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

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 Safety1.2 / 10Critical✓ 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.

  • 5 typed · 37 plain JS — the untyped files are packages/reflex-components-internal/src/reflex_components_internal/components/base/GradientProfile.js, packages/reflex-frontend/src/app/entry.client.embed.js, packages/reflex-frontend/src/app/entry.client.js, packages/reflex-frontend/src/app/routes.js, packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.js, packages/reflex-frontend/src/components/shiki/code.js (+31 more).
R10 · Code Duplication8.9 / 10Strong✓ 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.

  • REDACTED:670 · REDACTED:692 — 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. — REDACTED:670
  • REDACTED:791 · REDACTED:812 — 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. — REDACTED:791
  • REDACTED:740 · REDACTED:754 — 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. — REDACTED:740
  • packages/reflex-frontend/src/components/shiki/code.js:51 · packages/reflex-site-shared/src/reflex_site_shared/styles/assets/components/DeferredDemo.jsx:31 — the two spans are one implementation copied and then locally edited — 57 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. — packages/reflex-frontend/src/components/shiki/code.js:51
  • REDACTED:1502 · REDACTED:1513 — 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. — REDACTED:1502
  • packages/reflex-frontend/src/utils/helpers/set.js:66 · packages/reflex-frontend/src/utils/helpers/set.js:102 — 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. — packages/reflex-frontend/src/utils/helpers/set.js:66

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.
R2 · Cyclomatic Complexity9.8 / 10Exemplary✓ 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.

  • applyEvent has cyclomatic complexity 42 and cognitive complexity 71; 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. — REDACTED:633
  • mergeSlotProps has cyclomatic complexity 21 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 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. — REDACTED:2211
  • replaceEqualDeep has cyclomatic complexity 20 and cognitive complexity 36; 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. — REDACTED:368
  • applyClientStorageDelta has cyclomatic complexity 20 and cognitive complexity 26; 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. — REDACTED:1586
  • AlgoliaSearch 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. — REDACTED:260
  • hydrateClientStorage has cyclomatic complexity 18 and cognitive complexity 25; 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. — REDACTED:1495
  • parseDatetime has cyclomatic complexity 16 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 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. — packages/reflex-frontend/src/utils/helpers/datetime.js:5
  • applyEventActions 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:1451
  • formatCell has cyclomatic complexity 13 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. — packages/reflex-frontend/src/utils/helpers/dataeditor.js:21
R3 · Large Files7.1 / 10Strong✓ 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.

  • REDACTED has 2232 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
  • REDACTED has 1218 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

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage3.6 / 10Weak✓ 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. (×18) — REDACTED:1, REDACTED:1, packages/reflex-otel/src/reflex_otel/otel.js:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R5 · Dependency Freshness9.5 / 10Exemplary✓ Tool-verified

React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).

Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.

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.

R7 · Dead Code9.0 / 10Strong✓ 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 19 application, 4 tooling and 15 test entry point(s) detected in this repo. Gate removals on `npm run typecheck` — an undetected custom entry would make these reachable.
  • no import path from any entry point (19 application, 4 tooling, 15 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.js) — 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 — packages/reflex-frontend/src/utils/react-theme.js
  • no import path from any entry point (19 application, 4 tooling, 15 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 (×5) — packages/reflex-frontend/src/components/shiki/code.js, packages/reflex-frontend/src/utils/helpers/paste.js, packages/reflex-frontend/src/utils/helpers/dataeditor.js, …

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 Hygiene4.0 / 10Weak✓ 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. (×2) — packages/reflex-components-internal/src/reflex_components_internal/components/base/GradientProfile.js:1, REDACTED:23
  • Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json. — REDACTED:19

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports10.0 / 10Exemplary✓ 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.

S1 · Web-Security Posture8.0 / 10Strong✓ Tool-verified

Other · Security — Only what this repository's own non-C# files could be read for was assessed — and because this repository commits the configuration that serves its own HTTP surface, that configuration could be read in full for the security response headers it sets. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.

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 configured — defense in depth, even when a reverse proxy could set them. This is reported because `Caddyfile` is committed to this repository and declares the server that serves it, so the configuration that would carry these headers is in this repository and was read in full. (−2.0 on this card.) — docker-example/production-compose/Caddyfile:7

What to do

  • Set security response headers on the surface this repository serves: an `add_header` directive per header in the nginx/Caddy/Apache config, a `_headers` / `vercel.json` / `netlify.toml` entry for a static host, or `helmet()` in the HTTP server. `Content-Security-Policy` is the one that pays for itself first — it is what contains an injected script once one reaches the page — followed by `X-Content-Type-Options: nosniff` and a frame policy (`X-Frame-Options: DENY`, or CSP `frame-ancestors`). Where the app is served from a build container, the header configuration belongs in the image beside the built assets, so it ships with them rather than depending on where it lands.
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.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. 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 `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document2.0 / 10Critical✓ Tool-verified

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

  • `debug_failed_pickles` is public and takes `obj: object` from its caller, and it calls itself at line 41 (`debug_failed_pickles`) with a piece of `obj` (and at line 46, line 54, line 61) — and nowhere in `debug_failed_pickles` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `debug_failed_pickles` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — reflex/istate/__init__.py:41
  • `as_json_document` is public and takes `value: Any` from its caller, and it calls itself at line 316 (`as_json_document`) with a piece of `value` (and at line 318) — and nowhere in `as_json_document` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `as_json_document` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:316
  • `format_type` is public and takes `type_: Any` from its caller, and it calls itself at line 203 (`format_type`) with a piece of `type_` (and at line 214) — and nowhere in `format_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `format_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/reflex-docgen/src/reflex_docgen/_class.py:203
  • `format_as_emotion` is public and takes `style_dict: dict[str, Any]` from its caller, and it calls itself at line 379 (`format_as_emotion`) with a piece of `style_dict` — and nowhere in `format_as_emotion` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `format_as_emotion` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/reflex-base/src/reflex_base/style.py:379
  • `figure_out_type` is public and takes `value: Any` from its caller, and it calls itself at line 2227 (`figure_out_type`) with a piece of `value` (and at line 2229, line 2237, line 2238, line 2243, line 2244) — and nowhere in `figure_out_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `figure_out_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/reflex-base/src/reflex_base/vars/base.py:2227
  • `type_to_ast` is public and takes `typ: Any` from its caller, and it calls itself at line 767 (`type_to_ast`) with a piece of `typ` — and nowhere in `type_to_ast` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `type_to_ast` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:767
  • `get_typed_dict_field_types` is public and takes `typed_dict: Any` from its caller, and it calls itself at line 515 (`get_typed_dict_field_types`) with a piece of `typed_dict` — and nowhere in `get_typed_dict_field_types` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `get_typed_dict_field_types` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — REDACTED:515
  • `render_prop` is public and takes `value: Any` from its caller, and it calls itself at line 31 (`render_prop`) with a piece of `value` — and nowhere in `render_prop` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `render_prop` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — packages/reflex-base/src/reflex_base/components/tags/tag.py:31

What to do

  • Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

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 materialisation7.0 / 10Adequate✓ Tool-verified

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.

  • `debug` at line 280 is called with an argument built by `sorted(map(str, bases))` (line 280), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — reflex/model.py:280
  • `debug` at line 660 is called with an argument built by `list(map(str, override_dirs))` (line 660), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — reflex/utils/exec.py:660
  • `debug` at line 735 is called with an argument built by `list(map(str, reload_paths))` (line 735), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — reflex/utils/exec.py:735
  • `debug` at line 92 is called with an argument built by `"…".join(args)` (line 93), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — reflex/utils/migrations.py:92
  • `debug` at line 119 is called with an argument built by `"…".join(current_requirements_lines)` (line 119), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — packages/reflex-hosting-cli/src/reflex_cli/utils/dependency.py:119

What to do

  • In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
X24 · Document value interpolated into markup unescaped5.0 / 10Adequate✓ Tool-verified

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

  • `highlighted.html` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — packages/reflex-frontend/src/components/shiki/code.js:88

What to do

  • Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — 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.

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.

X3 · Exception handling7.2 / 10Strong✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×12) — REDACTED:2563, reflex/utils/exec.py:1217, reflex/utils/prerequisites.py:373, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×3) — REDACTED:167, packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:855, packages/reflex-bench/src/reflex_bench/drivers/bench_page.js:25
  • `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — packages/reflex-otel/src/reflex_otel/otel.js:144
  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. — REDACTED:282
  • `except (Exception, asyncio.CancelledError)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — packages/reflex-base/src/reflex_base/event/processor/future.py:113

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X4 · Structured logging3.3 / 10Weak✓ 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.

  • `error` at line 146 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:146
  • `error` at line 165 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:165
  • `error` at line 232 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:232
  • `warning` at line 749 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:749
  • `warning` at line 1245 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:1245
  • `warning` at line 1557 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:1557
  • `warning` at line 1947 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:1947
  • `warning` at line 2632 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2632
  • `warning` at line 2657 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2657
  • `warning` at line 2661 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2661
  • `error` at line 2751 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2751
  • `warning` at line 2775 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2775
  • `warning` at line 2802 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2802
  • `warning` at line 2810 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2810
  • `warning` at line 2896 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2896
  • `debug` at line 2936 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2936
  • `debug` at line 2945 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2945
  • `warning` at line 2965 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:2965
  • `warning` at line 141 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — reflex/assets.py:141
  • `warning` at line 161 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — reflex/model.py:161
  • `debug` at line 280 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/model.py:280
  • `error` at line 519 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — reflex/model.py:519
  • `error` at line 60 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:60
  • `log` at line 329 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.log(logging.INFO, "order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:329
  • `error` at line 689 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:689
  • `log` at line 936 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.log(logging.INFO, "order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:936
  • `info` at line 1154 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:1154
  • `info` at line 1163 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:1163
  • `info` at line 1183 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/reflex.py:1183
  • `warning` at line 1046 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — REDACTED:1046
  • `debug` at line 163 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/build.py:163
  • `debug` at line 234 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/build.py:234
  • `debug` at line 237 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/build.py:237
  • `info` at line 330 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:330
  • `warning` at line 414 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:414
  • `debug` at line 660 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:660
  • `debug` at line 735 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:735
  • `debug` at line 1221 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:1221
  • `debug` at line 1222 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:1222
  • `debug` at line 1243 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — reflex/utils/exec.py:1243

What to do

  • Interpolated log message defeats structured logging
X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.

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

  • 0/2 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.

What to do

  • The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).

WCAG coverage — what static analysis assessed

Statically assessed 12 of 55 WCAG 2.2 Level A/AA success criteria (22%; ≈24% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 43 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
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 43 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 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 Health43%Weak — gated by R1, X4, X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture95%ExemplarySolid.
Maturity79%StrongSolid.
Readiness47%Weak — gated by R4, P7, P8Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security69%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Domain Modelling100%ExemplaryStrongest area.
Accessibility81%StrongSolid.
Performance94%ExemplarySolid.
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 — 23 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 3 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 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.

  • C3 Audit Trail — Not assessed: this repository stores data through 'sqlalchemy' (reflex/model.py:21) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
  • C4 Data Retention — Not assessed: this repository stores data through 'sqlalchemy' (reflex/model.py:21) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
  • C5 Data-Subject Rights — Not assessed: this repository stores data through 'sqlalchemy' (reflex/model.py:21) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
Not included — 43 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
  • AX1 Captive dependencies — Not applicable: 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; this repository's Python 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 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.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — compose up failed (exit 17 — an image could not be built) — failed to solve: failed to compute cache key: failed to calculate checksum of ref beccc75f-70eb-4cd0-b442-3558247ffa3a::kgyjv18l6h3md2rgppq9o9rpk: "/requirements.txt": not found; likely cause (the repository): a file the REDACTED copies (`requirements.txt`) is not in the repository's build context (it may be produced by a build step outside the REDACTED, or excluded by .dockerignore); runtime evidence skipped The cause is in the repository, not in our sandbox: a file the REDACTED copies (`requirements.txt`) is not in the repository's build context (it may be produced by a build step outside the REDACTED, or excluded by .dockerignore). Nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
  • 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.
  • D21 Naming Consistency — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • 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. Aggregate roots were found in only one source directory (examples), which is a layered codebase, not two contexts. 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
  • D32 Data Compliance (PII/GDPR) — 3 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • 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: the JavaScript/TypeScript half could not be measured — packages/reflex-frontend/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • 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
  • 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.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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
  • X16 Unfloored truncation loop — X16 reached only 3% of this repository's production lines — python (162,937 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
  • 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
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — X29 reached only 3% of this repository's production lines — python (162,937 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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 — 32 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Boundary-crossing change coupling · ×6
  • Boundary-crossing change coupling: recharts.py ↔ installer.py packages/reflex-components-recharts/src/reflex_components_recharts/recharts.py:1 — `packages/reflex-components-recharts/src/reflex_components_recharts/recharts.py` (context reflex-components-recharts) and `reflex/constants/installer.py` (context reflex) sit in DIFFERENT parts of the tree yet change together 61% of the time (17 of the 28 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are `e7c37421` 0828dev (#6136) (at that commit the file was still `reflex/components/recharts/recharts.py`); `1e713983` 0824dev (#6053) (at that commit the file was still `reflex/components/recharts/recharts.py`); `fad67cfe` upgrade deps again for 0822 (#6022) (at that commit the file was still `reflex/components/recharts/recharts.py`) — run `git show` on any of them.
  • Boundary-crossing change coupling: __init__.py ↔ __init__.py packages/reflex-components-core/src/reflex_components_core/datadisplay/__init__.py:1 — `packages/reflex-components-core/src/reflex_components_core/datadisplay/__init__.py` (context reflex-components-core) and `reflex/components/__init__.py` (context reflex) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `f99c4880` Top-level namespace tweaks (#2523) (at that commit the file was still `reflex/components/datadisplay/__init__.py`); `33e48169` Lazy import modules in reflex (#2144) (at that commit the file was still `reflex/components/datadisplay/__init__.py`); `3262f296` fix editable column and theme casting (#2051) (at that commit the file was still `reflex/components/datadisplay/__init__.py`) — run `git show` on any of them.
  • Boundary-crossing change coupling: __init__.py ↔ __init__.py packages/reflex-components-core/src/reflex_components_core/core/__init__.py:1 — `packages/reflex-components-core/src/reflex_components_core/core/__init__.py` (context reflex-components-core) and `reflex/__init__.py` (context reflex) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3154987f` add window_event_listener (#5568) (at that commit the file was still `reflex/components/core/__init__.py`); `3129ddab` Add auto scroll (#4790) (at that commit the file was still `reflex/components/core/__init__.py`); `82a0d7f3` introduce customizable breakpoints (#3568) (at that commit the file was still `reflex/components/core/__init__.py`) — run `git show` on any of them.
  • Boundary-crossing change coupling: plotly.py ↔ react_player.py packages/reflex-components-plotly/src/reflex_components_plotly/plotly.py:1 — `packages/reflex-components-plotly/src/reflex_components_plotly/plotly.py` (context reflex-components-plotly) and `packages/reflex-components-react-player/src/reflex_components_react_player/react_player.py` (context reflex-components-react-player) sit in DIFFERENT parts of the tree yet change together 50% of the time (8 of the 16 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `169f70de` ENG-10963 refactor(log): migrate reflex-base and component packages t…; `ca5af9cd` 0821dev (#5993) (at that commit the files were still `reflex/components/plotly/plotly.py` and `reflex/components/react_player/react_player.py`); `946b7bc2` upgrade deps as per python 3.10 (#4842) (at that commit the files were still `reflex/components/plotly/plotly.py` and `reflex/components/react_player/react_player.py`) — run `git show` on any of them.
  • Boundary-crossing change coupling: icon.py ↔ tailwind_v4.py packages/reflex-components-lucide/src/reflex_components_lucide/icon.py:1 — `packages/reflex-components-lucide/src/reflex_components_lucide/icon.py` (context reflex-components-lucide) and `reflex/plugins/tailwind_v4.py` (context reflex) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `1e713983` 0824dev (#6053) (at that commit the file was still `reflex/components/lucide/icon.py`); `d52e6ed1` 0820dev (#5967) (at that commit the file was still `reflex/components/lucide/icon.py`); `c4254edc` 0818dev (#5933) (at that commit the file was still `reflex/components/lucide/icon.py`) — run `git show` on any of them.
  • Boundary-crossing change coupling: script.py ↔ event.py packages/reflex-components-core/src/reflex_components_core/base/script.py:1 — `packages/reflex-components-core/src/reflex_components_core/base/script.py` (context reflex-components-core) and `reflex/event.py` (context reflex) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `91ab8ac5` Remove wrong event handlers (#4136) (at that commit the file was still `reflex/components/base/script.py`); `06bdf9ed` Remove 0.3.0 deprecated features (#1947) (at that commit the file was still `reflex/components/base/script.py`); `513835cf` Update Deprecations (#1927) (at that commit the file was still `reflex/components/base/script.py`) — run `git show` on any of them.
D31 · IaC & Container Security · High IaC · ×5
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D28 · Secrets (history) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D14 · License Compliance · Banned license · ×1
  • Banned license: psycopg — `psycopg` 3.3.9 is published on PyPI under `LGPL-3.0-only`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception. ★ The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do — that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository's licence policy rather than replacing it: add `LGPL-3.0-only` / `LGPL-3.0-or-later` to the allow-list of the licence check your CI runs (`license-checker --onlyAllow`, the `allow-licenses` input of GitHub's dependency-review-action, `[licenses] allow` in cargo-deny's deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan's banned set is not read from that file, so the row stays until it is hidden.
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
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
R8 · Dependency Hygiene · Unlisted import 'react' · ×1
  • Unlisted import 'react' packages/reflex-components-internal/src/reflex_components_internal/components/base/GradientProfile.js:1 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
R8 · Dependency Hygiene · Unlisted import 'react-dom' · ×1
  • Unlisted import 'react-dom' REDACTED:23 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Serious — 666 finding(s)
D3 · God Classes · FileTooLong · ×45
  • FileTooLong: vars/base.py packages/reflex-base/src/reflex_base/vars/base.py — FileTooLong — 2731 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2231 over it, 5.46× 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: event/__init__.py packages/reflex-base/src/reflex_base/event/__init__.py — FileTooLong — 1993 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1493 over it, 3.99× 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: REDACTED REDACTED — FileTooLong — 1577 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1077 over it, 3.15× 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: REDACTED REDACTED — FileTooLong — 1550 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1050 over it, 3.10× 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: components/component.py packages/reflex-base/src/reflex_base/components/component.py — FileTooLong — 1269 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 769 over it, 2.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: REDACTED REDACTED — FileTooLong — 1231 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 731 over it, 2.46× 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: components/memo.py packages/reflex-base/src/reflex_base/components/memo.py — FileTooLong — 1167 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 667 over it, 2.33× 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: REDACTED REDACTED — FileTooLong — 1100 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 600 over it, 2.20× 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: REDACTED REDACTED — FileTooLong — 1069 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 569 over it, 2.14× 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: vars/sequence.py packages/reflex-base/src/reflex_base/vars/sequence.py — FileTooLong — 1043 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 543 over it, 2.09× 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: REDACTED REDACTED — FileTooLong — 1042 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 542 over it, 2.08× 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: drivers/events.py packages/reflex-bench/src/reflex_bench/drivers/events.py — FileTooLong — 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88× 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: compiler/compiler.py reflex/compiler/compiler.py — FileTooLong — 921 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 421 over it, 1.84× 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: utils/hosting.py packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py — FileTooLong — 899 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 399 over it, 1.80× 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: reflex_bench/cli.py packages/reflex-bench/src/reflex_bench/cli.py — FileTooLong — 871 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 371 over it, 1.74× 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: manager/redis.py reflex/istate/manager/redis.py — FileTooLong — 866 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 366 over it, 1.73× 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: docs/component.py docs/app/reflex_docs/pages/docs/component.py — 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: reflex_release/commands.py packages/reflex-release/src/reflex_release/commands.py — FileTooLong — 828 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 328 over it, 1.66× 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: suites/memory.py packages/reflex-bench/src/reflex_bench/suites/memory.py — FileTooLong — 807 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 307 over it, 1.61× 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: reflex/reflex.py reflex/reflex.py — FileTooLong — 804 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 304 over it, 1.61× 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: v2/apps.py packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py — FileTooLong — 756 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 256 over it, 1.51× 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: docs/markdown.py packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py — FileTooLong — 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51× 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: REDACTED REDACTED — FileTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43× 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: compiler/utils.py reflex/compiler/utils.py — 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: v2/cli.py packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py — FileTooLong — 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.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.
  • + 20 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×30
  • Hotspot: REDACTED REDACTED:1100 — REDACTED changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in state.connect at line 1100. 2 of those changes were fix/bug commits, and the other 30 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- REDACTED`: 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: REDACTED REDACTED:1382 — REDACTED changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in types._isinstance at line 1382. 4 of those changes were fix/bug commits, and the other 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- REDACTED`: 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: reflex/compiler/compiler.py reflex/compiler/compiler.py:1233 — reflex/compiler/compiler.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in compiler.compile_app at line 1233. 5 of those changes were fix/bug commits, and the other 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- reflex/compiler/compiler.py`: 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: packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:612 — packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in cli.deploy at line 612. 3 of those changes were fix/bug commits, and the other 7 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py`: 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: packages/reflex-base/src/reflex_base/vars/base.py packages/reflex-base/src/reflex_base/vars/base.py:1235 — packages/reflex-base/src/reflex_base/vars/base.py changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Var.guess_type at line 1235. 15 of those changes were fix/bug commits, and the other 29 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/vars/base.py`: 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: packages/reflex-base/src/reflex_base/event/__init__.py packages/reflex-base/src/reflex_base/event/__init__.py:1127 — packages/reflex-base/src/reflex_base/event/__init__.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in EventChain.create at line 1127. 12 of those changes were fix/bug commits, and the other 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/event/__init__.py`: 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: REDACTED REDACTED:776 — REDACTED changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BaseState.__init_subclass__ at line 776. 11 of those changes were fix/bug commits, and the other 25 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- REDACTED`: 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: packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py:252 — packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in base_state_processor._transform_event_arg at line 252. 12 of those changes were fix/bug commits, and the other 13 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py`: 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: reflex/compiler/utils.py reflex/compiler/utils.py:568 — reflex/compiler/utils.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in utils.compile_experimental_component_memo at line 568. 5 of those changes were fix/bug commits, and the other 14 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- reflex/compiler/utils.py`: 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: packages/reflex-base/src/reflex_base/environment.py packages/reflex-base/src/reflex_base/environment.py:392 — packages/reflex-base/src/reflex_base/environment.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in environment.interpret_env_var_value at line 392. 1 of those changes was a fix/bug commit, and the other 11 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/environment.py`: 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: packages/reflex-base/src/reflex_base/compiler/templates.py packages/reflex-base/src/reflex_base/compiler/templates.py:714 — packages/reflex-base/src/reflex_base/compiler/templates.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in templates.vite_config_template at line 714. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/compiler/templates.py`: 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: reflex/reflex.py reflex/reflex.py:845 — reflex/reflex.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in reflex.run at line 845. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- reflex/reflex.py`: 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: packages/reflex-base/src/reflex_base/config.py packages/reflex-base/src/reflex_base/config.py:369 — packages/reflex-base/src/reflex_base/config.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Config._post_init at line 369. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/config.py`: 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: packages/reflex-release/src/reflex_release/config.py packages/reflex-release/src/reflex_release/config.py:914 — packages/reflex-release/src/reflex_release/config.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in config.load_config at line 914. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-release/src/reflex_release/config.py`: 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: packages/reflex-base/src/reflex_base/components/memo.py packages/reflex-base/src/reflex_base/components/memo.py:1772 — packages/reflex-base/src/reflex_base/components/memo.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _MemoComponentWrapper.__call__ at line 1772. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/components/memo.py`: 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: reflex/compiler/plugins/memoize.py reflex/compiler/plugins/memoize.py:141 — reflex/compiler/plugins/memoize.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in memoize._should_memoize at line 141. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- reflex/compiler/plugins/memoize.py`: 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: packages/reflex-release/src/reflex_release/commands.py packages/reflex-release/src/reflex_release/commands.py:541 — packages/reflex-release/src/reflex_release/commands.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in commands.cmd_prepare_publish at line 541. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-release/src/reflex_release/commands.py`: 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: docs/app/reflex_docs/pages/docs/component.py docs/app/reflex_docs/pages/docs/component.py:468 — docs/app/reflex_docs/pages/docs/component.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in component.generate_props at line 468. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- docs/app/reflex_docs/pages/docs/component.py`: 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: packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:697 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in apps.app_logs at line 697. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py`: 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: packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:240 — packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gcp.deploy_command at line 240. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py`: 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: packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:602 — packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ReflexDocTransformer._render_alert at line 602. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py`: 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: reflex/istate/shared.py reflex/istate/shared.py:398 — reflex/istate/shared.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SharedStateBaseInternal._modify_linked_states at line 398. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- reflex/istate/shared.py`: 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: docs/app/reflex_docs/pages/docs/__init__.py docs/app/reflex_docs/pages/docs/__init__.py:253 — docs/app/reflex_docs/pages/docs/__init__.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in docs.extract_doc_description at line 253. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- docs/app/reflex_docs/pages/docs/__init__.py`: 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: REDACTED REDACTED:398 — REDACTED changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in processes.stream_logs at line 398. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- REDACTED`: 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: packages/reflex-frontend/src/utils/helpers/upload.js packages/reflex-frontend/src/utils/helpers/upload.js:20 — packages/reflex-frontend/src/utils/helpers/upload.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in upload.uploadFiles at line 20. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-frontend/src/utils/helpers/upload.js`: 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.
  • + 5 more in this group — see findings.md.
D17 · Explicit Debt · TodoComment · ×19
  • TodoComment tests/units/test_state.py:5548 — # TODO: drop the xfail once the dill release fixing — 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 tests/units/components/core/test_cond.py:152 — # TODO: shouldn't this be a ComputedVar? — 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 tests/integration/tests_playwright/test_dynamic_components.py:197 — # TODO: drop the skip once the dill release fixing — 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 reflex/istate/shared.py:76 — # TODO: remove disconnected clients after some time. — 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 reflex/istate/shared.py:253 — # TODO: Change StateManager to accept token + class instead of combining them in a string. — 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 reflex/istate/manager/redis.py:1526 — # TODO: clean up the cached states locks periodically — 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 packages/reflex-components-sonner/src/reflex_components_sonner/toast.py:106 — # TODO: fix serialization of icons for toast? (might not be possible yet) — 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 packages/reflex-components-sonner/src/reflex_components_sonner/toast.py:400 — # TODO: figure out why loading toast stay open forever when using level="loading" in toast() — 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 packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:25 — # TODO: Fix the serialization issue for custom types. — 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 packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:313 — # header_icons: Var[Any] # (TODO: must be a map of name: svg) #noqa: ERA001 — 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 packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:345 — # TODO: support a mapping (dict[int, bool]) — 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 packages/reflex-components-core/src/reflex_components_core/core/banner.py:165 — # TODO: This breaks the assumption that Vars are JS expressions — 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 packages/reflex-components-code/src/reflex_components_code/shiki_code_block.py:86 — # TODO: this transformer when included adds a weird behavior which removes other code lines. Need to figure out why. — 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 packages/reflex-base/src/reflex_base/environment.py:56 — # TODO: Change all interpret_.* signatures to value: str, field: dataclasses.Field once we migrate rx.Config to dataclasses — 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 packages/reflex-base/src/reflex_base/utils/format.py:263 — # TODO: we may need to re-visit this logic after new Var API is 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 REDACTED:108 — # TODO: fix import ordering and unused imports with ruff later — 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 REDACTED:648 — # TODO: This is not currently working since the default is not type compatible — 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 REDACTED:1192 — # TODO: check for nullable? — 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 docs/app/reflex_docs/pages/docs/__init__.py:156 — # TODO: Fix the snowflake integration docs and remove this. — 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.
R4 · Test Coverage · No test reaches this file · ×18
  • No test reaches this file REDACTED: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 REDACTED: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 packages/reflex-otel/src/reflex_otel/otel.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.
  • No test reaches this file packages/reflex-frontend/src/vite-plugin-react-compiler.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.
  • No test reaches this file packages/reflex-frontend/src/utils/react-theme.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.
  • No test reaches this file packages/reflex-frontend/src/compress-static.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.
  • No test reaches this file packages/reflex-frontend/src/components/shiki/code.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.
  • No test reaches this file packages/reflex-frontend/src/utils/helpers/paste.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.
  • No test reaches this file packages/reflex-frontend/src/utils/helpers/dataeditor.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.
  • No test reaches this file packages/reflex-site-shared/src/reflex_site_shared/styles/assets/components/GradientButton.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 packages/reflex-components-internal/src/reflex_components_internal/components/base/GradientProfile.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.
  • No test reaches this file packages/reflex-site-shared/src/reflex_site_shared/styles/assets/components/DeferredDemo.jsx: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 packages/reflex-frontend/src/app/entry.client.embed.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.
  • No test reaches this file packages/reflex-site-shared/src/reflex_site_shared/styles/assets/components/marketing-date.jsx: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 packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.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.
  • No test reaches this file packages/reflex-frontend/src/app/routes.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.
  • No test reaches this file packages/reflex-site-shared/src/reflex_site_shared/styles/assets/homepage/lib/use-isomorphic-layout-effect.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 packages/reflex-frontend/src/app/entry.client.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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×14
  • Swallowed exception (caught, then discarded) REDACTED:2563 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) reflex/utils/exec.py:1217 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) reflex/utils/prerequisites.py:373 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:448 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:640 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) reflex/istate/__init__.py:20 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) reflex/compiler/utils.py:360 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) packages/reflex-hosting-cli/src/reflex_cli/utils/dependency.py:44 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:549 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:282 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) packages/reflex-base/src/reflex_base/vars/base.py:2588 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:385 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:454 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) packages/reflex-base/src/reflex_base/event/processor/future.py:113 — `except (Exception, asyncio.CancelledError)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D29 · Static Analysis (SAST) · REDACTED · ×13
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×12
  • Duplicated block (8 lines × 2) docs/app/reflex_docs/pages/docs/library.py:20 — docs/app/reflex_docs/pages/docs/library.py:20-27 | docs/app/reflex_docs/pages/library_previews.py:32-39 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:130 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:130-137 | packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:45-52 — 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:390 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:390-397 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:588-595 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:424 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:424-431 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:623-630 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:447 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:447-454 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:646-653 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:488 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:488-495 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:687-694 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:511 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:511-518 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:710-717 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:589 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:589-596 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:516-523 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:481 — packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:481-488 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:372-379 — 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:208 — packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:208-215 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:478-485 — 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:156 — packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:156-163 | packages/reflex-components-internal/src/reflex_components_internal/components/base/slider.py:57-64 — 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. 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.
  • Duplicated block (8 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:206 — packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:206-213 | packages/reflex-components-internal/src/reflex_components_internal/components/base/slider.py:145-152 — 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. 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.
D29 · Static Analysis (SAST) · REDACTED · ×10
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D2 · Cognitive Complexity · ObjectVar.__getattr__ (cognitive 18) · ×8
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:294 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:300 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:310 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:316 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:322 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:328 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:334 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • ObjectVar.__getattr__ (cognitive 18) packages/reflex-base/src/reflex_base/vars/object.py:339 — ObjectVar.__getattr__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (ObjectVar.__getattr__, ObjectVar.__getattr__, ObjectVar.__getattr__, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×8
  • Recursive walk over a caller-supplied document has no depth cap reflex/istate/__init__.py:41 — `debug_failed_pickles` is public and takes `obj: object` from its caller, and it calls itself at line 41 (`debug_failed_pickles`) with a piece of `obj` (and at line 46, line 54, line 61) — and nowhere in `debug_failed_pickles` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `debug_failed_pickles` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:316 — `as_json_document` is public and takes `value: Any` from its caller, and it calls itself at line 316 (`as_json_document`) with a piece of `value` (and at line 318) — and nowhere in `as_json_document` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `as_json_document` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap packages/reflex-docgen/src/reflex_docgen/_class.py:203 — `format_type` is public and takes `type_: Any` from its caller, and it calls itself at line 203 (`format_type`) with a piece of `type_` (and at line 214) — and nowhere in `format_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `format_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap packages/reflex-base/src/reflex_base/style.py:379 — `format_as_emotion` is public and takes `style_dict: dict[str, Any]` from its caller, and it calls itself at line 379 (`format_as_emotion`) with a piece of `style_dict` — and nowhere in `format_as_emotion` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `format_as_emotion` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap packages/reflex-base/src/reflex_base/vars/base.py:2227 — `figure_out_type` is public and takes `value: Any` from its caller, and it calls itself at line 2227 (`figure_out_type`) with a piece of `value` (and at line 2229, line 2237, line 2238, line 2243, line 2244) — and nowhere in `figure_out_type` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `figure_out_type` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:767 — `type_to_ast` is public and takes `typ: Any` from its caller, and it calls itself at line 767 (`type_to_ast`) with a piece of `typ` — and nowhere in `type_to_ast` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `type_to_ast` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap REDACTED:515 — `get_typed_dict_field_types` is public and takes `typed_dict: Any` from its caller, and it calls itself at line 515 (`get_typed_dict_field_types`) with a piece of `typed_dict` — and nowhere in `get_typed_dict_field_types` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `get_typed_dict_field_types` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap packages/reflex-base/src/reflex_base/components/tags/tag.py:31 — `render_prop` is public and takes `value: Any` from its caller, and it calls itself at line 31 (`render_prop`) with a piece of `value` — and nowhere in `render_prop` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `render_prop` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×7
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:60 — packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:60-67 | packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:171-178 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:237-244 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:254-261 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:75 — packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:75-82 | packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:191-198 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:257-264 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:274-281 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:90 — packages/reflex-components-internal/src/reflex_components_internal/components/base/card.py:90-97 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:217-224 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:166-173 | packages/reflex-components-internal/src/reflex_components_internal/components/base/scroll_area.py:90-97 — 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 4 call sites, so a change lands once. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:147 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:147-154 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:134-141 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:273-280 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:231-238 — 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 4 call sites, so a change lands once. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:318 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:318-325 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:733-740 | packages/reflex-components-internal/src/reflex_components_internal/components/base/otp_field.py:140-147 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:458-465 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:338 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:338-345 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:536-543 | packages/reflex-components-internal/src/reflex_components_internal/components/base/number_field.py:187-194 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:415-422 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/input.py:69 — packages/reflex-components-internal/src/reflex_components_internal/components/base/input.py:69-76 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:188-199 | packages/reflex-components-internal/src/reflex_components_internal/components/base/number_field.py:230-237 | packages/reflex-components-internal/src/reflex_components_internal/components/base/otp_field.py:117-124 — 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 4 call sites, so a change lands once. 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.
D1 · Cyclomatic Complexity · Var.guess_type (cyclomatic 17) · ×6
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1221 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1224 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1227 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1230 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1233 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cyclomatic 17) packages/reflex-base/src/reflex_base/vars/base.py:1235 — Var.guess_type has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · Var.guess_type (cognitive 18) · ×6
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1221 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1224 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1227 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1230 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1233 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • Var.guess_type (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1235 — Var.guess_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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. This shape REPEATS in the file: 5 other methods here (Var.guess_type, Var.guess_type, Var.guess_type, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D3 · God Classes · TooManyMethods · ×6
  • TooManyMethods: BaseState REDACTED:589 — TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× 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.
  • TooManyMethods: Component packages/reflex-base/src/reflex_base/components/component.py:736 — TooManyMethods — 57 methods. The bar is 30 methods; this is 27 over it, 1.90× 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.
  • TooManyMethods: ArrayVar packages/reflex-base/src/reflex_base/vars/sequence.py:66 — TooManyMethods — 47 methods. The bar is 30 methods; this is 17 over it, 1.57× 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.
  • TooManyMethods: ReflexDocTransformer packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:238 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× 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.
  • TooManyMethods: NumberVar packages/reflex-base/src/reflex_base/vars/number.py:61 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× 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.
  • TooManyMethods: EventCallback packages/reflex-base/src/reflex_base/event/__init__.py:3154 — TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
D31 · IaC & Container Security · Medium IaC · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×6
  • Duplicated block (14 lines × 2) docs/app/reflex_docs/templates/docpage/docpage.py:679 — docs/app/reflex_docs/templates/docpage/docpage.py:679-692 | docs/app/reflex_docs/templates/docpage/docpage.py:709-722 — 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 `docs/app/reflex_docs/templates/docpage/docpage.py:679` 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) packages/reflex-release/src/reflex_release/changelog.py:64 — packages/reflex-release/src/reflex_release/changelog.py:64-77 | packages/reflex-release/src/reflex_release/changelog.py:134-147 — 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 `packages/reflex-release/src/reflex_release/changelog.py:134` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:112 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:112-125 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:118-131 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py` and `packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 2) reflex/utils/js_runtimes.py:172 — reflex/utils/js_runtimes.py:172-185 | reflex/utils/js_runtimes.py:226-239 — 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 `reflex/utils/js_runtimes.py: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. 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.
  • Duplicated block (14 lines × 2) packages/reflex-base/src/reflex_base/components/field.py:50 — packages/reflex-base/src/reflex_base/components/field.py:50-63 | packages/reflex-base/src/reflex_base/vars/base.py:4397-4410 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (14 lines × 2) packages/reflex-release/src/reflex_release/devpins.py:136 — packages/reflex-release/src/reflex_release/devpins.py:136-149 | scripts/check_min_deps.py:248-261 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `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.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×5
  • Outbound HTTP without resilience docs/app/reflex_docs/utils/http.py:40 — `aiohttp.ClientSession(` 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 packages/reflex-hosting-cli/src/reflex_cli/v2/deployments.py:172 — `httpx.get(` 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 packages/reflex-site-shared/src/reflex_site_shared/backend/signup.py:36 — `httpx.AsyncClient(` 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 packages/reflex-site-shared/src/reflex_site_shared/backend/signup.py:61 — `httpx.AsyncClient(` 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 packages/reflex-site-shared/src/reflex_site_shared/backend/slack.py:40 — `httpx.AsyncClient(` 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 · Edited copy of a member (11 corresponding lines) · ×4
  • Edited copy of a member (11 corresponding lines) reflex/utils/frontend_skeleton.py:661 — reflex/utils/frontend_skeleton.py:661-671 | reflex/utils/frontend_skeleton.py:675-685 — 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) REDACTED:460 — REDACTED:460-470 | reflex/istate/manager/memory.py:196-206 — 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) packages/reflex-bench/src/reflex_bench/suites/wire.py:574 — packages/reflex-bench/src/reflex_bench/suites/wire.py:574-584 | scripts/hash_examples.py:62-76 — 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) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:783 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:783-793 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py:309-326 — 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 (8 lines × 3) · ×4
  • Duplicated block (8 lines × 3) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:179 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:179-186 | packages/reflex-components-internal/src/reflex_components_internal/components/base/collapsible.py:100-107 | packages/reflex-components-internal/src/reflex_components_internal/components/base/tabs.py:199-206 — 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. 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.
  • Duplicated block (8 lines × 3) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:358 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:358-365 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:556-563 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:435-442 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 3) packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:214 — packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:214-221 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:280-287 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:294-301 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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.
  • Duplicated block (8 lines × 3) packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:174 — packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:174-181 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:324-331 | packages/reflex-components-internal/src/reflex_components_internal/components/base/scroll_area.py:70-77 — 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. 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×4
  • Low cohesion: Tab (LCOM4 5) packages/reflex-bench/src/reflex_bench/drivers/browser.py:126 — Tab's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: BaseComponent (LCOM4 4) packages/reflex-base/src/reflex_base/components/component.py:338 — BaseComponent's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Component (LCOM4 4) packages/reflex-base/src/reflex_base/components/component.py:736 — Component's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Workflow (LCOM4 4) REDACTED:766 — Workflow's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
X3 · Exception handling · Swallowed exception (empty catch) · ×4
  • Swallowed exception (empty catch) REDACTED:167 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/reflex-otel/src/reflex_otel/otel.js:144 — `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
  • Swallowed exception (empty catch) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:855 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) packages/reflex-bench/src/reflex_bench/drivers/bench_page.js:25 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×3
  • Focus outline removed in CSS without a :focus replacement packages/reflex-site-shared/src/reflex_site_shared/styles/assets/tailwind-theme.css:1812 — `.code-block` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement packages/reflex-site-shared/src/reflex_site_shared/styles/assets/tailwind-theme.css:2005 — `.demo-code-block` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
  • Focus outline removed in CSS without a :focus replacement docs/app/assets/docs-theme.css:213 — `.docs-landing .marketing-footer-newsletter-field` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
D15 · Churn × Complexity Hotspots · Repeated repair · ×3
  • Repeated repair: packages/reflex-base/src/reflex_base/vars/number.py packages/reflex-base/src/reflex_base/vars/number.py:456 — packages/reflex-base/src/reflex_base/vars/number.py changed 6 times in last 90 days and 4 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 NumberVar.__format__ at line 456), 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(vars): compile % with Python's sign-of-divisor semantics (#7638)”; “fix: parenthesize a unary base in the compiled ** expression (#7565)”; “Fix Var hashing to prevent silent data loss and enable hashability (#7015)”; “Upgrade ruff, pyright, and typer; fix the resulting failures (#6893)”. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-base/src/reflex_base/vars/number.py`: 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: tests/units/reflex_base/client_event_queue_runtime.mjs tests/units/reflex_base/client_event_queue_runtime.mjs:75 — tests/units/reflex_base/client_event_queue_runtime.mjs 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 4 (its worst body is (anonymous) at line 75), 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: isolate dynamic JavaScript execution environments (#7870)”; “fix(state): recover from unknown frontend substates (#7435)”; “fix: flatten nested client event lists (#7336)”. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- tests/units/reflex_base/client_event_queue_runtime.mjs`: 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: packages/reflex-components-core/src/reflex_components_core/core/_upload.py packages/reflex-components-core/src/reflex_components_core/core/_upload.py:387 — packages/reflex-components-core/src/reflex_components_core/core/_upload.py 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 9 (its worst body is _UploadChunkMultipartParser.on_headers_finished at line 387), 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(upload): answer a failing upload handler with a 500 or an error frame (#7808)”; “fix(upload): handle unknown event handlers (#6861)”; “Upgrade ruff, pyright, and typer; fix the resulting failures (#6893)”. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 02:14:34 +05:00' --until='2026-11-14 02:14:34 +05:00' --full-history --no-merges -- packages/reflex-components-core/src/reflex_components_core/core/_upload.py`: 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 · FunctionTooLong · ×3
  • FunctionTooLong: AlgoliaSearch.AlgoliaSearch REDACTED:260 — FunctionTooLong — AlgoliaSearch runs 442 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 342 over it, 4.42× 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: state.applyEvent REDACTED:633 — FunctionTooLong — applyEvent runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.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: state.useEventLoop REDACTED:1656 — FunctionTooLong — useEventLoop runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×3
  • Edited copy of a member (21 corresponding lines) reflex/compiler/plugins/builtin.py:398 — reflex/compiler/plugins/builtin.py:398-418 | reflex/compiler/plugins/builtin.py:427-455 — 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) reflex/utils/path_ops.py:124 — reflex/utils/path_ops.py:124-144 | reflex/utils/path_ops.py:190-210 — 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) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:246 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:246-266 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/auth.py:141-161 — 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 (15 corresponding lines) · ×3
  • Edited copy of a member (15 corresponding lines) packages/reflex-base/src/reflex_base/vars/sequence.py:227 — packages/reflex-base/src/reflex_base/vars/sequence.py:227-241 | packages/reflex-base/src/reflex_base/vars/sequence.py:853-869 — 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) packages/reflex-base/src/reflex_base/vars/sequence.py:964 — packages/reflex-base/src/reflex_base/vars/sequence.py:964-979 | packages/reflex-base/src/reflex_base/vars/sequence.py:1087-1101 — 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) REDACTED:908 — REDACTED:908-922 | packages/reflex-otel/src/reflex_otel/__init__.py:14-34 — 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 · Duplicated block (16 lines × 2) · ×3
  • Duplicated block (16 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:669 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:669-684 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:820-835 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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 `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:669` 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) packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:511 — packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:511-526 | packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:550-565 — 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 after the matched lines, `packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:527` calls `box`, `docdemobox` and `packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:566` 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 (16 lines × 2) packages/reflex-base/src/reflex_base/vars/sequence.py:762 — packages/reflex-base/src/reflex_base/vars/sequence.py:762-777 | packages/reflex-base/src/reflex_base/vars/set.py:810-825 — 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. 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.
D17 · Explicit Debt · XxxComment · ×2
  • XxxComment packages/reflex-components-sonner/src/reflex_components_sonner/toast.py:128 — # XXX: These still do not seem to work Custom style for the toast primary button. — 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.
  • XxxComment docs/app/reflex_docs/reflex_docs.py:101 — # XXX: The app is TOO BIG to build on Windows, so explicitly disallow it except for testing — 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.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: installer.py ↔ tailwind_v4.py reflex/constants/installer.py:1 — `reflex/constants/installer.py` and `reflex/plugins/tailwind_v4.py` change together 71% of the time (10 of the 14 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 10 shared commits counted here, the most recent 3 are `1e713983` 0824dev (#6053); `d52e6ed1` 0820dev (#5967); `c4254edc` 0818dev (#5933) — run `git show` on any of them.
  • Change coupling: base.py ↔ number.py reflex/vars/base.py:1 — `reflex/vars/base.py` and `reflex/vars/number.py` change together 53% of the time (9 of the 17 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 9 shared commits counted here, the most recent 3 are `b2523ad9` allow int and float typing for input elements behind a warning (#5098); `e182afeb` add ndigits to round dunder method (#5019); `8aee4461` fix str splatting in fallback command (#5005) — run `git show` on any of them.
D4 · Code Duplication · Edited copy of a member (26 corresponding lines) · ×2
  • Edited copy of a member (26 corresponding lines) reflex/testing.py:367 — reflex/testing.py:367-392 | reflex/testing.py:922-948 — 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) packages/reflex-base/src/reflex_base/plugins/compiler.py:197 — packages/reflex-base/src/reflex_base/plugins/compiler.py:197-222 | packages/reflex-base/src/reflex_base/plugins/compiler.py:229-256 — 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 (36 corresponding lines) · ×2
  • Edited copy of a member (36 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:234 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:234-271 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:233-268 — 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.
  • Edited copy of a member (36 corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:1052 — packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:1052-1097 | packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:1103-1138 — 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 (28 corresponding lines) · ×2
  • Edited copy of a member (28 corresponding lines) packages/reflex-docgen/src/reflex_docgen/markdown/transformer/_base.py:97 — packages/reflex-docgen/src/reflex_docgen/markdown/transformer/_base.py:97-126 | packages/reflex-docgen/src/reflex_docgen/markdown/transformer/_base.py:144-171 — 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.
  • Edited copy of a member (28 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:666 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:666-698 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/environments.py:196-223 — 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) · ×2
  • Edited copy of a member (22 corresponding lines) packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:371 — packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:371-392 | packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:396-422 — 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.
  • Edited copy of a member (22 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/components/blocks/typography.py:136 — packages/reflex-site-shared/src/reflex_site_shared/components/blocks/typography.py:136-157 | packages/reflex-site-shared/src/reflex_site_shared/components/blocks/typography.py:161-183 — 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 copy of a member (14 corresponding lines) · ×2
  • Edited copy of a member (14 corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/v2/project.py:357 — packages/reflex-hosting-cli/src/reflex_cli/v2/project.py:357-370 | packages/reflex-hosting-cli/src/reflex_cli/v2/project.py:426-439 — 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.
  • Edited copy of a member (14 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:223 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:223-243 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/databases.py:47-60 — 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 copies of one member (3 members, 13+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 13+ corresponding lines) packages/reflex-base/src/reflex_base/components/component.py:90 — packages/reflex-base/src/reflex_base/components/component.py:90-102 | packages/reflex-base/src/reflex_base/components/props.py:127-141 | packages/reflex-base/src/reflex_base/vars/base.py:4413-4425 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' 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.
  • Edited copies of one member (3 members, 13+ corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:96 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:96-110 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/connections.py:89-101 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py:517-533 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' 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 (8 corresponding lines) · ×2
  • Edited copy of a member (8 corresponding lines) packages/reflex-components-core/src/reflex_components_core/base/bare.py:184 — packages/reflex-components-core/src/reflex_components_core/base/bare.py:184-191 | packages/reflex-components-core/src/reflex_components_core/base/bare.py:194-208 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (8 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/scroll_area.py:147 — packages/reflex-components-internal/src/reflex_components_internal/components/base/scroll_area.py:147-154 | packages/reflex-components-internal/src/reflex_components_internal/components/base/slider.py:240-247 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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) REDACTED:1076 — REDACTED:1076-1099 | REDACTED:1186-1205 — 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) packages/reflex-base/src/reflex_base/components/component.py:140 — packages/reflex-base/src/reflex_base/components/component.py:140-162 | packages/reflex-base/src/reflex_base/components/props.py:148-167 — 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 (17 corresponding lines) · ×2
  • Edited copy of a member (17 corresponding lines) .claude/skills/prerelease-test/scripts/check_release_versions.py:42 — .claude/skills/prerelease-test/scripts/check_release_versions.py:42-58 | packages/reflex-release/src/reflex_release/gitutil.py:72-89 — 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.
  • Edited copy of a member (17 corresponding lines) docs/app/reflex_docs/pages/docs/recipes_overview.py:81 — docs/app/reflex_docs/pages/docs/recipes_overview.py:81-100 | docs/app/reflex_docs/pages/docs_landing/views/layout.py:14-30 — 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 copy of a member (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) docs/app/reflex_docs/utils/http.py:14 — docs/app/reflex_docs/utils/http.py:14-31 | REDACTED:15-32 — 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.
  • Edited copy of a member (18 corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:57 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:57-75 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/usage.py:21-38 — 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 · Duplicated block (27 lines × 2) · ×2
  • Duplicated block (27 lines × 2) packages/reflex-base/src/reflex_base/plugins/compiler.py:356 — packages/reflex-base/src/reflex_base/plugins/compiler.py:356-382 | packages/reflex-base/src/reflex_base/plugins/compiler.py:419-445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (27 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:127 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:127-153 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:126-152 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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. 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.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×2
  • Duplicated block (25 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:234 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:234-258 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:233-257 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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 `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:234` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (25 lines × 2) packages/reflex-hosting-cli/src/reflex_cli/deployments.py:210 — packages/reflex-hosting-cli/src/reflex_cli/deployments.py:210-234 | packages/reflex-hosting-cli/src/reflex_cli/v2/deployments.py:118-142 — 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.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×2
  • Duplicated block (35 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:227 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:227-261 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:228-262 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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 (35 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:236 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:236-270 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:253-287 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py` and `packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `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.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×2
  • Duplicated block (21 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:95 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:95-115 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:96-116 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (21 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:119 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:119-139 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:120-140 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) packages/reflex-base/src/reflex_base/vars/number.py:139 — packages/reflex-base/src/reflex_base/vars/number.py:139-156 | packages/reflex-base/src/reflex_base/vars/number.py:167-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (18 lines × 2) packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:655 — packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:655-672 | packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:677-694 — 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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:174 — packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:174-190 | packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py:181-197 — before extracting anything, compare `packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py` and `packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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. Note first that the copies are not typed on the same thing: `Dirs` names `reflex_base.constants` in one and `reflex_base.constants.base` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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) packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:58 — packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:58-74 | packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py:58-76 — before extracting anything, compare `packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py` and `packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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. 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: `Dirs` names `reflex_base.constants` in one and `reflex_base.constants.base` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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 (12 lines × 2) · ×2
  • Duplicated block (12 lines × 2) packages/reflex-bench/src/reflex_bench/cli.py:839 — packages/reflex-bench/src/reflex_bench/cli.py:839-850 | packages/reflex-bench/src/reflex_bench/cli.py:1028-1039 — 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 `packages/reflex-bench/src/reflex_bench/cli.py:839` 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) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:204 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:204-215 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:780-792 — 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 `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:780` 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 (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:120 — docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:120-129 | docs/app/reflex_docs/pages/integrations/integration_gallery.py:53-63 — 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 `docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:120` 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) REDACTED:281 — REDACTED:281-290 | reflex/istate/manager/memory.py:75-84 — 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 (8 lines × 6) · ×2
  • Duplicated block (8 lines × 6) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:110 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:110-117 | packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:295-302 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:402-409 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:434-441 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:120-127 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:352-359 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
  • Duplicated block (8 lines × 6) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:167 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:167-174 | packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:125-132 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:157-164 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:364-371 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:119-126 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:103-110 — 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 6 call sites, so a change lands once. 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.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×1
  • Animation without a prefers-reduced-motion guard REDACTED:231 — <span> moves — its inline style sets `animation: delay` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
D1 · Cyclomatic Complexity · cli.deploy (cyclomatic 103) · ×1
  • cli.deploy (cyclomatic 103) packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:612 — cli.deploy has cyclomatic complexity 103 (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 · AlgoliaSearch.AlgoliaSearch (cyclomatic 66) · ×1
  • AlgoliaSearch.AlgoliaSearch (cyclomatic 66) REDACTED:260 — AlgoliaSearch.AlgoliaSearch has cyclomatic complexity 66 (threshold 15). Of this number, 19 points are the body's own statements and 47 belong to 17 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 · types._isinstance (cyclomatic 61) · ×1
  • types._isinstance (cyclomatic 61) REDACTED:1382 — types._isinstance has cyclomatic complexity 61 (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 · compiler.compile_app (cyclomatic 52) · ×1
  • compiler.compile_app (cyclomatic 52) reflex/compiler/compiler.py:1233 — compiler.compile_app has cyclomatic complexity 52 (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 · connect (cyclomatic 44) · ×1
  • connect (cyclomatic 44) REDACTED:1100 — connect has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 8 of the 44 points are its own statements and the rest belongs to 23 function items inside it that branch (a function literal at line 1382, a function literal at line 1303, withoutUnknownSubstates, …). 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 · component.generate_props (cyclomatic 43) · ×1
  • component.generate_props (cyclomatic 43) docs/app/reflex_docs/pages/docs/component.py:468 — component.generate_props has cyclomatic complexity 43 (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 · applyEvent (cyclomatic 42) · ×1
  • applyEvent (cyclomatic 42) REDACTED:633 — applyEvent has cyclomatic complexity 42 (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 · config.load_config (cyclomatic 39) · ×1
  • config.load_config (cyclomatic 39) packages/reflex-release/src/reflex_release/config.py:914 — config.load_config has cyclomatic complexity 39 (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 · types.typehint_issubclass (cyclomatic 38) · ×1
  • types.typehint_issubclass (cyclomatic 38) REDACTED:1721 — types.typehint_issubclass has cyclomatic complexity 38 (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 · environment.interpret_env_var_value (cyclomatic 34) · ×1
  • environment.interpret_env_var_value (cyclomatic 34) packages/reflex-base/src/reflex_base/environment.py:392 — environment.interpret_env_var_value has cyclomatic complexity 34 (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 · Component._post_init (cyclomatic 33) · ×1
  • Component._post_init (cyclomatic 33) packages/reflex-base/src/reflex_base/components/component.py:940 — Component._post_init has cyclomatic complexity 33 (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 · _rendered.to_markdown (cyclomatic 32) · ×1
  • _rendered.to_markdown (cyclomatic 32) docs/app/agent_files/_rendered.py:83 — _rendered.to_markdown has cyclomatic complexity 32 (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 · PyiGenerator.scan_all (cyclomatic 31) · ×1
  • PyiGenerator.scan_all (cyclomatic 31) REDACTED:1706 — PyiGenerator.scan_all has cyclomatic complexity 31 (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 · reflex._run (cyclomatic 31) · ×1
  • reflex._run (cyclomatic 31) reflex/reflex.py:665 — reflex._run has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · state.useEventLoop (cyclomatic 31) · ×1
  • state.useEventLoop (cyclomatic 31) REDACTED:1656 — state.useEventLoop has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 1826, 1687, 1847, …). 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 · pyi_generator._get_type_hint (cyclomatic 29) · ×1
  • pyi_generator._get_type_hint (cyclomatic 29) REDACTED:173 — pyi_generator._get_type_hint has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · types.get_attribute_access_type (cyclomatic 28) · ×1
  • types.get_attribute_access_type (cyclomatic 28) REDACTED:1130 — types.get_attribute_access_type has cyclomatic complexity 28 (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 · gcp.deploy_command (cyclomatic 27) · ×1
  • gcp.deploy_command (cyclomatic 27) packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:240 — gcp.deploy_command has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · memoize._should_memoize (cyclomatic 27) · ×1
  • memoize._should_memoize (cyclomatic 27) reflex/compiler/plugins/memoize.py:141 — memoize._should_memoize has cyclomatic complexity 27 (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 · Benchmark.define (cyclomatic 26) · ×1
  • Benchmark.define (cyclomatic 26) packages/reflex-bench/src/reflex_bench/registry.py:252 — Benchmark.define has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · commands.cmd_prepare_publish (cyclomatic 26) · ×1
  • commands.cmd_prepare_publish (cyclomatic 26) packages/reflex-release/src/reflex_release/commands.py:541 — commands.cmd_prepare_publish has cyclomatic complexity 26 (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 · uploadFiles (cyclomatic 26) · ×1
  • uploadFiles (cyclomatic 26) packages/reflex-frontend/src/utils/helpers/upload.js:20 — uploadFiles 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 14 function items inside it that branch (eventHandler, a function literal at line 96, (anonymous)::onprogress, …). 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 · component.prop_docs (cyclomatic 24) · ×1
  • component.prop_docs (cyclomatic 24) docs/app/reflex_docs/pages/docs/component.py:284 — component.prop_docs 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 · compare.compare (cyclomatic 24) · ×1
  • compare.compare (cyclomatic 24) packages/reflex-bench/src/reflex_bench/compare.py:105 — compare.compare 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 · versions.next_version (cyclomatic 24) · ×1
  • versions.next_version (cyclomatic 24) packages/reflex-release/src/reflex_release/versions.py:31 — versions.next_version 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 · base_state_processor._transform_event_arg (cyclomatic 23) · ×1
  • base_state_processor._transform_event_arg (cyclomatic 23) packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py:252 — base_state_processor._transform_event_arg 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 · utils.compile_experimental_component_memo (cyclomatic 23) · ×1
  • utils.compile_experimental_component_memo (cyclomatic 23) reflex/compiler/utils.py:568 — utils.compile_experimental_component_memo 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 · AppHarness.frontend (cyclomatic 23) · ×1
  • AppHarness.frontend (cyclomatic 23) reflex/testing.py:641 — AppHarness.frontend 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 · Config._post_init (cyclomatic 22) · ×1
  • Config._post_init (cyclomatic 22) packages/reflex-base/src/reflex_base/config.py:369 — Config._post_init has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · DependencyTracker._populate_dependencies (cyclomatic 22) · ×1
  • DependencyTracker._populate_dependencies (cyclomatic 22) REDACTED:409 — DependencyTracker._populate_dependencies 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 · changelog.collapse_prereleases (cyclomatic 22) · ×1
  • changelog.collapse_prereleases (cyclomatic 22) packages/reflex-release/src/reflex_release/changelog.py:169 — changelog.collapse_prereleases 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 · EventChain.create (cyclomatic 21) · ×1
  • EventChain.create (cyclomatic 21) packages/reflex-base/src/reflex_base/event/__init__.py:1127 — EventChain.create has cyclomatic complexity 21 (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 · event._scan_detach (cyclomatic 21) · ×1
  • event._scan_detach (cyclomatic 21) packages/reflex-base/src/reflex_base/event/__init__.py:211 — event._scan_detach has cyclomatic complexity 21 (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 · event._check_event_args_subclass_of_callback (cyclomatic 21) · ×1
  • event._check_event_args_subclass_of_callback (cyclomatic 21) packages/reflex-base/src/reflex_base/event/__init__.py:2241 — event._check_event_args_subclass_of_callback has cyclomatic complexity 21 (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 · _parser._convert_block (cyclomatic 21) · ×1
  • _parser._convert_block (cyclomatic 21) packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:219 — _parser._convert_block has cyclomatic complexity 21 (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 · apps.app_logs (cyclomatic 21) · ×1
  • apps.app_logs (cyclomatic 21) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:697 — apps.app_logs has cyclomatic complexity 21 (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 · state.replaceEqualDeep (cyclomatic 21) · ×1
  • state.replaceEqualDeep (cyclomatic 21) REDACTED:368 — state.replaceEqualDeep has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function item inside it that branches. 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 · state.mergeSlotProps (cyclomatic 21) · ×1
  • state.mergeSlotProps (cyclomatic 21) REDACTED:2211 — state.mergeSlotProps has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cloud_cliref.process (cyclomatic 20) · ×1
  • cloud_cliref.process (cyclomatic 20) docs/app/reflex_docs/pages/docs/cloud_cliref.py:173 — cloud_cliref.process has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · pyi_generator._get_class_prop_comments (cyclomatic 20) · ×1
  • pyi_generator._get_class_prop_comments (cyclomatic 20) REDACTED:315 — pyi_generator._get_class_prop_comments has cyclomatic complexity 20 (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 · app_process.run_cli (cyclomatic 20) · ×1
  • app_process.run_cli (cyclomatic 20) REDACTED:944 — app_process.run_cli has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · cli._resolve_deploy_provider (cyclomatic 20) · ×1
  • cli._resolve_deploy_provider (cyclomatic 20) packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:277 — cli._resolve_deploy_provider has cyclomatic complexity 20 (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 · compiler.into_component (cyclomatic 20) · ×1
  • compiler.into_component (cyclomatic 20) reflex/compiler/compiler.py:949 — compiler.into_component has cyclomatic complexity 20 (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 · state.applyClientStorageDelta (cyclomatic 20) · ×1
  • state.applyClientStorageDelta (cyclomatic 20) REDACTED:1586 — state.applyClientStorageDelta has cyclomatic complexity 20 (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 · docs.extract_doc_description (cyclomatic 19) · ×1
  • docs.extract_doc_description (cyclomatic 19) docs/app/reflex_docs/pages/docs/__init__.py:253 — docs.extract_doc_description 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 · component.render_select (cyclomatic 19) · ×1
  • component.render_select (cyclomatic 19) docs/app/reflex_docs/pages/docs/component.py:150 — component.render_select 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 · Component._get_vars (cyclomatic 19) · ×1
  • Component._get_vars (cyclomatic 19) packages/reflex-base/src/reflex_base/components/component.py:1612 — Component._get_vars 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 · _MemoComponentWrapper.__call__ (cyclomatic 19) · ×1
  • _MemoComponentWrapper.__call__ (cyclomatic 19) packages/reflex-base/src/reflex_base/components/memo.py:1772 — _MemoComponentWrapper.__call__ 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 · shared_tailwind.tailwind_config_js_template (cyclomatic 19) · ×1
  • shared_tailwind.tailwind_config_js_template (cyclomatic 19) packages/reflex-base/src/reflex_base/plugins/shared_tailwind.py:85 — shared_tailwind.tailwind_config_js_template 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 · function._starts_with_arrow_function (cyclomatic 19) · ×1
  • function._starts_with_arrow_function (cyclomatic 19) packages/reflex-base/src/reflex_base/vars/function.py:66 — function._starts_with_arrow_function 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 · schema._check_benchmark (cyclomatic 19) · ×1
  • schema._check_benchmark (cyclomatic 19) packages/reflex-bench/src/reflex_bench/schema.py:381 — schema._check_benchmark 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 · apps.delete_app (cyclomatic 19) · ×1
  • apps.delete_app (cyclomatic 19) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:578 — apps.delete_app 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 · build._zip (cyclomatic 19) · ×1
  • build._zip (cyclomatic 19) reflex/utils/build.py:75 — build._zip 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 · memo._bind_function_runtime_args (cyclomatic 18) · ×1
  • memo._bind_function_runtime_args (cyclomatic 18) packages/reflex-base/src/reflex_base/components/memo.py:1578 — memo._bind_function_runtime_args has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · machine.checks (cyclomatic 18) · ×1
  • machine.checks (cyclomatic 18) packages/reflex-bench/src/reflex_bench/machine.py:421 — machine.checks has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Form._validate_on_submit_typed_dict_fields (cyclomatic 18) · ×1
  • Form._validate_on_submit_typed_dict_fields (cyclomatic 18) REDACTED:579 — Form._validate_on_submit_typed_dict_fields has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DataEditor.create (cyclomatic 18) · ×1
  • DataEditor.create (cyclomatic 18) packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:552 — DataEditor.create has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · execute.run_attempt (cyclomatic 18) · ×1
  • execute.run_attempt (cyclomatic 18) packages/reflex-workflow/src/reflex_workflow/engine/execute.py:763 — execute.run_attempt has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · state.hydrateClientStorage (cyclomatic 18) · ×1
  • state.hydrateClientStorage (cyclomatic 18) REDACTED:1495 — state.hydrateClientStorage has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · vite-plugin-safari-cachebust.createSafariMiddleware.safariCacheBustMiddleware (cyclomatic 18) · ×1
  • vite-plugin-safari-cachebust.createSafariMiddleware.safariCacheBustMiddleware (cyclomatic 18) REDACTED:169 — vite-plugin-safari-cachebust.createSafariMiddleware.safariCacheBustMiddleware has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body's own statements and 8 belong to 3 function items 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 · createSafariMiddleware (cyclomatic 18) · ×1
  • createSafariMiddleware (cyclomatic 18) REDACTED:158 — createSafariMiddleware has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 6 function items inside it that branch (safariCacheBustMiddleware, safariCacheBustMiddleware::end, safariCacheBustMiddleware::write, …). 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 · EventHandler.__call__ (cyclomatic 17) · ×1
  • EventHandler.__call__ (cyclomatic 17) packages/reflex-base/src/reflex_base/event/__init__.py:789 — EventHandler.__call__ 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 · deterministic_hash._encode_deterministic (cyclomatic 17) · ×1
  • deterministic_hash._encode_deterministic (cyclomatic 17) packages/reflex-base/src/reflex_base/utils/deterministic_hash.py:370 — deterministic_hash._encode_deterministic 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 · types.get_typed_dict_field_types (cyclomatic 17) · ×1
  • types.get_typed_dict_field_types (cyclomatic 17) REDACTED:471 — types.get_typed_dict_field_types 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 · size.measure_export (cyclomatic 17) · ×1
  • size.measure_export (cyclomatic 17) packages/reflex-bench/src/reflex_bench/suites/size.py:169 — size.measure_export 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 · AiohttpTransport.send (cyclomatic 17) · ×1
  • AiohttpTransport.send (cyclomatic 17) packages/reflex-build-sdk/src/reflex_build_sdk/transports/_aiohttp.py:108 — AiohttpTransport.send has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · config._load_lockstep (cyclomatic 17) · ×1
  • config._load_lockstep (cyclomatic 17) packages/reflex-release/src/reflex_release/config.py:755 — config._load_lockstep 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 · cron.parse_field (cyclomatic 17) · ×1
  • cron.parse_field (cyclomatic 17) packages/reflex-workflow/src/reflex_workflow/cron.py:41 — cron.parse_field 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 · processes.stream_logs (cyclomatic 17) · ×1
  • processes.stream_logs (cyclomatic 17) REDACTED:398 — processes.stream_logs 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 · templates.vite_config_template (cyclomatic 16) · ×1
  • templates.vite_config_template (cyclomatic 16) packages/reflex-base/src/reflex_base/compiler/templates.py:714 — templates.vite_config_template has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Field.__init__ (cyclomatic 16) · ×1
  • Field.__init__ (cyclomatic 16) packages/reflex-base/src/reflex_base/vars/base.py:4250 — Field.__init__ 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 · base._annotated_fields (cyclomatic 16) · ×1
  • base._annotated_fields (cyclomatic 16) packages/reflex-base/src/reflex_base/vars/base.py:4955 — base._annotated_fields 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 · LiteralStringVar.create (cyclomatic 16) · ×1
  • LiteralStringVar.create (cyclomatic 16) packages/reflex-base/src/reflex_base/vars/sequence.py:1581 — LiteralStringVar.create 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 · AppProcess.__init__ (cyclomatic 16) · ×1
  • AppProcess.__init__ (cyclomatic 16) REDACTED:1103 — AppProcess.__init__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · markdown.render_comparison (cyclomatic 16) · ×1
  • markdown.render_comparison (cyclomatic 16) packages/reflex-bench/src/reflex_bench/report/markdown.py:73 — markdown.render_comparison 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 · commands.cmd_plan (cyclomatic 16) · ×1
  • commands.cmd_plan (cyclomatic 16) packages/reflex-release/src/reflex_release/commands.py:365 — commands.cmd_plan 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 · scaffold.sync (cyclomatic 16) · ×1
  • scaffold.sync (cyclomatic 16) packages/reflex-release/src/reflex_release/scaffold.py:774 — scaffold.sync 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 · ReflexDocTransformer._render_alert (cyclomatic 16) · ×1
  • ReflexDocTransformer._render_alert (cyclomatic 16) packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:602 — ReflexDocTransformer._render_alert has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · App._validate_exception_handlers (cyclomatic 16) · ×1
  • App._validate_exception_handlers (cyclomatic 16) REDACTED:2319 — App._validate_exception_handlers 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 · LifespanMixin._run_lifespan_tasks (cyclomatic 16) · ×1
  • LifespanMixin._run_lifespan_tasks (cyclomatic 16) reflex/app_mixins/lifespan.py:197 — LifespanMixin._run_lifespan_tasks 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 · memoize._component_subtree_is_reactive (cyclomatic 16) · ×1
  • memoize._component_subtree_is_reactive (cyclomatic 16) reflex/compiler/plugins/memoize.py:101 — memoize._component_subtree_is_reactive 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 · SharedStateBaseInternal._modify_linked_states (cyclomatic 16) · ×1
  • SharedStateBaseInternal._modify_linked_states (cyclomatic 16) reflex/istate/shared.py:398 — SharedStateBaseInternal._modify_linked_states 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 · reflex.run (cyclomatic 16) · ×1
  • reflex.run (cyclomatic 16) reflex/reflex.py:845 — reflex.run 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 · BaseState.__init_subclass__ (cyclomatic 16) · ×1
  • BaseState.__init_subclass__ (cyclomatic 16) REDACTED:776 — BaseState.__init_subclass__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · parseDatetime (cyclomatic 16) · ×1
  • parseDatetime (cyclomatic 16) packages/reflex-frontend/src/utils/helpers/datetime.js:5 — parseDatetime has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D17 · Explicit Debt · HackComment · ×1
  • HackComment REDACTED:981 — # Hack to fix Windows hot reload issue. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
D2 · Cognitive Complexity · cli.deploy (cognitive 170) · ×1
  • cli.deploy (cognitive 170) packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:612 — cli.deploy has cognitive complexity 170 (threshold 15). Drivers by points: if/else 63 (118 pts), boolean chains 27, error handling 12 (14 pts), ternaries 6 (11 pts) (nesting depth added 62). 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 · AlgoliaSearch.AlgoliaSearch (cognitive 112) · ×1
  • AlgoliaSearch.AlgoliaSearch (cognitive 112) REDACTED:260 — AlgoliaSearch.AlgoliaSearch has cognitive complexity 112 (threshold 15). Drivers by points: ternaries 21 (55 pts), if/else 24 (40 pts), boolean chains 15, error handling 1, match/switch 1 (nesting depth added 50). Of this number, 41 points are the body's own statements and 71 belong to 17 function literals inside it that branch. 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 · types._isinstance (cognitive 110) · ×1
  • types._isinstance (cognitive 110) REDACTED:1382 — types._isinstance has cognitive complexity 110 (threshold 15). Drivers by points: if/else 33 (68 pts), boolean chains 16, ternaries 5 (14 pts), loops 3 (9 pts), error handling 2 (3 pts) (nesting depth added 51). 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 · component.generate_props (cognitive 102) · ×1
  • component.generate_props (cognitive 102) docs/app/reflex_docs/pages/docs/component.py:468 — component.generate_props has cognitive complexity 102 (threshold 15). Drivers by points: if/else 25 (65 pts), ternaries 4 (14 pts), loops 5 (13 pts), boolean chains 7, error handling 2 (3 pts) (nesting depth added 59). 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 · compiler.compile_app (cognitive 78) · ×1
  • compiler.compile_app (cognitive 78) reflex/compiler/compiler.py:1233 — compiler.compile_app has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (46 pts), loops 13 (18 pts), boolean chains 9, ternaries 3 (5 pts) (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 · applyEvent (cognitive 71) · ×1
  • applyEvent (cognitive 71) REDACTED:633 — applyEvent has cognitive complexity 71 (threshold 15). Drivers by points: if/else 31 (47 pts), ternaries 6 (13 pts), error handling 3 (6 pts), boolean chains 4, other 1 (nesting depth added 26). 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 · PyiGenerator.scan_all (cognitive 68) · ×1
  • PyiGenerator.scan_all (cognitive 68) REDACTED:1706 — PyiGenerator.scan_all has cognitive complexity 68 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 10 (30 pts), boolean chains 7 (nesting depth added 37). 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 · types.get_attribute_access_type (cognitive 63) · ×1
  • types.get_attribute_access_type (cognitive 63) REDACTED:1130 — types.get_attribute_access_type has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (49 pts), ternaries 2 (7 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 37). 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 · environment.interpret_env_var_value (cognitive 61) · ×1
  • environment.interpret_env_var_value (cognitive 61) packages/reflex-base/src/reflex_base/environment.py:392 — environment.interpret_env_var_value has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (40 pts), error handling 4 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Component._post_init (cognitive 59) · ×1
  • Component._post_init (cognitive 59) packages/reflex-base/src/reflex_base/components/component.py:940 — Component._post_init has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 3 (11 pts), boolean chains 5, loops 4 (5 pts), error handling 1 (3 pts) (nesting depth added 26). 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 · connect (cognitive 52) · ×1
  • connect (cognitive 52) REDACTED:1100 — connect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 7, loops 5 (6 pts), error handling 3 (4 pts), ternaries 2 (3 pts), other 1 (nesting depth added 8). Most of this is not in the body itself: 7 of the 52 points are its own statements and the rest belongs to 23 function items inside it that branch (a function literal at line 1382, a function literal at line 1257, checkVisibility, …). 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 · event._check_event_args_subclass_of_callback (cognitive 51) · ×1
  • event._check_event_args_subclass_of_callback (cognitive 51) packages/reflex-base/src/reflex_base/event/__init__.py:2241 — event._check_event_args_subclass_of_callback has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 7 (25 pts), if/else 7 (16 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 30). 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 · pyi_generator._get_class_prop_comments (cognitive 50) · ×1
  • pyi_generator._get_class_prop_comments (cognitive 50) REDACTED:315 — pyi_generator._get_class_prop_comments has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (43 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pyi_generator._get_type_hint (cognitive 49) · ×1
  • pyi_generator._get_type_hint (cognitive 49) REDACTED:173 — pyi_generator._get_type_hint has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (32 pts), ternaries 5 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 24). 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 · config.load_config (cognitive 49) · ×1
  • config.load_config (cognitive 49) packages/reflex-release/src/reflex_release/config.py:914 — config.load_config has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 10, loops 6 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · types.typehint_issubclass (cognitive 44) · ×1
  • types.typehint_issubclass (cognitive 44) REDACTED:1721 — types.typehint_issubclass has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 15, error handling 1 (2 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · event._scan_detach (cognitive 42) · ×1
  • event._scan_detach (cognitive 42) packages/reflex-base/src/reflex_base/event/__init__.py:211 — event._scan_detach has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 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 · _rendered.to_markdown (cognitive 41) · ×1
  • _rendered.to_markdown (cognitive 41) docs/app/agent_files/_rendered.py:83 — _rendered.to_markdown has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 10, ternaries 4 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · memoize._should_memoize (cognitive 40) · ×1
  • memoize._should_memoize (cognitive 40) reflex/compiler/plugins/memoize.py:141 — memoize._should_memoize has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 9, loops 3 (6 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 · commands.cmd_prepare_publish (cognitive 38) · ×1
  • commands.cmd_prepare_publish (cognitive 38) packages/reflex-release/src/reflex_release/commands.py:541 — commands.cmd_prepare_publish has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 9 (15 pts), boolean chains 3, error handling 1 (2 pts), 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 · reflex._run (cognitive 38) · ×1
  • reflex._run (cognitive 38) reflex/reflex.py:665 — reflex._run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 13 (nesting depth added 6). 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 · state.replaceEqualDeep (cognitive 38) · ×1
  • state.replaceEqualDeep (cognitive 38) REDACTED:368 — state.replaceEqualDeep has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 18). Of this number, 36 points are the body's own statements and 2 belong to one function item inside it that branches. 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 · useEventLoop (cognitive 38) · ×1
  • useEventLoop (cognitive 38) REDACTED:1656 — useEventLoop has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 4, loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 8). None of this is in the body itself: all 38 points belong to 20 function items inside it that branch (a function literal at line 1826, (anonymous)::handleStorage, a function literal at line 1875, …). 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 · compare.compare (cognitive 37) · ×1
  • compare.compare (cognitive 37) packages/reflex-bench/src/reflex_bench/compare.py:105 — compare.compare has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 8 (13 pts), loops 5 (7 pts), boolean chains 3 (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 · exec.run_process_and_launch_url (cognitive 37) · ×1
  • exec.run_process_and_launch_url (cognitive 37) reflex/utils/exec.py:285 — exec.run_process_and_launch_url has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 24). 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 · component.prop_docs (cognitive 36) · ×1
  • component.prop_docs (cognitive 36) docs/app/reflex_docs/pages/docs/component.py:284 — component.prop_docs has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 9 (13 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.compile_experimental_component_memo (cognitive 35) · ×1
  • utils.compile_experimental_component_memo (cognitive 35) reflex/compiler/utils.py:568 — utils.compile_experimental_component_memo has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uploadFiles (cognitive 35) · ×1
  • uploadFiles (cognitive 35) packages/reflex-frontend/src/utils/helpers/upload.js:20 — uploadFiles has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (7 pts), boolean chains 5, loops 4 (5 pts), ternaries 1 (2 pts), other 1 (nesting depth added 9). Most of this is not in the body itself: 5 of the 35 points are its own statements and the rest belongs to 14 function items inside it that branch (eventHandler, a function literal at line 96, (anonymous)::onprogress, …). 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 · cron.parse_field (cognitive 34) · ×1
  • cron.parse_field (cognitive 34) packages/reflex-workflow/src/reflex_workflow/cron.py:41 — cron.parse_field has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 3 (8 pts), error handling 2 (5 pts), boolean chains 3, loops 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._validate_exception_handlers (cognitive 34) · ×1
  • App._validate_exception_handlers (cognitive 34) REDACTED:2319 — App._validate_exception_handlers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 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.
D2 · Cognitive Complexity · docs.extract_doc_description (cognitive 33) · ×1
  • docs.extract_doc_description (cognitive 33) docs/app/reflex_docs/pages/docs/__init__.py:253 — docs.extract_doc_description has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (5 pts), boolean chains 2, error handling 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 · changelog.collapse_prereleases (cognitive 33) · ×1
  • changelog.collapse_prereleases (cognitive 33) packages/reflex-release/src/reflex_release/changelog.py:169 — changelog.collapse_prereleases has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 5 (6 pts), boolean chains 5 (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.
D2 · Cognitive Complexity · versions.next_version (cognitive 32) · ×1
  • versions.next_version (cognitive 32) packages/reflex-release/src/reflex_release/versions.py:31 — versions.next_version has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, ternaries 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compiler._compile_root_stylesheet (cognitive 32) · ×1
  • compiler._compile_root_stylesheet (cognitive 32) reflex/compiler/compiler.py:372 — compiler._compile_root_stylesheet has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (6 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (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 · Benchmark.define (cognitive 31) · ×1
  • Benchmark.define (cognitive 31) packages/reflex-bench/src/reflex_bench/registry.py:252 — Benchmark.define has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 7). 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.
D2 · Cognitive Complexity · _parser._convert_block (cognitive 31) · ×1
  • _parser._convert_block (cognitive 31) packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:219 — _parser._convert_block has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli._resolve_deploy_provider (cognitive 31) · ×1
  • cli._resolve_deploy_provider (cognitive 31) packages/reflex-hosting-cli/src/reflex_cli/v2/cli.py:277 — cli._resolve_deploy_provider has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 9 (12 pts), boolean chains 6 (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 · base_state_processor._transform_event_arg (cognitive 30) · ×1
  • base_state_processor._transform_event_arg (cognitive 30) packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py:252 — base_state_processor._transform_event_arg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 8, error handling 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gcp.deploy_command (cognitive 30) · ×1
  • gcp.deploy_command (cognitive 30) packages/reflex-hosting-cli/src/reflex_cli/v2/gcp.py:240 — gcp.deploy_command has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 2, ternaries 2, error handling 1, loops 1 (nesting depth added 4). 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.
D2 · Cognitive Complexity · config._load_lockstep (cognitive 30) · ×1
  • config._load_lockstep (cognitive 30) packages/reflex-release/src/reflex_release/config.py:755 — config._load_lockstep has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compiler.into_component (cognitive 30) · ×1
  • compiler.into_component (cognitive 30) reflex/compiler/compiler.py:949 — compiler.into_component has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, ternaries 2 (4 pts), error handling 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AppHarness.frontend (cognitive 30) · ×1
  • AppHarness.frontend (cognitive 30) reflex/testing.py:641 — AppHarness.frontend has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LiteralStringVar.create (cognitive 29) · ×1
  • LiteralStringVar.create (cognitive 29) packages/reflex-base/src/reflex_base/vars/sequence.py:1581 — LiteralStringVar.create has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (2 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 · schema._check_benchmark (cognitive 29) · ×1
  • schema._check_benchmark (cognitive 29) packages/reflex-bench/src/reflex_bench/schema.py:381 — schema._check_benchmark has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AsyncDeployments.wait (cognitive 29) · ×1
  • AsyncDeployments.wait (cognitive 29) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/deployments.py:306 — AsyncDeployments.wait has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 2, loops 1, ternaries 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 · apps.delete_app (cognitive 29) · ×1
  • apps.delete_app (cognitive 29) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:578 — apps.delete_app has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · processes.stream_logs (cognitive 29) · ×1
  • processes.stream_logs (cognitive 29) REDACTED:398 — processes.stream_logs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), boolean chains 3, error handling 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.
D2 · Cognitive Complexity · mergeSlotProps (cognitive 29) · ×1
  • mergeSlotProps (cognitive 29) REDACTED:2211 — mergeSlotProps has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (9 pts), boolean chains 6, 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 · PropsBase.__init__ (cognitive 28) · ×1
  • PropsBase.__init__ (cognitive 28) packages/reflex-base/src/reflex_base/components/props.py:234 — PropsBase.__init__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 1 (5 pts), loops 3 (nesting depth added 17). 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 · EventProcessor._try_clean_future (cognitive 28) · ×1
  • EventProcessor._try_clean_future (cognitive 28) packages/reflex-base/src/reflex_base/event/processor/event_processor.py:595 — EventProcessor._try_clean_future has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 5, loops 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 · style.format_as_emotion (cognitive 28) · ×1
  • style.format_as_emotion (cognitive 28) packages/reflex-base/src/reflex_base/style.py:341 — style.format_as_emotion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (9 pts), loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · base.figure_out_type (cognitive 28) · ×1
  • base.figure_out_type (cognitive 28) packages/reflex-base/src/reflex_base/vars/base.py:2210 — base.figure_out_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (28 pts) (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 · table.render_run (cognitive 28) · ×1
  • table.render_run (cognitive 28) packages/reflex-bench/src/reflex_bench/report/table.py:263 — table.render_run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (10 pts), loops 3 (6 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 · Form._validate_on_submit_typed_dict_fields (cognitive 28) · ×1
  • Form._validate_on_submit_typed_dict_fields (cognitive 28) REDACTED:579 — Form._validate_on_submit_typed_dict_fields has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 2 (4 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · apps.app_logs (cognitive 28) · ×1
  • apps.app_logs (cognitive 28) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:697 — apps.app_logs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · types.get_typed_dict_field_types (cognitive 27) · ×1
  • types.get_typed_dict_field_types (cognitive 27) REDACTED:471 — types.get_typed_dict_field_types has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (6 pts), boolean chains 5, loops 2 (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 · Field.__init__ (cognitive 27) · ×1
  • Field.__init__ (cognitive 27) packages/reflex-base/src/reflex_base/vars/base.py:4250 — Field.__init__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseState._init_var_dependency_dicts (cognitive 27) · ×1
  • BaseState._init_var_dependency_dicts (cognitive 27) REDACTED:1119 — BaseState._init_var_dependency_dicts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · telemetry._retrieve_cpu_info (cognitive 27) · ×1
  • telemetry._retrieve_cpu_info (cognitive 27) REDACTED:66 — telemetry._retrieve_cpu_info has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (6 pts), loops 1 (3 pts), error handling 1 (nesting depth added 17). 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 · function._starts_with_arrow_function (cognitive 26) · ×1
  • function._starts_with_arrow_function (cognitive 26) packages/reflex-base/src/reflex_base/vars/function.py:66 — function._starts_with_arrow_function has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · app_process.run_cli (cognitive 26) · ×1
  • app_process.run_cli (cognitive 26) REDACTED:944 — app_process.run_cli has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 7 (9 pts), boolean chains 2 (nesting depth added 5). 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 · commands._plan_versions (cognitive 26) · ×1
  • commands._plan_versions (cognitive 26) packages/reflex-release/src/reflex_release/commands.py:297 — commands._plan_versions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Cron.__call__ (cognitive 26) · ×1
  • Cron.__call__ (cognitive 26) packages/reflex-workflow/src/reflex_workflow/cron.py:168 — Cron.__call__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · App.__call__ (cognitive 26) · ×1
  • App.__call__ (cognitive 26) REDACTED:1176 — App.__call__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · applyClientStorageDelta (cognitive 26) · ×1
  • applyClientStorageDelta (cognitive 26) REDACTED:1586 — applyClientStorageDelta has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 11, loops 2 (3 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 · component.render_select (cognitive 25) · ×1
  • component.render_select (cognitive 25) docs/app/reflex_docs/pages/docs/component.py:150 — component.render_select has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, error handling 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Component._get_vars (cognitive 25) · ×1
  • Component._get_vars (cognitive 25) packages/reflex-base/src/reflex_base/components/component.py:1612 — Component._get_vars has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · memo._analyze_params (cognitive 25) · ×1
  • memo._analyze_params (cognitive 25) packages/reflex-base/src/reflex_base/components/memo.py:1301 — memo._analyze_params has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, 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.
D2 · Cognitive Complexity · Config._post_init (cognitive 25) · ×1
  • Config._post_init (cognitive 25) packages/reflex-base/src/reflex_base/config.py:369 — Config._post_init has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 2 (nesting depth added 2). 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 · EventChain.create (cognitive 25) · ×1
  • EventChain.create (cognitive 25) packages/reflex-base/src/reflex_base/event/__init__.py:1127 — EventChain.create has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StubGenerator.visit_ClassDef (cognitive 25) · ×1
  • StubGenerator.visit_ClassDef (cognitive 25) REDACTED:1240 — StubGenerator.visit_ClassDef has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · base._annotated_fields (cognitive 25) · ×1
  • base._annotated_fields (cognitive 25) packages/reflex-base/src/reflex_base/vars/base.py:4955 — base._annotated_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, ternaries 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.
D2 · Cognitive Complexity · scheduler.finalize (cognitive 25) · ×1
  • scheduler.finalize (cognitive 25) packages/reflex-bench/src/reflex_bench/scheduler.py:597 — scheduler.finalize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 2 (7 pts), loops 2 (3 pts), 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 · LifespanMixin._run_lifespan_tasks (cognitive 25) · ×1
  • LifespanMixin._run_lifespan_tasks (cognitive 25) reflex/app_mixins/lifespan.py:197 — LifespanMixin._run_lifespan_tasks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts), error handling 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.
D2 · Cognitive Complexity · build._zip (cognitive 25) · ×1
  • build._zip (cognitive 25) reflex/utils/build.py:75 — build._zip has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, loops 4 (5 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 · state.hydrateClientStorage (cognitive 25) · ×1
  • state.hydrateClientStorage (cognitive 25) REDACTED:1495 — state.hydrateClientStorage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 3 (6 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 · _MemoComponentWrapper.__call__ (cognitive 24) · ×1
  • _MemoComponentWrapper.__call__ (cognitive 24) packages/reflex-base/src/reflex_base/components/memo.py:1772 — _MemoComponentWrapper.__call__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventHandler.__call__ (cognitive 24) · ×1
  • EventHandler.__call__ (cognitive 24) packages/reflex-base/src/reflex_base/event/__init__.py:789 — EventHandler.__call__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pyi_generator.type_to_ast (cognitive 24) · ×1
  • pyi_generator.type_to_ast (cognitive 24) REDACTED:706 — pyi_generator.type_to_ast has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pyi_generator._get_init_lazy_imports (cognitive 24) · ×1
  • pyi_generator._get_init_lazy_imports (cognitive 24) REDACTED:1534 — pyi_generator._get_init_lazy_imports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Upload.create (cognitive 24) · ×1
  • Upload.create (cognitive 24) packages/reflex-components-core/src/reflex_components_core/core/upload.py:294 — Upload.create has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.validate_imports (cognitive 24) · ×1
  • utils.validate_imports (cognitive 24) reflex/compiler/utils.py:98 — utils.validate_imports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (10 pts), ternaries 2 (8 pts), boolean chains 3, loops 2 (3 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 · BaseState._mark_dirty_computed_vars (cognitive 24) · ×1
  • BaseState._mark_dirty_computed_vars (cognitive 24) REDACTED:1956 — BaseState._mark_dirty_computed_vars has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sitemap.generate_links_for_sitemap (cognitive 23) · ×1
  • sitemap.generate_links_for_sitemap (cognitive 23) REDACTED:136 — sitemap.generate_links_for_sitemap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (10 pts), boolean chains 1, 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 · table.render_samples (cognitive 23) · ×1
  • table.render_samples (cognitive 23) packages/reflex-bench/src/reflex_bench/report/table.py:494 — table.render_samples has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (8 pts), ternaries 1 (5 pts) (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 · size.measure_export (cognitive 23) · ×1
  • size.measure_export (cognitive 23) packages/reflex-bench/src/reflex_bench/suites/size.py:169 — size.measure_export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4, boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DataEditor.create (cognitive 23) · ×1
  • DataEditor.create (cognitive 23) packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:552 — DataEditor.create has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · commands.cmd_plan (cognitive 23) · ×1
  • commands.cmd_plan (cognitive 23) packages/reflex-release/src/reflex_release/commands.py:365 — commands.cmd_plan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), ternaries 3 (4 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 · config._load_custom_build (cognitive 23) · ×1
  • config._load_custom_build (cognitive 23) packages/reflex-release/src/reflex_release/config.py:813 — config._load_custom_build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · devpins._pin_upgrades (cognitive 23) · ×1
  • devpins._pin_upgrades (cognitive 23) packages/reflex-release/src/reflex_release/devpins.py:270 — devpins._pin_upgrades has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 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 · scaffold.sync (cognitive 23) · ×1
  • scaffold.sync (cognitive 23) packages/reflex-release/src/reflex_release/scaffold.py:774 — scaffold.sync has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateManagerRedis._try_modify_state (cognitive 23) · ×1
  • StateManagerRedis._try_modify_state (cognitive 23) reflex/istate/manager/redis.py:657 — StateManagerRedis._try_modify_state has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (5 pts), error handling 2, 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.
D2 · Cognitive Complexity · shared_tailwind.tailwind_config_js_template (cognitive 22) · ×1
  • shared_tailwind.tailwind_config_js_template (cognitive 22) packages/reflex-base/src/reflex_base/plugins/shared_tailwind.py:85 — shared_tailwind.tailwind_config_js_template has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 6, boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _HotReload._until (cognitive 22) · ×1
  • _HotReload._until (cognitive 22) packages/reflex-bench/src/reflex_bench/suites/hmr.py:409 — _HotReload._until has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Runner.loop (cognitive 22) · ×1
  • Runner.loop (cognitive 22) packages/reflex-workflow/src/reflex_workflow/engine/runner.py:171 — Runner.loop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · memoize._component_subtree_is_reactive (cognitive 22) · ×1
  • memoize._component_subtree_is_reactive (cognitive 22) reflex/compiler/plugins/memoize.py:101 — memoize._component_subtree_is_reactive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 4, ternaries 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 · utils.compile_imports (cognitive 22) · ×1
  • utils.compile_imports (cognitive 22) reflex/compiler/utils.py:134 — utils.compile_imports has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SharedStateBaseInternal._modify_linked_states (cognitive 22) · ×1
  • SharedStateBaseInternal._modify_linked_states (cognitive 22) reflex/istate/shared.py:398 — SharedStateBaseInternal._modify_linked_states has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseComponentMeta._process_annotated_fields (cognitive 21) · ×1
  • BaseComponentMeta._process_annotated_fields (cognitive 21) packages/reflex-base/src/reflex_base/components/component.py:205 — BaseComponentMeta._process_annotated_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (3 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · event.download (cognitive 21) · ×1
  • event.download (cognitive 21) packages/reflex-base/src/reflex_base/event/__init__.py:1996 — event.download has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventContext.release_lock (cognitive 21) · ×1
  • EventContext.release_lock (cognitive 21) packages/reflex-base/src/reflex_base/event/context.py:180 — EventContext.release_lock has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 pts), boolean chains 3, error handling 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 · DependencyTracker._populate_dependencies (cognitive 21) · ×1
  • DependencyTracker._populate_dependencies (cognitive 21) REDACTED:409 — DependencyTracker._populate_dependencies has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Session._open (cognitive 21) · ×1
  • _Session._open (cognitive 21) packages/reflex-bench/src/reflex_bench/drivers/events.py:642 — _Session._open has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · markdown.render_comparison (cognitive 21) · ×1
  • markdown.render_comparison (cognitive 21) packages/reflex-bench/src/reflex_bench/report/markdown.py:73 — markdown.render_comparison has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (7 pts), loops 3 (4 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 · WireSession._receive (cognitive 21) · ×1
  • WireSession._receive (cognitive 21) packages/reflex-bench/src/reflex_bench/suites/wire.py:224 — WireSession._receive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (20 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 · forms._iter_form_controls (cognitive 21) · ×1
  • forms._iter_form_controls (cognitive 21) REDACTED:210 — forms._iter_form_controls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dist.dist_metadata (cognitive 21) · ×1
  • dist.dist_metadata (cognitive 21) packages/reflex-release/src/reflex_release/dist.py:32 — dist.dist_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ReflexDocTransformer._render_quote_directive (cognitive 21) · ×1
  • ReflexDocTransformer._render_quote_directive (cognitive 21) packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:805 — ReflexDocTransformer._render_quote_directive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (8 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateManagerRedis._get_state_cached (cognitive 21) · ×1
  • StateManagerRedis._get_state_cached (cognitive 21) reflex/istate/manager/redis.py:782 — StateManagerRedis._get_state_cached has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 14). 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 · route.verify_route_validity (cognitive 21) · ×1
  • route.verify_route_validity (cognitive 21) reflex/route.py:12 — route.verify_route_validity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · api_reference_layout.method_details (cognitive 20) · ×1
  • api_reference_layout.method_details (cognitive 20) docs/app/reflex_docs/pages/docs/api_reference_layout.py:125 — api_reference_layout.method_details has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cloud_cliref.process (cognitive 20) · ×1
  • cloud_cliref.process (cognitive 20) docs/app/reflex_docs/pages/docs/cloud_cliref.py:173 — cloud_cliref.process has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 5, if/else 2, loops 1 (nesting depth added 1). 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 · Component._event_trigger_values_use_state (cognitive 20) · ×1
  • Component._event_trigger_values_use_state (cognitive 20) packages/reflex-base/src/reflex_base/components/component.py:1684 — Component._event_trigger_values_use_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · deterministic_hash._encode_deterministic (cognitive 20) · ×1
  • deterministic_hash._encode_deterministic (cognitive 20) packages/reflex-base/src/reflex_base/utils/deterministic_hash.py:370 — deterministic_hash._encode_deterministic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _Session._on_emit (cognitive 20) · ×1
  • _Session._on_emit (cognitive 20) packages/reflex-bench/src/reflex_bench/drivers/events.py:730 — _Session._on_emit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · secrets.update_secrets (cognitive 20) · ×1
  • secrets.update_secrets (cognitive 20) packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:102 — secrets.update_secrets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · istate.debug_failed_pickles (cognitive 20) · ×1
  • istate.debug_failed_pickles (cognitive 20) reflex/istate/__init__.py:26 — istate.debug_failed_pickles has cognitive complexity 20 (threshold 15). Drivers by points: error handling 4 (11 pts), if/else 5, loops 2 (4 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 · memo._bind_function_runtime_args (cognitive 19) · ×1
  • memo._bind_function_runtime_args (cognitive 19) packages/reflex-base/src/reflex_base/components/memo.py:1578 — memo._bind_function_runtime_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 2). 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 · BaseStateEventProcessor._execute_event (cognitive 19) · ×1
  • BaseStateEventProcessor._execute_event (cognitive 19) packages/reflex-base/src/reflex_base/event/processor/base_state_processor.py:882 — BaseStateEventProcessor._execute_event has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AppProcess.__init__ (cognitive 19) · ×1
  • AppProcess.__init__ (cognitive 19) REDACTED:1103 — AppProcess.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, ternaries 4 (5 pts) (nesting depth added 3). 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 · AppProcess._wait_until_ready (cognitive 19) · ×1
  • AppProcess._wait_until_ready (cognitive 19) REDACTED:1291 — AppProcess._wait_until_ready has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LoadRunner._collect (cognitive 19) · ×1
  • LoadRunner._collect (cognitive 19) packages/reflex-bench/src/reflex_bench/drivers/events.py:1508 — LoadRunner._collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · stats.stability_warnings (cognitive 19) · ×1
  • stats.stability_warnings (cognitive 19) packages/reflex-bench/src/reflex_bench/stats.py:878 — stats.stability_warnings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeBlock.create (cognitive 19) · ×1
  • CodeBlock.create (cognitive 19) packages/reflex-components-code/src/reflex_components_code/code.py:433 — CodeBlock.create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Icon.create (cognitive 19) · ×1
  • Icon.create (cognitive 19) packages/reflex-components-lucide/src/reflex_components_lucide/icon.py:55 — Icon.create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _class.format_type (cognitive 19) · ×1
  • _class.format_type (cognitive 19) packages/reflex-docgen/src/reflex_docgen/_class.py:178 — _class.format_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · docs_api.callable_api_reference (cognitive 19) · ×1
  • docs_api.callable_api_reference (cognitive 19) packages/reflex-site-shared/src/reflex_site_shared/components/docs_api.py:200 — docs_api.callable_api_reference has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · execute.run_attempt (cognitive 19) · ×1
  • execute.run_attempt (cognitive 19) packages/reflex-workflow/src/reflex_workflow/engine/execute.py:763 — execute.run_attempt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 3, ternaries 1 (nesting depth added 2). 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.
D2 · Cognitive Complexity · delta.build_delta (cognitive 19) · ×1
  • delta.build_delta (cognitive 19) reflex/istate/delta.py:222 — delta.build_delta has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2, ternaries 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateManagerRedis._wait_lock (cognitive 19) · ×1
  • StateManagerRedis._wait_lock (cognitive 19) reflex/istate/manager/redis.py:1225 — StateManagerRedis._wait_lock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LiteralVar._create_literal_var (cognitive 18) · ×1
  • LiteralVar._create_literal_var (cognitive 18) packages/reflex-base/src/reflex_base/vars/base.py:1892 — LiteralVar._create_literal_var has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · registry.select (cognitive 18) · ×1
  • registry.select (cognitive 18) packages/reflex-bench/src/reflex_bench/registry.py:677 — registry.select has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AiohttpTransport.send (cognitive 18) · ×1
  • AiohttpTransport.send (cognitive 18) packages/reflex-build-sdk/src/reflex_build_sdk/transports/_aiohttp.py:108 — AiohttpTransport.send has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, error handling 5, ternaries 1 (2 pts) (nesting depth added 2). 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 · _class._get_methods (cognitive 18) · ×1
  • _class._get_methods (cognitive 18) packages/reflex-docgen/src/reflex_docgen/_class.py:517 — _class._get_methods has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · hosting.watch_deployment_status (cognitive 18) · ×1
  • hosting.watch_deployment_status (cognitive 18) packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py:1658 — hosting.watch_deployment_status has cognitive complexity 18 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 4 (8 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · docs_api._parameter_descriptions (cognitive 18) · ×1
  • docs_api._parameter_descriptions (cognitive 18) packages/reflex-site-shared/src/reflex_site_shared/components/docs_api.py:140 — docs_api._parameter_descriptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ReflexDocTransformer._render_alert (cognitive 18) · ×1
  • ReflexDocTransformer._render_alert (cognitive 18) packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py:602 — ReflexDocTransformer._render_alert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5, boolean chains 4, loops 1 (2 pts) (nesting depth added 3). 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 · App._validate_var_dependencies (cognitive 18) · ×1
  • App._validate_var_dependencies (cognitive 18) REDACTED:2081 — App._validate_var_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), ternaries 1 (3 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 · utils.create_document_root (cognitive 18) · ×1
  • utils.create_document_root (cognitive 18) reflex/compiler/utils.py:845 — utils.create_document_root has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils._prune_stale_files (cognitive 18) · ×1
  • utils._prune_stale_files (cognitive 18) reflex/compiler/utils.py:1210 — utils._prune_stale_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateManagerDisk._process_write_queue (cognitive 18) · ×1
  • StateManagerDisk._process_write_queue (cognitive 18) REDACTED:321 — StateManagerDisk._process_write_queue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · reflex.run (cognitive 18) · ×1
  • reflex.run (cognitive 18) reflex/reflex.py:845 — reflex.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7 (nesting depth added 3). 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 · exec.get_reload_paths (cognitive 18) · ×1
  • exec.get_reload_paths (cognitive 18) reflex/utils/exec.py:646 — exec.get_reload_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 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 · createSafariMiddleware (cognitive 18) · ×1
  • createSafariMiddleware (cognitive 18) REDACTED:158 — createSafariMiddleware has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 4 (5 pts) (nesting depth added 1). None of this is in the body itself: all 18 points belong to 6 function items inside it that branch (safariCacheBustMiddleware, safariCacheBustMiddleware::write, safariCacheBustMiddleware::end, …). 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 · memoize_helpers._get_deps_from_event_trigger (cognitive 17) · ×1
  • memoize_helpers._get_deps_from_event_trigger (cognitive 17) packages/reflex-base/src/reflex_base/components/memoize_helpers.py:65 — memoize_helpers._get_deps_from_event_trigger has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventProcessor.enqueue (cognitive 17) · ×1
  • EventProcessor.enqueue (cognitive 17) packages/reflex-base/src/reflex_base/event/processor/event_processor.py:411 — EventProcessor.enqueue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3, error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · types.resolve_type_alias (cognitive 17) · ×1
  • types.resolve_type_alias (cognitive 17) REDACTED:793 — types.resolve_type_alias has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseStateMeta.__new__ (cognitive 17) · ×1
  • BaseStateMeta.__new__ (cognitive 17) packages/reflex-base/src/reflex_base/vars/base.py:5189 — BaseStateMeta.__new__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · HybridProperty.__set_name__ (cognitive 17) · ×1
  • HybridProperty.__set_name__ (cognitive 17) packages/reflex-base/src/reflex_base/vars/hybrid_property.py:149 — HybridProperty.__set_name__ has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5, ternaries 2 (4 pts) (nesting depth added 2). 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 · sequence._determine_value_of_array_index (cognitive 17) · ×1
  • sequence._determine_value_of_array_index (cognitive 17) packages/reflex-base/src/reflex_base/vars/sequence.py:2020 — sequence._determine_value_of_array_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CgroupScope.attach (cognitive 17) · ×1
  • CgroupScope.attach (cognitive 17) packages/reflex-bench/src/reflex_bench/collectors/cgroup.py:390 — CgroupScope.attach has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 3, error handling 2 (3 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · machine.checks (cognitive 17) · ×1
  • machine.checks (cognitive 17) packages/reflex-bench/src/reflex_bench/machine.py:421 — machine.checks has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, boolean chains 2. 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 · table.print_lines (cognitive 17) · ×1
  • table.print_lines (cognitive 17) packages/reflex-bench/src/reflex_bench/report/table.py:87 — table.print_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · apps.scale_app (cognitive 17) · ×1
  • apps.scale_app (cognitive 17) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:887 — apps.scale_app has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · auth.token_command (cognitive 17) · ×1
  • auth.token_command (cognitive 17) packages/reflex-hosting-cli/src/reflex_cli/v2/auth.py:157 — auth.token_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 4). 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.
D2 · Cognitive Complexity · commands.cmd_detect (cognitive 17) · ×1
  • commands.cmd_detect (cognitive 17) packages/reflex-release/src/reflex_release/commands.py:197 — commands.cmd_detect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · App._register_plugin_pages (cognitive 17) · ×1
  • App._register_plugin_pages (cognitive 17) REDACTED:1610 — App._register_plugin_pages has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 4 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventNamespace.on_event (cognitive 17) · ×1
  • EventNamespace.on_event (cognitive 17) REDACTED:2789 — EventNamespace.on_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 3). 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 · MutableProxy.__getattr__ (cognitive 17) · ×1
  • MutableProxy.__getattr__ (cognitive 17) reflex/istate/proxy.py:1074 — MutableProxy.__getattr__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Component._get_vars_from_event_triggers (cognitive 16) · ×1
  • Component._get_vars_from_event_triggers (cognitive 16) packages/reflex-base/src/reflex_base/components/component.py:1588 — Component._get_vars_from_event_triggers has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · Config.update_from_env (cognitive 16) · ×1
  • Config.update_from_env (cognitive 16) packages/reflex-base/src/reflex_base/config.py:813 — Config.update_from_env has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Event.from_event_type (cognitive 16) · ×1
  • Event.from_event_type (cognitive 16) packages/reflex-base/src/reflex_base/event/__init__.py:118 — Event.from_event_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LiteralEventChainVar.create (cognitive 16) · ×1
  • LiteralEventChainVar.create (cognitive 16) packages/reflex-base/src/reflex_base/event/__init__.py:3030 — LiteralEventChainVar.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3, boolean chains 2 (nesting depth added 1). 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 · event.fix_events (cognitive 16) · ×1
  • event.fix_events (cognitive 16) packages/reflex-base/src/reflex_base/event/__init__.py:2835 — event.fix_events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EventProcessor.stop (cognitive 16) · ×1
  • EventProcessor.stop (cognitive 16) packages/reflex-base/src/reflex_base/event/processor/event_processor.py:306 — EventProcessor.stop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (4 pts), loops 1 (nesting depth added 4). 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.
D2 · Cognitive Complexity · EventProcessor._resolve_future (cognitive 16) · ×1
  • EventProcessor._resolve_future (cognitive 16) packages/reflex-base/src/reflex_base/event/processor/event_processor.py:989 — EventProcessor._resolve_future has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · imports.merge_imports (cognitive 16) · ×1
  • imports.merge_imports (cognitive 16) packages/reflex-base/src/reflex_base/utils/imports.py:130 — imports.merge_imports has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (4 pts), loops 2 (3 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 · lazy_loader._attach_native (cognitive 16) · ×1
  • lazy_loader._attach_native (cognitive 16) REDACTED:31 — lazy_loader._attach_native has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3, boolean chains 2, error handling 1 (nesting depth added 2). 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 · StubGenerator.visit_Assign (cognitive 16) · ×1
  • StubGenerator.visit_Assign (cognitive 16) REDACTED:1342 — StubGenerator.visit_Assign has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), boolean chains 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 · PyiGenerator._scan_files (cognitive 16) · ×1
  • PyiGenerator._scan_files (cognitive 16) REDACTED:1663 — PyiGenerator._scan_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pyi_generator._generate_docstrings (cognitive 16) · ×1
  • pyi_generator._generate_docstrings (cognitive 16) REDACTED:541 — pyi_generator._generate_docstrings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · serializers._serialize_sqlalchemy_model (cognitive 16) · ×1
  • serializers._serialize_sqlalchemy_model (cognitive 16) packages/reflex-base/src/reflex_base/utils/serializers.py:710 — serializers._serialize_sqlalchemy_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, loops 3, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ComputedVar._add_static_dep (cognitive 16) · ×1
  • ComputedVar._add_static_dep (cognitive 16) packages/reflex-base/src/reflex_base/vars/base.py:2751 — ComputedVar._add_static_dep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Benchmark.normalize (cognitive 16) · ×1
  • Benchmark.normalize (cognitive 16) packages/reflex-bench/src/reflex_bench/registry.py:432 — Benchmark.normalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Scheduler._sample (cognitive 16) · ×1
  • Scheduler._sample (cognitive 16) packages/reflex-bench/src/reflex_bench/scheduler.py:973 — Scheduler._sample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · subjects.resolve (cognitive 16) · ×1
  • subjects.resolve (cognitive 16) packages/reflex-bench/src/reflex_bench/subjects.py:612 — subjects.resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5 (6 pts), boolean chains 2, error handling 1 (nesting depth added 2). 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 · subjects.prune (cognitive 16) · ×1
  • subjects.prune (cognitive 16) packages/reflex-bench/src/reflex_bench/subjects.py:758 — subjects.prune has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _class._format_signature (cognitive 16) · ×1
  • _class._format_signature (cognitive 16) packages/reflex-docgen/src/reflex_docgen/_class.py:462 — _class._format_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · apps.app_history (cognitive 16) · ×1
  • apps.app_history (cognitive 16) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:152 — apps.app_history has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _ComponentsRedirect.find_spec (cognitive 16) · ×1
  • _ComponentsRedirect.find_spec (cognitive 16) reflex/components/__init__.py:72 — _ComponentsRedirect.find_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 9). 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 · StateManagerRedis.get_state (cognitive 16) · ×1
  • StateManagerRedis.get_state (cognitive 16) reflex/istate/manager/redis.py:418 — StateManagerRedis.get_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · StateManagerRedis.set_state (cognitive 16) · ×1
  • StateManagerRedis.set_state (cognitive 16) reflex/istate/manager/redis.py:515 — StateManagerRedis.set_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 1 (3 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BaseState.__init_subclass__ (cognitive 16) · ×1
  • BaseState.__init_subclass__ (cognitive 16) REDACTED:776 — BaseState.__init_subclass__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 3). 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 · state._sync_shared_storage (cognitive 16) · ×1
  • state._sync_shared_storage (cognitive 16) REDACTED:2422 — state._sync_shared_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · prerequisites._can_colorize (cognitive 16) · ×1
  • prerequisites._can_colorize (cognitive 16) reflex/utils/prerequisites.py:348 — prerequisites._can_colorize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tasks._run_forever (cognitive 16) · ×1
  • tasks._run_forever (cognitive 16) reflex/utils/tasks.py:13 — tasks._run_forever has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parseDatetime (cognitive 16) · ×1
  • parseDatetime (cognitive 16) packages/reflex-frontend/src/utils/helpers/datetime.js:5 — parseDatetime has cognitive complexity 16 (threshold 15). Drivers by points: other 6, boolean chains 4, ternaries 3 (4 pts), if/else 2 (nesting depth added 1). 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.
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
D3 · God Classes · ClassTooLong · ×1
  • ClassTooLong: AlgoliaSearch REDACTED:1 — ClassTooLong — 442 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 42 over it, 1.11× 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.
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (5 members, 25 shared lines) · ×1
  • Near-duplicate member family (5 members, 25 shared lines) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:160 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:160-213 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:465-503 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:526-563 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:710-809 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:898-976 — These 5 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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 (80 corresponding lines) · ×1
  • Edited copy of a member (80 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:630 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:630-709 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:780-868 — These two members are one piece of code written twice and then edited apart: 80 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 (105 corresponding lines) · ×1
  • Edited copy of a member (105 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:304 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:304-421 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:276-380 — These two members are one piece of code written twice and then edited apart: 105 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 (50 corresponding lines) · ×1
  • Edited copy of a member (50 corresponding lines) docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:15 — docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:15-67 | docs/app/reflex_docs/pages/integrations/integration_list.py:18-67 — These two members are one piece of code written twice and then edited apart: 50 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) packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:235 — packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:235-282 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:375-427 — 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) reflex/reflex.py:574 — reflex/reflex.py:574-621 | reflex/reflex.py:625-662 — 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 (72 corresponding lines) · ×1
  • Edited copy of a member (72 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/templates/marketing_page.py:25 — packages/reflex-site-shared/src/reflex_site_shared/templates/marketing_page.py:25-101 | packages/reflex-site-shared/src/reflex_site_shared/templates/webpage.py:23-94 — These two members are one piece of code written twice and then edited apart: 72 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) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:430 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:430-476 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:389-442 — 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 (44 corresponding lines) · ×1
  • Edited copy of a member (44 corresponding lines) packages/reflex-base/src/reflex_base/plugins/compiler.py:345 — packages/reflex-base/src/reflex_base/plugins/compiler.py:345-398 | packages/reflex-base/src/reflex_base/plugins/compiler.py:409-452 — These two members are one piece of code written twice and then edited apart: 44 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, 33+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 33+ corresponding lines) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:997 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:997-1032 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:39-73 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:211-243 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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 (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) packages/reflex-docgen/src/reflex_docgen/_class.py:303 — packages/reflex-docgen/src/reflex_docgen/_class.py:303-331 | packages/reflex-docgen/src/reflex_docgen/_class.py:337-365 — 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) packages/reflex-base/src/reflex_base/components/component.py:1422 — packages/reflex-base/src/reflex_base/components/component.py:1422-1469 | reflex/compiler/plugins/builtin.py:113-144 | reflex/compiler/utils.py:492-513 — 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 copy of a member (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) reflex/utils/js_runtimes.py:155 — reflex/utils/js_runtimes.py:155-185 | reflex/utils/js_runtimes.py:206-239 — 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 (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) packages/reflex-base/src/reflex_base/event/__init__.py:318 — packages/reflex-base/src/reflex_base/event/__init__.py:318-353 | packages/reflex-base/src/reflex_base/event/__init__.py:357-388 — 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 (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:256 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:256-280 | packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:290-314 — 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 (46 corresponding lines) · ×1
  • Edited copy of a member (46 corresponding lines) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:274 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:274-320 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:291-336 — These two members are one piece of code written twice and then edited apart: 46 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) packages/reflex-base/src/reflex_base/components/memoize_helpers.py:161 — packages/reflex-base/src/reflex_base/components/memoize_helpers.py:161-179 | packages/reflex-base/src/reflex_base/vars/base.py:559-585 — 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 copies of one member (3 members, 14+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 14+ corresponding lines) packages/reflex-components-radix/src/reflex_components_radix/primitives/base.py:43 — packages/reflex-components-radix/src/reflex_components_radix/primitives/base.py:43-58 | packages/reflex-components-radix/src/reflex_components_radix/primitives/drawer.py:109-122 | packages/reflex-components-radix/src/reflex_components_radix/themes/base.py:148-163 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' 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 (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) packages/reflex-bench/src/reflex_bench/subjects.py:714 — packages/reflex-bench/src/reflex_bench/subjects.py:714-723 | packages/reflex-bench/src/reflex_bench/suites/lifecycle.py:209-221 — 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 copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:396 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:396-407 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/environments.py:172-186 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py:488-500 — 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 copy of a member (12 corresponding lines) · ×1
  • Edited copy of a member (12 corresponding lines) packages/reflex-base/src/reflex_base/vars/sequence.py:711 — packages/reflex-base/src/reflex_base/vars/sequence.py:711-722 | packages/reflex-base/src/reflex_base/vars/set.py:757-768 — 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 · Duplicated block (72 lines × 2) · ×1
  • Duplicated block (72 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:152 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:152-223 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:153-224 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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. 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.
D4 · Code Duplication · Duplicated block (64 lines × 2) · ×1
  • Duplicated block (64 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:169 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:169-232 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:186-249 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py` and `packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `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.
D4 · Code Duplication · Duplicated block (48 lines × 2) · ×1
  • Duplicated block (48 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:44 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:44-91 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:45-92 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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. 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.
D4 · Code Duplication · Duplicated block (37 lines × 2) · ×1
  • Duplicated block (37 lines × 2) docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:15 — docs/app/reflex_docs/pages/docs_landing/views/ai_builder.py:15-51 | docs/app/reflex_docs/pages/integrations/integration_list.py:18-54 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (33 lines × 2) · ×1
  • Duplicated block (33 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:166 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:166-198 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:165-197 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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. 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.
D4 · Code Duplication · Duplicated block (32–33 lines × 2) · ×1
  • Duplicated block (32–33 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:335 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:335-366 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:317-349 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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 `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:335` 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 (30 lines × 2) · ×1
  • Duplicated block (30 lines × 2) packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:123 — packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:123-152 | packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py:129-158 — before extracting anything, compare `packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py` and `packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 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. 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.
D4 · Code Duplication · Duplicated block (25–27 lines × 2) · ×1
  • Duplicated block (25–27 lines × 2) docs/app/reflex_docs/pages/docs/component.py:1053 — docs/app/reflex_docs/pages/docs/component.py:1053-1079 | docs/app/reflex_docs/pages/docs/component.py:1103-1127 — 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 `docs/app/reflex_docs/pages/docs/component.py:1053` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (25 lines × 4) · ×1
  • Duplicated block (25 lines × 4) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:166 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:166-190 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:472-496 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:532-556 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:719-743 — 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 `packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:166` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • Duplicated block (24 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:274 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:274-298 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:291-314 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py` and `packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 172 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 `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:274` 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 (16–17 lines × 9) · ×1
  • Duplicated block (16–17 lines × 9) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:161 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:161-176 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:466-482 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:527-542 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:589-604 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:713-729 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:998-1013 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:40-56 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:113-128 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:212-227 — before extracting anything, compare `packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py` and `packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10–17 lines × 2) · ×1
  • Duplicated block (10–17 lines × 2) packages/reflex-base/src/reflex_base/components/component.py:1444 — packages/reflex-base/src/reflex_base/components/component.py:1444-1460 | reflex/compiler/utils.py:504-513 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `reflex/compiler/utils.py:503` calls `_app_style` and `packages/reflex-base/src/reflex_base/components/component.py:1443` 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 (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) reflex/compiler/plugins/builtin.py:404 — reflex/compiler/plugins/builtin.py:404-418 | reflex/compiler/plugins/builtin.py:440-455 — 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 `reflex/compiler/plugins/builtin.py:440` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (12–14 lines × 5) · ×1
  • Duplicated block (12–14 lines × 5) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:125 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:125-136 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:1007-1020 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:50-61 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:122-133 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:221-232 — before extracting anything, compare `packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py` and `packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (13 lines × 10) · ×1
  • Duplicated block (13 lines × 10) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:165 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:165-177 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:471-483 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:531-543 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:593-605 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:718-730 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:904-916 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:1002-1014 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:45-57 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:117-129 | packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py:216-228 — before extracting anything, compare `packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py` and `packages/reflex-hosting-cli/src/reflex_cli/v2/secrets.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10–13 lines × 2) · ×1
  • Duplicated block (10–13 lines × 2) packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:382 — packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:382-391 | packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:408-420 — 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 before the matched lines, `packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:407` calls `_extract_frontmatter` and `packages/reflex-docgen/src/reflex_docgen/markdown/_parser.py:380` 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 (12 lines × 5) · ×1
  • Duplicated block (12 lines × 5) packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:179 — packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:179-190 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:485-496 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:545-556 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:732-743 | packages/reflex-hosting-cli/src/reflex_cli/v2/apps.py:941-952 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1
  • Duplicated block (12 lines × 3) packages/reflex-release/src/reflex_release/cli.py:91 — packages/reflex-release/src/reflex_release/cli.py:91-102 | packages/reflex-release/src/reflex_release/cli.py:214-225 | packages/reflex-release/src/reflex_release/cli.py:230-241 — 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 `packages/reflex-release/src/reflex_release/cli.py: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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `packages/reflex-release/src/reflex_release/cli.py:89` calls `add_parser` and `packages/reflex-release/src/reflex_release/cli.py:213` 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–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) packages/reflex-base/src/reflex_base/components/memo.py:1631 — packages/reflex-base/src/reflex_base/components/memo.py:1631-1640 | packages/reflex-base/src/reflex_base/components/memo.py:1809-1820 — 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.
D4 · Code Duplication · Duplicated block (8–12 lines × 2) · ×1
  • Duplicated block (8–12 lines × 2) packages/reflex-release/src/reflex_release/cli.py:243 — packages/reflex-release/src/reflex_release/cli.py:243-250 | packages/reflex-release/src/reflex_release/cli.py:268-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 `packages/reflex-release/src/reflex_release/cli.py:268` 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, `packages/reflex-release/src/reflex_release/cli.py:240` calls `add_parser`, `add_argument`, `_env` and `packages/reflex-release/src/reflex_release/cli.py:268` 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 (9 lines × 2) · ×1
  • Duplicated block (9 lines × 2) packages/reflex-base/src/reflex_base/components/memo.py:1600 — packages/reflex-base/src/reflex_base/components/memo.py:1600-1609 | packages/reflex-base/src/reflex_base/components/memo.py:1786-1794 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1
  • Duplicated block (6 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:641 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:641-646 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:792-797 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:344-349 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:257-262 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:640` calls `pop`, `keys` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:254` 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) docs/app/reflex_docs/pages/docs/component.py:202 — docs/app/reflex_docs/pages/docs/component.py:202-207 | docs/app/reflex_docs/pages/docs/component.py:212-217 — 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.
D4 · Code Duplication · Duplicated block (40 lines × 3) · ×1
  • Duplicated block (40 lines × 3) packages/reflex-components-internal/src/reflex_components_internal/components/base/switch.py:24 — packages/reflex-components-internal/src/reflex_components_internal/components/base/switch.py:24-119 | packages/reflex-components-internal/src/reflex_components_internal/components/base/toggle.py:23-62 | packages/reflex-components-internal/src/reflex_components_internal/components/base/toggle_group.py:27-69 — 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. 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 (11 lines × 4) · ×1
  • Duplicated block (11 lines × 4) packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:269 — packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py:269-279 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/environments.py:255-268 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py:221-231 | packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py:289-304 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
D4 · Code Duplication · Duplicated block (39 lines × 2) · ×1
  • Duplicated block (39 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:41 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:41-79 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:40-78 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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. 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.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:204 — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:204-225 | packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py:203-224 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py` and `packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 179 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. 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.
D4 · Code Duplication · Duplicated block (8 lines × 11) · ×1
  • Duplicated block (8 lines × 11) packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:153 — packages/reflex-components-internal/src/reflex_components_internal/components/base/accordion.py:153-160 | packages/reflex-components-internal/src/reflex_components_internal/components/base/collapsible.py:74-81 | packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:124-131 | packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:90-97 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:111-118 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:250-257 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:143-150 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:99-106 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:83-90 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:183-190 | packages/reflex-components-internal/src/reflex_components_internal/components/base/tooltip.py:120-127 — 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 11 call sites, so a change lands once. 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.
D4 · Code Duplication · Duplicated block (8 lines × 9) · ×1
  • Duplicated block (8 lines × 9) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:243 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:243-250 | packages/reflex-components-internal/src/reflex_components_internal/components/base/dialog.py:151-158 | packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py:200-207 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:350-357 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:304-311 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:214-221 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:192-199 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:304-311 | packages/reflex-components-internal/src/reflex_components_internal/components/base/tooltip.py:217-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 all 9 call sites, so a change lands once. 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.
D4 · Code Duplication · Duplicated block (8 lines × 7) · ×1
  • Duplicated block (8 lines × 7) packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:263 — packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py:263-270 | packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:370-377 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:344-351 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:234-241 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:212-219 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:498-505 | packages/reflex-components-internal/src/reflex_components_internal/components/base/tooltip.py:234-241 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/context_menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 134 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. 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.
D4 · Code Duplication · Duplicated block (9 lines × 5) · ×1
  • Duplicated block (9 lines × 5) packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:326 — packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py:326-334 | packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py:283-291 | packages/reflex-components-internal/src/reflex_components_internal/components/base/popover.py:187-195 | packages/reflex-components-internal/src/reflex_components_internal/components/base/preview_card.py:171-179 | packages/reflex-components-internal/src/reflex_components_internal/components/base/select.py:280-288 — before extracting anything, compare `packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py` and `packages/reflex-components-internal/src/reflex_components_internal/components/base/navigation_menu.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×1
  • Duplicated block (11 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:18 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:18-28 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:19-29 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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. 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.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:265 — packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py:265-283 | packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py:266-284 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/gallery/common.py` and `packages/reflex-site-shared/src/reflex_site_shared/gallery/gallery.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 227 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. 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.
D4 · Code Duplication · Duplicated block (34 lines × 2) · ×1
  • Duplicated block (34 lines × 2) packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:36 — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:36-69 | packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py:34-67 — before extracting anything, compare `packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py` and `packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 172 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `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.
D4 · Code Duplication · Duplicated block (14 lines × 5) · ×1
  • Duplicated block (14 lines × 5) packages/reflex-base/src/reflex_base/vars/base.py:2442 — packages/reflex-base/src/reflex_base/vars/base.py:2442-2455 | packages/reflex-base/src/reflex_base/vars/sequence.py:1256-1269 | packages/reflex-base/src/reflex_base/vars/sequence.py:1277-1290 | packages/reflex-base/src/reflex_base/vars/sequence.py:1298-1311 | packages/reflex-base/src/reflex_base/vars/sequence.py:1439-1452 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. 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.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) packages/reflex-base/src/reflex_base/vars/number.py:1127 — packages/reflex-base/src/reflex_base/vars/number.py:1127-1139 | packages/reflex-base/src/reflex_base/vars/number.py:1144-1156 | packages/reflex-base/src/reflex_base/vars/sequence.py:1422-1434 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1
  • Duplicated block (13 lines × 2) packages/reflex-components-internal/src/reflex_components_internal/blocks/telemetry/common_room.py:36 — packages/reflex-components-internal/src/reflex_components_internal/blocks/telemetry/common_room.py:36-48 | packages/reflex-components-internal/src/reflex_components_internal/blocks/telemetry/koala.py:36-48 — 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. 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.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) packages/reflex-components-internal/src/reflex_components_internal/components/base/button.py:116 — packages/reflex-components-internal/src/reflex_components_internal/components/base/button.py:116-120 | packages/reflex-components-internal/src/reflex_components_internal/components/base/button.py:124-128 | packages/reflex-components-internal/src/reflex_components_internal/components/base/link.py:89-93 | packages/reflex-components-internal/src/reflex_components_internal/components/base/link.py:97-101 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind `variant` to `LiteralButtonVariant` in one and `LiteralLinkVariant` 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.
D5 · Coupling · Off the main sequence · ×1
  • Off the main sequence: reflex (Python) — reflex (Python): abstractness 0.02, instability 0.00, distance 0.98 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — packages/reflex-frontend/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
P8 · Schema migrations · Schema created by SQLAlchemy create_all() (no migration path) · ×1
  • Schema created by SQLAlchemy create_all() (no migration path) packages/reflex-workflow/benchmarks/bench.py:159 — SQLAlchemy create_all() builds the schema from the model at startup and keeps no migration history, so there is no reviewed, repeatable upgrade path for an existing production database — a renamed column is dropped and re-added rather than migrated. Adopt Alembic (`alembic revision --autogenerate` + `alembic upgrade head`), so every schema change is a versioned file applied the same way in every environment.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 5 typed · 37 plain JS — the untyped files are packages/reflex-components-internal/src/reflex_components_internal/components/base/GradientProfile.js, packages/reflex-frontend/src/app/entry.client.embed.js, packages/reflex-frontend/src/app/entry.client.js, packages/reflex-frontend/src/app/routes.js, packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.js, packages/reflex-frontend/src/components/shiki/code.js (+31 more).
R10 · Code Duplication · Duplicated block (20 lines × 2 locations) · ×1
  • Duplicated block (20 lines × 2 locations) REDACTED:670 — REDACTED:670 · REDACTED:692 — 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 (14 lines × 2 locations) · ×1
  • Duplicated block (14 lines × 2 locations) REDACTED:791 — REDACTED:791 · REDACTED:812 — 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 (13 lines × 2 locations) · ×1
  • Duplicated block (13 lines × 2 locations) REDACTED:740 — REDACTED:740 · REDACTED:754 — 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 with local edits (12 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (12 matched lines × 2 locations) packages/reflex-frontend/src/components/shiki/code.js:51 — packages/reflex-frontend/src/components/shiki/code.js:51 · packages/reflex-site-shared/src/reflex_site_shared/styles/assets/components/DeferredDemo.jsx:31 — the two spans are one implementation copied and then locally edited — 57 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 (11 lines × 2 locations) · ×1
  • Duplicated block (11 lines × 2 locations) REDACTED:1502 — REDACTED:1502 · REDACTED:1513 — 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 (6 lines × 2 locations) · ×1
  • Duplicated block (6 lines × 2 locations) packages/reflex-frontend/src/utils/helpers/set.js:66 — packages/reflex-frontend/src/utils/helpers/set.js:66 · packages/reflex-frontend/src/utils/helpers/set.js:102 — 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.
R2 · Cyclomatic Complexity · Complex function applyEvent (cyclomatic 42, cognitive 71) · ×1
  • Complex function applyEvent (cyclomatic 42, cognitive 71) REDACTED:633 — applyEvent has cyclomatic complexity 42 and cognitive complexity 71; 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 mergeSlotProps (cyclomatic 21, cognitive 29) · ×1
  • Complex function mergeSlotProps (cyclomatic 21, cognitive 29) REDACTED:2211 — mergeSlotProps has cyclomatic complexity 21 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 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 replaceEqualDeep (cyclomatic 20, cognitive 36) · ×1
  • Complex function replaceEqualDeep (cyclomatic 20, cognitive 36) REDACTED:368 — replaceEqualDeep has cyclomatic complexity 20 and cognitive complexity 36; 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 applyClientStorageDelta (cyclomatic 20, cognitive 26) · ×1
  • Complex function applyClientStorageDelta (cyclomatic 20, cognitive 26) REDACTED:1586 — applyClientStorageDelta has cyclomatic complexity 20 and cognitive complexity 26; 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 AlgoliaSearch (cyclomatic 19, cognitive 18) · ×1
  • Complex function AlgoliaSearch (cyclomatic 19, cognitive 18) REDACTED:260 — AlgoliaSearch 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 hydrateClientStorage (cyclomatic 18, cognitive 25) · ×1
  • Complex function hydrateClientStorage (cyclomatic 18, cognitive 25) REDACTED:1495 — hydrateClientStorage has cyclomatic complexity 18 and cognitive complexity 25; 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 parseDatetime (cyclomatic 16, cognitive 16) · ×1
  • Complex function parseDatetime (cyclomatic 16, cognitive 16) packages/reflex-frontend/src/utils/helpers/datetime.js:5 — parseDatetime has cyclomatic complexity 16 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 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 applyEventActions (cyclomatic 13, cognitive 12) · ×1
  • Complex function applyEventActions (cyclomatic 13, cognitive 12) REDACTED:1451 — applyEventActions 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 formatCell (cyclomatic 13, cognitive 9) · ×1
  • Complex function formatCell (cyclomatic 13, cognitive 9) packages/reflex-frontend/src/utils/helpers/dataeditor.js:21 — formatCell has cyclomatic complexity 13 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.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 2232 lines of code REDACTED:1 — REDACTED has 2232 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: 1218 lines of code REDACTED:1 — REDACTED has 1218 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R7 · Dead Code · Dead file (~139 LoC) · ×1
  • Dead file (~139 LoC) packages/reflex-frontend/src/utils/react-theme.js — no import path from any entry point (19 application, 4 tooling, 15 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.js) — 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 (~109 LoC) · ×1
  • Dead file (~109 LoC) packages/reflex-frontend/src/components/shiki/code.js — no import path from any entry point (19 application, 4 tooling, 15 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 (~105 LoC) · ×1
  • Dead file (~105 LoC) packages/reflex-frontend/src/utils/helpers/paste.js — no import path from any entry point (19 application, 4 tooling, 15 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 (~94 LoC) · ×1
  • Dead file (~94 LoC) packages/reflex-frontend/src/utils/helpers/dataeditor.js — no import path from any entry point (19 application, 4 tooling, 15 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 (~63 LoC) · ×1
  • Dead file (~63 LoC) packages/reflex-frontend/src/app/entry.client.embed.js — no import path from any entry point (19 application, 4 tooling, 15 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 (~18 LoC) · ×1
  • Dead file (~18 LoC) packages/reflex-frontend/src/components/reflex/radix_themes_color_mode_provider.js — no import path from any entry point (19 application, 4 tooling, 15 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 · Unlisted import 'vite' · ×1
  • Unlisted import 'vite' REDACTED:19 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
X24 · Document value interpolated into markup unescaped · Untrusted text written into markup unescaped · ×1
  • Untrusted text written into markup unescaped packages/reflex-frontend/src/components/shiki/code.js:88 — `highlighted.html` is text this program did not author, and it is written into the text of an element through `dangerouslySetInnerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Minor — 106 finding(s)
X4 · Structured logging · Interpolated log message defeats structured logging · ×40
  • Interpolated log message defeats structured logging REDACTED:146 — `error` at line 146 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:165 — `error` at line 165 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:232 — `error` at line 232 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:749 — `warning` at line 749 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:1245 — `warning` at line 1245 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:1557 — `warning` at line 1557 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:1947 — `warning` at line 1947 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2632 — `warning` at line 2632 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2657 — `warning` at line 2657 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2661 — `warning` at line 2661 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2751 — `error` at line 2751 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2775 — `warning` at line 2775 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2802 — `warning` at line 2802 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2810 — `warning` at line 2810 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2896 — `warning` at line 2896 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2936 — `debug` at line 2936 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2945 — `debug` at line 2945 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging REDACTED:2965 — `warning` at line 2965 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/assets.py:141 — `warning` at line 141 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/model.py:161 — `warning` at line 161 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/model.py:280 — `debug` at line 280 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/model.py:519 — `error` at line 519 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/reflex.py:60 — `error` at line 60 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/reflex.py:329 — `log` at line 329 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.log(logging.INFO, "order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
  • Interpolated log message defeats structured logging reflex/reflex.py:689 — `error` at line 689 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
  • + 15 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×23
  • Duplicated predicate packages/reflex-base/src/reflex_base/vars/base.py:582 — `component.tag or type(component).__name__` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/vars/base.py, packages/reflex-components-radix/src/reflex_components_radix/themes/base.py. 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 packages/reflex-base/src/reflex_base/vars/base.py:1954 — `dataclasses.is_dataclass(value) and not isinstance(value, type)` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/vars/base.py, packages/reflex-hosting-cli/src/reflex_cli/utils/hosting.py. 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 packages/reflex-base/src/reflex_base/components/component.py:154 — `default is not MISSING and default_factory is not None` appears character-identically in 3 files — packages/reflex-base/src/reflex_base/components/component.py, packages/reflex-base/src/reflex_base/components/props.py, packages/reflex-base/src/reflex_base/vars/base.py. 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 packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py:79 — `domain not in personal_domains and ".edu" not in domain` appears character-identically in 2 files — packages/reflex-components-internal/src/reflex_components_internal/blocks/demo_form.py, packages/reflex-components-internal/src/reflex_components_internal/blocks/intro_form.py. 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 packages/reflex-hosting-cli/src/reflex_cli/deployments.py:238 — `find_spec("typer") is not None and find_spec("typer.core") is not None and find_spec("typer.models") is not None` appears character-identically in 2 files — packages/reflex-hosting-cli/src/reflex_cli/deployments.py, packages/reflex-hosting-cli/src/reflex_cli/v2/deployments.py. 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 packages/reflex-site-shared/src/reflex_site_shared/components/blocks/collapsible.py:28 — `foreground_override or f"{rx.color(color, 11)}"` appears character-identically in 2 files — packages/reflex-site-shared/src/reflex_site_shared/components/blocks/collapsible.py, packages/reflex-site-shared/src/reflex_site_shared/docs/markdown.py. 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 REDACTED:1155 — `frontend_port and backend_port and frontend_port != backend_port` appears character-identically in 2 files — REDACTED, reflex/reflex.py. 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 packages/reflex-base/src/reflex_base/components/field.py:39 — `get_origin(annotated_type) or annotated_type` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/components/field.py, packages/reflex-base/src/reflex_base/vars/base.py. 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 packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py:136 — `include_radix_themes and RADIX_THEMES_STYLESHEET in css_file_content` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/plugins/tailwind_v3.py, packages/reflex-base/src/reflex_base/plugins/tailwind_v4.py. 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 docs/app/agent_files/_plugin.py:352 — `isinstance(component, SimpleNamespace) and hasattr(component, "__call__")` appears character-identically in 2 files — docs/app/agent_files/_plugin.py, docs/app/reflex_docs/pages/docs/__init__.py. 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 packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py:594 — `isinstance(data, Var) and types.is_dataframe(data._var_type)` appears character-identically in 2 files — packages/reflex-components-dataeditor/src/reflex_components_dataeditor/dataeditor.py, packages/reflex-components-gridjs/src/reflex_components_gridjs/datatable.py. 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 REDACTED:1750 — `isinstance(field.type_, type) and issubclass(field.type_, ClientStorageBase)` appears character-identically in 2 files — REDACTED, reflex/utils/telemetry_accounting.py. 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 packages/reflex-bench/src/reflex_bench/drivers/echo_server.py:109 — `isinstance(message, str) and message.startswith(EVENT_PREFIX)` appears character-identically in 2 files — packages/reflex-bench/src/reflex_bench/drivers/echo_server.py, packages/reflex-bench/src/reflex_bench/drivers/events.py. 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 packages/reflex-bench/src/reflex_bench/drivers/events.py:659 — `isinstance(opened, str) and opened.startswith(OPEN_PREFIX)` appears character-identically in 2 files — packages/reflex-bench/src/reflex_bench/drivers/events.py, packages/reflex-bench/src/reflex_bench/suites/wire.py. 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 packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:284 — `meta.get("title_tag") or meta.get("title", "")` appears character-identically in 2 files — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py, packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py. 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 packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py:120 — `not image or image.startswith(("http://", "https://"))` appears character-identically in 2 files — packages/reflex-site-shared/src/reflex_site_shared/lib/meta/meta.py, packages/reflex-site-shared/src/reflex_site_shared/meta/meta.py. 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 packages/reflex-base/src/reflex_base/utils/format.py:244 — `part.startswith("[") and part.endswith("]")` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/utils/format.py, reflex/compiler/utils.py. 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 packages/reflex-components-radix/src/reflex_components_radix/themes/components/text_area.py:102 — `props.get("value") is not None and props.get("on_change") is not None` appears character-identically in 2 files — packages/reflex-components-radix/src/reflex_components_radix/themes/components/text_area.py, packages/reflex-components-radix/src/reflex_components_radix/themes/components/text_field.py. 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 packages/reflex-bench/src/reflex_bench/machine.py:363 — `python_version or platform.python_version()` appears character-identically in 2 files — packages/reflex-bench/src/reflex_bench/machine.py, packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/deployments.py. 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 packages/reflex-base/src/reflex_base/utils/log.py:228 — `record.exc_info and record.exc_info[0] is not None` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/utils/log.py, packages/reflex-hosting-cli/src/reflex_cli/utils/log.py. 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 packages/reflex-base/src/reflex_base/components/props.py:101 — `self.default is MISSING and self.default_factory is None` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/components/props.py, packages/reflex-base/src/reflex_base/vars/base.py. 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 packages/reflex-base/src/reflex_base/vars/base.py:676 — `serialized_data[0] == "-" and serialized_data[1:].isnumeric()` appears character-identically in 2 files — packages/reflex-base/src/reflex_base/vars/base.py, packages/reflex-base/src/reflex_base/vars/sequence.py. 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 REDACTED:289 — `state is not None and isinstance(token, BaseStateToken)` appears character-identically in 2 files — REDACTED, reflex/istate/manager/memory.py. 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.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×7
  • Projects may be oversized for their cohesion packages/reflex-base/pyproject.toml:1 — `packages/reflex-base` (37753 LoC, 375 module-visible types across 13 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 REDACTED:1 — `(repository root)` (27890 LoC, 168 module-visible types across 13 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 packages/reflex-bench/pyproject.toml:1 — `packages/reflex-bench` (18648 LoC, 208 module-visible types across 6 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 packages/reflex-components-internal/pyproject.toml:1 — `packages/reflex-components-internal` (7667 LoC, 296 module-visible types across 6 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 packages/reflex-site-shared/pyproject.toml:1 — `packages/reflex-site-shared` (12032 LoC, 79 module-visible types across 17 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 packages/reflex-components-core/pyproject.toml:1 — `packages/reflex-components-core` (6121 LoC, 224 module-visible types across 6 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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 docs/app/pyproject.toml:1 — `docs/app` (9900 LoC, 99 module-visible types across 17 directories) overshoots its size bounds. 7 of 28 build unit(s) (Python, npm) overshoot their size bounds, lowering Project Cohesion to 5.1/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.
X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×5
  • Diagnostic log message is built whether or not it is wanted reflex/model.py:280 — `debug` at line 280 is called with an argument built by `sorted(map(str, bases))` (line 280), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted reflex/utils/exec.py:660 — `debug` at line 660 is called with an argument built by `list(map(str, override_dirs))` (line 660), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted reflex/utils/exec.py:735 — `debug` at line 735 is called with an argument built by `list(map(str, reload_paths))` (line 735), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted reflex/utils/migrations.py:92 — `debug` at line 92 is called with an argument built by `"…".join(args)` (line 93), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted packages/reflex-hosting-cli/src/reflex_cli/utils/dependency.py:119 — `debug` at line 119 is called with an argument built by `"…".join(current_requirements_lines)` (line 119), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
D16 · Bus Factor · Off-boarding risk · ×4
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 15 significant file(s) lose their only recent owner: packages/reflex-build-sdk/src/reflex_build_sdk/types.py, packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/apps.py, packages/reflex-workflow/src/reflex_workflow/engine/handles.py, packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/projects.py, packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/providers.py, packages/reflex-build-sdk/src/reflex_build_sdk/_async/resources/deployments.py, packages/reflex-build-sdk/src/reflex_build_sdk/_decode.py, packages/reflex-build-sdk/src/reflex_build_sdk/_base.py (+7 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 11 significant file(s) lose their only recent owner: packages/reflex-release/src/reflex_release/commands.py, packages/reflex-release/src/reflex_release/scaffold.py, packages/reflex-release/src/reflex_release/devpins.py, packages/reflex-release/src/reflex_release/discovery.py, packages/reflex-release/src/reflex_release/cli.py, scripts/check_outdated_deps.py, packages/reflex-release/src/reflex_release/gitutil.py, packages/reflex-base/src/reflex_base/components/app_wraps.py (+3 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: packages/reflex-components-internal/src/reflex_components_internal/components/base/menu.py, packages/reflex-components-internal/src/reflex_components_internal/components/base/drawer.py, packages/reflex-components-internal/src/reflex_components_internal/components/base/number_field.py, packages/reflex-components-internal/src/reflex_components_internal/components/base/otp_field.py, packages/reflex-site-shared/src/reflex_site_shared/integrations.py, packages/reflex-components-internal/src/reflex_components_internal/components/base/badge.py. Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 6 significant file(s) lose their only recent owner: packages/reflex-base/src/reflex_base/components/memoize_helpers.py, packages/reflex-base/src/reflex_base/plugins/base.py, packages/reflex-base/src/reflex_base/constants/compiler.py, packages/reflex-base/src/reflex_base/components/tags/iter_tag.py, packages/reflex-base/src/reflex_base/utils/streaming_response.py, packages/reflex-base/src/reflex_base/telemetry_context.py. Pair on, review, or document these before any departure.
D34 · Knowledge Freshness · Orphaned file · ×3
  • Orphaned file packages/reflex-components-radix/src/reflex_components_radix/themes/layout/list.py: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 packages/reflex-components-radix/src/reflex_components_radix/primitives/slider.py: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 reflex/app_mixins/middleware.py: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.
D24 · Comment Value · redundant comment · ×2
  • redundant comment packages/reflex-frontend/src/utils/react-theme.js:70 — "Load saved theme from localStorage" repeats the code it sits on: 4 of its 5 words (saved, theme, local, storage) are already in `const savedTheme = localStorage.getItem("theme") || defaultTheme;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:1117 — "Get backend URL object from the endpoint." repeats the code it sits on: 4 of its 5 words (get, backend, url, endpoint) are already in `const endpoint = getBackendURL(EVENTURL);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D31 · IaC & Container Security · Low IaC · ×2
  • REDACTED
  • REDACTED
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×2
  • Silent fallback default on parse failure docs/app/reflex_docs/pages/docs/component.py:280 — `safe_issubclass` returns `False` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure packages/reflex-docgen/src/reflex_docgen/_class.py:478 — `_format_signature` returns `'(...)'` when `(ValueError, TypeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. 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 handler or in the docstring, 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.
D10 · Test Quality · Mock-dominated test · ×1
  • Mock-dominated test: preventDefault and stopPropagation act on the dom event among the args packages/reflex-frontend/tests/state.test.js:533 — This test sets up 3 test doubles (for example `vi.fn`) against 0 real object(s) of its own, and its only verification is 4 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.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (39 single-owned of 369 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; 369 of the 634 production source files in this repository met that bar). They are 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: packages/reflex-site-shared/src/reflex_site_shared/backend/demo_requests.py.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found REDACTED:88 — 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 `REDACTED` makes this repository a deployable product (line 88).
D28 · Secrets (history) · Algolia API key used for search · ×1
  • REDACTED
D28 · Secrets (history) · Rotate the exposed credentials · ×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 files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 3 of 369 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 369 of the 634 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: packages/reflex-components-radix/src/reflex_components_radix/themes/layout/list.py, packages/reflex-components-radix/src/reflex_components_radix/primitives/slider.py, reflex/app_mixins/middleware.py. 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
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
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 12/13 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `packages/reflex-release`.
S1 · Web-Security Posture · No security response headers detected · ×1
  • No security response headers detected docker-example/production-compose/Caddyfile:7 — 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 configured — defense in depth, even when a reverse proxy could set them. This is reported because `Caddyfile` is committed to this repository and declares the server that serves it, so the configuration that would carry these headers is in this repository and was read in full. (−2.0 on this card.)
X5 · Nullable reference types · Strict null checking is not enabled everywhere the repository type-checks · ×1
  • Strict null checking is not enabled everywhere the repository type-checks — 0/2 of this repository's type-checking configuration(s) turn on strict null checking (`"strict": true`, or `"strictNullChecks": true`). A configuration that states neither is counted as OFF, because off is tsc's own default; a solution-style one whose `"files"` is empty and whose `"references"` point at other projects is in neither number, because it checks no source itself. Where it is off, `string` admits `null` and `undefined`: passing a value that is null compiles silently and throws on the first property access.
X7 · Silent fallback defaults · Silent fallback default in catch · ×1
  • Silent fallback default in catch packages/reflex-bench/src/reflex_bench/drivers/bench_page.js:18 — `read` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing.
Minor — 2 finding(s)
D12 · Dependency Hygiene · Dependency hygiene PARTLY measured · ×1
  • Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 43 shipped distribution(s) across 25 manifest(s) (23 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, REDACTED, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
D24 · Comment Value · doc comments repeat the names · ×1
  • doc comments repeat the names REDACTED:915 — 2 of 180 documented parameters and 1 of 113 summaries in `reflex-frontend` only repeat the member or parameter name (e.g. "The current event." for `event`). Delete the restating tags, or add what the name does not say.

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-08cfcae7e91c40bba1c06970d3a804a3/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-08cfcae7e91c40bba1c06970d3a804a3/history-1.json --exit-code 0 --source .3artifacts/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=3200" --report-format json --report-path /tmp/watchdog-gitleaks-08cfcae7e91c40bba1c06970d3a804a3/history-2.json --exit-code 0 --source .1artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=198" --report-format json --report-path /tmp/watchdog-gitleaks-08cfcae7e91c40bba1c06970d3a804a3/history-3.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-3.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-08cfcae7e91c40bba1c06970d3a804a3/tree.json --exit-code 0 --source .2artifacts/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 packages/reflex-build-sdk/src/reflex_build_sdk/_sync --exclude tests/units/reflex_base/utils/pyi_generator/golden/sub_package --exclude tests/units/reflex_build_sdk/_sync .46artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .2artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .13artifacts/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. semgrep could not parse 3 file(s) — `packages/reflex-base/src/reflex_base/event/__init__.py`, `packages/reflex-bench/src/reflex_bench/subjects.py`, `packages/reflex-components-core/src/reflex_components_core/core/match.py` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
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 01a1e382-f4ef-7c24-9be0-87097f359f77 · 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