typst/typst

Executive summary

typst/typst falls short of our standard for a preview release, in part because we found no access checks on the code's endpoints or handlers. It scores 52 out of 100 and is rated Adequate, and two of its three critical findings are security problems in the build pipeline and in its servers and containers.

Security and Compliance, at 33, is the weakest lens and counts most in the score. The best first step is adding access checks, worth about 13 points. Recording design decisions comes next, worth about 5 points. Raising Security and Compliance to 68 would lift the score to about 66.

One pipeline step installs packages that can change without warning. One setting leaves the servers or containers unsafe, and one part of the code is no longer understood by anyone working on it. Pinning what the pipeline installs, correcting the unsafe settings and having someone learn the forgotten files would close these risks.

The product code is 138,661 lines, about €140,000 to rebuild.

Code Health 90 ★ Exemplary Architecture 96 ★ Exemplary Maturity 59 Adequate, capped by Architecture documentation Production Readiness 60 Adequate, capped by Outbound HTTP resilience Security and Compliance 33 Weak, capped by Supply-chain Provenance & Signing and Access Controls Performance 100 ★ Exemplary

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.

Security and Compliance 33 · counts for 46%Maturity 59 · counts for 25%Production Readiness 60 · counts for 14%Code Health 90 · counts for 8%Architecture 96 · counts for 4%Performance 100 · counts for 2%

If Security and Compliance rose from 33 to 68, the lowest score rated Strong, the score would rise from 52 to about 66.

Code composition: what the lines of code are

Product code 95%Tests 5%

New since the last survey: 14 findings

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

Cyclomatic Complexity · Lexer::math (cyclomatic 60) crates/typst-syntax/src/lexer.rs
God Classes · FileTooLong: src/kind.rs crates/typst-syntax/src/kind.rs
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) crates/typst-html/src/fragment.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-syntax/src/highlight.rs crates/typst-syntax/src/highlight.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-syntax/src/kind.rs crates/typst-syntax/src/kind.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-eval/src/code.rs crates/typst-eval/src/code.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-syntax/src/ast.rs crates/typst-syntax/src/ast.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-syntax/src/lexer.rs crates/typst-syntax/src/lexer.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-syntax/src/parser.rs crates/typst-syntax/src/parser.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-layout/src/inline/line.rs crates/typst-layout/src/inline/line.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-layout/src/grid/layouter.rs crates/typst-layout/src/grid/layouter.rs
Dependency Vulnerabilities · REDACTED
Dependency Vulnerabilities · REDACTED
Access Controls · No authorization docs/src/main.rs

Watchdog compares 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: 4 findings

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

Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) crates/typst-html/src/fragment.rs
Churn × Complexity Hotspots · Hotspot: crates/typst-library/src/layout/page.rs crates/typst-library/src/layout/page.rs
Explicit Debt · TodoComment crates/typst-syntax/src/lexer.rs
Access Controls · No authorization crates/typst-cli/src/compile.rs

Rebuild cost: about €140,000 · Estimate

Cost to rebuild	€47,000 to €240,000, for 781 to 2,478 hours of work, about 1.0 person-years for 1 to 2 engineers
Difficulty of the problem	Standard, 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 52. 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.
Size	Large: 138,661 lines of product code

How the estimate is made: Watchdog prices 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.

Raises the score by about 13 points · Medium effort · Access Controls

Resolve the 1 No ADRs found finding(s) in ADR Quality.

Raises the score by about 5 points · Low effort · ADR Quality

Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.

Raises the score by about 8 points · Medium effort · Web-Security Posture

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 €140,000 to build again, about 1.0 person-years of work. Its weakest lens is Security and Compliance, at 33 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.

Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts

What to do: Start with the Security and Compliance actions in Top priorities.

If you do one thing first · First action

Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do. Of all the actions in this report, it raises the score most for the work it takes: about 13 points for medium effort. The next survey will show the change in the score.

Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.

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.

399 modules, with 2209 dependencies between them. 3 loops run through 166 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 359 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 typst_cli.info	2 typst_utils.hash	3 typst_library.foundations.repr	4 typst_library.layout.axes	5 typst_library.foundations.auto	6 typst_library.foundations.func	7 typst_library.layout.abs	8 typst_library.layout.align	9 typst_library.layout.regions	10 typst_library.visualize.color	11 typst_syntax.path	12 typst_syntax.span	13 typst_library.foundations.dict	14 typst_library.introspection.location	15 typst_library.introspection.locator	16 typst_library.foundations.content.packed	17 typst_library.foundations.content	18 typst_library.foundations.styles	19 typst_library.foundations.cast	20 typst_library.layout.frame	21 typst_library.layout.sides	22 typst_syntax.node	23 typst_syntax.ast	24 typst_eval.vm	25 typst_library.layout.length	26 typst_library.layout.rel	27 typst_library.foundations.args	28 typst_library.foundations.content.element	29 typst_library.visualize.stroke	30 typst_library.foundations.scope	31 typst_library.math.ir.item	32 typst_library.diag	33 typst_library.engine	34 typst_html.dom	35 typst_html.property	36 typst_cli.args	37 typst_bundle	39 typst_library.text
1 typst_cli.info																																				2
2 typst_utils.hash																		2																		2
3 typst_library.foundations.repr	1
4 typst_library.layout.axes	1																	2	4																	1
5 typst_library.foundations.auto	2		1															3	8																	1
6 typst_library.foundations.func	3		1									4							2					1			2	1		2			1
7 typst_library.layout.abs			1															1					1													1
8 typst_library.layout.align	1		3	3			2										1	11	4		2															5
9 typst_library.layout.regions				2			1
10 typst_library.visualize.color	3		5		2	2						3							4								1
11 typst_syntax.path			1							1		1																							3	1
12 typst_syntax.span	1										2							3	4													1	1			1
13 typst_library.foundations.dict	1		1									1							4					1									1			1
14 typst_library.introspection.location			1									8	1																			7	7			6
15 typst_library.introspection.locator												3		4																		1	2			1
16 typst_library.foundations.content.packed	1				1							2		1	1		1	2	4		1							3					1			1
17 typst_library.foundations.content	1		3	1				1				1	1	1		1		5			1							1					1			1
18 typst_library.foundations.styles	1	3	1									4					2		4									5					1			3	2
19 typst_library.foundations.cast	5											1						1														3
20 typst_library.layout.frame		1		1			1							1				1
21 typst_library.layout.sides	1			2														3	4																	1
22 typst_syntax.node											2	10									1														1	1	1
23 typst_syntax.ast												1										91		62			3									2
24 typst_eval.vm	1											1											2							2		1	1
25 typst_library.layout.length	1		1				1					1						3	4				1													1
26 typst_library.layout.rel			1				1											3					1													1
27 typst_library.foundations.args	1		2									5	1						4					1								1	1			1
28 typst_library.foundations.content.element			1						1								1	3									3			1			4
29 typst_library.visualize.stroke			5		1		2											7							1		1									3
30 typst_library.foundations.scope	4					3						2																1				8	1		1	3
31 typst_library.math.ir.item				4			4	1				12			3	1	2	22								3			1							1
32 typst_library.diag											1	5										1								1			1		3	1
33 typst_library.engine	1	1									2	2						1												1		1				1
34 typst_html.dom							1					4		1			1	3		1											1		1		2	2
35 typst_html.property																																		1
36 typst_cli.args																																			10
37 typst_bundle		1													2	1	2	2															2			2
38 typst_layout.document					1							1					2	1		1	1										1		1			2
39 typst_library.text			1		2				1			1					1	10							2	1	1	1	1	1			2			3
40 typst_library.text.font							2																													1		2

Uses a module listed above itPart of a loopThe module itself

At a glance — Code Health · 90% · Exemplary ·

The Good

D3 · Rust God Classes 8.4 D4 · Rust Code Duplication 9.7 D17 · Rust Explicit Debt 9.9 X1 · Repo Async correctness 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X18 · Repo Disposal-pattern correctness 10.0 X19 · Repo Unrestored process-global state 10.0 X2 · Repo Cancellation propagation 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X23 · Repo Unguarded diagnostic materialisation 10.0 X25 · Repo Inert configuration knob 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X30 · Repo Support guard that admits what it rejects 10.0

The Bad

D1 · Rust Cyclomatic Complexity 5.6 D2 · Rust Cognitive Complexity 5.7

At a glance — Architecture · 96% · Exemplary ·

The Good

D5 · Rust Coupling 8.1 D6 · Rust Cohesion (LCOM4) 9.8 D26 · Rust Project Cohesion 7.8 D35 · Rust Change Coupling 9.7 AX10 · Repo Code composition 10.0 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX8 · Repo Test isolation 10.0 AX9 · Repo CQS / query purity 10.0

At a glance — Maturity · 59% · Adequate · gated by M2 ·

The Good

D15 · Rust Churn × Complexity Hotspots 9.6 D16 · Rust Bus Factor 9.4 D19 · Rust Documentation Quality 10.0 D34 · Rust Knowledge Freshness 9.8 M1 · Repo Documentation (README) 6.2 M3 · Repo Folder & project structure 10.0

The Ugly

D20 · Rust ADR Quality 0.0 M2 · Repo Architecture documentation 2.0

At a glance — Readiness · 60% · Adequate · gated by P7 ·

The Good

D9 · Rust Test Distribution 10.0 D12 · Rust Dependency Hygiene 8.0 D13 · Rust Secret Scanning 10.0 D14 · Rust License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P10 · Repo Library API & versioning 10.0 P4 · Repo Deployment & Rollback 7.0 P6 · Repo Release Hygiene 10.0

The Bad

P2 · Repo Observability 5.7 P3 · Repo Security & performance tooling 5.0

The Ugly

P7 · Repo Outbound HTTP resilience 3.0

At a glance — Security · 33% · Weak · gated by D36, C2 ·

The Good

D28 · Rust Secrets (history) 10.0 D29 · Rust Static Analysis (SAST) 8.0 D30 · Rust Dependency Vulnerabilities 8.5 D31 · Rust IaC & Container Security 9.4 D43 · Rust Malicious Dependencies 10.0 D44 · Rust Platform End-of-Life 10.0 X14 · Repo Bypassable address classification 10.0 X15 · Repo Unvalidated length from an untrusted reader 10.0

The Ugly

D36 · Rust Supply-chain Provenance & Signing 2.5 C2 · Repo Access Controls 0.0 S1 · Repo Web-Security Posture 4.0

At a glance — Performance · 100% · Exemplary ·

The Good

PF3 · Repo Async & latency hygiene 10.0

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 category	Findings	Severity
A03:2025 — Software Supply Chain Failures	13	Medium
A02:2025 — Security Misconfiguration	4	High / Critical
A05:2025 — Injection	2	High / Critical

Roadmap

First, implement a global authentication guard with explicit public opt-outs and named role rules to protect all endpoints by default. Second, enforce HTTPS-only communication by configuring TLS on the server or proxy and setting the Strict-Transport-Security header. Third, create an Architecture Decision Record folder to document significant design choices with their context and consequences. Finally, ensure all outbound HTTP calls use explicit timeouts and implement retry logic with back-off to handle transient failures.

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

Do this	Helps	Effort	Dimension
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.	+13.5 pts	Medium	Access Controls
Resolve the 1 No ADRs found finding(s) in ADR Quality.	+5.0 pts	Low	ADR Quality
Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.	+8.4 pts	Medium	Web-Security Posture
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.	+3.6 pts	Medium	Architecture documentation
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.	+1.3 pts	Low	Static Analysis (SAST)
Resolve the 1 High IaC finding(s) in IaC & Container Security — start with REDACTED.	+1.3 pts	Low	IaC & Container Security
Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with repeated.rs.	+1.0 pts	Low	Knowledge Freshness
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.	+1.0 pts	Low	Supply-chain Provenance & Signing

File quality

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

File	Score	Band	Worst signal
REDACTED	3.5	Mixed	IaC & Container Security: High IaC: REDACTED
REDACTED	5.8	Mixed	Dependency Vulnerabilities: Medium advisory (unmaintained): REDACTED
crates/typst-ide/src/matchers.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-library/src/layout/grid/resolve.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-html/src/mathml.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-layout/src/grid/layouter.rs	6.0	Mixed	Explicit Debt: HackComment
crates/typst-pdf/src/tags/context/table.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-layout/src/grid/lines.rs	6.0	Mixed	Explicit Debt: FixmeComment
crates/typst-layout/src/inline/shaping.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-library/src/visualize/image/svg.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-html/src/convert.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-library/src/foundations/array.rs	6.0	Mixed	Explicit Debt: TodoComment
docs/src/live.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-layout/src/grid/rowspans.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-html/src/typed.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-svg/src/paint.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-syntax/src/node.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-layout/src/lists.rs	6.0	Mixed	Explicit Debt: HackComment
crates/typst-library/src/model/bibliography.rs	6.0	Mixed	Explicit Debt: TodoComment
crates/typst-html/src/rules.rs	6.0	Mixed	Explicit 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 — 3

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

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

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

Could not be resolved — 14

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

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 60 of 60 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 60 dimensions across the health lenses

D1D2D3D4D5D6D9D12D13D14D15D16D17D19D20D26D28D29D30D31D34D35D36D43D44AX10AX3AX4AX8AX9C2M1M2M3P1P10P2P3P4P6P7PF3S1X1X12X13X14X15X16X18X19X2X21X22X23X25X27X28X29X30

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions

Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 454 of 530 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy · checkov	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3 · 3.2.533	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	—	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a174cd-568a-7909-9891-a6b7827c1639.

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 — Watchdog 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 (.rs) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 49 test files), but it was not re-run: its build outgrew the 6 GB scratch ceiling (6.046 GB measured) and was stopped; its suite was not run. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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 — Watchdog 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 deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog 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's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AXR1 Runtime accessibility — not measured this run — Watchdog 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 REDACTED (REDACTED). docker build failed (exit 1) — -------------------- 1 | >>> FROM --platform=$BUILDPLATFORM tonistiigi/xx:1.9.0 AS xx 2 | FROM --platform=$BUILDPLATFORM rust:1.98.0-alpine3.23 AS build 3 | -------------------- ERROR: failed to solve: tonistiigi/xx:1.9.0: failed to resolve source metadata for docker.io/tonistiigi/xx:1.9.0: failed to do request: Head "https://registry-1.docker.io/v2/tonistiigi/xx/manifests/1.9.0": Forbidden; runtime evidence skipped.
GD1 Unfinished & placeholder code — not measured this run — Watchdog 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 Rust 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 — Watchdog 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 Rust 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.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog 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 JavaScript/TypeScript, Python, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Python, Dart, Ruby, Scala or Kotlin was found in this repository, 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.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog 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 JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, 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 — not measured this run — Watchdog 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 PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go and JavaScript/TypeScript source only, and no C# was loaded and no PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go, JavaScript or TypeScript was found in this repository, 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.
X5 Nullable reference types — not measured this run — Watchdog 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 Rust 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: 2 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

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

Per-dimension blind spots

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

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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 is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
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.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

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

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

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

62 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was typst_syntax::highlight::highlight at 150. A further 42 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being SyntaxKind::name at 142 — they are counted neither in the figure above nor in this dimension's score. 13 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: crates/typst-syntax/src/kind.rs (SyntaxKind::name at 142), crates/typst-html/src/property.rs (Display::default_for at 117), crates/typst-library/src/layout/page.rs (Paper::from_str at 108), crates/typst-pdf/src/tags/groups.rs (Groups::breakable at 66), crates/typst-eval/src/code.rs (Expr::eval at 65), and 8 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

typst_layout::inline::line::commit (cyclomatic 25) · ×8crates/typst-layout/src/inline/line.rs:487

typst_ide::matchers::named_items (cyclomatic 37) · ×6crates/typst-ide/src/matchers.rs:9

typst_library::math::ir::resolve::resolve_realized (cyclomatic 37) · ×5crates/typst-library/src/math/ir/resolve.rs:150

typst_syntax::highlight::highlight (cyclomatic 150) · ×4crates/typst-syntax/src/highlight.rs:142

typst_pdf::tags::tree::close_group (cyclomatic 47) · ×4crates/typst-pdf/src/tags/tree/mod.rs:422

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

What to do

Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with typst_syntax::highlight::highlight (cyclomatic 150). — Refactoring it lifts Cyclomatic Complexity from 5.6 to about 6.5/10.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D2 · Cognitive Complexity5.7 / 10Adequate✓ 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 5.7 / 10 · rule-coverage 100% · ceiling Prevented

105 method(s) exceeded the cognitive complexity threshold of 15; the worst was typst_ide::matchers::named_items at 141.

typst_layout::inline::collect::collect (cognitive 52) · ×18crates/typst-layout/src/inline/collect.rs:137

typst_ide::matchers::named_items (cognitive 141) · ×8crates/typst-ide/src/matchers.rs:9

typst_library::math::ir::resolve::resolve_lr (cognitive 47) · ×7crates/typst-library/src/math/ir/resolve.rs:852

GridLayouter::render_fills_strokes (cognitive 75) · ×6crates/typst-layout/src/grid/layouter.rs:467

typst_pdf::tags::tree::close_group (cognitive 50) · ×6crates/typst-pdf/src/tags/tree/mod.rs:422

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

What to do

Bring the 4 bodies over 60 down to 60 or less in Cognitive Complexity — start with typst_ide::matchers::named_items (cognitive 141), GridLayouter::render_fills_strokes (cognitive 75), typst_ide::jump::jump_from_click_in_frame (cognitive 71). — 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 4 together lifts Cognitive Complexity from 5.7 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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

70 god class(es) detected.

FileTooLong: visualize/color.rs · ×32crates/typst-library/src/visualize/color.rs

FunctionTooLong: typst_pdf::convert::convert_validation_error · ×11crates/typst-pdf/src/convert.rs:529

MethodTooLong: GridLayouter.render_fills_strokes · ×9crates/typst-layout/src/grid/layouter.rs:467

ClassTooLong: GridLayouter · ×8crates/typst-layout/src/grid/layouter.rs:27

TooManyMethods: Content · ×8crates/typst-library/src/foundations/content/mod.rs:85

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

What to do

Resolve the 32 FileTooLong finding(s) in God Classes — start with resolve.rs (2), rules.rs (2), color.rs. — One of this dimension's main actionable groups (32 warning-level).
Resolve the 11 FunctionTooLong finding(s) in God Classes — start with table.rs (2), mod.rs (2), convert.rs. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 9 MethodTooLong finding(s) in God Classes — start with layouter.rs (3), kind.rs (2), compile.rs. — One of this dimension's main actionable groups (9 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D4 · Code Duplication9.7 / 10Stronggated by 74 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

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

72 duplicated block group(s) detected. A further 2 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (5 lines × 2) · ×13crates/typst-cli/src/eval.rs:60

Duplicated block (8 lines × 2) · ×8crates/typst-layout/src/grid/layouter.rs:993

Duplicated block (7 lines × 2) · ×7crates/typst-layout/src/shapes.rs:427

Duplicated block (10 lines × 2) · ×4crates/typst-library/src/layout/grid/resolve.rs:32

Duplicated block (9 lines × 2) · ×4crates/typst-html/src/document.rs:156

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

What to do

Resolve the 13 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with resolve.rs (2), mod.rs (2), eval.rs. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 8 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with layouter.rs, glyph.rs, mod.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with shapes.rs, transforms.rs, lang.rs. — One of this dimension's main actionable groups (7 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

D5 · Coupling8.1 / 10Strong✓ Tool-verified

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

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

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

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

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

Off the main sequence: typst-timing · ×3

Unstable project typst-realize

What to do

Resolve the 3 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 Unstable project typst-realize finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D6 · Cohesion (LCOM4)9.8 / 10Stronggated by 6 serious findings✓ Tool-verified

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

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

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

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

6 of 288 classes have LCOM4 above 3.

Low cohesion: Packed (LCOM4 17) · ×6crates/typst-library/src/foundations/content/packed.rs:14

What to do

Resolve the 6 Low cohesion finding(s) in Cohesion (LCOM4) — start with packed.rs, array.rs, vtable.rs. — One of this dimension's main actionable groups (6 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

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

220 test methods: 190 unit, 30 integration, 0 BDD, 0 e2e. The Rust suite contributes 220 `#[test]` function(s) across 49 file(s) declaring at least one; its unit/integration split is Cargo's own — 1 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D12 · Dependency Hygiene8.0 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

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

52 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.

Outdated: arrayvec · ×52

What to do

Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

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

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

Do you agree with this assessment?

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 396 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. A further 18 crate(s) in the closure resolve from git, a path or a private registry and publish no licence this pass can read; they are outside this verdict. 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.

Do you agree with this assessment?

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

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

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

Top hotspots: crates/typst-syntax/src/highlight.rs (3×150=450); crates/typst-syntax/src/kind.rs (3×142=426); crates/typst-eval/src/code.rs (4×65=260)

Hotspot: crates/typst-syntax/src/highlight.rs · ×13crates/typst-syntax/src/highlight.rs:142

What to do

Resolve the 13 Hotspot finding(s) in Churn × Complexity Hotspots — start with highlight.rs, kind.rs, code.rs. — One of this dimension's main actionable groups (13 warning-level).

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

Do you agree with this assessment?

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

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

20 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is crates/typst-syntax/src/node.rs. Counted over 332 of the 389 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1 · ×4

Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

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

Do you agree with this assessment?

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

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

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

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

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

TodoComment · ×76tools/test-helper/src/extension.ts:596

HackComment · ×6tests/src/notes.rs:241

FixmeComment · ×2crates/typst-layout/src/grid/lines.rs:523

What to do

Resolve the 76 TodoComment finding(s) in Explicit Debt — start with resolve.rs (6), rules.rs (6), bibliography.rs (5). — One of this dimension's main actionable groups (76 warning-level).
Resolve the 6 HackComment finding(s) in Explicit Debt — start with notes.rs, output.rs, run.rs. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 2 FixmeComment finding(s) in Explicit Debt — start with lines.rs, watcher.rs. — One of this dimension's main actionable groups (2 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

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

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

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

No architecture decision records were found.

No ADRs found

What to do

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

Do you agree with this assessment?

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

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

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

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

2 of 18 build units (Cargo) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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.

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

Do you agree with this assessment?

D29 · Static Analysis (SAST)8.0 / 10Adequategated by 1 critical finding✓ 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 8.0 / 10 · rule-coverage 100% · ceiling Documented

2 finding(s): 0 critical, 1 high, 1 medium, 0 low. semgrep hit a parse error in 6 file(s) — `crates/typst-library/src/foundations/array.rs` (line 380, line 394, line 398, …), `crates/typst-library/src/foundations/float.rs` (line 139, line 170, line 180), `crates/typst-library/src/foundations/str.rs` (line 157, line 331, line 580), `crates/typst-library/src/loading/json.rs` (line 137), `docs/src/example.rs` (line 51, line 57, line 61), … (+1 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 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

What to do

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

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

Do you agree with this assessment?

D30 · Dependency Vulnerabilities8.5 / 10Strong✓ 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.

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

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

REDACTED

What to do

Resolve the 6 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED (6). — One of this dimension's main actionable groups (6 warning-level).
Resolve the 2 Medium vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-level).

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

Do you agree with this assessment?

D31 · IaC & Container Security9.4 / 10Adequategated by 1 critical finding✓ 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.4 / 10 · rule-coverage 100% · ceiling Documented

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

REDACTED

What to do

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

Do you agree with this assessment?

D34 · Knowledge Freshness9.8 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

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

7 of 332 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is crates/typst-layout/src/grid/repeated.rs. Counted over 332 of the 389 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgecrates/typst-layout/src/grid/repeated.rs:1

Orphaned file · ×6crates/typst-utils/src/round.rs:1

Further orphaned files (smaller)

What to do

Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with repeated.rs. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 6 Orphaned file finding(s) in Knowledge Freshness — start with round.rs, image.rs, shape.rs. — One of this dimension's main actionable groups (6 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D35 · Change Coupling9.7 / 10Stronggated by 9 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: counter.rs↔state.rs 70%; lines.rs↔rowspans.rs 60%; document.rs↔mod.rs 60%

Change coupling: counter.rs ↔ state.rs · ×9crates/typst-library/src/introspection/counter.rs:1

What to do

Resolve the 9 Change coupling finding(s) in Change Coupling — start with mod.rs (3), lines.rs (2), counter.rs. — One of this dimension's main actionable groups (9 warning-level).

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

Do you agree with this assessment?

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

What to do

Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

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. Scored 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. SCORED, not informational.

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.

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 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.

What to do

The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

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

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

Do you agree with this assessment?

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

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

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

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

Do you agree with this assessment?

C2 · Access Controls0.0 / 10Critical✓ 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.

This repository serves requests — a server (HttpServer::new) (docs/src/main.rs:149) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected. — docs/src/main.rs:149

What to do

Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.

Do you agree with this assessment?

M1 · Documentation (README)6.2 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

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

361 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.

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.
Add a README to the 16 of 20 project(s) that lack one — worth up to 1.6 pts.
Review the README against recent changes; refresh the parts that drifted.

Do you agree with this assessment?

M2 · Architecture documentation2.0 / 10Weak✓ 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.

Do you agree with this assessment?

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

Do you agree with this assessment?

P2 · Observability5.7 / 10Adequate✓ Tool-verified

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

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

Only 5/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/typst-cli`, `crates/typst-ide`, `crates/typst-kit`, `docs`.

What to do

Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.

Do you agree with this assessment?

P3 · Security & performance tooling5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

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

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

`ureq::AgentBuilder::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. — crates/typst-kit/src/downloader.rs:167

What to do

Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.

Do you agree with this assessment?

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language 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.

Do you agree with this assessment?

S1 · Web-Security Posture4.0 / 10Weak✓ Tool-verified

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

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

This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `HttpServer::new(` (docs/src/main.rs:149).
None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Rust server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: `HttpServer::new(` (docs/src/main.rs:149).
No handler of this repository's Rust server answers 400, 413 or 422 (`StatusCode::BAD_REQUEST`, `HttpResponse::BadRequest()`, `Status::BadRequest`, tonic `Status::invalid_argument`), and nothing declares validation — no `validator`/`garde` derive, no body limit (`DefaultBodyLimit::max`, `RequestBodyLimitLayer`, `JsonConfig::default().limit(…)`, Rocket `Limits`) — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: `HttpServer::new(` (docs/src/main.rs:149).

What to do

Secure the server's transport: serve TLS itself (`HttpServer::bind_rustls_0_23(addr, config)` in actix-web, `axum_server::bind_rustls(addr, RustlsConfig::from_pem_file(…))`, tonic's `Server::builder().tls_config(ServerTlsConfig::new().identity(…))`, Rocket's `[default.tls]`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only.
Set security response headers on what the server sends — actix-web's `DefaultHeaders::new().add((header::X_CONTENT_TYPE_OPTIONS, "nosniff"))`, tower-http's `SetResponseHeaderLayer::overriding(…)` on an axum router, or keep Rocket's default `Shield` — with `Content-Security-Policy`, `X-Content-Type-Options` and a frame policy on every response.
Validate what the server reads from a request — path, query, headers, body size and shape — and answer what fails with 400 (413 for an oversized body) before a handler acts on it: derive `validator::Validate` (or `garde::Validate`) on the request types and reject with `StatusCode::BAD_REQUEST`, and cap bodies with `DefaultBodyLimit::max`/`RequestBodyLimitLayer` or actix's `JsonConfig::default().limit(…)`.

Do you agree with this assessment?

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

X2 · Cancellation propagation10.0 / 10Exemplary○ Nothing flagged

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

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

Do you agree with this assessment?

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

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

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

Do you agree with this assessment?

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen.

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

Reference — by lens

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

Lens	Score	Rating	Impact
Code Health	90%	Exemplary	Solid.
Architecture	96%	Exemplary	Solid.
Maturity	59%	Adequate — gated by M2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness	60%	Adequate — gated by P7	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security	33%	Weak — gated by D36, C2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance	100%	Exemplary	Strongest area.

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.

SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.

Not evidenced — 1 control(s) we could not find positive evidence for

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

P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 57 check(s) not relevant to this codebase

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

AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no exported interface declares behaviour
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — -------------------- 1 | >>> FROM --platform=$BUILDPLATFORM tonistiigi/xx:1.9.0 AS xx 2 | FROM --platform=$BUILDPLATFORM rust:1.98.0-alpine3.23 AS build 3 | -------------------- ERROR: failed to solve: tonistiigi/xx:1.9.0: failed to resolve source metadata for docker.io/tonistiigi/xx:1.9.0: failed to do request: Head "https://registry-1.docker.io/v2/tonistiigi/xx/manifests/1.9.0": Forbidden; 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 — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~7992 lines of test source are present (.rs) 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.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
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 is measured on C# only; JavaScript, Rust, TypeScript not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
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+ projects each declaring an entity of their own. 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"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .rs, .ts, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
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 — not scored — this repository shows only 1 of the 3 signals this lens looks for (298 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
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 8 current-state document(s) make no claim of a kind M4 checks. 2 claim(s) of kinds M4 does not check were not checked (path 1, command argument 1); M4 checks only links and versions.
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 — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
X17 Uncapped recursion over a caller-supplied document — 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
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.
X24 Document value interpolated into markup unescaped — 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
X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. TypeScript/JavaScript runs every callback on the one thread that owns its objects: a callback runs only when the body waiting on it has yielded, never alongside it, and a worker thread receives a COPY of what it is sent. A SharedArrayBuffer carries raw bytes, never an Array, Map or Set, so no collection is reachable from two threads at once. Not a gap in the analyzer and not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
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
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 3 finding(s)

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D31 · IaC & Container Security · High IaC · ×1

REDACTED

D34 · Knowledge Freshness · Orphaned knowledge · ×1

Orphaned knowledge crates/typst-layout/src/grid/repeated.rs:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.

Serious — 443 finding(s)

D17 · Explicit Debt · TodoComment · ×76

TodoComment tools/test-helper/src/extension.ts:596 — // TODO: proper capitalization of titles. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/src/output.rs:275 — // TODO: PDF plain text diffs. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/src/output.rs:360 — // TODO: Maybe enable pretty here too? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/src/output.rs:545 — // TODO: Bundle diff. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/src/run.rs:774 — // TODO: remove this once HTML export is stable — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment docs/src/live.rs:145 — // TODO: No trailing \n — 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 crates/typst-syntax/src/node.rs:360 — // TODO: Should we error if not exactly equal? — 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 crates/typst-syntax/src/node.rs:553 — // TODO: Should we also treat non-empty errors as leaves? — 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 crates/typst-svg/src/lib.rs:101 — // TODO: Maybe make this a little more elegant? — 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 crates/typst-svg/src/lib.rs:395 — // TODO: Links on the same page could be supported. — 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 crates/typst-svg/src/lib.rs:398 — // TODO: Location links on the same page could also be supported — 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 crates/typst-svg/src/paint.rs:175 — // TODO: Refactor 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 crates/typst-pdf/src/format.rs:933 — // TODO: Use `krilla::embed::MimeType`, or a wrapper around it here. — 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 crates/typst-pdf/src/link.rs:62 — // TODO: Consider erroring or at least warning if the location — 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 crates/typst-pdf/src/tags/groups.rs:64 — // TODO: walk up to the first parent that has a language. — 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 crates/typst-pdf/src/tags/tree/build.rs:389 — // TODO: infer numbering from `list.marker` — 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 crates/typst-pdf/src/tags/tree/build.rs:394 — // TODO: infer numbering from `enum.numbering` — 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 crates/typst-pdf/src/tags/tree/build.rs:491 — // TODO: should the attribution be handled somehow? — 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 crates/typst-pdf/src/tags/tree/text.rs:227 — // TODO: The `typographic` setting is ignored for now. — 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 crates/typst-pdf/src/tags/context/table.rs:643 — // TODO(accessibility): handle `text(dir: rtl)` — 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 crates/typst-library/src/visualize/image/mod.rs:286 — // TODO: the `DecyptionError` is currently not public — 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 crates/typst-library/src/visualize/image/svg.rs:519 — // TODO: Somehow unify this with `impl Display for FileError`. — 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 crates/typst-library/src/text/font/book.rs:193 — // TODO: Potentially also consider optical size for the distance — 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 crates/typst-library/src/text/font/color.rs:238 — // TODO: Our current conversion of the SVG table works for Twitter Color Emoji, — 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 crates/typst-library/src/text/font/color.rs:473 — // TODO: We ignore x2, y2. Have to apply them somehow. — 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.
+ 51 more in this group — see findings.md.

D3 · God Classes · FileTooLong · ×32

FileTooLong: visualize/color.rs crates/typst-library/src/visualize/color.rs — FileTooLong — 1457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 957 over it, 2.91× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/ast.rs crates/typst-syntax/src/ast.rs — FileTooLong — 1444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 944 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: grid/resolve.rs crates/typst-library/src/layout/grid/resolve.rs — FileTooLong — 1194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 694 over it, 2.39× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/parser.rs crates/typst-syntax/src/parser.rs — FileTooLong — 1143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 58 free functions. The bar is 500 significant lines; this is 643 over it, 2.29× 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: ir/resolve.rs crates/typst-library/src/math/ir/resolve.rs — FileTooLong — 1038 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 39 free functions. The bar is 500 significant lines; this is 538 over it, 2.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/complete.rs crates/typst-ide/src/complete.rs — FileTooLong — 936 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 436 over it, 1.87× 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: grid/layouter.rs crates/typst-layout/src/grid/layouter.rs — FileTooLong — 917 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 94% of them inside a single declaration: GridLayouter (2 blocks, 27-1862). The bar is 500 significant lines; this is 417 over it, 1.83× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/shapes.rs crates/typst-layout/src/shapes.rs — FileTooLong — 881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 381 over it, 1.76× 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: inline/shaping.rs crates/typst-layout/src/inline/shaping.rs — FileTooLong — 875 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 375 over it, 1.75× 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: model/bibliography.rs crates/typst-library/src/model/bibliography.rs — FileTooLong — 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 32 free functions. The bar is 500 significant lines; this is 374 over it, 1.75× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/mathml.rs crates/typst-html/src/mathml.rs — FileTooLong — 860 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 360 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: src/lib.rs crates/typst-realize/src/lib.rs — FileTooLong — 805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 305 over it, 1.61× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/node.rs crates/typst-syntax/src/node.rs — FileTooLong — 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 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: src/lexer.rs crates/typst-syntax/src/lexer.rs — FileTooLong — 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 83% of them inside a single declaration: Lexer (8 blocks, 16-1094). The bar is 500 significant lines; this is 248 over it, 1.50× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: visualize/gradient.rs crates/typst-library/src/visualize/gradient.rs — FileTooLong — 714 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 63% of them inside a single declaration: Gradient (5 blocks, 236-1078). The bar is 500 significant lines; this is 214 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: assets/docs.js docs/assets/docs.js — FileTooLong — 710 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 210 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: ir/item.rs crates/typst-library/src/math/ir/item.rs — FileTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 201 over it, 1.40× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: foundations/array.rs crates/typst-library/src/foundations/array.rs — FileTooLong — 687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 85% of them inside a single declaration: Array (12 blocks, 78-1247). The bar is 500 significant lines; this is 187 over it, 1.37× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: foundations/calc.rs crates/typst-library/src/foundations/calc.rs — FileTooLong — 682 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 47 free functions. The bar is 500 significant lines; this is 182 over it, 1.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/diag.rs crates/typst-library/src/diag.rs — FileTooLong — 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 153 over it, 1.31× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/convert.rs crates/typst-pdf/src/convert.rs — FileTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 123 over it, 1.25× 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: flow/compose.rs crates/typst-layout/src/flow/compose.rs — FileTooLong — 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 119 over it, 1.24× 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: text/mod.rs crates/typst-library/src/text/mod.rs — FileTooLong — 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 92 over it, 1.18× 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: grid/rowspans.rs crates/typst-layout/src/grid/rowspans.rs — FileTooLong — 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 69% of them inside a single declaration: GridLayouter (93-1003). The bar is 500 significant lines; this is 86 over it, 1.17× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: foundations/styles.rs crates/typst-library/src/foundations/styles.rs — FileTooLong — 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 63 over it, 1.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
+ 7 more in this group — see findings.md.

D2 · Cognitive Complexity · typst_layout · ×18

typst_layout::inline::collect::collect (cognitive 52) crates/typst-layout/src/inline/collect.rs:137 — typst_layout::inline::collect::collect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (37 pts), match/switch 3 (11 pts), loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::inline::shaping::shape_segment (cognitive 42) crates/typst-layout/src/inline/shaping.rs:958 — typst_layout::inline::shaping::shape_segment has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 4 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::inline::linebreak::breakpoints (cognitive 33) crates/typst-layout/src/inline/linebreak.rs:692 — typst_layout::inline::linebreak::breakpoints has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 pts), boolean chains 4, match/switch 2 (4 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.
typst_layout::grid::lines::hline_stroke_at_column (cognitive 30) crates/typst-layout/src/grid/lines.rs:397 — typst_layout::grid::lines::hline_stroke_at_column has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 10 (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.
typst_layout::math::table::layout_table (cognitive 29) crates/typst-layout/src/math/table.rs:18 — typst_layout::math::table::layout_table has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 7 (9 pts), boolean chains 1, match/switch 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.
typst_layout::flow::block::layout_multi_block (cognitive 28) crates/typst-layout/src/flow/block.rs:107 — typst_layout::flow::block::layout_multi_block has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::shapes::fill_segment (cognitive 28) crates/typst-layout/src/shapes.rs:953 — typst_layout::shapes::fill_segment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::shapes::segmented_rect (cognitive 27) crates/typst-layout/src/shapes.rs:756 — typst_layout::shapes::segmented_rect has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), match/switch 1 (3 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.
typst_layout::inline::line::commit (cognitive 26) crates/typst-layout/src/inline/line.rs:487 — typst_layout::inline::line::commit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, loops 2, match/switch 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.
typst_layout::shapes::layout_shape (cognitive 25) crates/typst-layout/src/shapes.rs:487 — typst_layout::shapes::layout_shape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::math::layout_equation_block (cognitive 24) crates/typst-layout/src/math/mod.rs:106 — typst_layout::math::layout_equation_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (5 pts), boolean chains 4, match/switch 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.
typst_layout::math::fragment::glyph::assemble (cognitive 22) crates/typst-layout/src/math/fragment/glyph.rs:570 — typst_layout::math::fragment::glyph::assemble has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::pages::collect::collect (cognitive 22) crates/typst-layout/src/pages/collect.rs:23 — typst_layout::pages::collect::collect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 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.
typst_layout::grid::lines::generate_line_segments (cognitive 19) crates/typst-layout/src/grid/lines.rs:81 — typst_layout::grid::lines::generate_line_segments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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.
typst_layout::inline::linebreak::linebreak_link (cognitive 19) crates/typst-layout/src/inline/linebreak.rs:860 — typst_layout::inline::linebreak::linebreak_link has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (5 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.
typst_layout::math::scripts::compute_script_shifts (cognitive 18) crates/typst-layout/src/math/scripts.rs:345 — typst_layout::math::scripts::compute_script_shifts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, 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.
typst_layout::inline::linebreak::linebreak_optimized_approximate (cognitive 16) crates/typst-layout/src/inline/linebreak.rs:384 — typst_layout::inline::linebreak::linebreak_optimized_approximate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_layout::lists::layout_enum (cognitive 16) crates/typst-layout/src/lists.rs:80 — typst_layout::lists::layout_enum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 1 (3 pts), 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.

D15 · Churn × Complexity Hotspots · Hotspot · ×13

Hotspot: crates/typst-syntax/src/highlight.rs crates/typst-syntax/src/highlight.rs:142 — crates/typst-syntax/src/highlight.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 150 in typst_syntax::highlight::highlight at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-syntax/src/highlight.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-syntax/src/kind.rs crates/typst-syntax/src/kind.rs:423 — crates/typst-syntax/src/kind.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in SyntaxKind::name at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-syntax/src/kind.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-eval/src/code.rs crates/typst-eval/src/code.rs:79 — crates/typst-eval/src/code.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in Expr::eval at line 79. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-eval/src/code.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-syntax/src/ast.rs crates/typst-syntax/src/ast.rs:404 — crates/typst-syntax/src/ast.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in Expr::from_untyped at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-syntax/src/ast.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-syntax/src/lexer.rs crates/typst-syntax/src/lexer.rs:656 — crates/typst-syntax/src/lexer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Lexer::math at line 656. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-syntax/src/lexer.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-syntax/src/parser.rs crates/typst-syntax/src/parser.rs:270 — crates/typst-syntax/src/parser.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in typst_syntax::parser::math_expr_prec at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-syntax/src/parser.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-layout/src/inline/line.rs crates/typst-layout/src/inline/line.rs:487 — crates/typst-layout/src/inline/line.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in typst_layout::inline::line::commit at line 487. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-layout/src/inline/line.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-cli/src/compile.rs crates/typst-cli/src/compile.rs:107 — crates/typst-cli/src/compile.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in CompileConfig::new_impl at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-cli/src/compile.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-layout/src/flow/distribute.rs crates/typst-layout/src/flow/distribute.rs:590 — crates/typst-layout/src/flow/distribute.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Distributor::finalize at line 590. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-layout/src/flow/distribute.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-layout/src/grid/layouter.rs crates/typst-layout/src/grid/layouter.rs:1599 — crates/typst-layout/src/grid/layouter.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in GridLayouter::finish_region at line 1599. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-layout/src/grid/layouter.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-macros/src/scope.rs crates/typst-macros/src/scope.rs:14 — crates/typst-macros/src/scope.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in typst_macros::scope::scope at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-macros/src/scope.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-library/src/foundations/array.rs crates/typst-library/src/foundations/array.rs:889 — crates/typst-library/src/foundations/array.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Array::sorted at line 889. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-library/src/foundations/array.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/typst-layout/src/flow/compose.rs crates/typst-layout/src/flow/compose.rs:224 — crates/typst-layout/src/flow/compose.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Composer::page_contents at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 14:59:56 +00:00' --until='2026-10-22 14:59:56 +00:00' --full-history --no-merges -- crates/typst-layout/src/flow/compose.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.

D4 · Code Duplication · Duplicated block (5 lines × 2) · ×13

Duplicated block (5 lines × 2) crates/typst-cli/src/eval.rs:60 — crates/typst-cli/src/eval.rs:60-65 | crates/typst-cli/src/query.rs:30-34 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) crates/typst-layout/src/grid/layouter.rs:1483 — crates/typst-layout/src/grid/layouter.rs:1483-1488 | crates/typst-layout/src/grid/layouter.rs:1547-1551 — 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) crates/typst-layout/src/shapes.rs:629 — crates/typst-layout/src/shapes.rs:629-633 | crates/typst-layout/src/shapes.rs:766-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.
Duplicated block (5 lines × 2) crates/typst-library/src/foundations/content/field.rs:98 — crates/typst-library/src/foundations/content/field.rs:98-102 | crates/typst-library/src/foundations/content/field.rs:125-129 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) crates/typst-library/src/math/ir/resolve.rs:732 — crates/typst-library/src/math/ir/resolve.rs:732-736 | crates/typst-library/src/math/ir/resolve.rs:831-835 — 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) crates/typst-macros/src/scope.rs:342 — crates/typst-macros/src/scope.rs:342-346 | crates/typst-macros/src/ty.rs:63-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) crates/typst-svg/src/lib.rs:39 — crates/typst-svg/src/lib.rs:39-43 | crates/typst-svg/src/lib.rs:64-68 — 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) crates/typst-library/src/layout/grid/mod.rs:446 — crates/typst-library/src/layout/grid/mod.rs:446-450 | crates/typst-library/src/model/table.rs:315-319 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) crates/typst-svg/src/path.rs:138 — crates/typst-svg/src/path.rs:138-145 | crates/typst-svg/src/path.rs:156-160 — 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) crates/typst-library/src/introspection/counter.rs:800 — crates/typst-library/src/introspection/counter.rs:800-804 | crates/typst-library/src/introspection/counter.rs:834-838 — 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) crates/typst-library/src/layout/grid/resolve.rs:214 — crates/typst-library/src/layout/grid/resolve.rs:214-218 | crates/typst-library/src/layout/grid/resolve.rs:311-315 — 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) crates/typst-library/src/text/font/color.rs:175 — crates/typst-library/src/text/font/color.rs:175-179 | crates/typst-library/src/text/font/color.rs:193-197 — 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) crates/typst-pdf/src/tags/tree/mod.rs:201 — crates/typst-pdf/src/tags/tree/mod.rs:201-205 | crates/typst-pdf/src/tags/tree/mod.rs:219-223 — 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.

D3 · God Classes · FunctionTooLong · ×11

FunctionTooLong: typst_pdf::convert::convert_validation_error crates/typst-pdf/src/convert.rs:529 — FunctionTooLong — typst_pdf::convert::convert_validation_error runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_syntax::highlight::highlight crates/typst-syntax/src/highlight.rs:142 — FunctionTooLong — typst_syntax::highlight::highlight runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_pdf::tags::context::table::build_table crates/typst-pdf/src/tags/context/table.rs:137 — FunctionTooLong — typst_pdf::tags::context::table::build_table runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_pdf::tags::tree::close_group crates/typst-pdf/src/tags/tree/mod.rs:422 — FunctionTooLong — typst_pdf::tags::tree::close_group runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_library::math::module crates/typst-library/src/math/mod.rs:45 — FunctionTooLong — typst_library::math::module runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_layout::pages::run::layout_page_run_impl crates/typst-layout/src/pages/run.rs:78 — FunctionTooLong — typst_layout::pages::run::layout_page_run_impl runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_library::foundations::calc::module crates/typst-library/src/foundations/calc.rs:18 — FunctionTooLong — typst_library::foundations::calc::module runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_ide::complete::code_completions crates/typst-ide/src/complete.rs:887 — FunctionTooLong — typst_ide::complete::code_completions runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_html::mathml::handle_realized crates/typst-html/src/mathml.rs:491 — FunctionTooLong — typst_html::mathml::handle_realized runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_layout::math::table::layout_table crates/typst-layout/src/math/table.rs:18 — FunctionTooLong — typst_layout::math::table::layout_table runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: typst_render::paint::to_sk_paint crates/typst-render/src/paint.rs:139 — FunctionTooLong — typst_render::paint::to_sk_paint runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D3 · God Classes · MethodTooLong · ×9

MethodTooLong: GridLayouter.render_fills_strokes crates/typst-layout/src/grid/layouter.rs:467 — MethodTooLong — render_fills_strokes runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SyntaxKind.mode_after crates/typst-syntax/src/kind.rs:612 — MethodTooLong — mode_after runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SyntaxKind.name crates/typst-syntax/src/kind.rs:423 — MethodTooLong — name runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: CompileConfig.new_impl crates/typst-cli/src/compile.rs:107 — MethodTooLong — new_impl runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SVGRenderer.write_gradients crates/typst-svg/src/paint.rs:117 — MethodTooLong — write_gradients runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GridLayouter.finish_region crates/typst-layout/src/grid/layouter.rs:1599 — MethodTooLong — finish_region runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ModuleImport.eval crates/typst-eval/src/import.rs:20 — MethodTooLong — eval runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GridLayouter.measure_auto_row crates/typst-layout/src/grid/layouter.rs:1243 — MethodTooLong — measure_auto_row runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MathConstants.from_constants crates/typst-library/src/text/font/metrics.rs:216 — MethodTooLong — from_constants runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D35 · Change Coupling · Change coupling · ×9

Change coupling: counter.rs ↔ state.rs crates/typst-library/src/introspection/counter.rs:1 — `crates/typst-library/src/introspection/counter.rs` and `crates/typst-library/src/introspection/state.rs` change together 70% of the time (21 of the 30 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 21 shared commits counted here, the most recent 3 are `53872d50` Refactor calling `Func`s and casting return values; `59d1474e` Add traces for counter and state update function calls; `ed67220e` Remove deprecated things and compatibility behaviours (#5591) — run `git show` on any of them.
Change coupling: lines.rs ↔ rowspans.rs crates/typst-layout/src/grid/lines.rs:1 — `crates/typst-layout/src/grid/lines.rs` and `crates/typst-layout/src/grid/rowspans.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `343a57b5` Move grid cell locator creation to GridLayouter (#6746); `69c3f957` Bump MSRV to 1.83 and Rust in CI to 1.85 (#5946); `36040d93` Refactor grid/layout.rs (#4100) (at that commit the files were still `crates/typst/src/layout/grid/lines.rs` and `crates/typst/src/layout/grid/rowspans.rs`) — run `git show` on any of them.
Change coupling: document.rs ↔ mod.rs crates/typst-html/src/document.rs:1 — `crates/typst-html/src/document.rs` and `crates/typst-layout/src/pages/mod.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — 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 6 shared commits counted here, the most recent 3 are `489b9f9c` Fix various doc comment warnings (#8293); `86e38439` Simplify realization kinds (#8220); `34a6a4f3` Respect bundle-level document properties — run `git show` on any of them.
Change coupling: mod.rs ↔ hide.rs crates/typst-layout/src/inline/mod.rs:1 — `crates/typst-layout/src/inline/mod.rs` and `crates/typst-library/src/layout/hide.rs` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — 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 6 shared commits counted here, the most recent 3 are `a52987a8` Refactor frame metadata into tags (#4212) (at that commit the files were still `crates/typst/src/layout/inline/mod.rs` and `crates/typst/src/layout/hide.rs`); `ddb61739` Simplify layout_inline's signature (at that commit the files were still `library/src/text/par.rs` and `library/src/graphics/hide.rs`); `6e3b1a2c` Make all fields of `Frame` private (at that commit the files were still `src/library/text/par.rs` and `src/library/graphics/hide.rs`) — run `git show` on any of them.
Change coupling: mod.rs ↔ place.rs crates/typst-layout/src/flow/mod.rs:1 — `crates/typst-layout/src/flow/mod.rs` and `crates/typst-library/src/layout/place.rs` change together 57% of the time (25 of the 44 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 25 shared commits counted here, the most recent 3 are `bb0e0894` Fix logical ordering of floats and footnotes (#5185) (at that commit the files were still `crates/typst/src/layout/flow/mod.rs` and `crates/typst/src/layout/place.rs`); `a69ada78` Rename place scope "page" to "parent" (#5027) (at that commit the files were still `crates/typst/src/layout/flow/mod.rs` and `crates/typst/src/layout/place.rs`); `a82256c5` Flow collection phase (#4931) (at that commit the files were still `crates/typst/src/layout/flow/mod.rs` and `crates/typst/src/layout/place.rs`) — run `git show` on any of them.
Change coupling: world.rs ↔ tests.rs crates/typst-cli/src/world.rs:1 — `crates/typst-cli/src/world.rs` and `crates/typst-ide/src/tests.rs` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 6 shared commits counted here, the most recent 3 are `186df364` Accept `Duration` type timezone offset values (#7691); `2865be67` Introduce `VirtualRoot` enum (#7689); `e71674f6` Construct library via extension trait instead of default & inherent i… — run `git show` on any of them.
Change coupling: lines.rs ↔ table.rs crates/typst-layout/src/grid/lines.rs:1 — `crates/typst-layout/src/grid/lines.rs` and `crates/typst-library/src/model/table.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are `639a8d0d` Repeatable Table Footers [More Flexible Tables Pt.6a] (#3577) (at that commit the files were still `crates/typst/src/layout/grid/lines.rs` and `crates/typst/src/model/table.rs`); `898367f0` Repeatable Table Headers [More Flexible Tables Pt.5a] (#3545) (at that commit the files were still `crates/typst/src/layout/grid/lines.rs` and `crates/typst/src/model/table.rs`); `decb4fd9` Merging cells: Rowspans [More Flexible Tables Pt.3b] (#3501) (at that commit the files were still `crates/typst/src/layout/grid/lines.rs` and `crates/typst/src/model/table.rs`) — run `git show` on any of them.
Change coupling: mod.rs ↔ hide.rs crates/typst-layout/src/flow/mod.rs:1 — `crates/typst-layout/src/flow/mod.rs` and `crates/typst-library/src/layout/hide.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are `a52987a8` Refactor frame metadata into tags (#4212) (at that commit the files were still `crates/typst/src/layout/flow.rs` and `crates/typst/src/layout/hide.rs`); `6e3b1a2c` Make all fields of `Frame` private (at that commit the files were still `src/library/layout/flow.rs` and `src/library/graphics/hide.rs`); `4640585f` First iteration of outline items (at that commit the files were still `src/library/layout/flow.rs` and `src/library/graphics/hide.rs`) — run `git show` on any of them.
Change coupling: image.rs ↔ shape.rs crates/typst-pdf/src/image.rs:1 — `crates/typst-pdf/src/image.rs` and `crates/typst-pdf/src/shape.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 5 shared commits counted here, the most recent 3 are `36f5d041` Fix panic in krilla when `surface.pop()` isn't executed (#7081); `80768afc` Generate Span tags with text attributes; `e6ba1957` Compute BBox of Table, Formula, and Figure tags for PDF/UA-1 — run `git show` on any of them.

D1 · Cyclomatic Complexity · typst_layout · ×8

typst_layout::inline::line::commit (cyclomatic 25) crates/typst-layout/src/inline/line.rs:487 — typst_layout::inline::line::commit 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.
typst_layout::inline::collect::collect (cyclomatic 24) crates/typst-layout/src/inline/collect.rs:137 — typst_layout::inline::collect::collect 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.
typst_layout::flow::block::layout_multi_block (cyclomatic 21) crates/typst-layout/src/flow/block.rs:107 — typst_layout::flow::block::layout_multi_block has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
typst_layout::grid::lines::hline_stroke_at_column (cyclomatic 21) crates/typst-layout/src/grid/lines.rs:397 — typst_layout::grid::lines::hline_stroke_at_column has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
typst_layout::inline::shaping::shape_segment (cyclomatic 21) crates/typst-layout/src/inline/shaping.rs:958 — typst_layout::inline::shaping::shape_segment 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.
typst_layout::math::table::layout_table (cyclomatic 20) crates/typst-layout/src/math/table.rs:18 — typst_layout::math::table::layout_table 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.
typst_layout::inline::linebreak::breakpoints (cyclomatic 19) crates/typst-layout/src/inline/linebreak.rs:692 — typst_layout::inline::linebreak::breakpoints 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.
typst_layout::math::layout_equation_block (cyclomatic 16) crates/typst-layout/src/math/mod.rs:106 — typst_layout::math::layout_equation_block 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 is NOT this file's highest cyclomatic complexity: typst_layout::math::layout_realized (cyclomatic 26) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.

D2 · Cognitive Complexity · typst_ide · ×8

typst_ide::matchers::named_items (cognitive 141) crates/typst-ide/src/matchers.rs:9 — typst_ide::matchers::named_items has cognitive complexity 141 (threshold 15). Drivers by points: if/else 17 (77 pts), loops 9 (38 pts), match/switch 5 (23 pts), boolean chains 3 (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::jump::jump_from_click_in_frame (cognitive 71) crates/typst-ide/src/jump.rs:209 — typst_ide::jump::jump_from_click_in_frame has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (50 pts), match/switch 4 (13 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::complete::field_access_completions (cognitive 35) crates/typst-ide/src/complete.rs:164 — typst_ide::complete::field_access_completions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 8 (15 pts), match/switch 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::complete::param_completions (cognitive 32) crates/typst-ide/src/complete.rs:503 — typst_ide::complete::param_completions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 3, loops 2, match/switch 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.
typst_ide::utils::summarize_font_family (cognitive 22) crates/typst-ide/src/utils.rs:41 — typst_ide::utils::summarize_font_family has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::tooltip::expr_tooltip (cognitive 21) crates/typst-ide/src/tooltip.rs:54 — typst_ide::tooltip::expr_tooltip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::complete::complete_params (cognitive 17) crates/typst-ide/src/complete.rs:436 — typst_ide::complete::complete_params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_ide::definition::definition (cognitive 17) crates/typst-ide/src/definition.rs:27 — typst_ide::definition::definition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D3 · God Classes · ClassTooLong · ×8

ClassTooLong: GridLayouter crates/typst-layout/src/grid/layouter.rs:27 — ClassTooLong — 858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 41 methods, 2 blocks, lines 27-1862. The bar is 400 significant lines; this is 458 over it, 2.15× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Lexer crates/typst-syntax/src/lexer.rs:16 — ClassTooLong — 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 37 methods, 8 blocks, lines 16-1094. The bar is 400 significant lines; this is 220 over it, 1.55× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Array crates/typst-library/src/foundations/array.rs:76 — ClassTooLong — 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 45 methods, 12 blocks, lines 78-1247. The bar is 400 significant lines; this is 181 over it, 1.45× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Color crates/typst-library/src/visualize/color.rs:177 — ClassTooLong — 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 39 methods, 8 blocks, lines 177-1818. The bar is 400 significant lines; this is 163 over it, 1.41× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SyntaxKind crates/typst-syntax/src/kind.rs:8 — ClassTooLong — 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 10 methods, 3 blocks, lines 8-773. The bar is 400 significant lines; this is 100 over it, 1.25× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ProcessColor crates/typst-library/src/visualize/color.rs:1822 — ClassTooLong — 498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 24 methods, 15 blocks, lines 1822-2544. The bar is 400 significant lines; this is 98 over it, 1.25× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CellGridResolver crates/typst-library/src/layout/grid/resolve.rs:941 — ClassTooLong — 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 6 methods, 2 blocks, lines 941-1991. The bar is 400 significant lines; this is 68 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Gradient crates/typst-library/src/visualize/gradient.rs:236 — ClassTooLong — 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 23 methods, 5 blocks, lines 236-1078. The bar is 400 significant lines; this is 50 over it, 1.13× 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.

D3 · God Classes · TooManyMethods · ×8

TooManyMethods: Content crates/typst-library/src/foundations/content/mod.rs:85 — TooManyMethods — 55 methods. The bar is 30 methods; this is 25 over it, 1.83× 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: Array crates/typst-library/src/foundations/array.rs:76 — TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× 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: Frame crates/typst-library/src/layout/frame.rs:18 — TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× 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: SyntaxNode crates/typst-syntax/src/node.rs:18 — TooManyMethods — 44 methods, declared across 2 files: src/node.rs (38), src/ast.rs (6). The bar is 30 methods; this is 14 over it, 1.47× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: Parser crates/typst-syntax/src/parser.rs:1480 — TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× 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: GridLayouter crates/typst-layout/src/grid/layouter.rs:27 — TooManyMethods — 41 methods, declared across 3 files: grid/layouter.rs (20), grid/repeated.rs (12), grid/rowspans.rs (9). The bar is 30 methods; this is 11 over it, 1.37× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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: Color crates/typst-library/src/visualize/color.rs:177 — TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× 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: Lexer crates/typst-syntax/src/lexer.rs:16 — 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.

D4 · Code Duplication · Duplicated block (8 lines × 2) · ×8

Duplicated block (8 lines × 2) crates/typst-layout/src/grid/layouter.rs:993 — crates/typst-layout/src/grid/layouter.rs:993-1000 | crates/typst-layout/src/grid/layouter.rs:1258-1267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-layout/src/math/fragment/glyph.rs:591 — crates/typst-layout/src/math/fragment/glyph.rs:591-598 | crates/typst-layout/src/math/fragment/glyph.rs:634-641 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-layout/src/math/mod.rs:60 — crates/typst-layout/src/math/mod.rs:60-67 | crates/typst-layout/src/math/mod.rs:115-122 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-layout/src/shapes.rs:376 — crates/typst-layout/src/shapes.rs:376-383 | crates/typst-layout/src/shapes.rs:401-408 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-library/src/foundations/calc.rs:185 — crates/typst-library/src/foundations/calc.rs:185-192 | crates/typst-library/src/foundations/calc.rs:239-246 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-pdf/src/tags/groups.rs:595 — crates/typst-pdf/src/tags/groups.rs:595-602 | crates/typst-pdf/src/tags/groups.rs:628-635 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) crates/typst-html/src/typed.rs:647 — crates/typst-html/src/typed.rs:647-654 | crates/typst-library/src/layout/dir.rs:245-252 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) crates/typst-library/src/math/equation.rs:257 — crates/typst-library/src/math/equation.rs:257-264 | crates/typst-library/src/model/figure.rs:483-490 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D2 · Cognitive Complexity · typst_library · ×7

typst_library::math::ir::resolve::resolve_lr (cognitive 47) crates/typst-library/src/math/ir/resolve.rs:852 — typst_library::math::ir::resolve::resolve_lr has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 6, loops 2 (5 pts), match/switch 2 (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.
typst_library::math::ir::process::preprocess (cognitive 40) crates/typst-library/src/math/ir/process.rs:135 — typst_library::math::ir::process::preprocess has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_library::math::ir::resolve::resolve_realized (cognitive 37) crates/typst-library/src/math/ir/resolve.rs:150 — typst_library::math::ir::resolve::resolve_realized has cognitive complexity 37 (threshold 15). Drivers by points: if/else 37. 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.
typst_library::visualize::gradient::process_stops (cognitive 19) crates/typst-library/src/visualize/gradient.rs:1369 — typst_library::visualize::gradient::process_stops has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_library::layout::grid::resolve::find_next_available_position (cognitive 18) crates/typst-library/src/layout/grid/resolve.rs:2314 — typst_library::layout::grid::resolve::find_next_available_position has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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.
typst_library::foundations::fields::field (cognitive 17) crates/typst-library/src/foundations/fields.rs:14 — typst_library::foundations::fields::field has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 3 (4 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
typst_library::math::ir::resolve::resolve_inner_attach (cognitive 16) crates/typst-library/src/math/ir/resolve.rs:472 — typst_library::math::ir::resolve::resolve_inner_attach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×7

Duplicated block (7 lines × 2) crates/typst-layout/src/shapes.rs:427 — crates/typst-layout/src/shapes.rs:427-433 | crates/typst-layout/src/shapes.rs:452-458 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-layout/src/transforms.rs:208 — crates/typst-layout/src/transforms.rs:208-214 | crates/typst-layout/src/transforms.rs:250-256 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-library/src/text/lang.rs:507 — crates/typst-library/src/text/lang.rs:507-513 | crates/typst-library/src/text/lang.rs:598-604 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-library/src/visualize/color.rs:1865 — crates/typst-library/src/visualize/color.rs:1865-1871 | crates/typst-library/src/visualize/color.rs:1873-1879 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-macros/src/elem.rs:343 — crates/typst-macros/src/elem.rs:343-349 | crates/typst-macros/src/elem.rs:582-590 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-library/src/foundations/datetime.rs:300 — crates/typst-library/src/foundations/datetime.rs:300-306 | crates/typst-library/src/foundations/datetime.rs:322-328 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/typst-layout/src/lists.rs:27 — crates/typst-layout/src/lists.rs:27-33 | crates/typst-layout/src/lists.rs:89-95 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D1 · Cyclomatic Complexity · typst_ide · ×6

typst_ide::matchers::named_items (cyclomatic 37) crates/typst-ide/src/matchers.rs:9 — typst_ide::matchers::named_items has cyclomatic complexity 37 (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.
typst_ide::jump::jump_from_click_in_frame (cyclomatic 30) crates/typst-ide/src/jump.rs:209 — typst_ide::jump::jump_from_click_in_frame 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.
typst_ide::complete::field_access_completions (cyclomatic 23) crates/typst-ide/src/complete.rs:164 — typst_ide::complete::field_access_completions has cyclomatic complexity 23 (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.
typst_ide::complete::param_completions (cyclomatic 19) crates/typst-ide/src/complete.rs:503 — typst_ide::complete::param_completions 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.
typst_ide::tooltip::expr_tooltip (cyclomatic 17) crates/typst-ide/src/tooltip.rs:54 — typst_ide::tooltip::expr_tooltip 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.
typst_ide::utils::summarize_font_family (cyclomatic 16) crates/typst-ide/src/utils.rs:41 — typst_ide::utils::summarize_font_family 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.

D17 · Explicit Debt · HackComment · ×6

HackComment tests/src/notes.rs:241 — // HACK: Replace backslashes in path sepators with slashes for cross — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment tests/src/output.rs:455 — // HACK: This is somewhat volatile, since it needs to be updated, — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment tests/src/run.rs:788 — // HACK: This hint only gets emitted in debug builds, so filter it — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/typst-layout/src/lists.rs:647 — /// HACK: Also consider frames empty if they only contain tags. Table — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/typst-layout/src/grid/layouter.rs:1338 — // HACK: Also consider frames empty if they only contain tags. Table — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment crates/typst-layout/src/grid/mod.rs:38 — // HACK: manually generate tags for table and grid cells. Ideally table and — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.

D2 · Cognitive Complexity · GridLayouter · ×6

GridLayouter::render_fills_strokes (cognitive 75) crates/typst-layout/src/grid/layouter.rs:467 — GridLayouter::render_fills_strokes has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 5 (10 pts), match/switch 3 (9 pts), boolean chains 8 (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.
GridLayouter::finish_region (cognitive 45) crates/typst-layout/src/grid/layouter.rs:1599 — GridLayouter::finish_region has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 10, loops 4 (6 pts), match/switch 2 (4 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.
GridLayouter::prepare_auto_row_cell_measurement (cognitive 33) crates/typst-layout/src/grid/rowspans.rs:383 — GridLayouter::prepare_auto_row_cell_measurement has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 3, match/switch 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.
GridLayouter::measure_auto_row (cognitive 27) crates/typst-layout/src/grid/layouter.rs:1243 — GridLayouter::measure_auto_row has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GridLayouter::measure_auto_columns (cognitive 25) crates/typst-layout/src/grid/layouter.rs:967 — GridLayouter::measure_auto_columns has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GridLayouter::layout_single_row (cognitive 17) crates/typst-layout/src/grid/layouter.rs:1467 — GridLayouter::layout_single_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, 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 · typst_pdf · ×6

typst_pdf::tags::tree::close_group (cognitive 50) crates/typst-pdf/src/tags/tree/mod.rs:422 — typst_pdf::tags::tree::close_group has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
typst_pdf::tags::context::table::build_table (cognitive 49) crates/typst-pdf/src/tags/context/table.rs:137 — typst_pdf::tags::context::table::build_table has cognitive complexity 49 (threshold 15). Drivers by points: loops 13 (21 pts), if/else 7 (16 pts), match/switch 4 (8 pts), boolean chains 4 (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.
typst_pdf::convert::convert_validation_error (cognitive 35) crates/typst-pdf/src/convert.rs:529 — typst_pdf::convert::convert_validation_error has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
typst_pdf::paint::convert_gradient_stops (cognitive 27) crates/typst-pdf/src/paint.rs:303 — typst_pdf::paint::convert_gradient_stops has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
typst_pdf::link::handle_link (cognitive 19) crates/typst-pdf/src/link.rs:30 — typst_pdf::link::handle_link has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, match/switch 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.
typst_pdf::tags::resolve::resolve_group_node (cognitive 18) crates/typst-pdf/src/tags/resolve/mod.rs:122 — typst_pdf::tags::resolve::resolve_group_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · typst_realize · ×6

typst_realize::visit_styled (cognitive 43) crates/typst-realize/src/lib.rs:592 — typst_realize::visit_styled has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_realize::finish_grouping (cognitive 34) crates/typst-realize/src/lib.rs:915 — typst_realize::finish_grouping has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (10 pts), boolean chains 2 (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.
typst_realize::verdict (cognitive 23) crates/typst-realize/src/lib.rs:437 — typst_realize::verdict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 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.
typst_realize::visit_regex_match (cognitive 22) crates/typst-realize/src/lib.rs:1399 — typst_realize::visit_regex_match has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, 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.
typst_realize::finish_innermost_grouping (cognitive 20) crates/typst-realize/src/lib.rs:870 — typst_realize::finish_innermost_grouping has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (10 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.
typst_realize::visit_kind_rules (cognitive 19) crates/typst-realize/src/lib.rs:297 — typst_realize::visit_kind_rules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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.

D30 · Dependency Vulnerabilities · Medium advisory (unmaintained) · ×6

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D6 · Cohesion (LCOM4) · Low cohesion · ×6

Low cohesion: Packed (LCOM4 17) crates/typst-library/src/foundations/content/packed.rs:14 — Packed's methods fall into 17 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 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Array (LCOM4 7) crates/typst-library/src/foundations/array.rs:76 — Array's methods fall into 7 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 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ContentVtable (LCOM4 6) crates/typst-library/src/foundations/content/vtable.rs:81 — ContentVtable's methods fall into 6 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 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Content (LCOM4 5) crates/typst-library/src/foundations/content/mod.rs:85 — Content's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Counter (LCOM4 5) crates/typst-library/src/introspection/counter.rs:219 — Counter's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: SvgPathBuilder (LCOM4 4) crates/typst-svg/src/path.rs:8 — SvgPathBuilder'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.

D1 · Cyclomatic Complexity · typst_library · ×5

typst_library::math::ir::resolve::resolve_realized (cyclomatic 37) crates/typst-library/src/math/ir/resolve.rs:150 — typst_library::math::ir::resolve::resolve_realized has cyclomatic complexity 37 (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.
typst_library::math::ir::resolve::resolve_lr (cyclomatic 25) crates/typst-library/src/math/ir/resolve.rs:852 — typst_library::math::ir::resolve::resolve_lr 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.
typst_library::math::ir::process::preprocess (cyclomatic 24) crates/typst-library/src/math/ir/process.rs:135 — typst_library::math::ir::process::preprocess 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.
typst_library::foundations::fields::field (cyclomatic 20) crates/typst-library/src/foundations/fields.rs:14 — typst_library::foundations::fields::field has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
typst_library::text::features (cyclomatic 18) crates/typst-library/src/text/mod.rs:1419 — typst_library::text::features has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · typst_syntax · ×4

typst_syntax::highlight::highlight (cyclomatic 150) crates/typst-syntax/src/highlight.rs:142 — typst_syntax::highlight::highlight has cyclomatic complexity 150 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
typst_syntax::parser::math_expr_prec (cyclomatic 24) crates/typst-syntax/src/parser.rs:270 — typst_syntax::parser::math_expr_prec 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. This is NOT this file's highest cyclomatic complexity: typst_syntax::parser::code_primary (cyclomatic 26) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
typst_syntax::parser::code_expr_prec (cyclomatic 18) crates/typst-syntax/src/parser.rs:587 — typst_syntax::parser::code_expr_prec 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. This is NOT this file's highest cyclomatic complexity: typst_syntax::parser::code_primary (cyclomatic 26) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
typst_syntax::reparser::expand_and_reparse_markup (cyclomatic 18) crates/typst-syntax/src/reparser.rs:128 — typst_syntax::reparser::expand_and_reparse_markup has cyclomatic complexity 18 (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 · typst_pdf · ×4

typst_pdf::tags::tree::close_group (cyclomatic 47) crates/typst-pdf/src/tags/tree/mod.rs:422 — typst_pdf::tags::tree::close_group has cyclomatic complexity 47 (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.
typst_pdf::convert::convert_validation_error (cyclomatic 44) crates/typst-pdf/src/convert.rs:529 — typst_pdf::convert::convert_validation_error has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
typst_pdf::tags::resolve::build_group_tag (cyclomatic 34) crates/typst-pdf/src/tags/resolve/mod.rs:279 — typst_pdf::tags::resolve::build_group_tag has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: typst_pdf::tags::resolve::tag_name (cyclomatic 39) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.
typst_pdf::tags::context::table::build_table (cyclomatic 30) crates/typst-pdf/src/tags/context/table.rs:137 — typst_pdf::tags::context::table::build_table has cyclomatic complexity 30 (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.

D2 · Cognitive Complexity · typst_syntax · ×4

typst_syntax::parser::code_expr_prec (cognitive 33) crates/typst-syntax/src/parser.rs:587 — typst_syntax::parser::code_expr_prec has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, match/switch 1 (3 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.
typst_syntax::parser::math_expr_prec (cognitive 28) crates/typst-syntax/src/parser.rs:270 — typst_syntax::parser::math_expr_prec has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (4 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.
typst_syntax::reparser::expand_and_reparse_markup (cognitive 26) crates/typst-syntax/src/reparser.rs:128 — typst_syntax::reparser::expand_and_reparse_markup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 pts), boolean chains 8 (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.
typst_syntax::parser::array_or_dict_item (cognitive 16) crates/typst-syntax/src/parser.rs:1126 — typst_syntax::parser::array_or_dict_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 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.

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×4

Duplicated block (10 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:32 — crates/typst-library/src/layout/grid/resolve.rs:32-41 | crates/typst-library/src/layout/grid/resolve.rs:83-92 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:133 — crates/typst-library/src/layout/grid/resolve.rs:133-142 | crates/typst-library/src/layout/grid/resolve.rs:170-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) crates/typst-library/src/visualize/gradient.rs:595 — crates/typst-library/src/visualize/gradient.rs:595-604 | crates/typst-library/src/visualize/gradient.rs:685-694 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) crates/typst-pdf/src/paint.rs:82 — crates/typst-pdf/src/paint.rs:82-91 | crates/typst-svg/src/shape.rs:64-73 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (9 lines × 2) · ×4

Duplicated block (9 lines × 2) crates/typst-html/src/document.rs:156 — crates/typst-html/src/document.rs:156-164 | crates/typst-layout/src/pages/mod.rs:154-162 — before extracting anything, compare `crates/typst-html/src/document.rs` and `crates/typst-layout/src/pages/mod.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) crates/typst-layout/src/lists.rs:323 — crates/typst-layout/src/lists.rs:323-331 | crates/typst-layout/src/lists.rs:356-364 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) crates/typst-pdf/src/tags/context/mod.rs:153 — crates/typst-pdf/src/tags/context/mod.rs:153-161 | crates/typst-pdf/src/tags/context/mod.rs:186-194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) crates/typst-library/src/visualize/stroke.rs:328 — crates/typst-library/src/visualize/stroke.rs:328-336 | crates/typst-library/src/visualize/stroke.rs:340-348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (6 lines × 2) · ×4

Duplicated block (6 lines × 2) crates/typst-library/src/visualize/gradient.rs:1168 — crates/typst-library/src/visualize/gradient.rs:1168-1173 | crates/typst-library/src/visualize/gradient.rs:1253-1258 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) crates/typst-cli/src/world.rs:261 — crates/typst-cli/src/world.rs:261-266 | crates/typst-kit/src/files.rs:309-314 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) crates/typst-library/src/model/bibliography.rs:353 — crates/typst-library/src/model/bibliography.rs:353-358 | crates/typst-library/src/model/cite.rs:120-125 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) crates/typst-library/src/layout/corners.rs:192 — crates/typst-library/src/layout/corners.rs:192-197 | crates/typst-library/src/layout/sides.rs:239-244 — before extracting anything, compare `crates/typst-library/src/layout/corners.rs` and `crates/typst-library/src/layout/sides.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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.

D1 · Cyclomatic Complexity · typst_realize · ×3

typst_realize::visit_styled (cyclomatic 25) crates/typst-realize/src/lib.rs:592 — typst_realize::visit_styled 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.
typst_realize::finish_grouping (cyclomatic 17) crates/typst-realize/src/lib.rs:915 — typst_realize::finish_grouping 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.
typst_realize::verdict (cyclomatic 16) crates/typst-realize/src/lib.rs:437 — typst_realize::verdict 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.

D2 · Cognitive Complexity · typst_eval · ×3

typst_eval::markup::eval_markup (cognitive 25) crates/typst-eval/src/markup.rs:27 — typst_eval::markup::eval_markup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (5 pts), loops 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.
typst_eval::call::eval_closure (cognitive 18) crates/typst-eval/src/call.rs:642 — typst_eval::call::eval_closure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_eval::call::eval_field_callee (cognitive 16) crates/typst-eval/src/call.rs:236 — typst_eval::call::eval_field_callee has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (5 pts), boolean chains 2 (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 · typst_html · ×3

typst_html::encode::write_element (cognitive 21) crates/typst-html/src/encode.rs:121 — typst_html::encode::write_element has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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.
typst_html::convert::handle (cognitive 20) crates/typst-html/src/convert.rs:93 — typst_html::convert::handle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
typst_html::convert::handle_text (cognitive 20) crates/typst-html/src/convert.rs:252 — typst_html::convert::handle_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 2, 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.

D31 · IaC & Container Security · Medium IaC · ×3

REDACTED
REDACTED
REDACTED

D4 · Code Duplication · Duplicated block (14 lines × 2) · ×3

Duplicated block (14 lines × 2) crates/typst-library/src/math/mod.rs:265 — crates/typst-library/src/math/mod.rs:265-278 | crates/typst-library/src/text/mod.rs:1109-1122 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) crates/typst-pdf/src/paint.rs:238 — crates/typst-pdf/src/paint.rs:238-251 | crates/typst-pdf/src/paint.rs:260-273 — 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 lines × 2) crates/typst-html/src/document.rs:111 — crates/typst-html/src/document.rs:111-124 | crates/typst-layout/src/pages/mod.rs:112-125 — before extracting anything, compare `crates/typst-html/src/document.rs` and `crates/typst-layout/src/pages/mod.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D5 · Coupling · Off the main sequence · ×3

Off the main sequence: typst-timing — typst-timing: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 14 project(s), so it's rigid to change.
Off the main sequence: typst-syntax — typst-syntax: abstractness 0.02, instability 0.15, distance 0.82 — zone of pain — concrete and depended on by 11 project(s), so it's rigid to change.
Off the main sequence: typst — typst: abstractness 1.00, instability 0.75, distance 0.75 — zone of uselessness — abstract and unstable, so it's likely unused.

D1 · Cyclomatic Complexity · Lexer · ×2

Lexer::math (cyclomatic 60) crates/typst-syntax/src/lexer.rs:656 — Lexer::math has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Lexer::number (cyclomatic 26) crates/typst-syntax/src/lexer.rs:975 — Lexer::number 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. This is NOT this file's highest cyclomatic complexity: Lexer::code (cyclomatic 34) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.

D1 · Cyclomatic Complexity · CellGridResolver · ×2

CellGridResolver::resolve_grid_child (cyclomatic 34) crates/typst-library/src/layout/grid/resolve.rs:1142 — CellGridResolver::resolve_grid_child 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.
CellGridResolver::collect_lines (cyclomatic 17) crates/typst-library/src/layout/grid/resolve.rs:1715 — CellGridResolver::collect_lines 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 · typst_html · ×2

typst_html::mathml::handle_realized (cyclomatic 32) crates/typst-html/src/mathml.rs:491 — typst_html::mathml::handle_realized has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
typst_html::convert::handle_text (cyclomatic 18) crates/typst-html/src/convert.rs:252 — typst_html::convert::handle_text 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 · GridLayouter · ×2

GridLayouter::render_fills_strokes (cyclomatic 30) crates/typst-layout/src/grid/layouter.rs:467 — GridLayouter::render_fills_strokes 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.
GridLayouter::finish_region (cyclomatic 30) crates/typst-layout/src/grid/layouter.rs:1599 — GridLayouter::finish_region 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.

D17 · Explicit Debt · FixmeComment · ×2

FixmeComment crates/typst-layout/src/grid/lines.rs:523 — // FIXME: Make this check more robust when footers at arbitrary — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment crates/typst-kit/src/watcher.rs:173 — // FIXME: This doesn't work properly for multifile image export. — 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 · CellGridResolver · ×2

CellGridResolver::resolve_grid_child (cognitive 69) crates/typst-library/src/layout/grid/resolve.rs:1142 — CellGridResolver::resolve_grid_child has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 5 (11 pts), match/switch 5 (10 pts), boolean chains 3 (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.
CellGridResolver::collect_lines (cognitive 26) crates/typst-library/src/layout/grid/resolve.rs:1715 — CellGridResolver::collect_lines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Composer · ×2

Composer::page_contents (cognitive 25) crates/typst-layout/src/flow/compose.rs:224 — Composer::page_contents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, 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.
Composer::footnote (cognitive 17) crates/typst-layout/src/flow/compose.rs:627 — Composer::footnote has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 1 (2 pts), loops 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 · ShapedText · ×2

ShapedText::build (cognitive 23) crates/typst-layout/src/inline/shaping.rs:326 — ShapedText::build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ShapedText::find_safe_to_break (cognitive 17) crates/typst-layout/src/inline/shaping.rs:657 — ShapedText::find_safe_to_break has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · typst_render · ×2

typst_render::paint::to_sk_paint (cognitive 22) crates/typst-render/src/paint.rs:139 — typst_render::paint::to_sk_paint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 7 (9 pts), loops 2 (3 pts) (nesting depth added 7). Of this number, 19 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
typst_render::text::write_bitmap (cognitive 21) crates/typst-render/src/text.rs:148 — typst_render::text::write_bitmap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D3 · God Classes · TooManyFields · ×2

TooManyFields: MathConstants crates/typst-library/src/text/font/metrics.rs:140 — TooManyFields — 55 stored fields beside 3 methods. The bar is 30 stored fields; this is 25 over it, 1.83× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: TextElem crates/typst-library/src/text/mod.rs:91 — TooManyFields — 42 stored fields beside 1 method. The bar is 30 stored fields; this is 12 over it, 1.40× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.

D30 · Dependency Vulnerabilities · Medium vulnerability · ×2

REDACTED
REDACTED

D4 · Code Duplication · Duplicated block (27 lines × 2) · ×2

Duplicated block (27 lines × 2) crates/typst-html/src/introspect.rs:212 — crates/typst-html/src/introspect.rs:212-238 | crates/typst-layout/src/introspect.rs:181-207 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (27 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:1738 — crates/typst-library/src/layout/grid/resolve.rs:1738-1764 | crates/typst-library/src/layout/grid/resolve.rs:1778-1804 — 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 (18–19 lines × 2) · ×2

Duplicated block (18–19 lines × 2) crates/typst-cli/src/eval.rs:111 — crates/typst-cli/src/eval.rs:111-129 | crates/typst-cli/src/query.rs:52-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.
Duplicated block (18–19 lines × 2) crates/typst-library/src/layout/corners.rs:214 — crates/typst-library/src/layout/corners.rs:214-232 | crates/typst-library/src/layout/sides.rs:252-269 — before extracting anything, compare `crates/typst-library/src/layout/corners.rs` and `crates/typst-library/src/layout/sides.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 (16 lines × 2) · ×2

Duplicated block (16 lines × 2) crates/typst-html/src/tag.rs:210 — crates/typst-html/src/tag.rs:210-225 | crates/typst-html/src/tag.rs:409-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.
Duplicated block (16 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:144 — crates/typst-library/src/layout/grid/resolve.rs:144-159 | crates/typst-library/src/layout/grid/resolve.rs:181-196 — 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 (15 lines × 2) · ×2

Duplicated block (15 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:222 — crates/typst-library/src/layout/grid/resolve.rs:222-236 | crates/typst-library/src/layout/grid/resolve.rs:317-331 — 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 (15 lines × 2) crates/typst-library/src/text/font/color.rs:485 — crates/typst-library/src/text/font/color.rs:485-499 | crates/typst-library/src/text/font/color.rs:515-529 — 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 lines × 2) · ×2

Duplicated block (12 lines × 2) crates/typst-layout/src/flow/collect.rs:405 — crates/typst-layout/src/flow/collect.rs:405-416 | crates/typst-layout/src/flow/collect.rs:505-516 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) crates/typst-library/src/layout/grid/mod.rs:532 — crates/typst-library/src/layout/grid/mod.rs:532-543 | crates/typst-library/src/model/table.rs:402-413 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (11 lines × 2) · ×2

Duplicated block (11 lines × 2) crates/typst-pdf/src/paint.rs:218 — crates/typst-pdf/src/paint.rs:218-228 | crates/typst-svg/src/paint.rs:133-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) crates/typst-library/src/foundations/datetime.rs:195 — crates/typst-library/src/foundations/datetime.rs:195-205 | crates/typst-library/src/foundations/datetime.rs:207-217 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (8 lines × 3) · ×2

Duplicated block (8 lines × 3) crates/typst-layout/src/flow/block.rs:77 — crates/typst-layout/src/flow/block.rs:77-84 | crates/typst-layout/src/flow/block.rs:193-200 | crates/typst-layout/src/inline/box.rs:54-61 — 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.
Duplicated block (8 lines × 3) crates/typst-cli/src/info.rs:591 — crates/typst-cli/src/info.rs:591-598 | crates/typst-cli/src/info.rs:602-609 | crates/typst-cli/src/info.rs:612-619 — 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.

C2 · Access Controls · No authorization · ×1

No authorization docs/src/main.rs:149 — This repository serves requests — a server (HttpServer::new) (docs/src/main.rs:149) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected.

D1 · Cyclomatic Complexity · CompileConfig · ×1

CompileConfig::new_impl (cyclomatic 31) crates/typst-cli/src/compile.rs:107 — CompileConfig::new_impl 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 · ModuleImport · ×1

ModuleImport::eval (cyclomatic 30) crates/typst-eval/src/import.rs:20 — ModuleImport::eval 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 · ForLoop · ×1

ForLoop::eval (cyclomatic 28) crates/typst-eval/src/flow.rs:118 — ForLoop::eval has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · docs.buildSymbolScoringFunction (cyclomatic 27) · ×1

docs.buildSymbolScoringFunction (cyclomatic 27) docs/assets/docs.js:1040 — docs.buildSymbolScoringFunction has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1062, 1106). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D1 · Cyclomatic Complexity · CapturesVisitor · ×1

CapturesVisitor::visit (cyclomatic 26) crates/typst-eval/src/call.rs:776 — CapturesVisitor::visit has cyclomatic complexity 26 (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 · PdfStandards · ×1

PdfStandards::new (cyclomatic 25) crates/typst-pdf/src/format.rs:573 — PdfStandards::new has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Distributor · ×1

Distributor::finalize (cyclomatic 22) crates/typst-layout/src/flow/distribute.rs:590 — Distributor::finalize 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 · docs.setUpSymbolFlyout · ×1

docs.setUpSymbolFlyout::populateFlyout (cyclomatic 22) docs/assets/docs.js:557 — docs.setUpSymbolFlyout::populateFlyout has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Color · ×1

Color::mix_iter (cyclomatic 20) crates/typst-library/src/visualize/color.rs:1526 — Color::mix_iter has cyclomatic complexity 20 (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 · DurationDisplay · ×1

DurationDisplay::fmt (cyclomatic 20) crates/typst-utils/src/duration.rs:15 — DurationDisplay::fmt 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 · Datetime · ×1

Datetime::construct (cyclomatic 19) crates/typst-library/src/foundations/datetime.rs:266 — Datetime::construct has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ImageResolver · ×1

ImageResolver::load_or_error (cyclomatic 19) crates/typst-library/src/visualize/image/svg.rs:449 — ImageResolver::load_or_error has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · typst_macros · ×1

typst_macros::scope::scope (cyclomatic 19) crates/typst-macros/src/scope.rs:14 — typst_macros::scope::scope has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ElementIntrospector · ×1

ElementIntrospector::query (cyclomatic 18) crates/typst-library/src/introspection/introspector.rs:194 — ElementIntrospector::query has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Tiling · ×1

Tiling::construct (cyclomatic 18) crates/typst-library/src/visualize/tiling.rs:100 — Tiling::construct 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 · docs.setUpTooltip (cyclomatic 18) · ×1

docs.setUpTooltip (cyclomatic 18) docs/assets/docs.js:320 — docs.setUpTooltip has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 7 function items inside it that branch (hide, a function literal at line 379, show, …). 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 · Composer · ×1

Composer::footnote (cyclomatic 17) crates/typst-layout/src/flow/compose.rs:627 — Composer::footnote 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 · Array · ×1

Array::sorted (cyclomatic 17) crates/typst-library/src/foundations/array.rs:889 — Array::sorted 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 · Str · ×1

Str::trim (cyclomatic 17) crates/typst-library/src/foundations/str.rs:569 — Str::trim 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 · CompletionContext · ×1

CompletionContext::value_completion_full (cyclomatic 16) crates/typst-ide/src/complete.rs:1283 — CompletionContext::value_completion_full has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Docs · ×1

Docs::summary (cyclomatic 16) crates/typst-ide/src/docs.rs:109 — Docs::summary 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 · CastInfo · ×1

CastInfo::error (cyclomatic 16) crates/typst-library/src/foundations/cast.rs:311 — CastInfo::error 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 · RasterImage · ×1

RasterImage::new_impl (cyclomatic 16) crates/typst-library/src/visualize/image/raster.rs:49 — RasterImage::new_impl has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · LiveVisitor · ×1

LiveVisitor::visit_item (cyclomatic 16) docs/src/live.rs:48 — LiveVisitor::visit_item has cyclomatic complexity 16 (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.

D2 · Cognitive Complexity · ModuleImport · ×1

ModuleImport::eval (cognitive 58) crates/typst-eval/src/import.rs:20 — ModuleImport::eval has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 3 (7 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · CompileConfig · ×1

CompileConfig::new_impl (cognitive 39) crates/typst-cli/src/compile.rs:107 — CompileConfig::new_impl has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 5, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · CapturesVisitor · ×1

CapturesVisitor::visit (cognitive 38) crates/typst-eval/src/call.rs:776 — CapturesVisitor::visit has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 6 (15 pts), match/switch 2 (4 pts) (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Array · ×1

Array::sorted (cognitive 37) crates/typst-library/src/foundations/array.rs:889 — Array::sorted has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 7 (17 pts) (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · docs.buildSymbolScoringFunction (cognitive 37) · ×1

docs.buildSymbolScoringFunction (cognitive 37) docs/assets/docs.js:1040 — docs.buildSymbolScoringFunction has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 14). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1062, 1106). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.

D2 · Cognitive Complexity · Distributor · ×1

Distributor::finalize (cognitive 34) crates/typst-layout/src/flow/distribute.rs:590 — Distributor::finalize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 2 (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 · DurationDisplay · ×1

DurationDisplay::fmt (cognitive 32) crates/typst-utils/src/duration.rs:15 — DurationDisplay::fmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (30 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 · Str · ×1

Str::trim (cognitive 31) crates/typst-library/src/foundations/str.rs:569 — Str::trim has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · typst_macros · ×1

typst_macros::scope::scope (cognitive 29) crates/typst-macros/src/scope.rs:14 — typst_macros::scope::scope has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 6 (13 pts), boolean chains 1, loops 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 · Datetime · ×1

Datetime::construct (cognitive 26) crates/typst-library/src/foundations/datetime.rs:266 — Datetime::construct has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 6 (8 pts) (nesting depth added 8). Of this number, 25 points are the body's own statements and 1 belongs to one function item inside it that branches. The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Lexer · ×1

Lexer::number (cognitive 25) crates/typst-syntax/src/lexer.rs:975 — Lexer::number has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 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 · Symbol · ×1

Symbol::construct (cognitive 24) crates/typst-library/src/foundations/symbol.rs:219 — Symbol::construct has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 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 · docs.setUpSymbolFlyout · ×1

docs.setUpSymbolFlyout::populateFlyout (cognitive 24) docs/assets/docs.js:557 — docs.setUpSymbolFlyout::populateFlyout has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Watcher · ×1

Watcher::wait (cognitive 23) crates/typst-kit/src/watcher.rs:121 — Watcher::wait has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ElementIntrospector · ×1

ElementIntrospector::query (cognitive 23) crates/typst-library/src/introspection/introspector.rs:194 — ElementIntrospector::query has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · docs.searchGlobally (cognitive 23) · ×1

docs.searchGlobally (cognitive 23) docs/assets/docs.js:823 — docs.searchGlobally has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 7 (10 pts), boolean chains 2 (nesting depth added 8). Of this number, 17 points are the body's own statements and 6 belong to one function item inside it that branches. 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 · RowspanSimulator · ×1

RowspanSimulator::simulate_rowspan_layout (cognitive 22) crates/typst-layout/src/grid/rowspans.rs:1059 — RowspanSimulator::simulate_rowspan_layout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ImageResolver · ×1

ImageResolver::load_or_error (cognitive 22) crates/typst-library/src/visualize/image/svg.rs:449 — ImageResolver::load_or_error has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Color · ×1

Color::mix_iter (cognitive 21) crates/typst-library/src/visualize/color.rs:1526 — Color::mix_iter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3, match/switch 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 · Stroke · ×1

Stroke::repr (cognitive 21) crates/typst-library/src/visualize/stroke.rs:307 — Stroke::repr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 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 · docs.setUpTooltip (cognitive 21) · ×1

docs.setUpTooltip (cognitive 21) docs/assets/docs.js:320 — docs.setUpTooltip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 6 (nesting depth added 1). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 379, hide, show, …). 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 · HtmlDocument · ×1

HtmlDocument::resolve_position (cognitive 20) crates/typst-ide/src/jump.rs:87 — HtmlDocument::resolve_position has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ListType · ×1

ListType::cast (cognitive 20) crates/typst-html/src/typed.rs:337 — ListType::cast has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · MathArgs · ×1

MathArgs::eval (cognitive 20) crates/typst-eval/src/call.rs:463 — MathArgs::eval has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), match/switch 2 (5 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 · CastInfo · ×1

CastInfo::error (cognitive 19) crates/typst-library/src/foundations/cast.rs:311 — CastInfo::error has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 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 · ProcessColor · ×1

ProcessColor::repr (cognitive 19) crates/typst-library/src/visualize/color.rs:2307 — ProcessColor::repr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Tiling · ×1

Tiling::construct (cognitive 19) crates/typst-library/src/visualize/tiling.rs:100 — Tiling::construct has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.

D2 · Cognitive Complexity · LiveVisitor · ×1

LiveVisitor::visit_item (cognitive 19) docs/src/live.rs:48 — LiveVisitor::visit_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Docs · ×1

Docs::summary (cognitive 18) crates/typst-ide/src/docs.rs:109 — Docs::summary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Packed · ×1

Packed::decode (cognitive 18) crates/typst-library/src/visualize/image/mod.rs:242 — Packed::decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · SVGRenderer · ×1

SVGRenderer::write_gradients (cognitive 18) crates/typst-svg/src/paint.rs:117 — SVGRenderer::write_gradients has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 2 (5 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 · ForLoop · ×1

ForLoop::eval (cognitive 18) crates/typst-eval/src/flow.rs:118 — ForLoop::eval has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (9 pts), match/switch 6 (7 pts), if/else 2 (nesting depth added 5). 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 · SyntaxNode · ×1

SyntaxNode::synthesize_with (cognitive 18) crates/typst-syntax/src/node.rs:384 — SyntaxNode::synthesize_with has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · Duration · ×1

Duration::into_attr (cognitive 17) crates/typst-html/src/typed.rs:558 — Duration::into_attr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 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 · Protector · ×1

Protector::visit_nodes (cognitive 16) crates/typst-html/src/convert.rs:612 — Protector::visit_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · CompletionContext · ×1

CompletionContext::value_completion_full (cognitive 16) crates/typst-ide/src/complete.rs:1283 — CompletionContext::value_completion_full has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D4 · Code Duplication · Near-duplicate member pair (46 shared lines) · ×1

Near-duplicate member pair (46 shared lines) crates/typst-library/src/layout/grid/resolve.rs:213 — crates/typst-library/src/layout/grid/resolve.rs:213-275 | crates/typst-library/src/layout/grid/resolve.rs:310-369 — These two members are variants of one another: 46 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) crates/typst-html/src/fragment.rs:53 — crates/typst-html/src/fragment.rs:53-77 | crates/typst-layout/src/flow/mod.rs:131-173 | crates/typst-layout/src/inline/mod.rs:82-120 | crates/typst-layout/src/pages/run.rs:88-248 — 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 · Duplicated block (33 lines × 2) · ×1

Duplicated block (33 lines × 2) crates/typst-eval/src/call.rs:415 — crates/typst-eval/src/call.rs:415-447 | crates/typst-eval/src/call.rs:483-515 — 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–32 lines × 2) · ×1

Duplicated block (29–32 lines × 2) crates/typst-render/src/image.rs:117 — crates/typst-render/src/image.rs:117-148 | crates/typst-svg/src/image.rs:147-175 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (30 lines × 2) · ×1

Duplicated block (30 lines × 2) crates/typst-layout/src/flow/block.rs:71 — crates/typst-layout/src/flow/block.rs:71-100 | crates/typst-layout/src/inline/box.rs:48-77 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1

Duplicated block (26 lines × 2) crates/typst-library/src/layout/grid/resolve.rs:239 — crates/typst-library/src/layout/grid/resolve.rs:239-264 | crates/typst-library/src/layout/grid/resolve.rs:334-359 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1

Duplicated block (17 lines × 2) crates/typst-macros/src/cast.rs:221 — crates/typst-macros/src/cast.rs:221-237 | crates/typst-macros/src/cast.rs:318-334 — 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 (16 lines × 3) · ×1

Duplicated block (16 lines × 3) crates/typst-library/src/visualize/gradient.rs:1114 — crates/typst-library/src/visualize/gradient.rs:1114-1129 | crates/typst-library/src/visualize/gradient.rs:1195-1210 | crates/typst-library/src/visualize/gradient.rs:1260-1275 — 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–15 lines × 2) · ×1

Duplicated block (14–15 lines × 2) crates/typst-bundle/src/lib.rs:163 — crates/typst-bundle/src/lib.rs:163-177 | crates/typst-layout/src/pages/mod.rs:143-156 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (13 lines × 2) · ×1

Duplicated block (13 lines × 2) crates/typst-layout/src/flow/collect.rs:434 — crates/typst-layout/src/flow/collect.rs:434-446 | crates/typst-layout/src/flow/collect.rs:534-546 — 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 (11–12 lines × 2) · ×1

Duplicated block (11–12 lines × 2) crates/typst-layout/src/math/fraction.rs:73 — crates/typst-layout/src/math/fraction.rs:73-84 | crates/typst-layout/src/math/line.rs:62-72 — 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 (11 lines × 4) · ×1

Duplicated block (11 lines × 4) crates/typst-html/src/fragment.rs:54 — crates/typst-html/src/fragment.rs:54-64 | crates/typst-layout/src/flow/mod.rs:139-149 | crates/typst-layout/src/inline/mod.rs:83-93 | crates/typst-layout/src/pages/run.rs:89-99 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.

D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1

Duplicated block (9–10 lines × 2) crates/typst-svg/src/shape.rs:75 — crates/typst-svg/src/shape.rs:75-83 | crates/typst-svg/src/shape.rs:109-118 — 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 lines × 3) · ×1

Duplicated block (9 lines × 3) crates/typst-library/src/layout/corners.rs:156 — crates/typst-library/src/layout/corners.rs:156-164 | crates/typst-library/src/layout/page.rs:643-651 | crates/typst-library/src/layout/sides.rs:214-222 — before extracting anything, compare `crates/typst-library/src/layout/corners.rs` and `crates/typst-library/src/layout/sides.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 (7 lines × 3) · ×1

Duplicated block (7 lines × 3) crates/typst-library/src/math/equation.rs:235 — crates/typst-library/src/math/equation.rs:235-241 | crates/typst-library/src/model/figure.rs:456-462 | crates/typst-library/src/model/heading.rs:330-336 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.

D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1

Duplicated block (12 lines × 3) crates/typst-bundle/src/lib.rs:135 — crates/typst-bundle/src/lib.rs:135-146 | crates/typst-html/src/document.rs:30-41 | crates/typst-layout/src/pages/mod.rs:39-50 — before extracting anything, compare `crates/typst-html/src/document.rs` and `crates/typst-layout/src/pages/mod.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1

Duplicated block (13 lines × 3) crates/typst-html/src/document.rs:84 — crates/typst-html/src/document.rs:84-96 | crates/typst-layout/src/pages/mod.rs:85-97 | crates/typst-layout/src/pages/run.rs:61-73 — before extracting anything, compare `crates/typst-html/src/document.rs` and `crates/typst-layout/src/pages/mod.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D5 · Coupling · Unstable project typst-realize · ×1

Unstable project typst-realize — typst-realize has instability 0.86 with 1 dependents.

M1 · Documentation (README) · README may be stale · ×1

README may be stale — 361 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.

P7 · Outbound HTTP resilience · Outbound HTTP without resilience · ×1

Outbound HTTP without resilience crates/typst-kit/src/downloader.rs:167 — `ureq::AgentBuilder::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.

SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×1

JavaScript dependencies are not locked — No package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock — JS installs aren't reproducible (SSDF PW.4.4). Commit your package manager's lockfile and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.

Minor — 32 finding(s)

D34 · Knowledge Freshness · Orphaned file · ×6

Orphaned file crates/typst-utils/src/round.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/typst-render/src/image.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/typst-render/src/shape.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/typst-kit/src/datetime.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/typst-utils/src/version.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file crates/typst-library/src/visualize/image/pdf.rs:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.

X10 · Duplicated predicate · Duplicated predicate · ×6

Duplicated predicate crates/typst-library/src/layout/corners.rs:144 — `Dict::castable(value) || T::castable(value)` appears character-identically in 2 files — crates/typst-library/src/layout/corners.rs, crates/typst-library/src/layout/sides.rs. 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 crates/typst-layout/src/flow/block.rs:93 — `fill.is_some() || stroke.iter().any(Option::is_some)` appears character-identically in 3 files — crates/typst-layout/src/flow/block.rs, crates/typst-layout/src/inline/box.rs, crates/typst-layout/src/shapes.rs. 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 crates/typst-html/src/mathml.rs:540 — `props.lspace && !props.align_form_infix && !lspace.is_zero()` appears character-identically in 2 files — crates/typst-html/src/mathml.rs, crates/typst-layout/src/math/mod.rs. 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 crates/typst-library/src/layout/length.rs:65 — `self.abs.is_zero() && other.abs.is_zero()` appears character-identically in 2 files — crates/typst-library/src/layout/length.rs, crates/typst-library/src/layout/rel.rs. 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 crates/typst-library/src/format.rs:376 — `self.v == other.v && self.span == other.span` appears character-identically in 2 files — crates/typst-library/src/format.rs, crates/typst-syntax/src/span.rs. 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 crates/typst-library/src/layout/point.rs:109 — `self.x.is_finite() && self.y.is_finite()` appears character-identically in 2 files — crates/typst-library/src/layout/point.rs, crates/typst-library/src/layout/size.rs. 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.

D16 · Bus Factor · Off-boarding risk · ×4

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: crates/typst-kit/src/server.rs, crates/typst-bundle/src/introspect.rs, crates/typst-html/src/introspect.rs, crates/typst-layout/src/introspect.rs, crates/typst-utils/src/collection.rs, crates/typst-cli/src/init.rs, crates/typst-library/src/text/font/tag.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/typst-html/src/attr.rs, crates/typst-library/src/math/ir/process.rs, crates/typst-layout/src/math/table.rs, crates/typst-layout/src/math/fraction.rs, crates/typst-library/src/math/ir/multiline.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #3 — If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: crates/typst-pdf/src/tags/context/mod.rs, crates/typst-pdf/src/tags/resolve/accumulator.rs, crates/typst-library/src/foundations/context.rs, crates/typst-pdf/src/tags/util/idvec.rs. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #4 — If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/typst-syntax/src/node.rs, crates/typst-syntax/src/reparser.rs, crates/typst-syntax/src/set.rs. Pair on, review, or document these before any departure.

X7 · Silent fallback defaults · Silent fallback default on Err · ×2

Silent fallback default on Err crates/typst-library/src/introspection/counter.rs:978 — `format_convergence_warning` turns every `Err` into `"(errored)".into()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err crates/typst-library/src/introspection/state.rs:526 — `format_convergence_warning` turns every `Err` into `"(errored)".into()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.

D16 · Bus Factor · Further sole-owners (lower concentration) · ×1

Further sole-owners (lower concentration) — 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (20 single-owned of 332 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; 332 of the 389 production source files in this repository met that bar). They are anonymized user #5 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/typst-utils/src/duration.rs.

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — 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/`.

D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1

Projects may be oversized for their cohesion — 2 of 18 project(s) overshoot their size bounds, lowering Project Cohesion to 7.8/10. The most over is `crates/typst-library` (65152 LoC, 715 module-visible types across 14 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.

D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1

Further orphaned files (smaller) — 6 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: crates/typst-utils/src/round.rs, crates/typst-render/src/image.rs, crates/typst-render/src/shape.rs, crates/typst-kit/src/datetime.rs, crates/typst-utils/src/version.rs, crates/typst-library/src/visualize/image/pdf.rs (7 orphaned of 332 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; 332 of the 389 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

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.

P2 · Observability · Logging is not universal · ×1

Logging is not universal — Only 5/9 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `crates/typst-cli`, `crates/typst-ide`, `crates/typst-kit`, `docs`.

S1 · Web-Security Posture · No app-layer HTTPS enforcement detected · ×1

No app-layer HTTPS enforcement detected — This repository starts an HTTP server and nothing in its Rust source or committed `Rocket.toml` secures the transport: no TLS served (actix-web `bind_rustls`/`bind_openssl`, axum-server `bind_rustls` with a `RustlsConfig`, tonic `ServerTlsConfig`, a `TlsAcceptor`, Rocket's `[default.tls]`), no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: `HttpServer::new(` (docs/src/main.rs:149).

S1 · Web-Security Posture · No security response headers detected · ×1

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

S1 · Web-Security Posture · No inbound request validation detected · ×1

No inbound request validation detected — No handler of this repository's Rust server answers 400, 413 or 422 (`StatusCode::BAD_REQUEST`, `HttpResponse::BadRequest()`, `Status::BadRequest`, tonic `Status::invalid_argument`), and nothing declares validation — no `validator`/`garde` derive, no body limit (`DefaultBodyLimit::max`, `RequestBodyLimitLayer`, `JsonConfig::default().limit(…)`, Rocket `Limits`) — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: `HttpServer::new(` (docs/src/main.rs:149).

Minor — 52 finding(s)

D12 · Dependency Hygiene · Outdated · ×52

Outdated: arrayvec — `arrayvec` is locked at 0.7.6 but 0.7.8 is the current stable release on crates.io, and it already satisfies the `"0.7.4"` requirement declared in crates/typst-library/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p arrayvec` and commit the updated REDACTED.
Outdated: az — `az` is locked at 1.2.1 but 1.3.0 is the current stable release on crates.io, and it already satisfies the `"1.2"` requirement declared in docs/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p az` and commit the updated REDACTED.
Outdated: bitflags — `bitflags` is locked at 2.11.1 but 2.13.2 is the current stable release on crates.io, and it already satisfies the `"2.10"` requirement declared in tests/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bitflags` and commit the updated REDACTED.
Outdated: bumpalo — `bumpalo` is locked at 3.20.2 but 3.20.3 is the current stable release on crates.io, and it already satisfies the `"3.15.4"` requirement declared in crates/typst-html/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bumpalo` and commit the updated REDACTED.
Outdated: bytemuck — `bytemuck` is locked at 1.25.0 but 1.25.2 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/typst-pdf/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bytemuck` and commit the updated REDACTED.
Outdated: chrono — `chrono` is locked at 0.4.39 but 0.4.45 is the current stable release on crates.io, and it already satisfies the `"0.4.24"` requirement declared in crates/typst-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p chrono` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.6.6 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4.4"` requirement declared in docs/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: clap_complete — `clap_complete` is locked at 4.6.9 but 4.6.11 is the current stable release on crates.io, and it already satisfies the `"4.2.1"` requirement declared in crates/typst-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap_complete` and commit the updated REDACTED.
Outdated: clap_mangen — `clap_mangen` is locked at 0.3.0 but 0.3.3 is the current stable release on crates.io, and it already satisfies the `"0.3.0"` requirement declared in crates/typst-cli/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap_mangen` and commit the updated REDACTED.
Outdated: csv — `csv` is locked at 1.3.1 but 1.4.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/typst-library/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p csv` and commit the updated REDACTED.
Outdated: either — `either` is locked at 1.13.0 but 1.19.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in docs/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p either` and commit the updated REDACTED.
Outdated: fastrand — `fastrand` is locked at 2.3.0 but 2.5.0 is the current stable release on crates.io, and it already satisfies the `"2.3"` requirement declared in crates/typst-kit/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p fastrand` and commit the updated REDACTED.
Outdated: flate2 — `flate2` is locked at 1.1.2 but 1.1.10 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/typst-kit/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p flate2` and commit the updated REDACTED.
Outdated: icu_collator — `icu_collator` is locked at 2.3.1 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.3.1"` requirement declared in docs/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_collator` and commit the updated REDACTED.
Outdated: icu_properties — `icu_properties` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.2.0"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_properties` and commit the updated REDACTED.
Outdated: icu_provider — `icu_provider` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.2.0"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_provider` and commit the updated REDACTED.
Outdated: icu_provider_blob — `icu_provider_blob` is locked at 2.2.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.2.0"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_provider_blob` and commit the updated REDACTED.
Outdated: icu_segmenter — `icu_segmenter` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.2.0"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p icu_segmenter` and commit the updated REDACTED.
Outdated: indexmap — `indexmap` is locked at 2.12.1 but 2.14.2 is the current stable release on crates.io, and it already satisfies the `"2"` requirement declared in tests/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p indexmap` and commit the updated REDACTED.
Outdated: itoa — `itoa` is locked at 1.0.14 but 1.0.18 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in crates/typst-svg/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p itoa` and commit the updated REDACTED.
Outdated: libfuzzer-sys — `libfuzzer-sys` is locked at 0.4.9 but 0.4.13 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in tests/fuzz/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libfuzzer-sys` and commit the updated REDACTED.
Outdated: libm — `libm` is locked at 0.2.11 but 0.2.16 is the current stable release on crates.io, and it already satisfies the `"0.2.11"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libm` and commit the updated REDACTED.
Outdated: memchr — `memchr` is locked at 2.8.0 but 2.8.3 is the current stable release on crates.io, and it already satisfies the `"2"` requirement declared in crates/typst-layout/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memchr` and commit the updated REDACTED.
Outdated: native-tls — `native-tls` is locked at 0.2.13 but 0.2.18 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in crates/typst-kit/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p native-tls` and commit the updated REDACTED.
Outdated: notify — `notify` is locked at 8.0.0 but 8.2.1 is the current stable release on crates.io, and it already satisfies the `"8"` requirement declared in crates/typst-kit/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p notify` and commit the updated REDACTED.
+ 27 more in this group — see findings.md.

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.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-ddc66a5b1fe744eeb305591fa806f49e/history.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-ddc66a5b1fe744eeb305591fa806f49e/tree.json --exit-code 0 --source .	0	artifacts/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/watchdog-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 tests/ref .	2	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	8	artifacts/raw/trivy-fs.json
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	4	artifacts/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	—
D37 · Vulnerability-disclosure Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-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 Confinement	runtime-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 Enforcement	runtime-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 Dependencies	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json

Run 01a174cd-568a-7909-9891-a6b7827c1639 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Findings by how serious they are

This survey was produced by

Executive summary

Top priorities

Diagnosis: what the measurements show together

Architecture — module dependency graph

Architecture: which parts of the code depend on which

At a glance — Code Health · 90% · Exemplary ·

At a glance — Architecture · 96% · Exemplary ·

At a glance — Maturity · 59% · Adequate · gated by M2 ·

At a glance — Readiness · 60% · Adequate · gated by P7 ·

At a glance — Security · 33% · Weak · gated by D36, C2 ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

Dimensions

Frontend & cross-cutting dimensions

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts