Public report of unclecode/crawl4ai, published 14 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, 14 November 2026, 00:28 UTC · Survey ID cd_f43e99f5e05e4484b7f43ca57ae41c78

unclecode/crawl4ai

Measured 14 November 2026, 00:25 UTC, at code version cae74b2

CAI score 37out of 100 At risk Up 3 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 medium codebase: 46,577 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.6 person-years · Weakest lens: Code Health, 22

Findings by how serious they are

118 critical 552 serious 96 minor

11 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
14 November 2026, 00:25 UTC

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

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

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

71of 71 dimensions measured by tools.
746of 766 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.
71dimensions across 7 lenses, read from 46,577 lines of product code in 2 projects.
Chapters

Executive summary

unclecode/crawl4ai is rated At risk because critical security findings are open, most of them in the packages it uses. It scores 37 out of 100, which the At risk rating leaves unchanged. We judged it as a preview release, against a lower bar.

Code Health, at 22, is the weakest lens and counts most in the score. The best first step is fixing the password or key in the code, worth about 4 points. Adding type checking would lift Code Health itself, also worth about 4. Raising Code Health to 67 would lift the score to about 48.

Thirty-five known security holes in the packages the code depends on can be used by attackers. Fourteen pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and twenty controls can't be used without a mouse. Updating the vulnerable packages, pinning each tool to an exact version and making the controls work with a keyboard would close these risks. Limiting each secret to its own step would fix the five secrets exposed to more of the pipeline than needed, and the three pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions. The 19 form fields without a label need a label.

The product code is 46,577 lines, about €85,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 22 · counts for 46%Production Readiness 39 · counts for 25%Accessibility 45 · counts for 14%Performance 60 · counts for 8%Security and Compliance 72 · counts for 4%Maturity 73 · counts for 2%Architecture 90 · counts for 1%

If Code Health rose from 22 to 67, the lowest score rated Strong, the score would rise from 37 to about 48.

Code composition: what the lines of code are
Product code 47%Tests 53%
New since the last survey: 56 findings

These 56 critical or serious findings weren't in the previous survey, on 25 October 2026.

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: 373 findings

These 373 critical or serious findings were in the previous survey, on 25 October 2026, and are gone from this one. The first 100 are listed here.

  • Cyclomatic Complexity · ask-ai.document.addEventListener("DOMContentLoaded") (cyclomatic 70) docs/md_v2/ask_ai/ask-ai.js
  • Cyclomatic Complexity · graph_view_template.html.initializeGraph (cyclomatic 60) docs/apps/linkdin/templates/graph_view_template.html
  • Cyclomatic Complexity · RecordingManager.eventToCommand (cyclomatic 41) docs/md_v2/apps/c4a-script/assets/app.js
  • Cyclomatic Complexity · page_actions.document.addEventListener("DOMContentLoaded") (cyclomatic 40) docs/md_v2/assets/page_actions.js
  • Cyclomatic Complexity · ScriptBuilder.injectEventCapture::captureEvent (cyclomatic 37) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cyclomatic Complexity · BlocklyManager.parseLineToBlock (cyclomatic 33) docs/md_v2/apps/c4a-script/assets/blockly-manager.js
  • Cyclomatic Complexity · RecordingManager.handleRecordedEvent (cyclomatic 32) docs/md_v2/apps/c4a-script/assets/app.js
  • Cyclomatic Complexity · crawl4ai_v0_7_0_showcase.link_preview_demo (cyclomatic 29) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cyclomatic Complexity · ScriptBuilder.handleRecordedEvent (cyclomatic 29) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cyclomatic Complexity · cloud-banner.init (cyclomatic 28) docs/md_v2/assets/cloud-banner.js
  • Cyclomatic Complexity · ScriptBuilder.flushKeyBuffer (cyclomatic 27) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cyclomatic Complexity · index.html.runCrawl (cyclomatic 25) deploy/docker/static/playground/index.html
  • Cyclomatic Complexity · selection_ask_ai.document.addEventListener("DOMContentLoaded") (cyclomatic 24) docs/md_v2/assets/selection_ask_ai.js
  • Cyclomatic Complexity · server.mock_compile (cyclomatic 22) docs/md_v2/apps/c4a-script/server.py
  • Cyclomatic Complexity · ContentAnalyzer.identifySemanticRegions (cyclomatic 20) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cyclomatic Complexity · AdminDashboard.getAppForm (cyclomatic 20) docs/md_v2/marketplace/admin/admin.js
  • Cyclomatic Complexity · AppDetailPage.renderAppDetails (cyclomatic 20) docs/md_v2/marketplace/app-detail.js
  • Cyclomatic Complexity · ContentAnalyzer.extractMetadata (cyclomatic 19) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cyclomatic Complexity · ScriptBuilder.generateJavaScript (cyclomatic 19) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cyclomatic Complexity · MarketplaceUI.loadFeaturedContent (cyclomatic 19) docs/md_v2/marketplace/frontend/marketplace.js
  • Cyclomatic Complexity · MarketplaceUI.loadFeaturedContent (cyclomatic 19) docs/md_v2/marketplace/marketplace.js
  • Cyclomatic Complexity · ScriptBuilder.getEventDetail (cyclomatic 18) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cyclomatic Complexity · github_stats.document.addEventListener("DOMContentLoaded") (cyclomatic 17) docs/md_v2/assets/github_stats.js
  • Cyclomatic Complexity · crawl4ai_v0_7_0_showcase.adaptive_crawling_demo (cyclomatic 16) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cyclomatic Complexity · RecordingManager.flushKeyBuffer (cyclomatic 16) docs/md_v2/apps/c4a-script/assets/app.js
  • Cyclomatic Complexity · content.chrome.runtime.onMessage.addListener() (cyclomatic 16) docs/md_v2/apps/crawl4ai-assistant/content/content.js
  • Cyclomatic Complexity · toc.document.addEventListener("DOMContentLoaded") (cyclomatic 16) docs/md_v2/assets/toc.js
  • Cognitive Complexity · ask-ai.document.addEventListener("DOMContentLoaded") (cognitive 85) docs/md_v2/ask_ai/ask-ai.js
  • Cognitive Complexity · graph_view_template.html.initializeGraph (cognitive 63) docs/apps/linkdin/templates/graph_view_template.html
  • Cognitive Complexity · crawl4ai_v0_7_0_showcase.link_preview_demo (cognitive 53) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cognitive Complexity · RecordingManager.eventToCommand (cognitive 52) docs/md_v2/apps/c4a-script/assets/app.js
  • Cognitive Complexity · BlocklyManager.parseLineToBlock (cognitive 50) docs/md_v2/apps/c4a-script/assets/blockly-manager.js
  • Cognitive Complexity · RecordingManager.handleRecordedEvent (cognitive 44) docs/md_v2/apps/c4a-script/assets/app.js
  • Cognitive Complexity · page_actions.document.addEventListener("DOMContentLoaded") (cognitive 43) docs/md_v2/assets/page_actions.js
  • Cognitive Complexity · ScriptBuilder.handleRecordedEvent (cognitive 41) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cognitive Complexity · server.mock_compile (cognitive 40) docs/md_v2/apps/c4a-script/server.py
  • Cognitive Complexity · index.html.runCrawl (cognitive 40) deploy/docker/static/playground/index.html
  • Cognitive Complexity · DatabaseManager._create_or_update_table (cognitive 39) docs/md_v2/marketplace/backend/database.py
  • Cognitive Complexity · ScriptBuilder.injectEventCapture::captureEvent (cognitive 33) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cognitive Complexity · cloud-banner.init (cognitive 30) docs/md_v2/assets/cloud-banner.js
  • Cognitive Complexity · ContentAnalyzer.analyzeRelationships (cognitive 29) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cognitive Complexity · ContentAnalyzer.extractMetadata (cognitive 27) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cognitive Complexity · selection_ask_ai.document.addEventListener("DOMContentLoaded") (cognitive 27) docs/md_v2/assets/selection_ask_ai.js
  • Cognitive Complexity · crawl4ai_v0_7_0_showcase.adaptive_crawling_demo (cognitive 25) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cognitive Complexity · MarkdownConverter.convertTable (cognitive 25) docs/md_v2/apps/crawl4ai-assistant/content/markdownConverter.js
  • Cognitive Complexity · ContentAnalyzer.identifySemanticRegions (cognitive 24) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cognitive Complexity · crawl4ai_v0_7_0_showcase.c4a_script_demo (cognitive 23) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cognitive Complexity · 8.test_adaptive_crawler_embedding (cognitive 22) docs/releases_review/demo_v0.7.8.py
  • Cognitive Complexity · content.chrome.runtime.onMessage.addListener() (cognitive 22) docs/md_v2/apps/crawl4ai-assistant/content/content.js
  • Cognitive Complexity · ScriptBuilder.generateJavaScript (cognitive 22) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cognitive Complexity · AppDetailPage.renderAppDetails (cognitive 22) docs/md_v2/marketplace/app-detail.js
  • Cognitive Complexity · crawl4ai_v0_7_0_showcase.interactive_menu (cognitive 20) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cognitive Complexity · 8.print_summary (cognitive 20) docs/releases_review/demo_v0.7.8.py
  • Cognitive Complexity · 0.print_summary (cognitive 20) docs/releases_review/demo_v0.8.0.py
  • Cognitive Complexity · 5.print_summary (cognitive 20) docs/releases_review/demo_v0.8.5.py
  • Cognitive Complexity · index.html.runStressTest (cognitive 20) deploy/docker/static/playground/index.html
  • Cognitive Complexity · ScriptBuilder.flushKeyBuffer (cognitive 20) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cognitive Complexity · toc.document.addEventListener("DOMContentLoaded") (cognitive 20) docs/md_v2/assets/toc.js
  • Cognitive Complexity · 8.test_import_formatting (cognitive 19) docs/releases_review/demo_v0.7.8.py
  • Cognitive Complexity · BlocklyManager.parseC4AToBlocks (cognitive 19) docs/md_v2/apps/c4a-script/assets/blockly-manager.js
  • Cognitive Complexity · ContentAnalyzer.identifyContentType (cognitive 19) docs/md_v2/apps/crawl4ai-assistant/content/contentAnalyzer.js
  • Cognitive Complexity · AdminDashboard.getAppForm (cognitive 19) docs/md_v2/marketplace/admin/admin.js
  • Cognitive Complexity · c4ai_discover.async_main (cognitive 18) docs/apps/linkdin/c4ai_discover.py
  • Cognitive Complexity · c4ai_insights.build_company_graph (cognitive 18) docs/apps/linkdin/c4ai_insights.py
  • Cognitive Complexity · crawl4ai_v0_7_0_showcase.url_seeder_demo (cognitive 18) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Cognitive Complexity · MarkdownConverter.postProcessTextOnly (cognitive 18) docs/md_v2/apps/crawl4ai-assistant/content/markdownConverter.js
  • Cognitive Complexity · utils.getElementSelector (cognitive 18) docs/md_v2/apps/crawl4ai-assistant/content/shared/utils.js
  • Cognitive Complexity · ScriptBuilder.getEventDetail (cognitive 17) docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Cognitive Complexity · server.search (cognitive 16) docs/md_v2/marketplace/backend/server.py
  • Cognitive Complexity · ApiHandler.chatStream (cognitive 16) docs/apps/linkdin/templates/ai.js
  • Cognitive Complexity · github_stats.document.addEventListener("DOMContentLoaded") (cognitive 16) docs/md_v2/assets/github_stats.js
  • God Classes · ClassTooLong: ScriptBuilder docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • God Classes · FunctionTooLong: ask-ai.document.addEventListener("DOMContentLoaded") docs/md_v2/ask_ai/ask-ai.js
  • God Classes · FileTooLong: content/scriptBuilder.js docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • God Classes · TooManyMethods: ScriptBuilder docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • God Classes · FunctionTooLong: page_actions.document.addEventListener("DOMContentLoaded") docs/md_v2/assets/page_actions.js
  • God Classes · FileTooLong: releases_review/crawl4ai_v0_7_0_showcase.py docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • God Classes · FileTooLong: assets/app.js docs/md_v2/apps/c4a-script/assets/app.js
  • God Classes · FileTooLong: admin/admin.js docs/md_v2/marketplace/admin/admin.js
  • God Classes · TooManyMethods: AdminDashboard docs/md_v2/marketplace/admin/admin.js
  • God Classes · TooManyMethods: MarkdownConverter docs/md_v2/apps/crawl4ai-assistant/content/markdownConverter.js
  • God Classes · FileTooLong: templates/graph_view_template.html docs/apps/linkdin/templates/graph_view_template.html
  • God Classes · FileTooLong: scripts/update_stats.py scripts/update_stats.py
  • God Classes · FileTooLong: monitor/index.html deploy/docker/static/monitor/index.html
  • God Classes · ClassTooLong: MarkdownConverter docs/md_v2/apps/crawl4ai-assistant/content/markdownConverter.js
  • God Classes · FunctionTooLong: selection_ask_ai.document.addEventListener("DOMContentLoaded") docs/md_v2/assets/selection_ask_ai.js
  • God Classes · MethodTooLong: BlocklyManager.generateToolbox docs/md_v2/apps/c4a-script/assets/blockly-manager.js
  • God Classes · MethodTooLong: ScriptBuilder.injectEventCapture docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js
  • Code Duplication · Edited copy of a member (34 corresponding lines) crawl4ai/cli.py
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) docs/md_v2/marketplace/backend/server.py
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) docs/md_v2/marketplace/backend/server.py
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) docs/releases_review/demo_v0.7.6.py
  • Code Duplication · Duplicated block (105 lines × 2) docs/examples/c4a_script/tutorial/server.py
  • Code Duplication · Duplicated block (65–68 lines × 2) docs/examples/docker_hooks_examples.py
  • Code Duplication · Duplicated block (56 lines × 2) docs/examples/c4a_script/tutorial/server.py
  • Code Duplication · Duplicated block (45–46 lines × 2) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Code Duplication · Duplicated block (41–43 lines × 2) docs/examples/docker_hooks_examples.py
  • Code Duplication · Duplicated block (42 lines × 2) docs/examples/docker_hooks_examples.py
  • Code Duplication · Duplicated block (19–34 lines × 3) docs/releases_review/crawl4ai_v0_7_0_showcase.py
  • Code Duplication · Duplicated block (30–34 lines × 3) docs/releases_review/demo_v0.7.8.py
Rebuild cost: about €85,000 · Estimate
Cost to rebuild€28,000 to €140,000, for 471 to 1,495 hours of work, about 0.6 person-years for 1 to 2 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.7 at a score of 37. 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.
SizeMedium: 46,577 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 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 4 points · Low effort · Secret Scanning
2
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 4 points · Medium effort · Type Safety
3
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
Raises the score by about 4 points · Medium effort · Dead Code

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 €85,000 to build again, about 0.6 person-years of work. Its weakest lens is Code Health, at 22 (Critical). 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 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for low effort, because it clears the 1 Secret Scanning 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 5.3 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 7% to 15% on every change. The history of the code shows how much it changes: about 11,910 lines over the last 90 days, which is about 48,302 lines a year. At that pace, the extra work comes to an estimated 8.2 to 49.4 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: 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.

127 modules, with 59 dependencies between them. Every module uses only modules listed above it, so there are no loops.

The table shows the 40 modules with the most connections; 87 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 crawl4ai.async_logger2 crawl4ai.async_url_seeder3 crawl4ai.browser_adapter4 crawl4ai.browser_profiler5 crawl4ai.cache_context6 crawl4ai.chunking_strategy7 crawl4ai.content_filter_strategy8 crawl4ai.deep_crawling.base_strategy9 crawl4ai.deep_crawling.filters10 crawl4ai.extraction_strategy11 crawl4ai.hub12 crawl4ai.legacy.crawler_strategy13 crawl4ai.models14 crawl4ai.script.c4a_result15 deploy.docker.utils16 crawl4ai.adaptive_crawler17 crawl4ai.async_database18 crawl4ai.async_dispatcher19 crawl4ai.content_filter_strategy_lxml20 crawl4ai.content_scraping_strategy21 crawl4ai.crawlers.amazon_product.crawler22 crawl4ai.crawlers.google_search.crawler23 crawl4ai.deep_crawling.bff_strategy24 crawl4ai.deep_crawling.bfs_strategy25 crawl4ai.domain_mapper26 crawl4ai.legacy.web_crawler27 crawl4ai.markdown_generation_strategy28 crawl4ai.script29 crawl4ai.script.c4a_compile30 deploy.docker.schemas31 crawl4ai.async_configs32 crawl4ai.deep_crawling.dfs_strategy33 crawl4ai34 crawl4ai.async_crawler_strategy35 crawl4ai.browser_manager36 crawl4ai.link_preview37 crawl4ai.async_webcrawler38 crawl4ai.processors.pdf39 crawl4ai.deep_crawling.crazy40 deploy.docker
1 crawl4ai.async_logger
2 crawl4ai.async_url_seeder
3 crawl4ai.browser_adapter
4 crawl4ai.browser_profiler
5 crawl4ai.cache_context
6 crawl4ai.chunking_strategy
7 crawl4ai.content_filter_strategy
8 crawl4ai.deep_crawling.base_strategy
9 crawl4ai.deep_crawling.filters
10 crawl4ai.extraction_strategy
11 crawl4ai.hub
12 crawl4ai.legacy.crawler_strategy
13 crawl4ai.models
14 crawl4ai.script.c4a_result
15 deploy.docker.utils
16 crawl4ai.adaptive_crawler3
17 crawl4ai.async_database1
18 crawl4ai.async_dispatcher3
19 crawl4ai.content_filter_strategy_lxml1
20 crawl4ai.content_scraping_strategy2
21 crawl4ai.crawlers.amazon_product.crawler1
22 crawl4ai.crawlers.google_search.crawler1
23 crawl4ai.deep_crawling.bff_strategy11
24 crawl4ai.deep_crawling.bfs_strategy11
25 crawl4ai.domain_mapper1
26 crawl4ai.legacy.web_crawler1
27 crawl4ai.markdown_generation_strategy2
28 crawl4ai.script2
29 crawl4ai.script.c4a_compile3
30 deploy.docker.schemas1
31 crawl4ai.async_configs11111
32 crawl4ai.deep_crawling.dfs_strategy11
33 crawl4ai212
34 crawl4ai.async_crawler_strategy1133
35 crawl4ai.browser_manager3
36 crawl4ai.link_preview12
37 crawl4ai.async_webcrawler1221
38 crawl4ai.processors.pdf2211
39 crawl4ai.deep_crawling.crazy1223
40 deploy.docker1632
Uses a module listed above itPart of a loopThe module itself
1 crawl4ai.async_logger2 crawl4ai.async_url_seeder3 crawl4ai.browser_adapter4 crawl4ai.browser_profiler5 crawl4ai.cache_context6 crawl4ai.chunking_strategy7 crawl4ai.content_filter_strategy8 crawl4ai.deep_crawling.base_strategy9 crawl4ai.deep_crawling.filters10 crawl4ai.extraction_strategy11 crawl4ai.hub12 crawl4ai.legacy.crawler_strategy13 crawl4ai.models14 crawl4ai.script.c4a_result15 deploy.docker.utils16 crawl4ai.adaptive_crawler17 crawl4ai.async_database18 crawl4ai.async_dispatcher19 crawl4ai.content_filter_strategy_lxml20 crawl4ai.content_scraping_strategy21 crawl4ai.crawlers.amazon_product.crawler22 crawl4ai.crawlers.google_search.crawler23 crawl4ai.deep_crawling.bff_strategy24 crawl4ai.deep_crawling.bfs_strategy25 crawl4ai.domain_mapper26 crawl4ai.legacy.web_crawler27 crawl4ai.markdown_generation_strategy28 crawl4ai.script29 crawl4ai.script.c4a_compile30 deploy.docker.schemas31 crawl4ai.async_configs32 crawl4ai.deep_crawling.dfs_strategy33 crawl4ai34 crawl4ai.async_crawler_strategy35 crawl4ai.browser_manager36 crawl4ai.link_preview37 crawl4ai.async_webcrawler38 crawl4ai.processors.pdf39 crawl4ai.deep_crawling.crazy40 deploy.dockercrawl4ai.async_logger1crawl4ai.async_url_seeder2crawl4ai.browser_adapter3crawl4ai.browser_profiler4crawl4ai.cache_context5crawl4ai.chunking_strategy6crawl4ai.content_filter_strategy7crawl4ai.deep_crawling.base_strategy8crawl4ai.deep_crawling.filters9crawl4ai.extraction_strategy10crawl4ai.hub11crawl4ai.legacy.crawler_strategy12crawl4ai.models13crawl4ai.script.c4a_result14deploy.docker.utils15crawl4ai.adaptive_crawler16crawl4ai.async_database17crawl4ai.async_dispatcher18crawl4ai.content_filter_strategy_lxml19crawl4ai.content_scraping_strategy20crawl4ai.crawlers.amazon_product.crawler21crawl4ai.crawlers.google_search.crawler22crawl4ai.deep_crawling.bff_strategy23crawl4ai.deep_crawling.bfs_strategy24crawl4ai.domain_mapper25crawl4ai.legacy.web_crawler26crawl4ai.markdown_generation_strategy27crawl4ai.script28crawl4ai.script.c4a_compile29deploy.docker.schemas30crawl4ai.async_configs31crawl4ai.deep_crawling.dfs_strategy32crawl4ai33crawl4ai.async_crawler_strategy34crawl4ai.browser_manager35crawl4ai.link_preview36crawl4ai.async_webcrawler37crawl4ai.processors.pdf38crawl4ai.deep_crawling.crazy39deploy.docker4031312111111112231111111121211333121221221112231632+87 more modules (most-connected shown)

At a glance — Code Health · 22% · Weak · gated by D1, D2, R1, R2, R3, R7, X4 ·

At a glance — Architecture · 90% · Adequate · gated by D26 ·

At a glance — Maturity · 73% · Strong ·

At a glance — Readiness · 39% · Weak · gated by D12, P3, P7 ·

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

At a glance — Accessibility · 45% · Adequate · gated by AC4, AC6 ·

At a glance — Performance · 60% · Adequate ·

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
A03:2025 — Software Supply Chain Failures63High / Critical
A05:2025 — Injection48High / Critical
A02:2025 — Security Misconfiguration5High / Critical
A07:2025 — Authentication Failures3High / Critical

Roadmap

Top priorities: Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up; Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value; Bring the 61 bodies over 30 down to 30 or less in Cognitive Complexity — start with HTML2Text.handle_tag (cognitive 353), AsyncWebCrawler.arun (cognitive 192), LXMLWebScrapingStrategy._scrap (cognitive 166).

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

Do thisHelpsEffortDimension
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.+3.8 ptsLowSecret Scanning
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.+4.3 ptsMediumType Safety
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.+4.3 ptsMediumDead Code
Bring the 61 bodies over 30 down to 30 or less in Cognitive Complexity — start with HTML2Text.handle_tag (cognitive 353), AsyncWebCrawler.arun (cognitive 192), LXMLWebScrapingStrategy._scrap (cognitive 166).+4.1 ptsHighCognitive Complexity
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.+2.6 ptsMediumSecurity & performance tooling
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+2.3 ptsMediumKeyboard semantics
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.+2.2 ptsMediumVisual & motion safety
Interpolated log message defeats structured logging+1.9 ptsMediumStructured logging

File quality

Per-file score 0–10 — a quality signature. Of 70 files carrying findings, judged against the Preview bar: 9% slop · 25% mixed · 66% near-clean.

FileScoreBandWorst signal
REDACTED0.2SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED1.5SlopSecret Scanning: Leaked secret: REDACTED
REDACTED2.1SlopIaC & Container Security: High IaC: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.7MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
crawl4ai/deep_crawling/bff_strategy.py5.5MixedCyclomatic Complexity: BestFirstCrawlingStrategy._arun_best_first (cyclomatic 35)
REDACTED5.7MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.8MixedDependency Vulnerabilities: Critical CVE: REDACTED
crawl4ai/html2text/__init__.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 — 118

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

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

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

Could not be resolved — 11

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 71 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 — 71 dimensions across the health lenses
D1D2D3D4D6D11D12D13D14D15D16D17D19D20D24D26D27D28D29D30D31D34D35D36D37D43D44AC1AC2AC3AC4AC5AC6AX10AX2AX3AX4C2M1M2M3P1P10P2P3P4P5P6P7PF3R1R10R2R3R7R9S1X1X12X13X14X17X19X23X24X25X27X28X3X30X4

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, 746 of 766 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 01a1d772-3a95-7292-98a6-52d271ccc689.

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

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — 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.
  • 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 (setup.py), 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.
  • AC6 Visual & motion safety — 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. 14 further occurrence(s) are not listed individually; the score already reflects all 54.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (docker-compose.yml). compose up failed (exit 17 — an image could not be built) — failed to solve: process "/bin/sh -c curl -fsSL https://packages.redis.io/gpg | gpg --dearmor -o /usr/share/keyrings/redis-archive-keyring.gpg && echo \"deb [signed-by=/usr/share/keyrings/redis-archive-keyring.gpg] https://packages.redis.io/deb bookworm main\" > /etc/apt/sources.list.d/redis.list" did not complete successfully: exit code: 2; runtime evidence skipped.
  • 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. 'redis' is imported (deploy/docker/api.py:16), 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. 'redis' is imported (deploy/docker/api.py:16), 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. 'redis' is imported (deploy/docker/api.py:16), 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 and Scala 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 and Scala 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.
  • X3 Exception handling — 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. 74 further occurrence(s) are not listed individually; the score already reflects all 114.
  • 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. 48 further occurrence(s) are not listed individually; the score already reflects all 88.
  • X5 Nullable reference types — 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 and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python 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.

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

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • 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.
  • 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.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • 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 REDACTED, 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.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • 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 Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

89 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was HTML2Text.handle_tag at 165.

HTML2Text.handle_tag (cyclomatic 165)crawl4ai/html2text/__init__.py:310
AsyncPlaywrightCrawlerStrategy._crawl_web (cyclomatic 100)REDACTED:515
AsyncWebCrawler.arun (cyclomatic 87)crawl4ai/async_webcrawler.py:216
LXMLWebScrapingStrategy._scrap (cyclomatic 79)crawl4ai/content_scraping_strategy.py:649
cli.crawl_cmd (cyclomatic 59)crawl4ai/cli.py:1033

+ 84 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 Cyclomatic Complexity — start with HTML2Text.handle_tag (cyclomatic 165). — Refactoring it lifts Cyclomatic Complexity from 2.0 to about 2.7/10.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ 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 2.0 / 10 · rule-coverage 100% · ceiling Prevented

153 method(s) exceeded the cognitive complexity threshold of 15; the worst was HTML2Text.handle_tag at 353.

HTML2Text.handle_tag (cognitive 353)crawl4ai/html2text/__init__.py:310
AsyncWebCrawler.arun (cognitive 192)crawl4ai/async_webcrawler.py:216
LXMLWebScrapingStrategy._scrap (cognitive 166)crawl4ai/content_scraping_strategy.py:649
AsyncPlaywrightCrawlerStrategy._crawl_web (cognitive 155)REDACTED:515
NaivePDFProcessorStrategy._extract_images (cognitive 154)crawl4ai/processors/pdf/processor.py:251

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

What to do

  1. Bring the 61 bodies over 30 down to 30 or less in Cognitive Complexity — start with HTML2Text.handle_tag (cognitive 353), AsyncWebCrawler.arun (cognitive 192), LXMLWebScrapingStrategy._scrap (cognitive 166). — 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 61 together lifts Cognitive Complexity from 2.0 to about 5.6/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.

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

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

21 god class(es) detected.

FileTooLong: REDACTED · ×18REDACTED
TooManyMethods: AsyncPlaywrightCrawlerStrategy · ×3REDACTED:47

What to do

  1. Resolve the 18 FileTooLong finding(s) in God Classes — start with REDACTED, async_configs.py, extraction_strategy.py. — One of this dimension's main actionable groups (18 warning-level).
  2. Resolve the 3 TooManyMethods finding(s) in God Classes — start with REDACTED, REDACTED, 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 Duplication7.2 / 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 7.2 / 10 · rule-coverage 100% · ceiling Verified

75 duplicated block group(s) detected. 7.0 % of the production lines (3,258 of 46,577) are in a reported copy. A further 28 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 2 of the 103 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (11 lines × 2) · ×5crawl4ai/async_configs.py:2525
Duplicated block (5 lines × 2) · ×4REDACTED:1117
Edited copy of a member (7 corresponding lines) · ×3crawl4ai/model_loader.py:65
Duplicated block (20 lines × 2) · ×3crawl4ai/browser_profiler.py:881
Duplicated block (18 lines × 2) · ×3crawl4ai/processors/pdf/utils.py:82

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

What to do

  1. Resolve the 5 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with async_configs.py (2), REDACTED, bfs_strategy.py. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 4 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 3 Edited copy of a member (7 corresponding lines) finding(s) in Code Duplication — start with model_loader.py, async_configs.py, version_manager.py. — One of this dimension's main actionable groups (3 warning-level).

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

D6 · Cohesion (LCOM4)9.9 / 10Stronggated by 1 serious finding✓ 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.9 / 10 · rule-coverage 100% · ceiling Verified

1 of 115 classes have LCOM4 above 3.

Low cohesion: JsonLxmlExtractionStrategy (LCOM4 4)crawl4ai/extraction_strategy.py:2051

What to do

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

Detailed fixes: d6_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 1 measured tier(s). Python (repository root, 268 test files): measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

D12 · Dependency Hygiene9.8 1.5 / 10Critical✓ Tool-verified

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

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

Maturity: Documented → Verified → Prevented · effective 1.5 / 10 · rule-coverage 16% · ceiling Verified

5 outdated, 0 yanked pinned Python distributions. 7 of 45 shipped distributions were graded against pypi.org (0 not published there, 38 declared without an exact pin, which installs the newest release the declaration admits and so cannot be behind one). Only EXACT pins are graded for currency: a floor or a range already installs the newest release it admits, so reporting one would report this repository for being current. Whether a deliberate upper cap has itself gone stale is a different and weaker question, and is not asked. Whether any distribution is UNMAINTAINED is not graded — PyPI publishes no maintenance status, and release age does not stand in for one. Lockfiles are not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock), so a lock-resolved install is outside this verdict. Known CVEs in this dependency graph are D30's question.

Outdated: anyio · ×5

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

D13 · Secret Scanning5.0 / 10Adequate✓ Tool-verified

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

1 secret(s) detected.

REDACTED

What to do

  1. Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).

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

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

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

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

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

0 of 120 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 45 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (75 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. 5 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots8.8 / 10Strong✓ 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 8.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: REDACTED (7×100=700); crawl4ai/async_configs.py (17×36=612); deploy/docker/api.py (10×50=500) Repeated repair below the complexity floor: deploy/docker/server.py (10 of 11 changes were fixes); crawl4ai/processors/pdf/__init__.py (4 of 4 changes were fixes); deploy/docker/egress_proxy.py (3 of 3 changes were fixes)

Hotspot: REDACTED · ×7REDACTED:515
Repeated repair: deploy/docker/server.py · ×4deploy/docker/server.py:1103

What to do

  1. Resolve the 7 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED, async_configs.py, api.py. — One of this dimension's main actionable groups (7 warning-level).
  2. Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with server.py, __init__.py, egress_proxy.py. — One of this dimension's main actionable groups (4 warning-level).

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

D16 · Bus Factor8.8 / 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.8 / 10 · rule-coverage 100% · ceiling Documented

10 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is crawl4ai/prompts.py. Counted over 85 of the 103 production source files in this repository: 17 are under the ~2,400-byte size floor this dimension measures over, and the remaining 1 have no attributable history left to measure.

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

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 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 12 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

12 deducted task-comment markers across 46577 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 · ×11deploy/docker/monitor.py:240
FixmeCommentcrawl4ai/async_logger.py:211

What to do

  1. Resolve the 11 TodoComment finding(s) in Explicit Debt — start with __init__.py (4), async_configs.py (2), monitor.py. — One of this dimension's main actionable groups (11 warning-level).
  2. Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with async_logger.py. — 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. 8 document(s) read across 1 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 foundpyproject.toml:78

What to do

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

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

D24 · Comment Value7.7 7.4 / 10Strong✓ 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 7.4 / 10 · rule-coverage 95% · ceiling Documented

1 of 44 judged comments only repeat the code they sit on (2.3 %). 10 comment(s) in another language or script were not judged.

redundant commentcrawl4ai/crawlers/google_search/script.js:83

What to do

  1. Resolve the 1 redundant comment finding(s) in Comment Value — start with script.js. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 2 build units (Python) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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

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

D27 · Navigability8.7 / 10Strong✓ 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 8.7 / 10 · rule-coverage 100% · ceiling Documented

53 % of calls cross a namespace and 0 % go through an interface, but 51 % of collaborators are co-located — so following a call takes several hops. Baseline: small — navigation cost is tolerated.

Scattered collaborators

What to do

  1. Resolve the 1 Scattered collaborators finding(s) in Navigability. — One of this dimension's main actionable groups (1 recommendation-level).

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

D28 · Secrets (history)9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

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

REDACTED
REDACTED

What to do

  1. Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. 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.5 / 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.5 / 10 · rule-coverage 100% · ceiling Documented

48 finding(s): 0 critical, 25 high, 22 medium, 1 low. 14 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `REDACTED` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. 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 3 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

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

What to do

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

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

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

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

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

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

54 finding(s): 17 critical, 18 high, 19 medium, 0 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 17 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (17). — One of this dimension's main actionable groups (17 issue-level).
  2. Resolve the 15 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (13), REDACTED (2). — One of this dimension's main actionable groups (15 issue-level).
  3. Resolve the 2 Critical vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).

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

D31 · IaC & Container Security9.0 / 10Adequategated by 2 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 9.0 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED
REDACTED

What to do

  1. Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
  2. Resolve the 3 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-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

1 of 86 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crawl4ai/legacy/cli.py. Counted over 86 of the 103 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned files with no living knowledge
Orphaned filecrawl4ai/legacy/cli.py:1

✓ On the Gold path — maintain.

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

D35 · Change Coupling9.7 / 10Stronggated by 3 serious findings✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

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

Strongest change-coupling: database.py↔REDACTED 91%; bff_strategy.py↔bfs_strategy.py 57%; REDACTED↔database.py 55%

Change coupling: database.py ↔ REDACTED · ×3crawl4ai/legacy/database.py:1

What to do

  1. Resolve the 3 Change coupling finding(s) in Change Coupling — start with database.py, bff_strategy.py, REDACTED. — One of this dimension's main actionable groups (3 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
REDACTED

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

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AC1 · Text alternatives10.0 / 10Exemplary○ Nothing flagged

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

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

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

AC2 · Forms & labels5.0 / 10Adequate✓ Tool-verified

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

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

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

  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×5) — deploy/docker/static/monitor/index.html:98, deploy/docker/static/playground/index.html:177, docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:544, …
  • This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×9) — deploy/docker/static/monitor/index.html:114, deploy/docker/static/playground/index.html:207, docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:543, …
  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×14) — deploy/docker/static/monitor/index.html:202, deploy/docker/static/monitor/index.html:296, deploy/docker/static/playground/index.html:199, …
  • A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). (×6) — docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:103, docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:104, docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:105, …

What to do

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

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

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

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

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

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

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

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

  • The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler. (×6) — docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:31, docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:32, docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:33, …
  • A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×14) — docs/md_v2/marketplace/app-detail.js:300, docs/md_v2/marketplace/frontend/app-detail.js:317, docs/md_v2/marketplace/frontend/marketplace.js:220, …

What to do

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

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

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

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

AC6 · Visual & motion safety1.5 / 10Critical✓ 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.

  • `.pulse-fast` moves (`animation: pulse-fast 1s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — deploy/docker/static/monitor/index.html:42
  • `.spin-slow` moves (`animation: spin-slow 3s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — deploy/docker/static/monitor/index.html:48
  • `.progress-bar` moves (`transition: width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — deploy/docker/static/monitor/index.html:52
  • `.page-actions-footer` sets color: #666 on background-color: #070708 — 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/assets/page_actions.css:362
  • `.c4ai-container-selector` sets color: #666 on background-color: #1a1a1a — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:279
  • `.c4ai-cloud-modal-content .c4ai-close-modal:hover` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:912
  • `.c4ai-toolbar .c4ai-field-selector` sets color: #666 on background-color: #1a1a1a — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1007
  • `.c4ai-cloud-btn` sets color: #0fbbaa on background-color: #3f3f44 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1058
  • `.c4ai-c2c-preview .c4ai-preview-close:hover` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2486
  • `.c4ai-c2c-preview .c4ai-cloud-btn` sets color: #666 on background-color: #3f3f44 — 1.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2756
  • `.c4ai-nav-btn.c4ai-nav-deselect` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2804
  • `.btn` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×2) — docs/md_v2/apps/c4a-script/playground/styles.css:151, docs/examples/c4a_script/tutorial/playground/styles.css:151
  • `.page-btn:hover, .page-btn.active` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. (×2) — docs/md_v2/apps/c4a-script/playground/styles.css:419, docs/examples/c4a_script/tutorial/playground/styles.css:419
  • `#search-input` 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. (×2) — docs/md_v2/marketplace/marketplace.css:144, docs/md_v2/marketplace/frontend/marketplace.css:144
  • `.hamburger-line` moves (`transition: transform 0.3s, opacity 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/layout.css:215
  • `#terminal-mkdocs-side-panel` moves (`transition: left 0.3s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/layout.css:288
  • `.ask-ai-selection-button` moves (`transition: background-color 0.2s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/layout.css:420
  • `.ask-ai-selection-button` moves (`animation: askAiButtonAppear 0.2s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/layout.css:425
  • `.floating-ask-ai-button` moves (`transition: background-color 0.2s ease, transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/layout.css:532
  • `.page-actions-button::after` moves (`transition: transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/page_actions.css:46
  • `.page-actions-notification` moves (`animation: slideInFromTop 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/page_actions.css:287
  • `.page-action-link.loading .page-action-icon::before` moves (`animation: spin 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/assets/page_actions.css:348
  • `.message-thinking` moves (`animation: thinking 1s infinite ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/ask_ai/ask-ai.css:258
  • `.tool-content` moves (`animation: fadeIn 0.4s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/assistant.css:651
  • `.cloud-banner::before` moves (`animation: cloud-shimmer 4s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/assistant.css:1092
  • `.cloud-announcement::before` moves (`animation: rotate 20s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/assistant.css:1194
  • `.success-icon` moves (`animation: bounce 0.5s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/assistant.css:1499
  • `.c4ai-cloud-icon` moves (`animation: cloud-float 3s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:794
  • `.c4ai-recording-dot` moves (`animation: c4ai-pulse 1.5s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1205
  • `.c4ai-replay-progress-bar` moves (`transition: width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1808
  • `.c4ai-click-indicator` moves (`animation: c4ai-click-pulse 0.6s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1857
  • `.feature-card` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/playground/styles.css:198
  • `.modal-content` moves (`animation: modalFadeIn 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/playground/styles.css:231
  • `.product-card` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/playground/styles.css:351
  • `.spinner` moves (`animation: spin 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/playground/styles.css:393
  • `.progress-fill` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/playground/styles.css:437
  • `.tutorial-nav` moves (`transition: transform 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — docs/md_v2/apps/c4a-script/assets/app.css:487

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.

AX2 · Stateful singletons10.0 / 10Exemplary✓ Tool-verified

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

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

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.

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.
M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

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

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

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

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

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

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

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

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

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

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

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

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

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

P2 · Observability8.0 / 10Strong✓ 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.

P3 · Security & performance tooling0.0 / 10Critical✓ 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.

  • No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:8

What to do

  • Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback8.0 / 10Strong✓ Tool-verified

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

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

  • Deployment is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever reaches the release trigger goes to production unreviewed, so a mistaken merge or tag is live before anyone can stop it.

What to do

  • Add an approval/environment gate (required reviewers / protection rules) before production promotion.
P5 · DR & Backup7.0 / 10Strong✓ 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

  • No persistence guard on critical data stores — use Docker named volumes (or your orchestrator's persistent-volume equivalent) so the data store can't be wiped by a container recreate (or, in cloud, set purge-protection / soft-delete / prevent_destroy).
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. (×2) — crawl4ai/browser_profiler.py:1090, crawl4ai/browser_profiler.py:1232
  • `requests.head(` 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. (×2) — crawl4ai/content_scraping_strategy.py:109, REDACTED:1327
  • `requests.post(` 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. — REDACTED:73
  • `requests.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. (×2) — crawl4ai/legacy/docs_manager.py:41, crawl4ai/legacy/docs_manager.py:49

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.
PF3 · Async & latency hygiene6.0 / 10Adequate✓ 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.

  • `start` is async and calls subprocess.check_output — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — crawl4ai/browser_manager.py:188
  • `cleanup` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — crawl4ai/browser_manager.py:428
  • `kill_builtin_browser` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — crawl4ai/browser_profiler.py:1315
  • `fetch_docs` is async and calls requests.get — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs. — crawl4ai/legacy/docs_manager.py:21

What to do

  • Python: await the async equivalent (asyncio.sleep, an async HTTP client such as httpx.AsyncClient or aiohttp, asyncio.create_subprocess_exec), or move the blocking call off the loop with `await asyncio.to_thread(...)`; never call asyncio.run inside a coroutine — await the coroutine.
R1 · Type Safety0.0 / 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.

  • 0 typed · 6 plain JS — the untyped files are crawl4ai/crawlers/google_search/script.js, crawl4ai/js_snippet/flatten_shadow_dom.js, crawl4ai/js_snippet/navigator_overrider.js, crawl4ai/js_snippet/remove_consent_popups.js, crawl4ai/js_snippet/remove_overlay_elements.js, crawl4ai/js_snippet/update_image_dimensions.js.

What to do

  • Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
R10 · Code Duplication8.2 / 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.

  • docs/examples/c4a_script/tutorial/ and docs/md_v2/apps/c4a-script/ are near-verbatim copies of each other: 20 files are byte-identical under the same relative paths (~6921 lines; the trees hold 21 and 21 files). That is one structural fact, not 20 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place. — docs/md_v2/apps/c4a-script/assets/app.js:1
  • crawl4ai/js_snippet/flatten_shadow_dom.js:19 · crawl4ai/js_snippet/flatten_shadow_dom.js:53 — the two spans are one implementation copied and then locally edited — 155 tokens are still identical, in the same order in both spans, 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. — crawl4ai/js_snippet/flatten_shadow_dom.js:19

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 Complexity2.9 / 10Weak✓ 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.

  • (anonymous) has cyclomatic complexity 44 and cognitive complexity 87; 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. — crawl4ai/js_snippet/remove_consent_popups.js:1
  • serializeShadowChild has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — crawl4ai/js_snippet/flatten_shadow_dom.js:53
  • removeOverlays has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — crawl4ai/js_snippet/remove_overlay_elements.js:59
  • extractImageData has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — crawl4ai/crawlers/google_search/script.js:3
R3 · Large Files3.3 / 10Weak✓ 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.

  • crawl4ai/js_snippet/remove_consent_popups.js has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — crawl4ai/js_snippet/remove_consent_popups.js:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R7 · Dead Code0.0 / 10Critical✓ 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 1 application, 0 tooling and 0 test entry point(s) detected in this repo. This repository declares no build, type-check or test script, so nothing here would fail on a wrong deletion — confirm by hand that nothing loads each file (including by a path built at runtime) before removing it. An undetected custom entry would make these reachable.
  • no import path from any entry point (1 application, 0 tooling, 0 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) — crawl4ai/js_snippet/remove_consent_popups.js, crawl4ai/js_snippet/remove_overlay_elements.js, crawl4ai/js_snippet/flatten_shadow_dom.js, …

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
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 — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. 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.

  • `https://cdn.tailwindcss.com` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 8 such include(s) across the repository's markup. — deploy/docker/static/monitor/index.html:7

What to do

  • Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
X1 · Async correctness7.8 / 10Strong✓ Tool-verified

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.

  • The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception. (×3) — crawl4ai/browser_manager.py:2017, crawl4ai/browser_profiler.py:506, crawl4ai/browser_profiler.py:1045

What to do

  • Task from `asyncio.create_task` is not kept
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.2 / 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.

  • `to_serializable_dict` is public and takes `obj: Any` from its caller, and it calls itself at line 573 (`to_serializable_dict`) with a piece of `obj` (and at line 577, line 583, line 611) — and nowhere in `to_serializable_dict` 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 `to_serializable_dict` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crawl4ai/async_configs.py:573
  • `from_serializable_dict` is public and takes `data: Any` from its caller, and it calls itself at line 676 (`from_serializable_dict`) with a piece of `data` (and at line 730, line 736, line 740) — and nowhere in `from_serializable_dict` 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 `from_serializable_dict` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crawl4ai/async_configs.py:676
  • `__init__` is public, takes a document from its caller (line 25) and hands it to `_decode_cert_data`, which calls itself at line 54 (`self._decode_cert_data`) with a piece of `data` (and at line 58) — and nowhere in `_decode_cert_data` 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 `_decode_cert_data` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — crawl4ai/ssl_certificate.py:54

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.

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

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

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

X24 · Document value interpolated into markup unescaped6.4 / 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.

  • `tag.text` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the text of an element of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `tag.text` at this site, or validate it against the shape the position accepts before interpolating it. — REDACTED:906

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 handling5.1 / 10Adequate✓ 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.

  • 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. (×34) — deploy/docker/api.py:912, deploy/docker/api.py:929, deploy/docker/api.py:951, …
  • `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. (×6) — deploy/docker/utils.py:406, crawl4ai/async_configs.py:836, REDACTED:632, …

What to do

  • Swallowed exception (empty catch)
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 logging2.6 / 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.

  • `warning` at line 112 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. — deploy/docker/api.py:112
  • `error` at line 195 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. — deploy/docker/api.py:195
  • `error` at line 318 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. — deploy/docker/api.py:318
  • `error` at line 413 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. — deploy/docker/api.py:413
  • `error` at line 478 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. — deploy/docker/api.py:478
  • `info` at line 634 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. — deploy/docker/api.py:634
  • `error` at line 638 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. — deploy/docker/api.py:638
  • `info` at line 815 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. — deploy/docker/api.py:815
  • `info` at line 857 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. — deploy/docker/api.py:857
  • `warning` at line 870 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. — deploy/docker/api.py:870
  • `error` at line 891 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. — deploy/docker/api.py:891
  • `error` at line 943 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. — deploy/docker/api.py:943
  • `info` at line 1047 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. — deploy/docker/api.py:1047
  • `error` at line 1096 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. — deploy/docker/api.py:1096
  • `info` at line 94 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. — REDACTED:94
  • `info` at line 107 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. — REDACTED:107
  • `info` at line 119 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. — REDACTED:119
  • `error` at line 125 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:125
  • `info` at line 129 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. — REDACTED:129
  • `info` at line 200 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. — REDACTED:200
  • `info` at line 221 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. — REDACTED:221
  • `info` 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.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. — REDACTED:237
  • `warning` at line 176 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. — deploy/docker/monitor.py:176
  • `error` at line 188 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. — deploy/docker/monitor.py:188
  • `error` at line 217 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. — deploy/docker/monitor.py:217
  • `warning` at line 227 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. — deploy/docker/monitor.py:227
  • `error` at line 22 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. — deploy/docker/monitor_routes.py:22
  • `error` at line 55 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. — deploy/docker/monitor_routes.py:55
  • `error` at line 84 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. — deploy/docker/monitor_routes.py:84
  • `error` at line 95 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. — deploy/docker/monitor_routes.py:95
  • `error` at line 117 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. — deploy/docker/monitor_routes.py:117
  • `error` at line 132 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. — deploy/docker/monitor_routes.py:132
  • `error` at line 147 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. — deploy/docker/monitor_routes.py:147
  • `info` at line 171 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. — deploy/docker/monitor_routes.py:171
  • `error` at line 184 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. — deploy/docker/monitor_routes.py:184
  • `warning` at line 230 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. — deploy/docker/monitor_routes.py:230
  • `info` at line 244 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. — deploy/docker/monitor_routes.py:244
  • `error` at line 253 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. — deploy/docker/monitor_routes.py:253
  • `info` at line 327 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. — deploy/docker/monitor_routes.py:327
  • `error` at line 336 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. — deploy/docker/monitor_routes.py:336

What to do

  • Interpolated log message defeats structured logging

WCAG coverage — what static analysis assessed

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

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

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

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health22%Weak — gated by D1, D2, R1, R2, R3, R7, X4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture90%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity73%StrongStrongest area.
Readiness39%Weak — gated by D12, P3, P7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security72%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility45%Adequate — gated by AC4, AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance60%AdequateAcceptable, with room to improve.
Unscored — 3 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 — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 10 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 9 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 'redis' (deploy/docker/api.py:16) 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 'redis' (deploy/docker/api.py:16) 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 'redis' (deploy/docker/api.py:16) 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 — 51 check(s) not relevant to this codebase

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

  • AX1 Captive dependencies — Not applicable: this repository's 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.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — 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: process "/bin/sh -c curl -fsSL https://packages.redis.io/gpg | gpg --dearmor -o /usr/share/keyrings/redis-archive-keyring.gpg && echo \"deb [signed-by=/usr/share/keyrings/redis-archive-keyring.gpg] https://packages.redis.io/deb bookworm main\" > /etc/apt/sources.list.d/redis.list" did not complete successfully: exit code: 2; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — 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.
  • D10 Test Quality — ~53450 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • 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. 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) — 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.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D5 Coupling — Not applicable — this Python build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 49 value object(s); a Domain/Aggregates/ValueObjects layer
  • 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 and Scala, 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
  • M4 Documentation accuracy — Not applicable: the 85 current-state document(s) make no claim of a kind M4 checks. 119 claim(s) of kinds M4 does not check were not checked (path 71, command argument 2, environment variable 46); M4 checks only links and versions and artefact counts.
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • R4 Test Coverage — the JS/TS workspace (6 production file(s)) has no JavaScript/TypeScript test, but it is 2.08% of this repository's production source and the other 97.92% carries 53,450 line(s) of test code this pass cannot read — an incidental frontend's reachability is not the repository's test posture, so it is not scored as one
  • R5 Dependency Freshness — no package-lock.json — dependency freshness not measured (would require an npm lockfile); JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • R6 Tooling — no package.json in the repository — test/lint/typecheck wiring is read from package.json scripts (corroborated against CI), so this project's own toolchain isn't measured here
  • R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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.
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • 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 — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • 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 — 118 finding(s)
D30 · Dependency Vulnerabilities · High CVE · ×17
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×15
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC4 · Keyboard semantics · Click handler on a non-interactive <div> · ×14
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/app-detail.js:300 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/app-detail.js:317 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:220 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:236 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:251 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:266 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:332 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/frontend/marketplace.js:347 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:237 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:253 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:268 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:283 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:349 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
  • Click handler on a non-interactive <div> docs/md_v2/marketplace/marketplace.js:364 — A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <select> without a programmatic label · ×11
  • <select> without a programmatic label deploy/docker/static/monitor/index.html:202 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label deploy/docker/static/monitor/index.html:296 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label deploy/docker/static/playground/index.html:199 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:549 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1031 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1043 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:70 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:188 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:844 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:1735 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <select> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:2337 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels · <label> that labels no control · ×9
  • <label> that labels no control deploy/docker/static/monitor/index.html:114 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control deploy/docker/static/playground/index.html:207 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:543 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:548 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1025 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1030 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1042 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:1734 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
  • <label> that labels no control docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:1744 — This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC2 · Forms & labels · <input> without a programmatic label · ×7
  • <input> without a programmatic label deploy/docker/static/monitor/index.html:98 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label deploy/docker/static/playground/index.html:177 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:544 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:1026 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:259 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
  • <input> without a programmatic label docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:1745 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label docs/md_v2/apps/llmtxt/llmtxt.js:137 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels · <button> with no accessible text · ×6
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:103 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:104 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/click2crawl.js:105 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:134 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:135 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
  • <button> with no accessible text docs/md_v2/apps/crawl4ai-assistant/content/scriptBuilder.js:136 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC4 · Keyboard semantics · Clickable element isn't keyboard-operable · ×6
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:31 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:32 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownExtraction.js:33 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownPreviewModal.js:46 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownPreviewModal.js:47 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
  • Clickable element isn't keyboard-operable docs/md_v2/apps/crawl4ai-assistant/content/markdownPreviewModal.js:48 — The repo's own CSS styles .c4ai-dot with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical vulnerability · ×2
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×2
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <textarea> without a programmatic label · ×1
  • <textarea> without a programmatic label deploy/docker/static/playground/index.html:208 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
D13 · Secret Scanning · Leaked secret · ×1
  • REDACTED
D28 · Secrets (history) · High secret · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×1
  • REDACTED
Serious — 552 finding(s)
X3 · Exception handling · Swallowed exception (empty catch) · ×34
  • Swallowed exception (empty catch) deploy/docker/api.py:912 — 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) deploy/docker/api.py:929 — 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) deploy/docker/api.py:951 — 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) REDACTED:114 — 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) REDACTED:211 — 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) REDACTED:232 — 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) deploy/docker/egress_proxy.py:148 — 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) deploy/docker/egress_proxy.py:323 — 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) deploy/docker/egress_proxy.py:337 — 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) deploy/docker/egress_proxy.py:346 — 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) deploy/docker/server.py:258 — 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) deploy/docker/server.py:262 — 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) deploy/docker/utils.py:166 — 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) REDACTED:575 — 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) REDACTED:1218 — 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) REDACTED:1226 — 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) REDACTED:1235 — 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) REDACTED:1809 — 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) REDACTED:92 — 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) REDACTED:364 — 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) REDACTED:822 — 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) REDACTED:916 — 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) REDACTED:937 — 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) crawl4ai/async_webcrawler.py:189 — 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) crawl4ai/async_webcrawler.py:646 — 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.
  • + 9 more in this group — see findings.md.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×26
  • Animation without a prefers-reduced-motion guard deploy/docker/static/monitor/index.html:42 — `.pulse-fast` moves (`animation: pulse-fast 1s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard deploy/docker/static/monitor/index.html:48 — `.spin-slow` moves (`animation: spin-slow 3s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard deploy/docker/static/monitor/index.html:52 — `.progress-bar` moves (`transition: width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/layout.css:215 — `.hamburger-line` moves (`transition: transform 0.3s, opacity 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/layout.css:288 — `#terminal-mkdocs-side-panel` moves (`transition: left 0.3s ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/layout.css:420 — `.ask-ai-selection-button` moves (`transition: background-color 0.2s ease, transform 0.15s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/layout.css:425 — `.ask-ai-selection-button` moves (`animation: askAiButtonAppear 0.2s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/layout.css:532 — `.floating-ask-ai-button` moves (`transition: background-color 0.2s ease, transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/page_actions.css:46 — `.page-actions-button::after` moves (`transition: transform 0.2s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/page_actions.css:287 — `.page-actions-notification` moves (`animation: slideInFromTop 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/assets/page_actions.css:348 — `.page-action-link.loading .page-action-icon::before` moves (`animation: spin 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/ask_ai/ask-ai.css:258 — `.message-thinking` moves (`animation: thinking 1s infinite ease-in-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/assistant.css:651 — `.tool-content` moves (`animation: fadeIn 0.4s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/assistant.css:1092 — `.cloud-banner::before` moves (`animation: cloud-shimmer 4s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/assistant.css:1194 — `.cloud-announcement::before` moves (`animation: rotate 20s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/assistant.css:1499 — `.success-icon` moves (`animation: bounce 0.5s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:794 — `.c4ai-cloud-icon` moves (`animation: cloud-float 3s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1205 — `.c4ai-recording-dot` moves (`animation: c4ai-pulse 1.5s ease-in-out infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1808 — `.c4ai-replay-progress-bar` moves (`transition: width 0.3s ease`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1857 — `.c4ai-click-indicator` moves (`animation: c4ai-click-pulse 0.6s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/c4a-script/playground/styles.css:198 — `.feature-card` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/c4a-script/playground/styles.css:231 — `.modal-content` moves (`animation: modalFadeIn 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/c4a-script/playground/styles.css:351 — `.product-card` moves (`transition: transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/c4a-script/playground/styles.css:393 — `.spinner` moves (`animation: spin 1s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard docs/md_v2/apps/c4a-script/playground/styles.css:437 — `.progress-fill` moves (`transition: width 0.3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • + 1 more in this group — see findings.md.
D30 · Dependency Vulnerabilities · Medium CVE · ×19
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · FileTooLong · ×18
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1154 over it, 3.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: crawl4ai/async_configs.py crawl4ai/async_configs.py — FileTooLong — 1602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1102 over it, 3.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: crawl4ai/extraction_strategy.py crawl4ai/extraction_strategy.py — FileTooLong — 1445 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 945 over it, 2.89× 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 — 1212 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 712 over it, 2.42× 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: crawl4ai/browser_manager.py crawl4ai/browser_manager.py — FileTooLong — 1200 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 700 over it, 2.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: REDACTED REDACTED — FileTooLong — 1112 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 612 over it, 2.22× 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 — 1095 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 595 over it, 2.19× 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: crawl4ai/cli.py crawl4ai/cli.py — FileTooLong — 1076 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 576 over it, 2.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: html2text/__init__.py crawl4ai/html2text/__init__.py — FileTooLong — 913 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 413 over it, 1.83× 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: crawl4ai/table_extraction.py crawl4ai/table_extraction.py — FileTooLong — 859 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 359 over it, 1.72× 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: docker/api.py deploy/docker/api.py — FileTooLong — 856 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 356 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: crawl4ai/browser_profiler.py crawl4ai/browser_profiler.py — FileTooLong — 797 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 297 over it, 1.59× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 286 over it, 1.57× 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: docker/server.py deploy/docker/server.py — FileTooLong — 739 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 239 over it, 1.48× 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 — 735 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 235 over it, 1.47× 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: crawl4ai/async_webcrawler.py crawl4ai/async_webcrawler.py — FileTooLong — 719 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 219 over it, 1.44× 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: crawl4ai/content_scraping_strategy.py crawl4ai/content_scraping_strategy.py — FileTooLong — 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42× 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: crawl4ai/async_dispatcher.py crawl4ai/async_dispatcher.py — FileTooLong — 552 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 52 over it, 1.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.
D29 · Static Analysis (SAST) · REDACTED · ×13
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D17 · Explicit Debt · TodoComment · ×11
  • TodoComment deploy/docker/monitor.py:240 — # TODO: Track actual browser process memory instead of estimates — 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 crawl4ai/async_configs.py:1972 — # TODO: Planning to set properties dynamically based on the __init__ signature — 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 crawl4ai/async_configs.py:2323 — # TODO: Planning to set properties dynamically based on the __init__ signature — 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:910 — # TODO: Planning to set properties dynamically based on the __init__ signature — 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 crawl4ai/extraction_strategy.py:632 — # TODO: Planning to set properties dynamically based on the __init__ signature — 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 crawl4ai/install.py:65 — # TODO: Will be added in the future — 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:248 — # TODO: Very ugly approach, but promise to change it! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment crawl4ai/html2text/__init__.py:33 — # TODO: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment crawl4ai/html2text/__init__.py:489 — # TODO: `` `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.
  • TodoComment crawl4ai/html2text/__init__.py:671 — # TODO: line up <ol><li>s > 9 correctly. — 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 crawl4ai/html2text/__init__.py:786 — # TODO: Add docstring for these one letter functions — 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.
D15 · Churn × Complexity Hotspots · Hotspot · ×7
  • Hotspot: REDACTED REDACTED:515 — REDACTED changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in AsyncPlaywrightCrawlerStrategy._crawl_web at line 515. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08: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: crawl4ai/async_configs.py crawl4ai/async_configs.py:398 — crawl4ai/async_configs.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in async_configs._filter_untrusted_fields at line 398. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/async_configs.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: deploy/docker/api.py deploy/docker/api.py:742 — deploy/docker/api.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in api.handle_crawl_request at line 742. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- deploy/docker/api.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: crawl4ai/async_webcrawler.py crawl4ai/async_webcrawler.py:216 — crawl4ai/async_webcrawler.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in AsyncWebCrawler.arun at line 216. 1 of those changes was a fix/bug commit, and the other 2 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/async_webcrawler.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: crawl4ai/deep_crawling/bff_strategy.py crawl4ai/deep_crawling/bff_strategy.py:200 — crawl4ai/deep_crawling/bff_strategy.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in BestFirstCrawlingStrategy._arun_best_first at line 200. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/deep_crawling/bff_strategy.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: crawl4ai/browser_manager.py crawl4ai/browser_manager.py:836 — crawl4ai/browser_manager.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in BrowserManager._start_impl at line 836. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/browser_manager.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: crawl4ai/deep_crawling/bfs_strategy.py crawl4ai/deep_crawling/bfs_strategy.py:312 — crawl4ai/deep_crawling/bfs_strategy.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BFSDeepCrawlStrategy._arun_stream at line 312. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/deep_crawling/bfs_strategy.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.
P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×7
  • Outbound HTTP without resilience crawl4ai/browser_profiler.py:1090 — `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 crawl4ai/browser_profiler.py:1232 — `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 crawl4ai/content_scraping_strategy.py:109 — `requests.head(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
  • Outbound HTTP without resilience REDACTED:73 — `requests.post(` 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 crawl4ai/legacy/docs_manager.py:41 — `requests.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 crawl4ai/legacy/docs_manager.py:49 — `requests.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 REDACTED:1327 — `requests.head(` 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×6
  • Swallowed exception (caught, then discarded) deploy/docker/utils.py:406 — `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) crawl4ai/async_configs.py:836 — `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:632 — `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:656 — `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:153 — `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:357 — `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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×5
  • Duplicated block (11 lines × 2) crawl4ai/async_configs.py:2525 — crawl4ai/async_configs.py:2525-2535 | crawl4ai/async_configs.py:2555-2565 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) REDACTED:635 — REDACTED:635-647 | REDACTED:682-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.
  • Duplicated block (11 lines × 2) crawl4ai/deep_crawling/bfs_strategy.py:246 — crawl4ai/deep_crawling/bfs_strategy.py:246-256 | crawl4ai/deep_crawling/bfs_strategy.py:343-353 — 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, `crawl4ai/deep_crawling/bfs_strategy.py:355` calls `info` and `crawl4ai/deep_crawling/bfs_strategy.py:257` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (11 lines × 2) REDACTED:1823 — REDACTED:1823-1833 | REDACTED:1916-1926 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) crawl4ai/async_configs.py:827 — crawl4ai/async_configs.py:827-837 | crawl4ai/proxy_strategy.py:36-46 — 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.4 · ×4
  • Low contrast colour pair in CSS (2.4:1) docs/md_v2/apps/c4a-script/playground/styles.css:151 — `.btn` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.4:1) docs/md_v2/apps/c4a-script/playground/styles.css:419 — `.page-btn:hover, .page-btn.active` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.4:1) docs/examples/c4a_script/tutorial/playground/styles.css:151 — `.btn` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.4:1) docs/examples/c4a_script/tutorial/playground/styles.css:419 — `.page-btn:hover, .page-btn.active` sets color: white on background-color: #0fbbaa — 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D15 · Churn × Complexity Hotspots · Repeated repair · ×4
  • Repeated repair: deploy/docker/server.py deploy/docker/server.py:1103 — deploy/docker/server.py changed 11 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is server.get_context at line 1103), 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(docker): apply crawler_configs to single-URL and streaming requests”; “fix(security): stop launching Chromium with certificate checks off”; “fix(docker): build permanent browser with egress-hardened default config so its pool signature matches”; “fix(security): route the seeder and robots.txt fetches through the egress proxy”. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- deploy/docker/server.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: crawl4ai/processors/pdf/__init__.py crawl4ai/processors/pdf/__init__.py:305 — crawl4ai/processors/pdf/__init__.py changed 4 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 13 (its worst body is PDFContentScrapingStrategy._get_pdf_path at line 305), 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(pdf): validate egress destinations and bound resource use in PDF fetch”; “fix(pdf): carry cookies across manual redirect hops”; “fix(docker): validate PDF download redirects against SSRF (#2127)”; “fix: Don't veto PDFCrawlerStrategy placeholder responses (#2135)”. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/processors/pdf/__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.
  • Repeated repair: deploy/docker/egress_proxy.py deploy/docker/egress_proxy.py:199 — deploy/docker/egress_proxy.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is PinningProxy._handle_absolute at line 199), 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(security): route the seeder and robots.txt fetches through the egress proxy”; “fix(docker): fall through junk proxy env values, refuse non-http proxy schemes”; “fix(docker): chain egress proxy through upstream HTTP(S)_PROXY”. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- deploy/docker/egress_proxy.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: crawl4ai/js_snippet/remove_overlay_elements.js crawl4ai/js_snippet/remove_overlay_elements.js:59 — crawl4ai/js_snippet/remove_overlay_elements.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is removeOverlays at line 59), 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: changes.”; “fix: remove_overlay_elements can remove body if it has a global popup class.”; “fix: remove unconditional setTimeout waits from overlay/consent removal scripts”. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-06 20:13:39 +08:00' --until='2026-11-04 20:13:39 +08:00' --full-history --no-merges -- crawl4ai/js_snippet/remove_overlay_elements.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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×4
  • Duplicated block (5 lines × 2) REDACTED:1117 — REDACTED:1117-1121 | crawl4ai/extraction_strategy.py:1029-1033 — 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 `REDACTED:1117` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) REDACTED:414 — REDACTED:414-418 | REDACTED:439-443 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) REDACTED:334 — REDACTED:334-339 | crawl4ai/link_preview.py:65-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 both 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `tag` to `str = "URL_SEED"` in one and `str = "LINK_EXTRACT"` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (5 lines × 2) scripts/update_stats.py:140 — scripts/update_stats.py:140-144 | scripts/update_stats.py:145-149 — 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.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×4
  • Sync-over-async blocking crawl4ai/browser_manager.py:188 — `start` is async and calls subprocess.check_output — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
  • Sync-over-async blocking crawl4ai/browser_manager.py:428 — `cleanup` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
  • Sync-over-async blocking crawl4ai/browser_profiler.py:1315 — `kill_builtin_browser` is async and calls subprocess.run — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
  • Sync-over-async blocking crawl4ai/legacy/docs_manager.py:21 — `fetch_docs` is async and calls requests.get — a blocking call inside async code stalls the event loop — every other task on it waits for as long as it runs.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.4 · ×3
  • Low contrast colour pair in CSS (3.4:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:912 — `.c4ai-cloud-modal-content .c4ai-close-modal:hover` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.4:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2486 — `.c4ai-c2c-preview .c4ai-preview-close:hover` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.4:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2804 — `.c4ai-nav-btn.c4ai-nav-deselect` sets color: #fff on background-color: #ff3c74 — 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D3 · God Classes · TooManyMethods · ×3
  • TooManyMethods: AsyncPlaywrightCrawlerStrategy REDACTED:47 — 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: ASTBuilder REDACTED:212 — TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× 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: DomainMapper REDACTED:122 — 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 · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×3
  • Change coupling: database.py ↔ REDACTED crawl4ai/legacy/database.py:1 — `crawl4ai/legacy/database.py` and `REDACTED` change together 91% of the time (10 of the 11 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 `00026b5f` feat(config): Adding a configurable way of setting the cache director… (at that commit the file was still `crawl4ai/database.py`); `4d283ab3` ## [v0.2.74] - 2024-07-08 A slew of exciting updates to improve the c… (at that commit the file was still `crawl4ai/database.py`); `b3a0edaa` - User agent - Extract Links - Extract Metadata - Update Readme - Upd… (at that commit the file was still `crawl4ai/database.py`) — run `git show` on any of them.
  • Change coupling: bff_strategy.py ↔ bfs_strategy.py crawl4ai/deep_crawling/bff_strategy.py:1 — `crawl4ai/deep_crawling/bff_strategy.py` and `crawl4ai/deep_crawling/bfs_strategy.py` change together 57% of the time (8 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 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 8 shared commits counted here, the most recent 3 are `c24d12d1` fix(deep-crawl): reset page budget on a fresh run of a reused strateg…; `19f3e5e1` fix(deep-crawl): drop the O(n^2) parent scan and the duplicate best-f…; `43738c9e` Fix can_process_url() to receive normalized URL in deep crawl strategies — run `git show` on any of them.
  • Change coupling: REDACTED ↔ database.py REDACTED:1 — `REDACTED` and `crawl4ai/legacy/database.py` change together 55% of the time (6 of the 11 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 6 shared commits counted here, the most recent 3 are `00026b5f` feat(config): Adding a configurable way of setting the cache director… (at that commit the files were still `crawl4ai/crawler_strategy.py` and `crawl4ai/database.py`); `4d283ab3` ## [v0.2.74] - 2024-07-08 A slew of exciting updates to improve the c… (at that commit the files were still `crawl4ai/crawler_strategy.py` and `crawl4ai/database.py`); `b3a0edaa` - User agent - Extract Links - Extract Metadata - Update Readme - Upd… (at that commit the files were still `crawl4ai/crawler_strategy.py` and `crawl4ai/database.py`) — run `git show` on any of them.
D36 · Supply-chain Provenance & Signing REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×3
  • Edited copy of a member (7 corresponding lines) crawl4ai/model_loader.py:65 — crawl4ai/model_loader.py:65-71 | REDACTED:653-675 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) crawl4ai/async_configs.py:877 — crawl4ai/async_configs.py:877-883 | crawl4ai/proxy_strategy.py:71-77 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) crawl4ai/legacy/version_manager.py:13 — crawl4ai/legacy/version_manager.py:13-19 | REDACTED:241-247 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×3
  • Duplicated block (20 lines × 2) crawl4ai/browser_profiler.py:881 — crawl4ai/browser_profiler.py:881-900 | crawl4ai/browser_profiler.py:920-939 — 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, `crawl4ai/browser_profiler.py:901` calls `info` and `crawl4ai/browser_profiler.py:940` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (20 lines × 2) crawl4ai/cli.py:470 — crawl4ai/cli.py:470-489 | crawl4ai/cli.py:550-569 — 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 (20 lines × 2) crawl4ai/deep_crawling/bff_strategy.py:76 — crawl4ai/deep_crawling/bff_strategy.py:76-95 | crawl4ai/deep_crawling/bfs_strategy.py:63-82 — before extracting anything, compare `crawl4ai/deep_crawling/bff_strategy.py` and `crawl4ai/deep_crawling/bfs_strategy.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — 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 (18 lines × 2) · ×3
  • Duplicated block (18 lines × 2) crawl4ai/processors/pdf/utils.py:82 — crawl4ai/processors/pdf/utils.py:82-99 | crawl4ai/processors/pdf/utils.py:227-244 — 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 `crawl4ai/processors/pdf/utils.py:82` 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 (18 lines × 2) deploy/docker/monitor_routes.py:200 — deploy/docker/monitor_routes.py:200-217 | deploy/docker/monitor_routes.py:291-308 — 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, `deploy/docker/monitor_routes.py:220` calls `startswith`, `HTTPException` and `deploy/docker/monitor_routes.py:310` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (18 lines × 2) crawl4ai/async_configs.py:887 — crawl4ai/async_configs.py:887-904 | crawl4ai/proxy_strategy.py:81-98 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crawl4ai/proxy_strategy.py:76` calls `get` and `crawl4ai/async_configs.py:882` 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 (13 lines × 2) · ×3
  • Duplicated block (13 lines × 2) REDACTED:1177 — REDACTED:1177-1189 | REDACTED:1226-1238 — 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 `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 (13 lines × 2) crawl4ai/deep_crawling/dfs_strategy.py:63 — crawl4ai/deep_crawling/dfs_strategy.py:63-75 | crawl4ai/deep_crawling/dfs_strategy.py:173-185 — 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 (13 lines × 2) deploy/docker/api.py:190 — deploy/docker/api.py:190-202 | deploy/docker/api.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.
X1 · Async correctness · Task from `asyncio.create_task` is not kept · ×3
  • Task from `asyncio.create_task` is not kept crawl4ai/browser_manager.py:2017 — The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
  • Task from `asyncio.create_task` is not kept crawl4ai/browser_profiler.py:506 — The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
  • Task from `asyncio.create_task` is not kept crawl4ai/browser_profiler.py:1045 — The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×3
  • Recursive walk over a caller-supplied document has no depth cap crawl4ai/async_configs.py:573 — `to_serializable_dict` is public and takes `obj: Any` from its caller, and it calls itself at line 573 (`to_serializable_dict`) with a piece of `obj` (and at line 577, line 583, line 611) — and nowhere in `to_serializable_dict` 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 `to_serializable_dict` 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 crawl4ai/async_configs.py:676 — `from_serializable_dict` is public and takes `data: Any` from its caller, and it calls itself at line 676 (`from_serializable_dict`) with a piece of `data` (and at line 730, line 736, line 740) — and nowhere in `from_serializable_dict` 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 `from_serializable_dict` 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 crawl4ai/ssl_certificate.py:54 — `__init__` is public, takes a document from its caller (line 25) and hands it to `_decode_cert_data`, which calls itself at line 54 (`self._decode_cert_data`) with a piece of `data` (and at line 58) — and nowhere in `_decode_cert_data` 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 `_decode_cert_data` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.0 · ×2
  • Low contrast colour pair in CSS (3.0:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:279 — `.c4ai-container-selector` sets color: #666 on background-color: #1a1a1a — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.0:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1007 — `.c4ai-toolbar .c4ai-field-selector` sets color: #666 on background-color: #1a1a1a — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×2
  • Focus outline removed in CSS without a :focus replacement docs/md_v2/marketplace/marketplace.css:144 — `#search-input` 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/md_v2/marketplace/frontend/marketplace.css:144 — `#search-input` 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.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×2
  • Edited copy of a member (11 corresponding lines) deploy/docker/monitor_routes.py:123 — deploy/docker/monitor_routes.py:123-133 | deploy/docker/monitor_routes.py:138-148 — 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) crawl4ai/async_database.py:642 — crawl4ai/async_database.py:642-654 | crawl4ai/migrations.py:47-57 — 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 (40 lines × 2) · ×2
  • Duplicated block (40 lines × 2) crawl4ai/browser_profiler.py:487 — crawl4ai/browser_profiler.py:487-526 | crawl4ai/browser_profiler.py:1026-1065 — 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 `crawl4ai/browser_profiler.py:487` 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 (40 lines × 2) crawl4ai/link_preview.py:311 — crawl4ai/link_preview.py:311-350 | crawl4ai/link_preview.py:355-394 — 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 (14–18 lines × 2) · ×2
  • Duplicated block (14–18 lines × 2) crawl4ai/async_database.py:300 — crawl4ai/async_database.py:300-313 | crawl4ai/async_database.py:393-410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (14–18 lines × 2) REDACTED:1042 — REDACTED:1042-1055 | REDACTED:1185-1202 — 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 `REDACTED:1042` 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.
D4 · Code Duplication · Duplicated block (14–16 lines × 2) · ×2
  • Duplicated block (14–16 lines × 2) REDACTED:1057 — REDACTED:1057-1070 | REDACTED:1212-1227 — 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 `REDACTED:1212` 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–16 lines × 2) deploy/docker/monitor_routes.py:233 — deploy/docker/monitor_routes.py:233-246 | deploy/docker/monitor_routes.py:314-329 — 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 (9–10 lines × 2) · ×2
  • Duplicated block (9–10 lines × 2) REDACTED:488 — REDACTED:488-497 | REDACTED:733-741 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9–10 lines × 2) crawl4ai/html2text/__init__.py:552 — crawl4ai/html2text/__init__.py:552-560 | crawl4ai/html2text/__init__.py:609-618 — 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 `crawl4ai/html2text/__init__.py:552` 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 (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) crawl4ai/browser_profiler.py:719 — crawl4ai/browser_profiler.py:719-725 | crawl4ai/browser_profiler.py:764-770 — 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, `crawl4ai/browser_profiler.py:757` calls `join`, `isdir` and `crawl4ai/browser_profiler.py:715` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) REDACTED:1108 — REDACTED:1108-1114 | crawl4ai/extraction_strategy.py:1021-1027 — 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.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.5 · ×1
  • Low contrast colour pair in CSS (3.5:1) docs/md_v2/assets/page_actions.css:362 — `.page-actions-footer` sets color: #666 on background-color: #070708 — 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.3 · ×1
  • Low contrast colour pair in CSS (4.3:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:1058 — `.c4ai-cloud-btn` sets color: #0fbbaa on background-color: #3f3f44 — 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (1.8 · ×1
  • Low contrast colour pair in CSS (1.8:1) docs/md_v2/apps/crawl4ai-assistant/content/overlay.css:2756 — `.c4ai-c2c-preview .c4ai-cloud-btn` sets color: #666 on background-color: #3f3f44 — 1.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · HTML2Text.handle_tag (cyclomatic 165) · ×1
  • HTML2Text.handle_tag (cyclomatic 165) crawl4ai/html2text/__init__.py:310 — HTML2Text.handle_tag has cyclomatic complexity 165 (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 · AsyncPlaywrightCrawlerStrategy._crawl_web (cyclomatic 100) · ×1
  • AsyncPlaywrightCrawlerStrategy._crawl_web (cyclomatic 100) REDACTED:515 — AsyncPlaywrightCrawlerStrategy._crawl_web has cyclomatic complexity 100 (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 · AsyncWebCrawler.arun (cyclomatic 87) · ×1
  • AsyncWebCrawler.arun (cyclomatic 87) crawl4ai/async_webcrawler.py:216 — AsyncWebCrawler.arun has cyclomatic complexity 87 (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 · LXMLWebScrapingStrategy._scrap (cyclomatic 79) · ×1
  • LXMLWebScrapingStrategy._scrap (cyclomatic 79) crawl4ai/content_scraping_strategy.py:649 — LXMLWebScrapingStrategy._scrap has cyclomatic complexity 79 (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 · cli.crawl_cmd (cyclomatic 59) · ×1
  • cli.crawl_cmd (cyclomatic 59) crawl4ai/cli.py:1033 — cli.crawl_cmd has cyclomatic complexity 59 (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 · (anonymous) (cyclomatic 56) · ×1
  • (anonymous) (cyclomatic 56) crawl4ai/js_snippet/remove_consent_popups.js:1 — (anonymous) has cyclomatic complexity 56 (threshold 15). Of this number, 44 points are the body's own statements and 12 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · api.handle_crawl_request (cyclomatic 50) · ×1
  • api.handle_crawl_request (cyclomatic 50) deploy/docker/api.py:742 — api.handle_crawl_request has cyclomatic complexity 50 (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 · JsonElementExtractionStrategy.agenerate_schema (cyclomatic 44) · ×1
  • JsonElementExtractionStrategy.agenerate_schema (cyclomatic 44) crawl4ai/extraction_strategy.py:1764 — JsonElementExtractionStrategy.agenerate_schema has cyclomatic complexity 44 (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 · HTML2Text.o (cyclomatic 43) · ×1
  • HTML2Text.o (cyclomatic 43) crawl4ai/html2text/__init__.py:801 — HTML2Text.o 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 · LLMTableExtraction.extract_tables (cyclomatic 40) · ×1
  • LLMTableExtraction.extract_tables (cyclomatic 40) crawl4ai/table_extraction.py:780 — LLMTableExtraction.extract_tables has cyclomatic complexity 40 (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 · async_configs._filter_untrusted_fields (cyclomatic 36) · ×1
  • async_configs._filter_untrusted_fields (cyclomatic 36) crawl4ai/async_configs.py:398 — async_configs._filter_untrusted_fields has cyclomatic complexity 36 (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 · LXMLWebScrapingStrategy.process_image (cyclomatic 36) · ×1
  • LXMLWebScrapingStrategy.process_image (cyclomatic 36) crawl4ai/content_scraping_strategy.py:440 — LXMLWebScrapingStrategy.process_image has cyclomatic complexity 36 (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 · AdaptiveCrawler.print_stats (cyclomatic 35) · ×1
  • AdaptiveCrawler.print_stats (cyclomatic 35) REDACTED:1570 — AdaptiveCrawler.print_stats has cyclomatic complexity 35 (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 · LXMLWebScrapingStrategy._process_element (cyclomatic 35) · ×1
  • LXMLWebScrapingStrategy._process_element (cyclomatic 35) crawl4ai/content_scraping_strategy.py:261 — LXMLWebScrapingStrategy._process_element has cyclomatic complexity 35 (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 · BestFirstCrawlingStrategy._arun_best_first (cyclomatic 35) · ×1
  • BestFirstCrawlingStrategy._arun_best_first (cyclomatic 35) crawl4ai/deep_crawling/bff_strategy.py:200 — BestFirstCrawlingStrategy._arun_best_first has cyclomatic complexity 35 (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 · NaivePDFProcessorStrategy._extract_images (cyclomatic 34) · ×1
  • NaivePDFProcessorStrategy._extract_images (cyclomatic 34) crawl4ai/processors/pdf/processor.py:251 — NaivePDFProcessorStrategy._extract_images 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 · AdaptiveCrawler.digest (cyclomatic 32) · ×1
  • AdaptiveCrawler.digest (cyclomatic 32) REDACTED:1330 — AdaptiveCrawler.digest 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 · AsyncUrlSeeder._iter_sitemap (cyclomatic 31) · ×1
  • AsyncUrlSeeder._iter_sitemap (cyclomatic 31) REDACTED:1110 — AsyncUrlSeeder._iter_sitemap 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 · BrowserManager._start_impl (cyclomatic 30) · ×1
  • BrowserManager._start_impl (cyclomatic 30) crawl4ai/browser_manager.py:836 — BrowserManager._start_impl has cyclomatic complexity 30 (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 · DomainMapper._scan_host (cyclomatic 30) · ×1
  • DomainMapper._scan_host (cyclomatic 30) REDACTED:506 — DomainMapper._scan_host has cyclomatic complexity 30 (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._emit_js (cyclomatic 30) · ×1
  • Compiler._emit_js (cyclomatic 30) REDACTED:387 — Compiler._emit_js has cyclomatic complexity 30 (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 · CrawlerRunConfig.__init__ (cyclomatic 29) · ×1
  • CrawlerRunConfig.__init__ (cyclomatic 29) crawl4ai/async_configs.py:1850 — CrawlerRunConfig.__init__ has cyclomatic complexity 29 (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 · AsyncUrlSeeder._from_sitemaps (cyclomatic 29) · ×1
  • AsyncUrlSeeder._from_sitemaps (cyclomatic 29) REDACTED:890 — AsyncUrlSeeder._from_sitemaps 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 · BrowserManager.close (cyclomatic 29) · ×1
  • BrowserManager.close (cyclomatic 29) crawl4ai/browser_manager.py:2019 — BrowserManager.close has cyclomatic complexity 29 (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 · utils.calculate_link_intrinsic_score (cyclomatic 29) · ×1
  • utils.calculate_link_intrinsic_score (cyclomatic 29) REDACTED:3390 — utils.calculate_link_intrinsic_score 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 · (anonymous) (cyclomatic 28) · ×1
  • (anonymous) (cyclomatic 28) crawl4ai/js_snippet/remove_overlay_elements.js:1 — (anonymous) has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to 9 function items inside it that branch (removeOverlays, a function literal at line 98, isDocumentStructure, …). 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 · EmbeddingStrategy.select_links_for_expansion (cyclomatic 26) · ×1
  • EmbeddingStrategy.select_links_for_expansion (cyclomatic 26) REDACTED:871 — EmbeddingStrategy.select_links_for_expansion 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 · async_configs._clamp_untrusted (cyclomatic 26) · ×1
  • async_configs._clamp_untrusted (cyclomatic 26) crawl4ai/async_configs.py:462 — async_configs._clamp_untrusted 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 · AsyncUrlSeeder._iter_sitemap_content (cyclomatic 26) · ×1
  • AsyncUrlSeeder._iter_sitemap_content (cyclomatic 26) REDACTED:1004 — AsyncUrlSeeder._iter_sitemap_content 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 · AsyncWebCrawler.aprocess_html (cyclomatic 26) · ×1
  • AsyncWebCrawler.aprocess_html (cyclomatic 26) crawl4ai/async_webcrawler.py:729 — AsyncWebCrawler.aprocess_html 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 · HTML2Text.handle_emphasis (cyclomatic 26) · ×1
  • HTML2Text.handle_emphasis (cyclomatic 26) crawl4ai/html2text/__init__.py:237 — HTML2Text.handle_emphasis 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 · utils.preprocess_html_for_schema (cyclomatic 26) · ×1
  • utils.preprocess_html_for_schema (cyclomatic 26) REDACTED:3127 — utils.preprocess_html_for_schema 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 · BrowserConfig.__init__ (cyclomatic 25) · ×1
  • BrowserConfig.__init__ (cyclomatic 25) crawl4ai/async_configs.py:1041 — BrowserConfig.__init__ has cyclomatic complexity 25 (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 · async_url_seeder._parse_head (cyclomatic 25) · ×1
  • async_url_seeder._parse_head (cyclomatic 25) REDACTED:187 — async_url_seeder._parse_head has cyclomatic complexity 25 (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 · BrowserManager.get_page (cyclomatic 25) · ×1
  • BrowserManager.get_page (cyclomatic 25) crawl4ai/browser_manager.py:1593 — BrowserManager.get_page has cyclomatic complexity 25 (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 · BrowserProfiler.interactive_manager (cyclomatic 25) · ×1
  • BrowserProfiler.interactive_manager (cyclomatic 25) crawl4ai/browser_profiler.py:817 — BrowserProfiler.interactive_manager has cyclomatic complexity 25 (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 · LLMContentFilter.filter_content (cyclomatic 25) · ×1
  • LLMContentFilter.filter_content (cyclomatic 25) REDACTED:935 — LLMContentFilter.filter_content has cyclomatic complexity 25 (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.extract_metadata_using_lxml (cyclomatic 25) · ×1
  • utils.extract_metadata_using_lxml (cyclomatic 25) REDACTED:1540 — utils.extract_metadata_using_lxml has cyclomatic complexity 25 (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 · AsyncUrlSeeder._extract_text_context (cyclomatic 24) · ×1
  • AsyncUrlSeeder._extract_text_context (cyclomatic 24) REDACTED:1471 — AsyncUrlSeeder._extract_text_context 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 · BrowserManager._maybe_bump_browser_version (cyclomatic 24) · ×1
  • BrowserManager._maybe_bump_browser_version (cyclomatic 24) crawl4ai/browser_manager.py:1837 — BrowserManager._maybe_bump_browser_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 · JsonElementExtractionStrategy._validate_schema (cyclomatic 24) · ×1
  • JsonElementExtractionStrategy._validate_schema (cyclomatic 24) crawl4ai/extraction_strategy.py:1366 — JsonElementExtractionStrategy._validate_schema 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 · antibot_detector.is_blocked (cyclomatic 23) · ×1
  • antibot_detector.is_blocked (cyclomatic 23) crawl4ai/antibot_detector.py:191 — antibot_detector.is_blocked 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 · LLMExtractionStrategy.extract (cyclomatic 23) · ×1
  • LLMExtractionStrategy.extract (cyclomatic 23) crawl4ai/extraction_strategy.py:641 — LLMExtractionStrategy.extract has cyclomatic complexity 23 (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: one other method here (LLMExtractionStrategy.aextract) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · LLMExtractionStrategy.aextract (cyclomatic 23) · ×1
  • LLMExtractionStrategy.aextract (cyclomatic 23) crawl4ai/extraction_strategy.py:843 — LLMExtractionStrategy.aextract has cyclomatic complexity 23 (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: one other method here (LLMExtractionStrategy.extract) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · utils.clean_pdf_text (cyclomatic 23) · ×1
  • utils.clean_pdf_text (cyclomatic 23) crawl4ai/processors/pdf/utils.py:217 — utils.clean_pdf_text 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 · async_configs.from_serializable_dict (cyclomatic 22) · ×1
  • async_configs.from_serializable_dict (cyclomatic 22) crawl4ai/async_configs.py:647 — async_configs.from_serializable_dict 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 · AsyncUrlSeeder.urls (cyclomatic 22) · ×1
  • AsyncUrlSeeder.urls (cyclomatic 22) REDACTED:369 — AsyncUrlSeeder.urls 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 · CustomHTML2Text.handle_tag (cyclomatic 22) · ×1
  • CustomHTML2Text.handle_tag (cyclomatic 22) crawl4ai/html2text/__init__.py:1106 — CustomHTML2Text.handle_tag 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 · AsyncHTTPCrawlerStrategy._handle_http (cyclomatic 21) · ×1
  • AsyncHTTPCrawlerStrategy._handle_http (cyclomatic 21) REDACTED:2752 — AsyncHTTPCrawlerStrategy._handle_http 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 · MemoryAdaptiveDispatcher.run_urls_stream (cyclomatic 21) · ×1
  • MemoryAdaptiveDispatcher.run_urls_stream (cyclomatic 21) crawl4ai/async_dispatcher.py:530 — MemoryAdaptiveDispatcher.run_urls_stream 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 · AsyncUrlSeeder._calculate_url_relevance_score (cyclomatic 21) · ×1
  • AsyncUrlSeeder._calculate_url_relevance_score (cyclomatic 21) REDACTED:1524 — AsyncUrlSeeder._calculate_url_relevance_score 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 · LocalSeleniumCrawlerStrategy.crawl (cyclomatic 21) · ×1
  • LocalSeleniumCrawlerStrategy.crawl (cyclomatic 21) REDACTED:206 — LocalSeleniumCrawlerStrategy.crawl 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 · AsyncLLMTextManager.build_search_index (cyclomatic 21) · ×1
  • AsyncLLMTextManager.build_search_index (cyclomatic 21) REDACTED:225 — AsyncLLMTextManager.build_search_index 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 · utils.clean_pdf_text_to_html (cyclomatic 21) · ×1
  • utils.clean_pdf_text_to_html (cyclomatic 21) crawl4ai/processors/pdf/utils.py:71 — utils.clean_pdf_text_to_html 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 · LLMTableExtraction._process_chunk (cyclomatic 21) · ×1
  • LLMTableExtraction._process_chunk (cyclomatic 21) crawl4ai/table_extraction.py:1135 — LLMTableExtraction._process_chunk 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 · ManagedBrowser.start (cyclomatic 20) · ×1
  • ManagedBrowser.start (cyclomatic 20) crawl4ai/browser_manager.py:188 — ManagedBrowser.start 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 · BrowserManager.setup_context (cyclomatic 20) · ×1
  • BrowserManager.setup_context (cyclomatic 20) crawl4ai/browser_manager.py:1196 — BrowserManager.setup_context 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 · DomainMapper.scan (cyclomatic 20) · ×1
  • DomainMapper.scan (cyclomatic 20) REDACTED:206 — DomainMapper.scan 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 · DomainMapper._parse_feed_xml (cyclomatic 20) · ×1
  • DomainMapper._parse_feed_xml (cyclomatic 20) REDACTED:853 — DomainMapper._parse_feed_xml 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 · C4AScriptError.from_exception (cyclomatic 20) · ×1
  • C4AScriptError.from_exception (cyclomatic 20) REDACTED:50 — C4AScriptError.from_exception 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 · PruningContentFilterLXML._compute_metrics (cyclomatic 19) · ×1
  • PruningContentFilterLXML._compute_metrics (cyclomatic 19) crawl4ai/content_filter_strategy_lxml.py:217 — PruningContentFilterLXML._compute_metrics 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 · URLPatternFilter.apply (cyclomatic 19) · ×1
  • URLPatternFilter.apply (cyclomatic 19) crawl4ai/deep_crawling/filters.py:219 — URLPatternFilter.apply 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 · DefaultMarkdownGenerator.generate_markdown (cyclomatic 19) · ×1
  • DefaultMarkdownGenerator.generate_markdown (cyclomatic 19) crawl4ai/markdown_generation_strategy.py:148 — DefaultMarkdownGenerator.generate_markdown has cyclomatic complexity 19 (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 · DefaultTableExtraction.is_data_table (cyclomatic 19) · ×1
  • DefaultTableExtraction.is_data_table (cyclomatic 19) crawl4ai/table_extraction.py:132 — DefaultTableExtraction.is_data_table has cyclomatic complexity 19 (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 · utils.get_content_of_website (cyclomatic 19) · ×1
  • utils.get_content_of_website (cyclomatic 19) REDACTED:932 — utils.get_content_of_website 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 · utils.extract_metadata (cyclomatic 19) · ×1
  • utils.extract_metadata (cyclomatic 19) REDACTED:1626 — utils.extract_metadata has cyclomatic complexity 19 (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 · api.handle_stream_crawl_request (cyclomatic 19) · ×1
  • api.handle_stream_crawl_request (cyclomatic 19) deploy/docker/api.py:980 — api.handle_stream_crawl_request 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 · async_configs.to_serializable_dict (cyclomatic 18) · ×1
  • async_configs.to_serializable_dict (cyclomatic 18) crawl4ai/async_configs.py:551 — async_configs.to_serializable_dict 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 · MemoryAdaptiveDispatcher.run_urls (cyclomatic 18) · ×1
  • MemoryAdaptiveDispatcher.run_urls (cyclomatic 18) crawl4ai/async_dispatcher.py:374 — MemoryAdaptiveDispatcher.run_urls 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 · AsyncUrlSeeder._validate (cyclomatic 18) · ×1
  • AsyncUrlSeeder._validate (cyclomatic 18) REDACTED:1286 — AsyncUrlSeeder._validate 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 · AsyncUrlSeeder._fetch_head (cyclomatic 18) · ×1
  • AsyncUrlSeeder._fetch_head (cyclomatic 18) REDACTED:1360 — AsyncUrlSeeder._fetch_head 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 · CacheValidator.validate (cyclomatic 18) · ×1
  • CacheValidator.validate (cyclomatic 18) crawl4ai/cache_validator.py:88 — CacheValidator.validate 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 · CrawlerMonitor.update_task (cyclomatic 18) · ×1
  • CrawlerMonitor.update_task (cyclomatic 18) crawl4ai/components/crawler_monitor.py:512 — CrawlerMonitor.update_task 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 · LXMLWebScrapingStrategy.remove_empty_elements_fast (cyclomatic 18) · ×1
  • LXMLWebScrapingStrategy.remove_empty_elements_fast (cyclomatic 18) crawl4ai/content_scraping_strategy.py:547 — LXMLWebScrapingStrategy.remove_empty_elements_fast 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 · WebCrawler.run (cyclomatic 18) · ×1
  • WebCrawler.run (cyclomatic 18) crawl4ai/legacy/web_crawler.py:121 — WebCrawler.run 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 · LLMConfig.__init__ (cyclomatic 17) · ×1
  • LLMConfig.__init__ (cyclomatic 17) crawl4ai/async_configs.py:2493 — LLMConfig.__init__ 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 · MemoryAdaptiveDispatcher.crawl_url (cyclomatic 17) · ×1
  • MemoryAdaptiveDispatcher.crawl_url (cyclomatic 17) crawl4ai/async_dispatcher.py:228 — MemoryAdaptiveDispatcher.crawl_url 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 · BrowserManager.create_browser_context (cyclomatic 17) · ×1
  • BrowserManager.create_browser_context (cyclomatic 17) crawl4ai/browser_manager.py:1304 — BrowserManager.create_browser_context 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 · BrowserProfiler.create_profile (cyclomatic 17) · ×1
  • BrowserProfiler.create_profile (cyclomatic 17) crawl4ai/browser_profiler.py:382 — BrowserProfiler.create_profile 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.
D1 · Cyclomatic Complexity · BFSDeepCrawlStrategy._arun_stream (cyclomatic 17) · ×1
  • BFSDeepCrawlStrategy._arun_stream (cyclomatic 17) crawl4ai/deep_crawling/bfs_strategy.py:312 — BFSDeepCrawlStrategy._arun_stream 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 · BrowserManager._get_page_by_target_id (cyclomatic 16) · ×1
  • BrowserManager._get_page_by_target_id (cyclomatic 16) crawl4ai/browser_manager.py:1537 — BrowserManager._get_page_by_target_id 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 · RelevantContentFilter.extract_text_chunks (cyclomatic 16) · ×1
  • RelevantContentFilter.extract_text_chunks (cyclomatic 16) REDACTED:162 — RelevantContentFilter.extract_text_chunks 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 · PruningContentFilterLXML.filter_content (cyclomatic 16) · ×1
  • PruningContentFilterLXML.filter_content (cyclomatic 16) crawl4ai/content_filter_strategy_lxml.py:154 — PruningContentFilterLXML.filter_content 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 · DFSDeepCrawlStrategy._arun_batch (cyclomatic 16) · ×1
  • DFSDeepCrawlStrategy._arun_batch (cyclomatic 16) crawl4ai/deep_crawling/dfs_strategy.py:28 — DFSDeepCrawlStrategy._arun_batch 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. This shape REPEATS in the file: one other method here (DFSDeepCrawlStrategy._arun_stream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · DFSDeepCrawlStrategy._arun_stream (cyclomatic 16) · ×1
  • DFSDeepCrawlStrategy._arun_stream (cyclomatic 16) crawl4ai/deep_crawling/dfs_strategy.py:142 — DFSDeepCrawlStrategy._arun_stream 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. This shape REPEATS in the file: one other method here (DFSDeepCrawlStrategy._arun_batch) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · DFSDeepCrawlStrategy.link_discovery (cyclomatic 16) · ×1
  • DFSDeepCrawlStrategy.link_discovery (cyclomatic 16) crawl4ai/deep_crawling/dfs_strategy.py:246 — DFSDeepCrawlStrategy.link_discovery 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 · JsonElementExtractionStrategy._extract_single_field (cyclomatic 16) · ×1
  • JsonElementExtractionStrategy._extract_single_field (cyclomatic 16) crawl4ai/extraction_strategy.py:1178 — JsonElementExtractionStrategy._extract_single_field 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 · C4ACompiler._handle_unexpected_token (cyclomatic 16) · ×1
  • C4ACompiler._handle_unexpected_token (cyclomatic 16) crawl4ai/script/c4a_compile.py:175 — C4ACompiler._handle_unexpected_token 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 · DefaultTableExtraction.extract_table_data (cyclomatic 16) · ×1
  • DefaultTableExtraction.extract_table_data (cyclomatic 16) crawl4ai/table_extraction.py:259 — DefaultTableExtraction.extract_table_data 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 · FixmeComment · ×1
  • FixmeComment crawl4ai/async_logger.py:211 — # FIXME: If there are formatting strings in floating point format, — 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.
D2 · Cognitive Complexity · HTML2Text.handle_tag (cognitive 353) · ×1
  • HTML2Text.handle_tag (cognitive 353) crawl4ai/html2text/__init__.py:310 — HTML2Text.handle_tag has cognitive complexity 353 (threshold 15). Drivers by points: if/else 141 (293 pts), boolean chains 43, ternaries 3 (13 pts), loops 1 (4 pts) (nesting depth added 165). 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 · AsyncWebCrawler.arun (cognitive 192) · ×1
  • AsyncWebCrawler.arun (cognitive 192) crawl4ai/async_webcrawler.py:216 — AsyncWebCrawler.arun has cognitive complexity 192 (threshold 15). Drivers by points: if/else 40 (93 pts), ternaries 12 (45 pts), boolean chains 30, error handling 5 (19 pts), loops 2 (5 pts) (nesting depth added 103). 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 · LXMLWebScrapingStrategy._scrap (cognitive 166) · ×1
  • LXMLWebScrapingStrategy._scrap (cognitive 166) crawl4ai/content_scraping_strategy.py:649 — LXMLWebScrapingStrategy._scrap has cognitive complexity 166 (threshold 15). Drivers by points: if/else 46 (102 pts), loops 19 (38 pts), error handling 9 (16 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 85). 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 · AsyncPlaywrightCrawlerStrategy._crawl_web (cognitive 155) · ×1
  • AsyncPlaywrightCrawlerStrategy._crawl_web (cognitive 155) REDACTED:515 — AsyncPlaywrightCrawlerStrategy._crawl_web has cognitive complexity 155 (threshold 15). Drivers by points: if/else 61 (90 pts), error handling 14 (27 pts), boolean chains 20, ternaries 6 (12 pts), loops 2 (6 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent 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 · NaivePDFProcessorStrategy._extract_images (cognitive 154) · ×1
  • NaivePDFProcessorStrategy._extract_images (cognitive 154) crawl4ai/processors/pdf/processor.py:251 — NaivePDFProcessorStrategy._extract_images has cognitive complexity 154 (threshold 15). Drivers by points: if/else 23 (99 pts), error handling 7 (36 pts), ternaries 2 (14 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 119). 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 · AdaptiveCrawler.print_stats (cognitive 111) · ×1
  • AdaptiveCrawler.print_stats (cognitive 111) REDACTED:1570 — AdaptiveCrawler.print_stats has cognitive complexity 111 (threshold 15). Drivers by points: if/else 32 (72 pts), loops 6 (20 pts), ternaries 5 (17 pts), boolean chains 1, error handling 1 (nesting depth added 66). 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 · (anonymous) (cognitive 102) · ×1
  • (anonymous) (cognitive 102) crawl4ai/js_snippet/remove_consent_popups.js:1 — (anonymous) has cognitive complexity 102 (threshold 15). Drivers by points: if/else 22 (49 pts), error handling 10 (22 pts), loops 9 (18 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 50). Of this number, 87 points are the body's own statements and 15 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LLMTableExtraction.extract_tables (cognitive 96) · ×1
  • LLMTableExtraction.extract_tables (cognitive 96) crawl4ai/table_extraction.py:780 — LLMTableExtraction.extract_tables has cognitive complexity 96 (threshold 15). Drivers by points: if/else 33 (81 pts), loops 3 (7 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent 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.crawl_cmd (cognitive 90) · ×1
  • cli.crawl_cmd (cognitive 90) crawl4ai/cli.py:1033 — cli.crawl_cmd has cognitive complexity 90 (threshold 15). Drivers by points: if/else 42 (68 pts), loops 4 (14 pts), boolean chains 4, error handling 2, ternaries 1 (2 pts) (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 · JsonElementExtractionStrategy.agenerate_schema (cognitive 89) · ×1
  • JsonElementExtractionStrategy.agenerate_schema (cognitive 89) crawl4ai/extraction_strategy.py:1764 — JsonElementExtractionStrategy.agenerate_schema has cognitive complexity 89 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 7, error handling 3 (7 pts), loops 4 (7 pts), ternaries 3 (7 pts) (nesting depth added 44). 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 · HTML2Text.o (cognitive 87) · ×1
  • HTML2Text.o (cognitive 87) crawl4ai/html2text/__init__.py:801 — HTML2Text.o has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (68 pts), boolean chains 13, loops 2 (6 pts) (nesting depth added 44). 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 · BestFirstCrawlingStrategy._arun_best_first (cognitive 81) · ×1
  • BestFirstCrawlingStrategy._arun_best_first (cognitive 81) crawl4ai/deep_crawling/bff_strategy.py:200 — BestFirstCrawlingStrategy._arun_best_first has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 6 (13 pts), boolean chains 7, ternaries 2 (7 pts), error handling 1 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent 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 · AsyncUrlSeeder._iter_sitemap (cognitive 76) · ×1
  • AsyncUrlSeeder._iter_sitemap (cognitive 76) REDACTED:1110 — AsyncUrlSeeder._iter_sitemap has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 7 (18 pts), ternaries 3 (9 pts), error handling 5 (7 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent 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.handle_crawl_request (cognitive 74) · ×1
  • api.handle_crawl_request (cognitive 74) deploy/docker/api.py:742 — api.handle_crawl_request has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (37 pts), error handling 9 (12 pts), ternaries 8 (12 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AdaptiveCrawler.digest (cognitive 73) · ×1
  • AdaptiveCrawler.digest (cognitive 73) REDACTED:1330 — AdaptiveCrawler.digest has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (56 pts), loops 3 (10 pts), boolean chains 7 (nesting depth added 38). 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 · AsyncUrlSeeder._iter_sitemap_content (cognitive 67) · ×1
  • AsyncUrlSeeder._iter_sitemap_content (cognitive 67) REDACTED:1004 — AsyncUrlSeeder._iter_sitemap_content has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 7 (18 pts), ternaries 3 (9 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent 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 · AsyncUrlSeeder._from_sitemaps (cognitive 66) · ×1
  • AsyncUrlSeeder._from_sitemaps (cognitive 66) REDACTED:890 — AsyncUrlSeeder._from_sitemaps has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 7 (17 pts), error handling 3 (8 pts), boolean chains 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BrowserManager._maybe_bump_browser_version (cognitive 66) · ×1
  • BrowserManager._maybe_bump_browser_version (cognitive 66) crawl4ai/browser_manager.py:1837 — BrowserManager._maybe_bump_browser_version has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 6 (15 pts), error handling 3 (11 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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 · BrowserManager.close (cognitive 63) · ×1
  • BrowserManager.close (cognitive 63) crawl4ai/browser_manager.py:2019 — BrowserManager.close has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (28 pts), error handling 6 (19 pts), loops 8 (16 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent 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 · BrowserManager._start_impl (cognitive 62) · ×1
  • BrowserManager._start_impl (cognitive 62) crawl4ai/browser_manager.py:836 — BrowserManager._start_impl has cognitive complexity 62 (threshold 15). Drivers by points: if/else 28 (54 pts), boolean chains 5, ternaries 1 (3 pts) (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 · BrowserManager.get_page (cognitive 62) · ×1
  • BrowserManager.get_page (cognitive 62) crawl4ai/browser_manager.py:1593 — BrowserManager.get_page has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (44 pts), error handling 5 (15 pts), boolean chains 3 (nesting depth added 33). 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 · BrowserProfiler.interactive_manager (cognitive 62) · ×1
  • BrowserProfiler.interactive_manager (cognitive 62) crawl4ai/browser_profiler.py:817 — BrowserProfiler.interactive_manager has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 4 (10 pts), error handling 2 (6 pts), boolean chains 2 (nesting depth added 36). 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 · LXMLWebScrapingStrategy._process_element (cognitive 62) · ×1
  • LXMLWebScrapingStrategy._process_element (cognitive 62) crawl4ai/content_scraping_strategy.py:261 — LXMLWebScrapingStrategy._process_element has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 9 (17 pts), error handling 5 (10 pts), boolean chains 5 (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 · AsyncUrlSeeder._extract_text_context (cognitive 61) · ×1
  • AsyncUrlSeeder._extract_text_context (cognitive 61) REDACTED:1471 — AsyncUrlSeeder._extract_text_context has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 8 (18 pts), boolean chains 2 (nesting depth added 39). 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 · EmbeddingStrategy.select_links_for_expansion (cognitive 60) · ×1
  • EmbeddingStrategy.select_links_for_expansion (cognitive 60) REDACTED:871 — EmbeddingStrategy.select_links_for_expansion has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (39 pts), ternaries 4 (9 pts), loops 4 (7 pts), boolean chains 5 (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 · DomainMapper._scan_host (cognitive 59) · ×1
  • DomainMapper._scan_host (cognitive 59) REDACTED:506 — DomainMapper._scan_host has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 4 (11 pts), boolean chains 7, error handling 1 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent 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 · LXMLWebScrapingStrategy.process_image (cognitive 52) · ×1
  • LXMLWebScrapingStrategy.process_image (cognitive 52) crawl4ai/content_scraping_strategy.py:440 — LXMLWebScrapingStrategy.process_image has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 6 (12 pts), boolean chains 9, ternaries 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · async_configs._clamp_untrusted (cognitive 49) · ×1
  • async_configs._clamp_untrusted (cognitive 49) crawl4ai/async_configs.py:462 — async_configs._clamp_untrusted has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 5 (10 pts), ternaries 2 (8 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 · HTML2Text.handle_emphasis (cognitive 47) · ×1
  • HTML2Text.handle_emphasis (cognitive 47) crawl4ai/html2text/__init__.py:237 — HTML2Text.handle_emphasis has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 8, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CustomHTML2Text.handle_tag (cognitive 46) · ×1
  • CustomHTML2Text.handle_tag (cognitive 46) crawl4ai/html2text/__init__.py:1106 — CustomHTML2Text.handle_tag has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.clean_pdf_text (cognitive 46) · ×1
  • utils.clean_pdf_text (cognitive 46) crawl4ai/processors/pdf/utils.py:217 — utils.clean_pdf_text has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 5, loops 2 (4 pts), error handling 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 · MemoryAdaptiveDispatcher.run_urls_stream (cognitive 45) · ×1
  • MemoryAdaptiveDispatcher.run_urls_stream (cognitive 45) crawl4ai/async_dispatcher.py:530 — MemoryAdaptiveDispatcher.run_urls_stream has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 7 (14 pts), error handling 2 (6 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 · async_url_seeder._parse_head (cognitive 44) · ×1
  • async_url_seeder._parse_head (cognitive 44) REDACTED:187 — async_url_seeder._parse_head has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (12 pts), error handling 3 (8 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DomainMapper._parse_feed_xml (cognitive 44) · ×1
  • DomainMapper._parse_feed_xml (cognitive 44) REDACTED:853 — DomainMapper._parse_feed_xml has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 6 (13 pts), boolean chains 3, error handling 1 (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 · LLMTableExtraction._process_chunk (cognitive 44) · ×1
  • LLMTableExtraction._process_chunk (cognitive 44) crawl4ai/table_extraction.py:1135 — LLMTableExtraction._process_chunk has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 3 (7 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PruningContentFilterLXML._compute_metrics (cognitive 43) · ×1
  • PruningContentFilterLXML._compute_metrics (cognitive 43) crawl4ai/content_filter_strategy_lxml.py:217 — PruningContentFilterLXML._compute_metrics has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 2 (7 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.clean_pdf_text_to_html (cognitive 43) · ×1
  • utils.clean_pdf_text_to_html (cognitive 43) crawl4ai/processors/pdf/utils.py:71 — utils.clean_pdf_text_to_html has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · C4AScriptError.from_exception (cognitive 43) · ×1
  • C4AScriptError.from_exception (cognitive 43) REDACTED:50 — C4AScriptError.from_exception has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 1 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 25). 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 · async_configs._filter_untrusted_fields (cognitive 42) · ×1
  • async_configs._filter_untrusted_fields (cognitive 42) crawl4ai/async_configs.py:398 — async_configs._filter_untrusted_fields has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 19, if/else 13 (19 pts), ternaries 2 (3 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 · URLPatternFilter.apply (cognitive 42) · ×1
  • URLPatternFilter.apply (cognitive 42) crawl4ai/deep_crawling/filters.py:219 — URLPatternFilter.apply has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 6 (19 pts), if/else 9 (18 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 · Compiler._emit_js (cognitive 42) · ×1
  • Compiler._emit_js (cognitive 42) REDACTED:387 — Compiler._emit_js has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (28 pts), ternaries 5 (11 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 · utils.preprocess_html_for_schema (cognitive 40) · ×1
  • utils.preprocess_html_for_schema (cognitive 40) REDACTED:3127 — utils.preprocess_html_for_schema has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 7 (10 pts), boolean chains 5, ternaries 1 (2 pts), 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 · async_configs.from_serializable_dict (cognitive 39) · ×1
  • async_configs.from_serializable_dict (cognitive 39) crawl4ai/async_configs.py:647 — async_configs.from_serializable_dict has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · antibot_detector.is_blocked (cognitive 38) · ×1
  • antibot_detector.is_blocked (cognitive 38) crawl4ai/antibot_detector.py:191 — antibot_detector.is_blocked has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 4 (8 pts), boolean chains 4 (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 · MemoryAdaptiveDispatcher.run_urls (cognitive 38) · ×1
  • MemoryAdaptiveDispatcher.run_urls (cognitive 38) crawl4ai/async_dispatcher.py:374 — MemoryAdaptiveDispatcher.run_urls has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (12 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LLMContentFilter.filter_content (cognitive 38) · ×1
  • LLMContentFilter.filter_content (cognitive 38) REDACTED:935 — LLMContentFilter.filter_content has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (5 pts), boolean chains 4, error handling 2 (4 pts), loops 3 (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 · LXMLWebScrapingStrategy.remove_empty_elements_fast (cognitive 37) · ×1
  • LXMLWebScrapingStrategy.remove_empty_elements_fast (cognitive 37) crawl4ai/content_scraping_strategy.py:547 — LXMLWebScrapingStrategy.remove_empty_elements_fast has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · AsyncLLMTextManager.build_search_index (cognitive 37) · ×1
  • AsyncLLMTextManager.build_search_index (cognitive 37) REDACTED:225 — AsyncLLMTextManager.build_search_index has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (9 pts), boolean chains 3, error handling 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 · AsyncWebCrawler.aprocess_html (cognitive 35) · ×1
  • AsyncWebCrawler.aprocess_html (cognitive 35) crawl4ai/async_webcrawler.py:729 — AsyncWebCrawler.aprocess_html has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 6 (11 pts), boolean chains 5, error handling 3 (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 · BrowserManager._get_page_by_target_id (cognitive 35) · ×1
  • BrowserManager._get_page_by_target_id (cognitive 35) crawl4ai/browser_manager.py:1537 — BrowserManager._get_page_by_target_id has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 20). 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 · utils.calculate_link_intrinsic_score (cognitive 35) · ×1
  • utils.calculate_link_intrinsic_score (cognitive 35) REDACTED:3390 — utils.calculate_link_intrinsic_score has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 5, error handling 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 · ManagedBrowser.cleanup (cognitive 34) · ×1
  • ManagedBrowser.cleanup (cognitive 34) crawl4ai/browser_manager.py:428 — ManagedBrowser.cleanup has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 21). 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 · RelevantContentFilter.extract_text_chunks (cognitive 34) · ×1
  • RelevantContentFilter.extract_text_chunks (cognitive 34) REDACTED:162 — RelevantContentFilter.extract_text_chunks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 1 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · JsonElementExtractionStrategy._validate_schema (cognitive 33) · ×1
  • JsonElementExtractionStrategy._validate_schema (cognitive 33) crawl4ai/extraction_strategy.py:1366 — JsonElementExtractionStrategy._validate_schema has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, error handling 2, loops 1, 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 · ManagedBrowser.start (cognitive 32) · ×1
  • ManagedBrowser.start (cognitive 32) crawl4ai/browser_manager.py:188 — ManagedBrowser.start has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 4 (7 pts), loops 3 (6 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 · BFSDeepCrawlStrategy._arun_stream (cognitive 32) · ×1
  • BFSDeepCrawlStrategy._arun_stream (cognitive 32) crawl4ai/deep_crawling/bfs_strategy.py:312 — BFSDeepCrawlStrategy._arun_stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 4, loops 2 (3 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 · DFSDeepCrawlStrategy._arun_batch (cognitive 32) · ×1
  • DFSDeepCrawlStrategy._arun_batch (cognitive 32) crawl4ai/deep_crawling/dfs_strategy.py:28 — DFSDeepCrawlStrategy._arun_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (7 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (DFSDeepCrawlStrategy._arun_stream) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · DFSDeepCrawlStrategy._arun_stream (cognitive 32) · ×1
  • DFSDeepCrawlStrategy._arun_stream (cognitive 32) crawl4ai/deep_crawling/dfs_strategy.py:142 — DFSDeepCrawlStrategy._arun_stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (7 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (DFSDeepCrawlStrategy._arun_batch) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · crawler_pool.janitor (cognitive 32) · ×1
  • crawler_pool.janitor (cognitive 32) REDACTED:176 — crawler_pool.janitor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 2 (8 pts), loops 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · (anonymous) (cognitive 32) · ×1
  • (anonymous) (cognitive 32) crawl4ai/js_snippet/remove_overlay_elements.js:1 — (anonymous) has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 4 (5 pts), error handling 1 (4 pts) (nesting depth added 10). Most of this is not in the body itself: 10 of the 32 points are its own statements and the rest belongs to 9 function items inside it that branch (removeOverlays, a function literal at line 98, isDocumentStructure, …). 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 · AsyncUrlSeeder._fetch_head (cognitive 31) · ×1
  • AsyncUrlSeeder._fetch_head (cognitive 31) REDACTED:1360 — AsyncUrlSeeder._fetch_head has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 3 (6 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (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 · AsyncUrlSeeder.urls (cognitive 30) · ×1
  • AsyncUrlSeeder.urls (cognitive 30) REDACTED:369 — AsyncUrlSeeder.urls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, ternaries 4, 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 · utils.chunk_documents (cognitive 30) · ×1
  • utils.chunk_documents (cognitive 30) REDACTED:84 — utils.chunk_documents has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (9 pts), ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.extract_metadata_using_lxml (cognitive 30) · ×1
  • utils.extract_metadata_using_lxml (cognitive 30) REDACTED:1540 — utils.extract_metadata_using_lxml has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 7 (9 pts), boolean chains 5, loops 3, error handling 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 · MemoryAdaptiveDispatcher._memory_monitor_task (cognitive 29) · ×1
  • MemoryAdaptiveDispatcher._memory_monitor_task (cognitive 29) crawl4ai/async_dispatcher.py:175 — MemoryAdaptiveDispatcher._memory_monitor_task has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 2, loops 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 · AsyncUrlSeeder._calculate_url_relevance_score (cognitive 29) · ×1
  • AsyncUrlSeeder._calculate_url_relevance_score (cognitive 29) REDACTED:1524 — AsyncUrlSeeder._calculate_url_relevance_score has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (7 pts), ternaries 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 · JsonElementExtractionStrategy._extract_single_field (cognitive 29) · ×1
  • JsonElementExtractionStrategy._extract_single_field (cognitive 29) crawl4ai/extraction_strategy.py:1178 — JsonElementExtractionStrategy._extract_single_field has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 2 (6 pts), loops 1 (nesting depth added 15). 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 · CrawlerRunConfig.__init__ (cognitive 28) · ×1
  • CrawlerRunConfig.__init__ (cognitive 28) crawl4ai/async_configs.py:1850 — CrawlerRunConfig.__init__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 13, ternaries 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 · AsyncHTTPCrawlerStrategy._handle_http (cognitive 27) · ×1
  • AsyncHTTPCrawlerStrategy._handle_http (cognitive 27) REDACTED:2752 — AsyncHTTPCrawlerStrategy._handle_http has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 5, boolean chains 4, 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 · LLMExtractionStrategy.extract (cognitive 27) · ×1
  • LLMExtractionStrategy.extract (cognitive 27) crawl4ai/extraction_strategy.py:641 — LLMExtractionStrategy.extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, error handling 2, loops 2, 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. This shape REPEATS in the file: one other method here (LLMExtractionStrategy.aextract) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · LLMExtractionStrategy.aextract (cognitive 27) · ×1
  • LLMExtractionStrategy.aextract (cognitive 27) crawl4ai/extraction_strategy.py:843 — LLMExtractionStrategy.aextract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, error handling 2, loops 2, 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. This shape REPEATS in the file: one other method here (LLMExtractionStrategy.extract) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · utils.apply_png_predictor (cognitive 27) · ×1
  • utils.apply_png_predictor (cognitive 27) crawl4ai/processors/pdf/utils.py:3 — utils.apply_png_predictor has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 4 (10 pts), if/else 4 (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 · async_configs.to_serializable_dict (cognitive 26) · ×1
  • async_configs.to_serializable_dict (cognitive 26) crawl4ai/async_configs.py:551 — async_configs.to_serializable_dict has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, loops 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 · AsyncWebCrawler.arun_many (cognitive 26) · ×1
  • AsyncWebCrawler.arun_many (cognitive 26) crawl4ai/async_webcrawler.py:987 — AsyncWebCrawler.arun_many has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (7 pts), loops 1 (3 pts), boolean chains 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 · DomainMapper.scan (cognitive 26) · ×1
  • DomainMapper.scan (cognitive 26) REDACTED:206 — DomainMapper.scan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 2 (4 pts), boolean chains 3, loops 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, 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 · LocalSeleniumCrawlerStrategy.crawl (cognitive 26) · ×1
  • LocalSeleniumCrawlerStrategy.crawl (cognitive 26) REDACTED:206 — LocalSeleniumCrawlerStrategy.crawl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, error handling 3, loops 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 · api.handle_stream_crawl_request (cognitive 26) · ×1
  • api.handle_stream_crawl_request (cognitive 26) deploy/docker/api.py:980 — api.handle_stream_crawl_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, error handling 3, 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 · BrowserProfiler._listen_windows (cognitive 25) · ×1
  • BrowserProfiler._listen_windows (cognitive 25) crawl4ai/browser_profiler.py:196 — BrowserProfiler._listen_windows has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CacheValidator.validate (cognitive 25) · ×1
  • CacheValidator.validate (cognitive 25) crawl4ai/cache_validator.py:88 — CacheValidator.validate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 3, 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 · utils.get_content_of_website (cognitive 25) · ×1
  • utils.get_content_of_website (cognitive 25) REDACTED:932 — utils.get_content_of_website has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 9 (10 pts), error handling 2, 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 · LLMConfig.__init__ (cognitive 24) · ×1
  • LLMConfig.__init__ (cognitive 24) crawl4ai/async_configs.py:2493 — LLMConfig.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 6 (9 pts), boolean chains 3 (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 · AsyncPlaywrightCrawlerStrategy.robust_execute_user_script (cognitive 24) · ×1
  • AsyncPlaywrightCrawlerStrategy.robust_execute_user_script (cognitive 24) REDACTED:2053 — AsyncPlaywrightCrawlerStrategy.robust_execute_user_script has cognitive complexity 24 (threshold 15). Drivers by points: error handling 6 (15 pts), if/else 4 (6 pts), ternaries 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 · DomainMapper._scan_robots_txt (cognitive 24) · ×1
  • DomainMapper._scan_robots_txt (cognitive 24) REDACTED:671 — DomainMapper._scan_robots_txt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 pts), boolean chains 2, error handling 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 · WebCrawler.run (cognitive 24) · ×1
  • WebCrawler.run (cognitive 24) crawl4ai/legacy/web_crawler.py:121 — WebCrawler.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, error handling 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 · LinkPreview._merge_head_data (cognitive 24) · ×1
  • LinkPreview._merge_head_data (cognitive 24) crawl4ai/link_preview.py:276 — LinkPreview._merge_head_data has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 3 (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 · AsyncUrlSeeder._validate (cognitive 23) · ×1
  • AsyncUrlSeeder._validate (cognitive 23) REDACTED:1286 — AsyncUrlSeeder._validate has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 6 (7 pts), boolean chains 5 (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 · BrowserManager.create_browser_context (cognitive 23) · ×1
  • BrowserManager.create_browser_context (cognitive 23) crawl4ai/browser_manager.py:1304 — BrowserManager.create_browser_context has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (4 pts), 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 · PruningContentFilterLXML.filter_content (cognitive 23) · ×1
  • PruningContentFilterLXML.filter_content (cognitive 23) crawl4ai/content_filter_strategy_lxml.py:154 — PruningContentFilterLXML.filter_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts), boolean chains 2, error handling 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 · DomainMapper._scan_sitemaps (cognitive 23) · ×1
  • DomainMapper._scan_sitemaps (cognitive 23) REDACTED:713 — DomainMapper._scan_sitemaps has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), error handling 2 (6 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 · PDFContentScrapingStrategy._get_pdf_path (cognitive 23) · ×1
  • PDFContentScrapingStrategy._get_pdf_path (cognitive 23) crawl4ai/processors/pdf/__init__.py:305 — PDFContentScrapingStrategy._get_pdf_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (4 pts), boolean chains 2, loops 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 · artifacts.janitor (cognitive 23) · ×1
  • artifacts.janitor (cognitive 23) deploy/docker/artifacts.py:123 — artifacts.janitor has cognitive complexity 23 (threshold 15). Drivers by points: error handling 5 (12 pts), if/else 4 (8 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 · MemoryAdaptiveDispatcher.crawl_url (cognitive 22) · ×1
  • MemoryAdaptiveDispatcher.crawl_url (cognitive 22) crawl4ai/async_dispatcher.py:228 — MemoryAdaptiveDispatcher.crawl_url has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1, error handling 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 · AsyncUrlSeeder._from_cc (cognitive 22) · ×1
  • AsyncUrlSeeder._from_cc (cognitive 22) REDACTED:834 — AsyncUrlSeeder._from_cc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), error handling 2 (4 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 · BrowserManager.setup_context (cognitive 22) · ×1
  • BrowserManager.setup_context (cognitive 22) crawl4ai/browser_manager.py:1196 — BrowserManager.setup_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 1 (2 pts) (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 · browser_profiler.shrink_profile (cognitive 22) · ×1
  • browser_profiler.shrink_profile (cognitive 22) crawl4ai/browser_profiler.py:83 — browser_profiler.shrink_profile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (6 pts), error handling 1 (4 pts), boolean chains 2, 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 · PruningContentFilter._prune_tree (cognitive 22) · ×1
  • PruningContentFilter._prune_tree (cognitive 22) REDACTED:715 — PruningContentFilter._prune_tree has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · BFSDeepCrawlStrategy._arun_batch (cognitive 22) · ×1
  • BFSDeepCrawlStrategy._arun_batch (cognitive 22) crawl4ai/deep_crawling/bfs_strategy.py:207 — BFSDeepCrawlStrategy._arun_batch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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 · DFSDeepCrawlStrategy.link_discovery (cognitive 22) · ×1
  • DFSDeepCrawlStrategy.link_discovery (cognitive 22) crawl4ai/deep_crawling/dfs_strategy.py:246 — DFSDeepCrawlStrategy.link_discovery has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 2, ternaries 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 · DefaultTableExtraction.extract_tables (cognitive 22) · ×1
  • DefaultTableExtraction.extract_tables (cognitive 22) crawl4ai/table_extraction.py:90 — DefaultTableExtraction.extract_tables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 1 (4 pts), error handling 1 (3 pts), boolean chains 2, 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 · EmbeddingStrategy.update_state (cognitive 21) · ×1
  • EmbeddingStrategy.update_state (cognitive 21) REDACTED:1233 — EmbeddingStrategy.update_state has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), ternaries 2 (4 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 · BrowserConfig.__init__ (cognitive 21) · ×1
  • BrowserConfig.__init__ (cognitive 21) crawl4ai/async_configs.py:1041 — BrowserConfig.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 6, ternaries 4. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · DomainMapper._discover_via_crt (cognitive 21) · ×1
  • DomainMapper._discover_via_crt (cognitive 21) REDACTED:361 — DomainMapper._discover_via_crt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 1, error handling 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 · DefaultMarkdownGenerator.convert_links_to_citations (cognitive 21) · ×1
  • DefaultMarkdownGenerator.convert_links_to_citations (cognitive 21) crawl4ai/markdown_generation_strategy.py:82 — DefaultMarkdownGenerator.convert_links_to_citations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 2 (5 pts), boolean chains 2, 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 · LLMTableExtraction._create_smart_chunks (cognitive 21) · ×1
  • LLMTableExtraction._create_smart_chunks (cognitive 21) crawl4ai/table_extraction.py:1034 — LLMTableExtraction._create_smart_chunks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (6 pts), boolean chains 1 (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 · utils.extract_metadata (cognitive 21) · ×1
  • utils.extract_metadata (cognitive 21) REDACTED:1626 — utils.extract_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 4, loops 3 (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.
D2 · Cognitive Complexity · BrowserProfiler.create_profile (cognitive 20) · ×1
  • BrowserProfiler.create_profile (cognitive 20) crawl4ai/browser_profiler.py:382 — BrowserProfiler.create_profile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 3 (4 pts), loops 1, ternaries 1 (nesting depth added 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 · CrawlerMonitor.update_task (cognitive 20) · ×1
  • CrawlerMonitor.update_task (cognitive 20) crawl4ai/components/crawler_monitor.py:512 — CrawlerMonitor.update_task has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3 (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.
D2 · Cognitive Complexity · DomainMapper._scan_homepage (cognitive 20) · ×1
  • DomainMapper._scan_homepage (cognitive 20) REDACTED:902 — DomainMapper._scan_homepage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts), 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 · DefaultTableExtraction.is_data_table (cognitive 20) · ×1
  • DefaultTableExtraction.is_data_table (cognitive 20) crawl4ai/table_extraction.py:132 — DefaultTableExtraction.is_data_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · DefaultTableExtraction.extract_table_data (cognitive 20) · ×1
  • DefaultTableExtraction.extract_table_data (cognitive 20) crawl4ai/table_extraction.py:259 — DefaultTableExtraction.extract_table_data has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), boolean chains 3, ternaries 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · utils.normalize_url (cognitive 20) · ×1
  • utils.normalize_url (cognitive 20) REDACTED:2259 — utils.normalize_url has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 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 · CrawlerRunConfig.is_match (cognitive 19) · ×1
  • CrawlerRunConfig.is_match (cognitive 19) crawl4ai/async_configs.py:2269 — CrawlerRunConfig.is_match has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), loops 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 · AsyncPlaywrightCrawlerStrategy.smart_wait (cognitive 19) · ×1
  • AsyncPlaywrightCrawlerStrategy.smart_wait (cognitive 19) REDACTED:235 — AsyncPlaywrightCrawlerStrategy.smart_wait has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (8 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 · SemaphoreDispatcher.crawl_url (cognitive 19) · ×1
  • SemaphoreDispatcher.crawl_url (cognitive 19) crawl4ai/async_dispatcher.py:651 — SemaphoreDispatcher.crawl_url has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, error handling 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 · BrowserProfiler._listen_unix (cognitive 19) · ×1
  • BrowserProfiler._listen_unix (cognitive 19) crawl4ai/browser_profiler.py:252 — BrowserProfiler._listen_unix has cognitive complexity 19 (threshold 15). Drivers by points: error handling 6 (9 pts), if/else 4 (8 pts), boolean chains 1, 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 · BrowserProfiler.launch_standalone_browser (cognitive 19) · ×1
  • BrowserProfiler.launch_standalone_browser (cognitive 19) crawl4ai/browser_profiler.py:960 — BrowserProfiler.launch_standalone_browser has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 2 (3 pts), boolean chains 2, 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, 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 · BFSDeepCrawlStrategy.link_discovery (cognitive 19) · ×1
  • BFSDeepCrawlStrategy.link_discovery (cognitive 19) crawl4ai/deep_crawling/bfs_strategy.py:133 — BFSDeepCrawlStrategy.link_discovery has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, ternaries 1 (2 pts), 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 · URLPatternFilter._add_pattern (cognitive 19) · ×1
  • URLPatternFilter._add_pattern (cognitive 19) crawl4ai/deep_crawling/filters.py:185 — URLPatternFilter._add_pattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (5 pts), boolean chains 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 · monitor_routes.restart_browser (cognitive 19) · ×1
  • monitor_routes.restart_browser (cognitive 19) deploy/docker/monitor_routes.py:258 — monitor_routes.restart_browser has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2, 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 · server.get_context (cognitive 19) · ×1
  • server.get_context (cognitive 19) deploy/docker/server.py:1103 — server.get_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (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 · BFSDeepCrawlStrategy.traverse (cognitive 18) · ×1
  • BFSDeepCrawlStrategy.traverse (cognitive 18) crawl4ai/deep_crawling/crazy.py:326 — BFSDeepCrawlStrategy.traverse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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 · C4ACompiler._handle_unexpected_token (cognitive 18) · ×1
  • C4ACompiler._handle_unexpected_token (cognitive 18) crawl4ai/script/c4a_compile.py:175 — C4ACompiler._handle_unexpected_token has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (5 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 · OnlineUAGenerator.generate (cognitive 18) · ×1
  • OnlineUAGenerator.generate (cognitive 18) crawl4ai/user_agent_generator.py:109 — OnlineUAGenerator.generate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (5 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 · api._load_crawler_configs (cognitive 18) · ×1
  • api._load_crawler_configs (cognitive 18) deploy/docker/api.py:653 — api._load_crawler_configs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 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 · cli.manage_profiles (cognitive 17) · ×1
  • cli.manage_profiles (cognitive 17) crawl4ai/cli.py:581 — cli.manage_profiles has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (12 pts), loops 2 (3 pts), if/else 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · cli.auth_cmd (cognitive 17) · ×1
  • cli.auth_cmd (cognitive 17) crawl4ai/cloud/cli.py:94 — cli.auth_cmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 1 (3 pts), boolean chains 1, 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 · DomainMapper._apply_scoring (cognitive 17) · ×1
  • DomainMapper._apply_scoring (cognitive 17) REDACTED:1052 — DomainMapper._apply_scoring has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (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 · HTML2Text.previousIndex (cognitive 17) · ×1
  • HTML2Text.previousIndex (cognitive 17) crawl4ai/html2text/__init__.py:209 — HTML2Text.previousIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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 · HTML2Text.optwrap (cognitive 17) · ×1
  • HTML2Text.optwrap (cognitive 17) crawl4ai/html2text/__init__.py:999 — HTML2Text.optwrap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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 · LinkPreview._filter_links (cognitive 17) · ×1
  • LinkPreview._filter_links (cognitive 17) crawl4ai/link_preview.py:112 — LinkPreview._filter_links has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, 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 · DefaultMarkdownGenerator.generate_markdown (cognitive 17) · ×1
  • DefaultMarkdownGenerator.generate_markdown (cognitive 17) crawl4ai/markdown_generation_strategy.py:148 — DefaultMarkdownGenerator.generate_markdown has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, error handling 4 (6 pts), if/else 4 (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 · LLMTableExtraction._extract_table_structure (cognitive 17) · ×1
  • LLMTableExtraction._extract_table_structure (cognitive 17) crawl4ai/table_extraction.py:973 — LLMTableExtraction._extract_table_structure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 1 (2 pts), boolean chains 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, 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 · LLMTableExtraction._extract_with_chunking (cognitive 17) · ×1
  • LLMTableExtraction._extract_with_chunking (cognitive 17) crawl4ai/table_extraction.py:1261 — LLMTableExtraction._extract_with_chunking has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (2 pts), ternaries 1 (2 pts), 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 · utils.advanced_split (cognitive 17) · ×1
  • utils.advanced_split (cognitive 17) REDACTED:462 — utils.advanced_split has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, 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 · utils.get_content_of_website_optimized (cognitive 17) · ×1
  • utils.get_content_of_website_optimized (cognitive 17) REDACTED:1186 — utils.get_content_of_website_optimized has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), error handling 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 · utils.quick_extract_links (cognitive 17) · ×1
  • utils.quick_extract_links (cognitive 17) REDACTED:2459 — utils.quick_extract_links has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 2, 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 · monitor_routes.kill_browser (cognitive 17) · ×1
  • monitor_routes.kill_browser (cognitive 17) deploy/docker/monitor_routes.py:189 — monitor_routes.kill_browser has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), error handling 2, 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 · script.extractImageData (cognitive 17) · ×1
  • script.extractImageData (cognitive 17) crawl4ai/crawlers/google_search/script.js:3 — script.extractImageData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (4 pts), loops 2, 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 · flatten_shadow_dom.serializeShadowChild (cognitive 17) · ×1
  • flatten_shadow_dom.serializeShadowChild (cognitive 17) crawl4ai/js_snippet/flatten_shadow_dom.js:53 — flatten_shadow_dom.serializeShadowChild has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 3 (7 pts) (nesting depth added 5). 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 · AsyncPlaywrightCrawlerStrategy.crawl (cognitive 16) · ×1
  • AsyncPlaywrightCrawlerStrategy.crawl (cognitive 16) REDACTED:437 — AsyncPlaywrightCrawlerStrategy.crawl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, ternaries 1 (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 · MemoryAdaptiveDispatcher._update_queue_priorities (cognitive 16) · ×1
  • MemoryAdaptiveDispatcher._update_queue_priorities (cognitive 16) crawl4ai/async_dispatcher.py:471 — MemoryAdaptiveDispatcher._update_queue_priorities has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 2 (3 pts), 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 · AsyncLogger._log (cognitive 16) · ×1
  • AsyncLogger._log (cognitive 16) crawl4ai/async_logger.py:182 — AsyncLogger._log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 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 · AsyncUrlSeeder._apply_bm25_scoring (cognitive 16) · ×1
  • AsyncUrlSeeder._apply_bm25_scoring (cognitive 16) REDACTED:757 — AsyncUrlSeeder._apply_bm25_scoring has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · NaivePDFProcessorStrategy.process_batch (cognitive 16) · ×1
  • NaivePDFProcessorStrategy.process_batch (cognitive 16) crawl4ai/processors/pdf/processor.py:142 — NaivePDFProcessorStrategy.process_batch has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (6 pts), if/else 5 (6 pts), boolean chains 2, loops 2 (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 · DefaultTableExtraction._build_grid (cognitive 16) · ×1
  • DefaultTableExtraction._build_grid (cognitive 16) crawl4ai/table_extraction.py:217 — DefaultTableExtraction._build_grid has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (13 pts), boolean chains 2, if/else 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · utils.perform_completion_with_backoff (cognitive 16) · ×1
  • utils.perform_completion_with_backoff (cognitive 16) REDACTED:1785 — utils.perform_completion_with_backoff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), ternaries 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. This shape REPEATS in the file: one other method here (utils.aperform_completion_with_backoff) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · utils.aperform_completion_with_backoff (cognitive 16) · ×1
  • utils.aperform_completion_with_backoff (cognitive 16) REDACTED:1877 — utils.aperform_completion_with_backoff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), ternaries 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. This shape REPEATS in the file: one other method here (utils.perform_completion_with_backoff) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · utils.get_text_embeddings (cognitive 16) · ×1
  • utils.get_text_embeddings (cognitive 16) REDACTED:3554 — utils.get_text_embeddings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 1 (2 pts), loops 1 (2 pts), 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 · api.handle_markdown_request (cognitive 16) · ×1
  • api.handle_markdown_request (cognitive 16) deploy/docker/api.py:334 — api.handle_markdown_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, error handling 3, ternaries 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 · crawler_pool.get_crawler (cognitive 16) · ×1
  • crawler_pool.get_crawler (cognitive 16) REDACTED:72 — crawler_pool.get_crawler has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (3 pts), 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 · (anonymous) (cognitive 16) · ×1
  • (anonymous) (cognitive 16) crawl4ai/js_snippet/update_image_dimensions.js:1 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 6 function items inside it that branch ((anonymous)::filterImage, (anonymous)::checkImage, a function literal at line 2, …). 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member pair (86 shared lines) · ×1
  • Near-duplicate member pair (86 shared lines) REDACTED:1005 — REDACTED:1005-1108 | REDACTED:1111-1283 — These two members are variants of one another: 86 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (77 shared lines) · ×1
  • Near-duplicate member pair (77 shared lines) crawl4ai/deep_crawling/dfs_strategy.py:34 — crawl4ai/deep_crawling/dfs_strategy.py:34-140 | crawl4ai/deep_crawling/dfs_strategy.py:148-244 — These two members are variants of one another: 77 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (68 shared lines) · ×1
  • Near-duplicate member pair (68 shared lines) crawl4ai/async_dispatcher.py:235 — crawl4ai/async_dispatcher.py:235-372 | crawl4ai/async_dispatcher.py:658-760 — These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Near-duplicate member pair (59 shared lines) · ×1
  • Near-duplicate member pair (59 shared lines) crawl4ai/processors/pdf/utils.py:73 — crawl4ai/processors/pdf/utils.py:73-215 | crawl4ai/processors/pdf/utils.py:219-354 — These two members are variants of one another: 59 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) REDACTED:1740 — REDACTED:1740-1810 | REDACTED:1842-1875 | REDACTED:1878-1990 | REDACTED:1995-2024 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (127 corresponding lines) · ×1
  • Edited copy of a member (127 corresponding lines) crawl4ai/extraction_strategy.py:642 — crawl4ai/extraction_strategy.py:642-772 | crawl4ai/extraction_strategy.py:844-970 — These two members are one piece of code written twice and then edited apart: 127 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 (98 corresponding lines) · ×1
  • Edited copy of a member (98 corresponding lines) crawl4ai/deep_crawling/bfs_strategy.py:213 — crawl4ai/deep_crawling/bfs_strategy.py:213-310 | crawl4ai/deep_crawling/bfs_strategy.py:318-422 — These two members are one piece of code written twice and then edited apart: 98 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 (90 corresponding lines) · ×1
  • Edited copy of a member (90 corresponding lines) crawl4ai/async_dispatcher.py:380 — crawl4ai/async_dispatcher.py:380-469 | crawl4ai/async_dispatcher.py:536-636 — These two members are one piece of code written twice and then edited apart: 90 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 (64 corresponding lines) · ×1
  • Edited copy of a member (64 corresponding lines) crawl4ai/deep_crawling/bfs_strategy.py:142 — crawl4ai/deep_crawling/bfs_strategy.py:142-205 | crawl4ai/deep_crawling/dfs_strategy.py:255-333 — These two members are one piece of code written twice and then edited apart: 64 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 (35 corresponding lines) · ×1
  • Edited copy of a member (35 corresponding lines) REDACTED:772 — REDACTED:772-806 | crawl4ai/content_filter_strategy_lxml.py:347-381 — These two members are one piece of code written twice and then edited apart: 35 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) · ×1
  • Edited copy of a member (15 corresponding lines) REDACTED:1108 — REDACTED:1108-1124 | crawl4ai/extraction_strategy.py:1021-1035 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (67 corresponding lines) · ×1
  • Edited copy of a member (67 corresponding lines) REDACTED:1797 — REDACTED:1797-1863 | REDACTED:1889-1956 — These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (29 corresponding lines) · ×1
  • Edited copy of a member (29 corresponding lines) deploy/docker/server.py:751 — deploy/docker/server.py:751-779 | deploy/docker/server.py:792-820 — 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 copy of a member (41 corresponding lines) · ×1
  • Edited copy of a member (41 corresponding lines) crawl4ai/browser_profiler.py:688 — crawl4ai/browser_profiler.py:688-728 | crawl4ai/browser_profiler.py:731-778 — These two members are one piece of code written twice and then edited apart: 41 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) deploy/docker/job.py:75 — deploy/docker/job.py:75-98 | deploy/docker/job.py:120-138 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) crawl4ai/deep_crawling/crazy.py:197 — crawl4ai/deep_crawling/crazy.py:197-206 | crawl4ai/deep_crawling/crazy.py:210-218 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) crawl4ai/async_configs.py:1202 — crawl4ai/async_configs.py:1202-1211 | crawl4ai/async_configs.py:2337-2346 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) crawl4ai/browser_adapter.py:68 — crawl4ai/browser_adapter.py:68-99 | crawl4ai/browser_adapter.py:185-219 — 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 (27 corresponding lines) · ×1
  • Edited copy of a member (27 corresponding lines) REDACTED:1724 — REDACTED:1724-1750 | REDACTED:1753-1782 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 11+ corresponding lines) crawl4ai/legacy/database.py:57 — crawl4ai/legacy/database.py:57-70 | crawl4ai/legacy/database.py:85-120 | crawl4ai/legacy/database.py:162-172 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×1
  • Edited copy of a member (13 corresponding lines) crawl4ai/migrations.py:25 — crawl4ai/migrations.py:25-37 | REDACTED:2952-2968 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) crawl4ai/cli.py:47 — crawl4ai/cli.py:47-55 | crawl4ai/cloud/cli.py:35-40 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) REDACTED:186 — REDACTED:186-189 | crawl4ai/table_extraction.py:59-63 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (82–87 lines × 2) · ×1
  • Duplicated block (82–87 lines × 2) crawl4ai/extraction_strategy.py:686 — crawl4ai/extraction_strategy.py:686-772 | crawl4ai/extraction_strategy.py:889-970 — 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 `crawl4ai/extraction_strategy.py:686` 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 (46–49 lines × 2) · ×1
  • Duplicated block (46–49 lines × 2) crawl4ai/deep_crawling/dfs_strategy.py:90 — crawl4ai/deep_crawling/dfs_strategy.py:90-138 | crawl4ai/deep_crawling/dfs_strategy.py:199-244 — 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.
D4 · Code Duplication · Duplicated block (43–45 lines × 2) · ×1
  • Duplicated block (43–45 lines × 2) crawl4ai/async_dispatcher.py:403 — crawl4ai/async_dispatcher.py:403-447 | crawl4ai/async_dispatcher.py:558-600 — 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.
D4 · Code Duplication · Duplicated block (33–42 lines × 2) · ×1
  • Duplicated block (33–42 lines × 2) REDACTED:1546 — REDACTED:1546-1578 | REDACTED:1581-1622 — 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 (38–39 lines × 2) · ×1
  • Duplicated block (38–39 lines × 2) crawl4ai/browser_manager.py:1619 — crawl4ai/browser_manager.py:1619-1656 | crawl4ai/browser_manager.py:1718-1756 — 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 (19–37 lines × 2) · ×1
  • Duplicated block (19–37 lines × 2) crawl4ai/deep_crawling/bff_strategy.py:155 — crawl4ai/deep_crawling/bff_strategy.py:155-173 | crawl4ai/deep_crawling/dfs_strategy.py:255-291 — 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 (31–34 lines × 2) · ×1
  • Duplicated block (31–34 lines × 2) crawl4ai/deep_crawling/bfs_strategy.py:172 — crawl4ai/deep_crawling/bfs_strategy.py:172-205 | crawl4ai/deep_crawling/dfs_strategy.py:303-333 — 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 (31–32 lines × 2) · ×1
  • Duplicated block (31–32 lines × 2) crawl4ai/async_dispatcher.py:235 — crawl4ai/async_dispatcher.py:235-265 | crawl4ai/async_dispatcher.py:658-689 — 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 `crawl4ai/async_dispatcher.py:235` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crawl4ai/async_dispatcher.py:265` calls `time` and `crawl4ai/async_dispatcher.py:689` 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 (31 lines × 2) · ×1
  • Duplicated block (31 lines × 2) crawl4ai/browser_adapter.py:69 — crawl4ai/browser_adapter.py:69-99 | crawl4ai/browser_adapter.py:189-219 — 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, `crawl4ai/browser_adapter.py:187` calls `apply_stealth` and `crawl4ai/browser_adapter.py:67` 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 (30 lines × 2) · ×1
  • Duplicated block (30 lines × 2) crawl4ai/browser_adapter.py:102 — crawl4ai/browser_adapter.py:102-131 | crawl4ai/browser_adapter.py:222-251 — 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 (29–30 lines × 2) · ×1
  • Duplicated block (29–30 lines × 2) crawl4ai/processors/pdf/utils.py:187 — crawl4ai/processors/pdf/utils.py:187-215 | crawl4ai/processors/pdf/utils.py:325-354 — 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 `crawl4ai/processors/pdf/utils.py:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) crawl4ai/deep_crawling/bff_strategy.py:117 — crawl4ai/deep_crawling/bff_strategy.py:117-144 | crawl4ai/deep_crawling/bfs_strategy.py:104-131 — before extracting anything, compare `crawl4ai/deep_crawling/bff_strategy.py` and `crawl4ai/deep_crawling/bfs_strategy.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — 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 (21–27 lines × 2) · ×1
  • Duplicated block (21–27 lines × 2) REDACTED:1088 — REDACTED:1088-1108 | REDACTED:1257-1283 — 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, `REDACTED:1254` calls `_log` and `REDACTED:1087` 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 (26–27 lines × 2) · ×1
  • Duplicated block (26–27 lines × 2) crawl4ai/extraction_strategy.py:658 — crawl4ai/extraction_strategy.py:658-684 | crawl4ai/extraction_strategy.py:862-887 — 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 (24–26 lines × 2) · ×1
  • Duplicated block (24–26 lines × 2) crawl4ai/async_dispatcher.py:334 — crawl4ai/async_dispatcher.py:334-357 | crawl4ai/async_dispatcher.py:723-748 — 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 `crawl4ai/async_dispatcher.py:334` 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 (17–24 lines × 2) · ×1
  • Duplicated block (17–24 lines × 2) crawl4ai/cloud/cli.py:335 — crawl4ai/cloud/cli.py:335-351 | crawl4ai/cloud/cli.py:401-424 — 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 (20–23 lines × 2) · ×1
  • Duplicated block (20–23 lines × 2) REDACTED:1009 — REDACTED:1009-1028 | REDACTED:1130-1152 — 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 (22–23 lines × 2) · ×1
  • Duplicated block (22–23 lines × 2) crawl4ai/deep_crawling/bfs_strategy.py:213 — crawl4ai/deep_crawling/bfs_strategy.py:213-235 | crawl4ai/deep_crawling/bfs_strategy.py:318-339 — 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 (21–22 lines × 2) · ×1
  • Duplicated block (21–22 lines × 2) crawl4ai/cache_validator.py:134 — crawl4ai/cache_validator.py:134-154 | crawl4ai/cache_validator.py:165-186 — 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 `crawl4ai/cache_validator.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.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) crawl4ai/user_agent_generator.py:45 — crawl4ai/user_agent_generator.py:45-66 | crawl4ai/user_agent_generator.py:393-414 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) crawl4ai/deep_crawling/bff_strategy.py:51 — crawl4ai/deep_crawling/bff_strategy.py:51-71 | crawl4ai/deep_crawling/bfs_strategy.py:40-60 — before extracting anything, compare `crawl4ai/deep_crawling/bff_strategy.py` and `crawl4ai/deep_crawling/bfs_strategy.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (17–20 lines × 2) · ×1
  • Duplicated block (17–20 lines × 2) REDACTED:1071 — REDACTED:1071-1087 | REDACTED:1234-1253 — 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 `REDACTED:1234` 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 after the matched lines, `REDACTED:1254` calls `_log` and `REDACTED:1088` 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 (19–20 lines × 2) · ×1
  • Duplicated block (19–20 lines × 2) crawl4ai/cli.py:708 — crawl4ai/cli.py:708-727 | crawl4ai/cli.py:904-922 — 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 `crawl4ai/cli.py:708` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `browser_type` to `str` in one and `Optional[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (19 lines × 3) · ×1
  • Duplicated block (19 lines × 3) REDACTED:2293 — REDACTED:2293-2311 | REDACTED:2365-2383 | REDACTED:2423-2441 — 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.
D4 · Code Duplication · Duplicated block (16–19 lines × 2) · ×1
  • Duplicated block (16–19 lines × 2) crawl4ai/deep_crawling/bff_strategy.py:166 — crawl4ai/deep_crawling/bff_strategy.py:166-181 | crawl4ai/deep_crawling/bfs_strategy.py:154-172 — before extracting anything, compare `crawl4ai/deep_crawling/bff_strategy.py` and `crawl4ai/deep_crawling/bfs_strategy.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `crawl4ai/deep_crawling/bff_strategy.py:186` calls `get` and `crawl4ai/deep_crawling/bfs_strategy.py:173` 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 (18–19 lines × 2) · ×1
  • Duplicated block (18–19 lines × 2) crawl4ai/deep_crawling/dfs_strategy.py:34 — crawl4ai/deep_crawling/dfs_strategy.py:34-52 | crawl4ai/deep_crawling/dfs_strategy.py:148-165 — 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 (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) REDACTED:1160 — REDACTED:1160-1179 | REDACTED:1519-1537 — 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–18 lines × 2) · ×1
  • Duplicated block (17–18 lines × 2) crawl4ai/async_database.py:164 — crawl4ai/async_database.py:164-181 | crawl4ai/async_database.py:185-201 — 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 (13–17 lines × 3) · ×1
  • Duplicated block (13–17 lines × 3) crawl4ai/crawlers/google_search/crawler.py:77 — crawl4ai/crawlers/google_search/crawler.py:77-93 | crawl4ai/crawlers/google_search/crawler.py:96-112 | crawl4ai/crawlers/google_search/crawler.py:113-125 — 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 `crawl4ai/crawlers/google_search/crawler.py:77` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crawl4ai/crawlers/google_search/crawler.py:76` calls `open`, `load` and `crawl4ai/crawlers/google_search/crawler.py:113` 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 (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) REDACTED:1835 — REDACTED:1835-1851 | REDACTED:1928-1944 — 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 (14–16 lines × 3) · ×1
  • Duplicated block (14–16 lines × 3) REDACTED:1861 — REDACTED:1861-1874 | REDACTED:1976-1989 | REDACTED:2008-2023 — 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) REDACTED:2186 — REDACTED:2186-2201 | REDACTED:2279-2294 — 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.
D4 · Code Duplication · Duplicated block (10–15 lines × 2) · ×1
  • Duplicated block (10–15 lines × 2) crawl4ai/async_dispatcher.py:317 — crawl4ai/async_dispatcher.py:317-331 | crawl4ai/async_dispatcher.py:704-713 — 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 `crawl4ai/async_dispatcher.py:317` 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 (12–15 lines × 2) · ×1
  • Duplicated block (12–15 lines × 2) crawl4ai/processors/pdf/utils.py:139 — crawl4ai/processors/pdf/utils.py:139-150 | crawl4ai/processors/pdf/utils.py:277-291 — 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 (12–14 lines × 3) · ×1
  • Duplicated block (12–14 lines × 3) crawl4ai/browser_manager.py:2024 — crawl4ai/browser_manager.py:2024-2035 | crawl4ai/browser_manager.py:2048-2061 | crawl4ai/browser_manager.py:2087-2098 — 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.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) crawl4ai/processors/pdf/processor.py:127 — crawl4ai/processors/pdf/processor.py:127-140 | crawl4ai/processors/pdf/processor.py:206-219 — 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 `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 (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) crawl4ai/extraction_strategy.py:2318 — crawl4ai/extraction_strategy.py:2318-2330 | crawl4ai/extraction_strategy.py:2435-2447 | crawl4ai/extraction_strategy.py:2514-2526 — 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. 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 (10–12 lines × 2) · ×1
  • Duplicated block (10–12 lines × 2) crawl4ai/browser_manager.py:1928 — crawl4ai/browser_manager.py:1928-1939 | crawl4ai/browser_manager.py:1944-1953 — 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 `crawl4ai/browser_manager.py:1928` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×1
  • Duplicated block (9 lines × 3) crawl4ai/async_configs.py:2322 — crawl4ai/async_configs.py:2322-2330 | REDACTED:909-917 | crawl4ai/extraction_strategy.py:631-639 — 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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) crawl4ai/processors/pdf/processor.py:111 — crawl4ai/processors/pdf/processor.py:111-118 | crawl4ai/processors/pdf/processor.py:173-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `crawl4ai/processors/pdf/processor.py:170` calls `_page_limit` and `crawl4ai/processors/pdf/processor.py:108` 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 (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) deploy/docker/api.py:154 — deploy/docker/api.py:154-160 | deploy/docker/api.py:386-393 — 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 `deploy/docker/api.py:386` 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 (7 lines × 3) · ×1
  • Duplicated block (7 lines × 3) crawl4ai/async_database.py:167 — crawl4ai/async_database.py:167-173 | crawl4ai/async_database.py:188-194 | crawl4ai/async_webcrawler.py:708-715 — 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.
D4 · Code Duplication · Duplicated block (5–7 lines × 3) · ×1
  • Duplicated block (5–7 lines × 3) REDACTED:1685 — REDACTED:1685-1691 | REDACTED:1693-1699 | REDACTED:1700-1704 — 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) crawl4ai/cli.py:1281 — crawl4ai/cli.py:1281-1286 | crawl4ai/cli.py:1290-1295 — 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 `crawl4ai/cli.py:1281` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) REDACTED:1796 — REDACTED:1796-1800 | REDACTED:1870-1874 | REDACTED:1985-1989 | REDACTED:2018-2023 — 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.
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×1
  • Duplicated block (12 lines × 2) crawl4ai/deep_crawling/base_strategy.py:88 — crawl4ai/deep_crawling/base_strategy.py:88-105 | crawl4ai/deep_crawling/bff_strategy.py:407-418 — 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 (22–25 lines × 2) · ×1
  • Duplicated block (22–25 lines × 2) scripts/update_stats.py:154 — scripts/update_stats.py:154-178 | scripts/update_stats.py:182-203 — 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: JsonLxmlExtractionStrategy (LCOM4 4) crawl4ai/extraction_strategy.py:2051 — JsonLxmlExtractionStrategy'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.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 0 typed · 6 plain JS — the untyped files are crawl4ai/crawlers/google_search/script.js, crawl4ai/js_snippet/flatten_shadow_dom.js, crawl4ai/js_snippet/navigator_overrider.js, crawl4ai/js_snippet/remove_consent_popups.js, crawl4ai/js_snippet/remove_overlay_elements.js, crawl4ai/js_snippet/update_image_dimensions.js.
R10 · Code Duplication · Forked directory tree (20 identical files, ~6921 lines × 2 trees) · ×1
  • Forked directory tree (20 identical files, ~6921 lines × 2 trees) docs/md_v2/apps/c4a-script/assets/app.js:1 — docs/examples/c4a_script/tutorial/ and docs/md_v2/apps/c4a-script/ are near-verbatim copies of each other: 20 files are byte-identical under the same relative paths (~6921 lines; the trees hold 21 and 21 files). That is one structural fact, not 20 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) — or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place.
R10 · Code Duplication · Duplicated block with local edits (20 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (20 matched lines × 2 locations) crawl4ai/js_snippet/flatten_shadow_dom.js:19 — crawl4ai/js_snippet/flatten_shadow_dom.js:19 · crawl4ai/js_snippet/flatten_shadow_dom.js:53 — the two spans are one implementation copied and then locally edited — 155 tokens are still identical, in the same order in both spans, 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.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 44, cognitive 87) · ×1
  • Complex function (anonymous) (cyclomatic 44, cognitive 87) crawl4ai/js_snippet/remove_consent_popups.js:1 — (anonymous) has cyclomatic complexity 44 and cognitive complexity 87; 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 serializeShadowChild (cyclomatic 12, cognitive 17) · ×1
  • Complex function serializeShadowChild (cyclomatic 12, cognitive 17) crawl4ai/js_snippet/flatten_shadow_dom.js:53 — serializeShadowChild has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function removeOverlays (cyclomatic 12, cognitive 10) · ×1
  • Complex function removeOverlays (cyclomatic 12, cognitive 10) crawl4ai/js_snippet/remove_overlay_elements.js:59 — removeOverlays has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function extractImageData (cyclomatic 11, cognitive 17) · ×1
  • Complex function extractImageData (cyclomatic 11, cognitive 17) crawl4ai/crawlers/google_search/script.js:3 — extractImageData has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · crawl4ai/js_snippet/remove_consent_popups.js · ×1
  • crawl4ai/js_snippet/remove_consent_popups.js: 619 lines of code crawl4ai/js_snippet/remove_consent_popups.js:1 — crawl4ai/js_snippet/remove_consent_popups.js has 619 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R7 · Dead Code · Dead file (~715 LoC) · ×1
  • Dead file (~715 LoC) crawl4ai/js_snippet/remove_consent_popups.js — no import path from any entry point (1 application, 0 tooling, 0 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 (~127 LoC) · ×1
  • Dead file (~127 LoC) crawl4ai/js_snippet/remove_overlay_elements.js — no import path from any entry point (1 application, 0 tooling, 0 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 (~104 LoC) · ×1
  • Dead file (~104 LoC) crawl4ai/js_snippet/flatten_shadow_dom.js — no import path from any entry point (1 application, 0 tooling, 0 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 (~54 LoC) · ×1
  • Dead file (~54 LoC) crawl4ai/js_snippet/update_image_dimensions.js — no import path from any entry point (1 application, 0 tooling, 0 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 (~25 LoC) · ×1
  • Dead file (~25 LoC) crawl4ai/js_snippet/navigator_overrider.js — no import path from any entry point (1 application, 0 tooling, 0 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
S1 · Web-Security Posture · Third-party script without Subresource Integrity · ×1
  • Third-party script without Subresource Integrity deploy/docker/static/monitor/index.html:7 — `https://cdn.tailwindcss.com` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 8 such include(s) across the repository's markup.
X24 · Document value interpolated into markup unescaped · Document value reaches a markup attribute unescaped · ×1
  • Document value reaches a markup attribute unescaped REDACTED:906 — `tag.text` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the text of an element of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `tag.text` at this site, or validate it against the shape the position accepts before interpolating it.
Minor — 91 finding(s)
X4 · Structured logging · Interpolated log message defeats structured logging · ×40
  • Interpolated log message defeats structured logging deploy/docker/api.py:112 — `warning` at line 112 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 deploy/docker/api.py:195 — `error` at line 195 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 deploy/docker/api.py:318 — `error` at line 318 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 deploy/docker/api.py:413 — `error` at line 413 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 deploy/docker/api.py:478 — `error` at line 478 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 deploy/docker/api.py:634 — `info` at line 634 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.
  • Interpolated log message defeats structured logging deploy/docker/api.py:638 — `error` at line 638 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 deploy/docker/api.py:815 — `info` at line 815 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.
  • Interpolated log message defeats structured logging deploy/docker/api.py:857 — `info` at line 857 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.
  • Interpolated log message defeats structured logging deploy/docker/api.py:870 — `warning` at line 870 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 deploy/docker/api.py:891 — `error` at line 891 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 deploy/docker/api.py:943 — `error` at line 943 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 deploy/docker/api.py:1047 — `info` at line 1047 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.
  • Interpolated log message defeats structured logging deploy/docker/api.py:1096 — `error` at line 1096 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:94 — `info` at line 94 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.
  • Interpolated log message defeats structured logging REDACTED:107 — `info` at line 107 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.
  • Interpolated log message defeats structured logging REDACTED:119 — `info` at line 119 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.
  • Interpolated log message defeats structured logging REDACTED:125 — `error` at line 125 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:129 — `info` at line 129 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.
  • Interpolated log message defeats structured logging REDACTED:200 — `info` at line 200 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.
  • Interpolated log message defeats structured logging REDACTED:221 — `info` at line 221 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.
  • Interpolated log message defeats structured logging REDACTED:237 — `info` 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.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 deploy/docker/monitor.py:176 — `warning` at line 176 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 deploy/docker/monitor.py:188 — `error` at line 188 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 deploy/docker/monitor.py:217 — `error` at line 217 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 · ×14
  • Duplicated predicate docs/md_v2/marketplace/app-detail.js:50 — `app.slug === this.appSlug || app.name.toLowerCase().replace(/\s+/g, '-') === this.appSlug` appears character-identically in 2 files — docs/md_v2/marketplace/app-detail.js, docs/md_v2/marketplace/frontend/app-detail.js. 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/md_v2/marketplace/frontend/marketplace.js:381 — `app.slug || app.name.toLowerCase().replace(/\s+/g, '-')` appears character-identically in 2 files — docs/md_v2/marketplace/frontend/marketplace.js, docs/md_v2/marketplace/marketplace.js. 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/md_v2/marketplace/frontend/marketplace.js:287 — `e.key === '/' && !searchInput.contains(document.activeElement)` appears character-identically in 2 files — docs/md_v2/marketplace/frontend/marketplace.js, docs/md_v2/marketplace/marketplace.js. 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/md_v2/marketplace/frontend/marketplace.js:291 — `e.key === 'Escape' && searchInput.contains(document.activeElement)` appears character-identically in 2 files — docs/md_v2/marketplace/frontend/marketplace.js, docs/md_v2/marketplace/marketplace.js. 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/md_v2/marketplace/frontend/marketplace.js:344 — `results.articles && results.articles.length` appears character-identically in 2 files — docs/md_v2/marketplace/frontend/marketplace.js, docs/md_v2/marketplace/marketplace.js. 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 crawl4ai/js_snippet/remove_consent_popups.js:6 — `style.display !== "none" && style.visibility !== "hidden" && style.opacity !== "0"` appears character-identically in 2 files — crawl4ai/js_snippet/remove_consent_popups.js, crawl4ai/js_snippet/remove_overlay_elements.js. 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 crawl4ai/deep_crawling/bff_strategy.py:92 — `depth != 0 and not await self.filter_chain.apply(url)` appears character-identically in 2 files — crawl4ai/deep_crawling/bff_strategy.py, crawl4ai/deep_crawling/bfs_strategy.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 crawl4ai/script/c4a_compile.py:186 — `exc.token.type == 'CLICK' and 'THEN' in str(exc.expected)` appears character-identically in 2 files — crawl4ai/script/c4a_compile.py, REDACTED. 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 crawl4ai/legacy/version_manager.py:29 — `installed is None or installed < current` appears character-identically in 2 files — crawl4ai/legacy/version_manager.py, REDACTED. 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 crawl4ai/async_configs.py:2327 — `name in self._UNWANTED_PROPS and value is not all_params[name].default` appears character-identically in 2 files — crawl4ai/async_configs.py, REDACTED. 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 crawl4ai/script/c4a_compile.py:294 — `proc_name in line and not line.strip().startswith('PROC')` appears character-identically in 2 files — crawl4ai/script/c4a_compile.py, REDACTED. 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/releases_review/demo_v0.7.5.py:105 — `result.get('results') and result['results'][0].get('success')` appears character-identically in 2 files — docs/releases_review/demo_v0.7.5.py, docs/releases_review/v0.7.5_docker_hooks_demo.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/releases_review/demo_v0.7.8.py:808 — `result.markdown and result.markdown.raw_markdown` appears character-identically in 2 files — docs/releases_review/demo_v0.7.8.py, docs/releases_review/demo_v0.8.0.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 crawl4ai/deep_crawling/bfs_strategy.py:298 — `self._cancel_event.is_set() and self._on_state_change` appears character-identically in 2 files — crawl4ai/deep_crawling/bfs_strategy.py, crawl4ai/deep_crawling/dfs_strategy.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.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×10
  • Hand-rolled JSON/XML parsing via regex crawl4ai/antibot_detector.py:37 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex crawl4ai/antibot_detector.py:81 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex crawl4ai/antibot_detector.py:161 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:75 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:246 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:634 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:661 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:2916 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:3124 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex REDACTED:101 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
X7 · Silent fallback defaults · Silent fallback default in catch · ×6
  • Silent fallback default in catch crawl4ai/cloud_notice.py:66 — `_version` 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.
  • Silent fallback default in catch crawl4ai/extraction_strategy.py:2296 — `_get_element_text` 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.
  • Silent fallback default in catch crawl4ai/extraction_strategy.py:66 — `_get_top_level_structure` 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.
  • Silent fallback default in catch REDACTED:1552 — `extract_metadata_using_lxml` 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.
  • Silent fallback default in catch docs/releases_review/demo_v0.7.5.py:49 — `check_docker_service` (in `demo_1_docker_hooks_system`) swallows every exception into `return False` — 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.
  • Silent fallback default in catch docs/releases_review/demo_v0.7.7.py:60 — `check_server_health` swallows every exception into `return False` — 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.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×3
  • Silent fallback default on parse failure crawl4ai/content_filter_strategy_lxml.py:160 — `filter_content` returns `[]` when `(etree.ParserError, etree.LxmlError, ValueError)` 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 crawl4ai/deep_crawling/filters.py:473 — `_extract_domain` returns `''` when `ValueError` 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 crawl4ai/table_extraction.py:231 — `span` (in `_build_grid`) returns `1` when `(TypeError, ValueError)` 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.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: crawl4ai/prompts.py, REDACTED, crawl4ai/components/crawler_monitor.py, deploy/docker/monitor_routes.py, crawl4ai/antibot_detector.py, crawl4ai/install.py, crawl4ai/cloud_notice.py. Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 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 (10 single-owned of 85 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; 85 of the 103 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (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: crawl4ai/table_extraction.py, crawl4ai/processors/pdf/utils.py, deploy/docker/redis_config.py.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found pyproject.toml:78 — 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 `pyproject.toml` makes this repository a deployable product (line 78).
D24 · Comment Value · redundant comment · ×1
  • redundant comment crawl4ai/crawlers/google_search/script.js:83 — "Build Google Image URL" repeats the code it sits on: 4 of its 4 words (build, google, image, url) are already in `const googleUrl = buildGoogleImageUrl(imageInfo[0], link, imageId, imageInfo[1], imageInfo[2]);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (42149 LoC, 439 module-visible types across 51 directories). 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.
D27 · Navigability · Scattered collaborators · ×1
  • Scattered collaborators — 53 % of calls cross a namespace and only 51 % of collaborators are co-located — group each feature's code into a vertical slice so a call's collaborators sit together.
D28 · Secrets (history) · Rotate the exposed credentials · ×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 — 1 of 86 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; 86 of the 103 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: crawl4ai/legacy/cli.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.
D34 · Knowledge Freshness · Orphaned file · ×1
  • Orphaned file crawl4ai/legacy/cli.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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
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.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:8 — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P4 · Deployment & Rollback · No release approval gate · ×1
  • No release approval gate — Deployment is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever reaches the release trigger goes to production unreviewed, so a mistaken merge or tag is live before anyone can stop it.
Minor — 5 finding(s)
D12 · Dependency Hygiene · Outdated · ×5
  • Outdated: anyio — `anyio` is pinned to 4.9.0, but 4.16.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 4.9.0 until the declaration is edited.
  • Outdated: email-validator — `email-validator` is pinned to 2.2.0, but 2.3.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.2.0 until the declaration is edited.
  • Outdated: pyjwt — `pyjwt` is pinned to 2.10.1, but 2.15.1 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.10.1 until the declaration is edited.
  • Outdated: slowapi — `slowapi` is pinned to 0.1.9, but 0.1.10 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 0.1.9 until the declaration is edited.
  • Outdated: sse-starlette — `sse-starlette` is pinned to 2.2.1, but 3.7.0 is the current stable release on PyPI. An exact pin never moves on its own, so this repository installs 2.2.1 until the declaration is edited. This crosses a major version, so it is a migration rather than a bump.

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 --report-format json --report-path /tmp/watchdog-gitleaks-1c0bd90645434034be11be115026fb21/history.json --exit-code 0 --source .4artifacts/raw/gitleaks-history.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-1c0bd90645434034be11be115026fb21/tree.json --exit-code 0 --source .0artifacts/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 deploy/docker/static/monitor --exclude deploy/docker/static/playground --exclude docs .48artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .54artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .5artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
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 Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1d772-3a95-7292-98a6-52d271ccc689 · 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