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

spencermountain/compromise

Measured 15 November 2026, 05:22 UTC, at code version d4d3071

CAI score 47out of 100 Weak
CriticalWeakAdequateStrongExemplary
Down 14 since the last survey

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

A large codebase: 103,103 lines of product code in 21 projects, tests not counted · Estimated rebuild effort: about 1.1 person-years · Weakest lens: Production Readiness, 37

Findings by how serious they are

27 critical 609 serious 1699 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
15 November 2026, 05:22 UTC

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

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

60of 60 dimensions measured by tools.
2323of 2335 findings point to an exact file and line, so you can open each one in the code. The other 12 concern the repository as a whole, such as missing documentation.
60dimensions across 6 lenses, read from 103,103 lines of product code in 21 projects.
Chapters

Executive summary

spencermountain/compromise falls short of our standard for production because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 47 out of 100 and is rated Weak, and 25 of its 27 critical findings are security problems.

Production Readiness, at 37, is the weakest lens and counts most in the score. The best first step is making the tests check their results, worth about 6 points. Adding a diagnostic log would lift Production Readiness itself, worth about 5 points. Raising Production Readiness to 70 would lift the score to about 56.

Twenty-one passwords or keys are open to anyone who can read the repository. Two automatic updates take new releases before a bad one can be spotted, and two weaknesses in the code could be used by an attacker. Replacing each exposed password or key, setting a waiting period for automatic updates and fixing the weaknesses the scanner points to would close these risks. The test that checks nothing needs to check the result it produces.

The product code is 103,103 lines, about €160,000 to rebuild.

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

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

If Production Readiness rose from 37 to 70, the lowest score rated Strong, the score would rise from 47 to about 56.

Code composition: what the lines of code are
Product code 60%Tests 40%
New since the last survey: 334 findings

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

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

Fixed since the last survey: 349 findings

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

  • Cyclomatic Complexity · (anonymous)::add (cyclomatic 46) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · (anonymous) (cyclomatic 33) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · 02-from-here.tryHere (cyclomatic 29) src/1-one/match/methods/match/02-from-here.js
  • Cyclomatic Complexity · compromise-dates.W (cyclomatic 24) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · addMethod (cyclomatic 24) src/3-three/numbers/numbers/api.js
  • Cyclomatic Complexity · out.out (cyclomatic 23) src/1-one/output/api/out.js
  • Cyclomatic Complexity · runMatch (cyclomatic 23) src/1-one/match/methods/match/index.js
  • Cyclomatic Complexity · find.findNumbers (cyclomatic 22) src/3-three/numbers/numbers/find.js
  • Cyclomatic Complexity · compromise-dates.M (cyclomatic 22) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · index.parseArgs (cyclomatic 22) scripts/debug/rules/index.js
  • Cyclomatic Complexity · 02-neighbours.byNeighbour (cyclomatic 21) src/3-three/chunker/compute/02-neighbours.js
  • Cyclomatic Complexity · format.format (cyclomatic 20) scripts/debug/word/format.js
  • Cyclomatic Complexity · (anonymous) (cyclomatic 19) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · extend.addIrregulars (cyclomatic 17) src/API/extend.js
  • Cyclomatic Complexity · index.expandVariable (cyclomatic 17) src/2-two/preTagger/model/_expand/index.js
  • Cyclomatic Complexity · compromise-dates.$ (cyclomatic 17) plugins/dates/builds/compromise-dates.cjs
  • Cyclomatic Complexity · redact.redact (cyclomatic 16) src/3-three/redact/redact.js
  • Cyclomatic Complexity · index.main (cyclomatic 16) scripts/debug/word/index.js
  • Cyclomatic Complexity · api (cyclomatic 16) src/3-three/verbs/api/api.js
  • Cognitive Complexity · compromise-dates.parseTime (cognitive 71) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · 03-time.parseTime (cognitive 71) plugins/dates/src/api/parse/one/01-tokenize/03-time.js
  • Cognitive Complexity · 02-from-here.tryHere (cognitive 57) src/1-one/match/methods/match/02-from-here.js
  • Cognitive Complexity · parse (cognitive 55) src/3-three/numbers/numbers/parse/toNumber/index.js
  • Cognitive Complexity · (anonymous)::add (cognitive 51) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · 02-neighbours.byNeighbour (cognitive 48) src/3-three/chunker/compute/02-neighbours.js
  • Cognitive Complexity · runMatch (cognitive 42) src/1-one/match/methods/match/index.js
  • Cognitive Complexity · find.findNumbers (cognitive 36) src/3-three/numbers/numbers/find.js
  • Cognitive Complexity · (anonymous) (cognitive 32) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · question.parseQuestion (cognitive 31) src/3-three/verbs/api/conjugate/question.js
  • Cognitive Complexity · apostrophe-s.isOrHas (cognitive 30) src/2-two/contraction-two/compute/apostrophe-s.js
  • Cognitive Complexity · W (cognitive 27) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · extend.addIrregulars (cognitive 26) src/API/extend.js
  • Cognitive Complexity · addMethod (cognitive 25) src/3-three/numbers/numbers/api.js
  • Cognitive Complexity · index.parseArgs (cognitive 24) scripts/debug/rules/index.js
  • Cognitive Complexity · format.format (cognitive 24) scripts/debug/word/format.js
  • Cognitive Complexity · out.out (cognitive 22) src/1-one/output/api/out.js
  • Cognitive Complexity · M (cognitive 22) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · index.main (cognitive 21) scripts/debug/word/index.js
  • Cognitive Complexity · $ (cognitive 21) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · question (cognitive 20) src/3-three/verbs/api/conjugate/question.js
  • Cognitive Complexity · 01-easy.easyMode (cognitive 19) src/3-three/chunker/compute/01-easy.js
  • Cognitive Complexity · match-debug.matchDebug (cognitive 17) src/API/debug/match-debug.js
  • Cognitive Complexity · compute.freeze (cognitive 17) src/1-one/freeze/compute.js
  • Cognitive Complexity · index.expandVariable (cognitive 17) src/2-two/preTagger/model/_expand/index.js
  • Cognitive Complexity · (anonymous) (cognitive 17) plugins/dates/builds/compromise-dates.cjs
  • Cognitive Complexity · 01-getHooks.getHooks (cognitive 16) src/1-one/sweep/methods/sweep/01-getHooks.js
  • Cognitive Complexity · quickSplit.splitOn (cognitive 16) src/2-two/preTagger/methods/quickSplit.js
  • Cognitive Complexity · index.parseNumber (cognitive 16) src/3-three/numbers/numbers/parse/index.js
  • Cognitive Complexity · api (cognitive 16) src/3-three/verbs/api/api.js
  • God Classes · FunctionTooLong: api.api src/3-three/verbs/api/api.js
  • Test Quality · No assertions: paragraph-basic plugins/paragraphs/tests/misc.test.js
  • Test Quality · No assertions: paragraph-tests plugins/paragraphs/tests/misc.test.js
  • Test Quality · Test project verifies nothing: plugins/paragraphs plugins/paragraphs/tests/misc.test.js
  • Churn × Complexity Hotspots · Hotspot: src/3-three/numbers/numbers/api.js src/3-three/numbers/numbers/api.js
  • Churn × Complexity Hotspots · Hotspot: src/2-two/preTagger/model/_expand/index.js src/2-two/preTagger/model/_expand/index.js
  • Churn × Complexity Hotspots · Hotspot: src/3-three/verbs/api/api.js src/3-three/verbs/api/api.js
  • Churn × Complexity Hotspots · Hotspot: src/1-one/match/methods/match/02-from-here.js src/1-one/match/methods/match/02-from-here.js
  • Churn × Complexity Hotspots · Hotspot: src/1-one/output/api/out.js src/1-one/output/api/out.js
  • Churn × Complexity Hotspots · Hotspot: src/2-two/preTagger/compute/tagger/2nd-pass/03-regex.js src/2-two/preTagger/compute/tagger/2nd-pass/03-regex.js
  • Churn × Complexity Hotspots · Repeated repair: src/3-three/verbs/api/conjugate/toPast.js src/3-three/verbs/api/conjugate/toPast.js
  • Churn × Complexity Hotspots · Repeated repair: src/3-three/verbs/api/parse/grammar/forms.js src/3-three/verbs/api/parse/grammar/forms.js
  • Churn × Complexity Hotspots · Repeated repair: src/3-three/verbs/api/lib.js src/3-three/verbs/api/lib.js
  • Secrets (history) · REDACTED: gcp-api-key client_side/cute_demo/coffeejs/index.js
  • Secrets (history) · REDACTED: gcp-api-key client_side/cute_demo/index.coffee
  • Secrets (history) · REDACTED: REDACTED client_side/cute_demo/libs/nlp.js
  • Secrets (history) · REDACTED: REDACTED client_side/cute_demo/nlp.js
  • Secrets (history) · REDACTED: REDACTED client_side/long_demo/libs/nlp.js
  • Secrets (history) · REDACTED: REDACTED client_side/long_demo/nlp.js
  • Change Coupling · Change-coupling hub: scratch.js → adjectives.js, comparables.js, index.js, misc.js, actors.js, organizations.js, properNouns.js, singulars.js, uncountables.js, units.js, femaleNames.js, lastnames.js, maleNames.js, people.js, cities.js, places.js, adj-gerund.js, adj-noun.js, adj-past.js, noun-verb.js, person-verb.js, infinitives.js, participles.js, phrasals.js, PastTense.js, dates.js, insert.js, insert.js, replace.js, index.js, multi-word.js, single-word.js, lookaround.js, match.js, 02-from-here.js, index.js, _text.js, fromSpec.js, 01-parse.js, index.js, tag.js, setTag.js, tokenize.js, index.js, isPossessive.js, index.js, index.js, 01-case.js, 01-acronym.js, 06-switches.js, _adhoc.js, _fastTag.js, index.js, byTag.js, looksPlural.js, _adj.js, _noun.js, _verb.js, adj-gerund.js, adj-past.js, index.js, frozenLex.js, index.js, misc.js, suffixes.js, regex-normal.js, misc.js, nouns.js, verbs.js, plugin.js, clauses.js, 04-fallback.js, index.js, api.js, api.js, toInfinitive.js, View.js, extend.js, REDACTED, one.js, three.d.ts scratch.js
  • Change Coupling · Change coupling: scratch.js ↔ matches.js plugins/dates/scratch.js
  • Code Duplication · Duplication concentrated across 7 sibling directories (8 clone groups) src/3-three/nouns/api/api.js
  • Code Duplication · Duplication concentrated across 4 sibling directories (7 clone groups) src/1-one/contraction-one/compute/contractions/index.js
  • Code Duplication · Duplicated block with local edits (114 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (97 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (81 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (73 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (69 matched lines × 2 locations) plugins/paragraphs/builds/compromise-paragraphs.cjs
  • Code Duplication · Duplicated block with local edits (56 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (52 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (42 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (39 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (39 matched lines × 2 locations) src/1-one/contraction-one/compute/contractions/index.js
  • Code Duplication · Duplicated block with local edits (35 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (33 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block (33 lines × 2 locations) src/1-one/match/methods/match/steps/and-block.js
  • Code Duplication · Duplicated block with local edits (31 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block (30 lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (30 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block with local edits (26 matched lines × 2 locations) plugins/_experiments/wikipedia/scripts/perf.js
  • Code Duplication · Duplicated block (26 lines × 2 locations) src/1-one/contraction-one/compute/contractions/_splice.js
  • Code Duplication · Duplicated block with local edits (25 matched lines × 2 locations) plugins/stats/builds/compromise-stats.cjs
  • Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) plugins/speed/builds/compromise-speed.browser.cjs
  • Code Duplication · Duplicated block with local edits (23 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block with local edits (22 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block with local edits (22 matched lines × 2 locations) REDACTED
  • Code Duplication · Duplicated block with local edits (22 matched lines × 2 locations) src/3-three/numbers/numbers/api.js
  • Code Duplication · Duplicated block with local edits (21 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
  • Code Duplication · Duplicated block (19 lines × 2 locations) plugins/dates/builds/compromise-dates.cjs
Rebuild cost: about €160,000 · Estimate
Cost to rebuild€52,000 to €260,000, for 866 to 2,747 hours of work, about 1.1 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 47. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 103,103 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

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

Top priorities

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

1
Resolve the 1 Assertions commented out finding(s) in Test Quality — start with topic-selections.test.js.
Raises the score by about 6 points · Low effort · Test Quality
2
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 5 points · Medium effort · Observability
3
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
Raises the score by about 5 points · Medium effort · Security & performance tooling

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 €160,000 to build again, about 1.1 person-years of work. Its weakest lens is Production Readiness, at 37 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Assertions commented out finding(s) in Test Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 Test Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 4.8 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 18% on every change. The history of the code shows how much it changes: about 141,534 lines over the last 90 days, which is about 573,999 lines a year. At that pace, the extra work comes to an estimated 114.3 to 685.6 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

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

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

The table shows the 40 modules with the most connections; 192 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 bin2 bin._lib3 data4 plugins._experiments.ast.src5 plugins._experiments.compress.src6 plugins._experiments.markdown.src7 plugins._experiments.markdown.src.parse8 plugins._experiments.sentiment.src9 plugins._experiments.wikipedia.scripts10 plugins._experiments.wikipedia.scripts.generate11 plugins.dates12 plugins.dates.builds13 plugins.subtitles.builds.compromise-subtitle14 src.API.View15 plugins.dates.builds.compromise-dates16 plugins.dates.src.api.dates17 plugins.dates.src.api.durations18 plugins.dates.src.api.times19 plugins.subtitles.src.SubtitleDoc20 src.2-two.contraction-two.api21 src.3-three.adjectives.plugin22 src.3-three.adverbs.plugin23 src.3-three.chunker.api.api24 src.3-three.coreference.api.pronouns25 src.3-three.misc.acronyms26 src.3-three.misc.parentheses27 src.3-three.misc.possessives28 src.3-three.misc.quotations29 src.3-three.misc.slashes30 src.3-three.nouns.api.api31 src.3-three.numbers.fractions.api32 src.3-three.numbers.numbers.api33 src.3-three.sentences.api34 src.3-three.topics.people.api35 src.3-three.verbs.api.api36 plugins.dates.src.api.parse.one.units._day37 plugins.dates.src.api.parse.one.units._time38 plugins.dates.src.api.parse.one.units._week39 plugins.dates.src.api.parse.one.units._year40 src.3-three.numbers.money.api
1 bin
2 bin._lib
3 data
4 plugins._experiments.ast.src
5 plugins._experiments.compress.src
6 plugins._experiments.markdown.src
7 plugins._experiments.markdown.src.parse
8 plugins._experiments.sentiment.src
9 plugins._experiments.wikipedia.scripts
10 plugins._experiments.wikipedia.scripts.generate
11 plugins.dates
12 plugins.dates.builds
13 plugins.subtitles.builds.compromise-subtitle
14 src.API.View
15 plugins.dates.builds.compromise-dates3
16 plugins.dates.src.api.dates1
17 plugins.dates.src.api.durations1
18 plugins.dates.src.api.times1
19 plugins.subtitles.src.SubtitleDoc1
20 src.2-two.contraction-two.api1
21 src.3-three.adjectives.plugin1
22 src.3-three.adverbs.plugin1
23 src.3-three.chunker.api.api1
24 src.3-three.coreference.api.pronouns1
25 src.3-three.misc.acronyms1
26 src.3-three.misc.parentheses1
27 src.3-three.misc.possessives1
28 src.3-three.misc.quotations1
29 src.3-three.misc.slashes1
30 src.3-three.nouns.api.api1
31 src.3-three.numbers.fractions.api1
32 src.3-three.numbers.numbers.api1
33 src.3-three.sentences.api1
34 src.3-three.topics.people.api1
35 src.3-three.verbs.api.api1
36 plugins.dates.src.api.parse.one.units._day4
37 plugins.dates.src.api.parse.one.units._time3
38 plugins.dates.src.api.parse.one.units._week2
39 plugins.dates.src.api.parse.one.units._year6
40 src.3-three.numbers.money.api1
Uses a module listed above itPart of a loopThe module itself
1 bin2 bin._lib3 data4 plugins._experiments.ast.src5 plugins._experiments.compress.src6 plugins._experiments.markdown.src7 plugins._experiments.markdown.src.parse8 plugins._experiments.sentiment.src9 plugins._experiments.wikipedia.scripts10 plugins._experiments.wikipedia.scripts.generate11 plugins.dates12 plugins.dates.builds13 plugins.subtitles.builds.compromise-subtitle14 src.API.View15 plugins.dates.builds.compromise-dates16 plugins.dates.src.api.dates17 plugins.dates.src.api.durations18 plugins.dates.src.api.times19 plugins.subtitles.src.SubtitleDoc20 src.2-two.contraction-two.api21 src.3-three.adjectives.plugin22 src.3-three.adverbs.plugin23 src.3-three.chunker.api.api24 src.3-three.coreference.api.pronouns25 src.3-three.misc.acronyms26 src.3-three.misc.parentheses27 src.3-three.misc.possessives28 src.3-three.misc.quotations29 src.3-three.misc.slashes30 src.3-three.nouns.api.api31 src.3-three.numbers.fractions.api32 src.3-three.numbers.numbers.api33 src.3-three.sentences.api34 src.3-three.topics.people.api35 src.3-three.verbs.api.api36 plugins.dates.src.api.parse.one.units._day37 plugins.dates.src.api.parse.one.units._time38 plugins.dates.src.api.parse.one.units._week39 plugins.dates.src.api.parse.one.units._year40 src.3-three.numbers.money.apibin1bin._lib2data3plugins._experiments.ast.src4plugins._experiments.compress.src5plugins._experiments.markdown.src6plugins._experiments.markdown.src.parse7plugins._experiments.sentiment.src8plugins._experiments.wikipedia.scripts9plugins._experiments.wikipedia.scripts.generate10plugins.dates11plugins.dates.builds12plugins.subtitles.builds.compromise-subtitle13src.API.View14plugins.dates.builds.compromise-dates15plugins.dates.src.api.dates16plugins.dates.src.api.durations17plugins.dates.src.api.times18plugins.subtitles.src.SubtitleDoc19src.2-two.contraction-two.api20src.3-three.adjectives.plugin21src.3-three.adverbs.plugin22src.3-three.chunker.api.api23src.3-three.coreference.api.pronouns24src.3-three.misc.acronyms25src.3-three.misc.parentheses26src.3-three.misc.possessives27src.3-three.misc.quotations28src.3-three.misc.slashes29src.3-three.nouns.api.api30src.3-three.numbers.fractions.api31src.3-three.numbers.numbers.api32src.3-three.sentences.api33src.3-three.topics.people.api34src.3-three.verbs.api.api35plugins.dates.src.api.parse.one.units._day36plugins.dates.src.api.parse.one.units._time37plugins.dates.src.api.parse.one.units._week38plugins.dates.src.api.parse.one.units._year39src.3-three.numbers.money.api4031111111111111111111143261+192 more modules (most-connected shown)

At a glance — Code Health · 49% · Weak · gated by D1, D2, R1 ·

At a glance — Architecture · 88% · Strong ·

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

At a glance — Readiness · 37% · Weak · gated by R8, P2, P3 ·

At a glance — Security · 48% · Weak · gated by D28 ·

At a glance — Performance · 85% · Strong ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A07:2025 — Authentication Failures22High / Critical
A05:2025 — Injection8High / Critical
A03:2025 — Software Supply Chain Failures6Medium

Roadmap

Top priorities: Resolve the 1 Assertions commented out finding(s) in Test Quality — start with topic-selections.test.js; Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.

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

Do thisHelpsEffortDimension
Resolve the 1 Assertions commented out finding(s) in Test Quality — start with topic-selections.test.js.+6.3 ptsLowTest Quality
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+5.4 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.+5.4 ptsMediumSecurity & performance tooling
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.+4.9 ptsMediumDependency Hygiene
Resolve the 1 `currentNotInHTML` spells `HTML` where 18 names in the project spell it… finding(s) in Naming Consistency — start with REDACTED.+1.0 ptsLowNaming Consistency
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with package.json.+1.3 ptsLowADR Quality
Resolve the 1 finding(s) in Type Safety.+2.5 ptsMediumType Safety
Resolve the 21 REDACTED finding(s) in Secrets (history) — start with REDACTED (2), REDACTED (2), REDACTED.+2.4 ptsMediumSecrets (history)

File quality

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

FileScoreBandWorst signal
REDACTED4.2MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): Medium: REDACTED
plugins/dates/builds/compromise-dates.cjs4.8MixedCyclomatic Complexity: compromise-dates.Ot (cyclomatic 56)
REDACTED5.1MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.4MixedDependency Vulnerabilities: Medium CVE: REDACTED
plugins/subtitles/builds/compromise-subtitle.cjs5.5MixedCyclomatic Complexity: compromise-subtitle.$ (cyclomatic 124)
REDACTED5.7MixedStatic Analysis (SAST): Medium: REDACTED
tests/03-three/topics/topic-selections.test.js6.6MixedTest Quality: Assertions commented out: topics-basic
plugins/subtitles/tests/fromSubtitle.test.js7.0MixedTest Quality: No assertions: returns a wrapped doc
plugins/subtitles/tests/wrap.test.js7.1MixedTest Quality: No assertions: positions count across cues
src/3-three/verbs/api/conjugate/question.js7.2MixedCyclomatic Complexity: question.parseQuestion (cyclomatic 83)
plugins/_experiments/compress/src/lz.js7.2MixedCyclomatic Complexity: _compress (cyclomatic 38)
plugins/stats/builds/compromise-stats.cjs7.2MixedCyclomatic Complexity: compromise-stats.unpack (cyclomatic 18)
plugins/speed/tests/behavior.test.js7.2MixedTest Quality: No assertions: keypress reuses sentences and isolates returned documents
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED
REDACTED7.2MixedSecrets (history): REDACTED: REDACTED

How the grades work

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

Critical — 27

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

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

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

Could not be resolved — 8

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

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 60 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

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

What we checked — 60 dimensions across the health lenses
D1D2D3D5D6D10D12D13D14D15D17D19D20D21D23D24D26D27D28D29D30D34D35D36D43D44AX10AX3AX4GD1IC1M1M2M3M4P1P10P2P3P4P6PF3R1R10R11R2R3R4R6R7R8R9X1X12X16X21X28X29X3X30

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1dda8-60db-7bf7-847e-e187b8686425.

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

Run transparency — what happened this run

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

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.mts, .cts, .js) and the coverage collector does support this ecosystem — it drives jest, vitest and mocha — but the runner its test command uses is one the coverage collector has no executor for (`tape`). Read from the manifests: the root package has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer` and declares `tape`; `plugins/_experiments/ast` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/cmd-k` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/markdown` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/sentiment` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/wikipedia` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/dates` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/html` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/markdown` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/paragraphs` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/payload` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/speech` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`. Not scored — this is a gap in the analyzer's runner coverage, not a missing .mts/.cts/.js runner and not a defect in this repository.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.mts, .cts, .js) and the reliability runner does support this ecosystem — it drives jest, vitest, mocha and egg-bin — but the runner its test command uses is one the re-runner has no executor for (`tape`). Read from the manifests: the root package has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer` and declares `tape`; `plugins/_experiments/ast` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/cmd-k` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/markdown` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/sentiment` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/_experiments/wikipedia` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/dates` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/html` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/markdown` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/paragraphs` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/payload` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`; `plugins/speech` has a `scripts.test` of `tape "./tests/**/*.test.js" | tap-dancer --color always` and declares `tape`. So flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's runner coverage, not a missing .mts/.cts/.js runner and not a finding about this repository.
  • D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (136 contributor(s) across 6604 commit(s) sampled, automation and bot accounts excluded). One of them holds 92% of the history; the other 135 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22'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.
  • D27 Navigability — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Tracing effort is measured over resolved call sites, and all 532 sampled here came from .js files. This repository's .cjs source is a material share of its production lines and contributed none, so the score above is a verdict about the part that was read. Not a finding that the unread half navigates well — it is unmeasured.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `REDACTED`, `REDACTED`, `builds/three/compromise-three.mjs`, `builds/two/compromise-two.mjs`, `plugins/dates/builds/compromise-dates.cjs`, … (+3 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • 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 none applies: this repository publishes a library and deploys nothing (no container, IaC or deployment manifest), so it holds no runtime state of its own. Any data-access dependency it declares is the store it is a CLIENT for, not one it operates. The DR control belongs to whoever runs that data.
  • R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 244 further occurrence(s) are not listed individually; the score already reflects all 284.
  • R2 Cyclomatic Complexity — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 163 further occurrence(s) are not listed individually; the score already reflects all 203.
  • R4 Test Coverage — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 108 further occurrence(s) are not listed individually; the score already reflects all 148.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 809 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled certificate validation, obsolete TLS versions, plaintext password storage and session cookies set without HttpOnly, Secure or SameSite, and none was found. The server controls this dimension also scores were not assessed, so no score is given.
  • X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 1 further occurrence(s) are not listed individually; the score already reflects all 41.
  • X2 Cancellation propagation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Go, PHP, Dart, Kotlin, Ruby, Scala, Java, Python and Rust source only, and no C# was loaded, and no named async function in this repository's JavaScript/TypeScript, nor any Go, PHP or Dart function or Kotlin suspend function, makes a request that can be cancelled (fetch, axios, ky, ofetch, got, undici, node:http; net/http, net.Dial; amphp; Dio; Ktor, OkHttp), so there is nothing to judge, 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Document value interpolated into markup unescaped could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentOutOfRangeException: Index was out of range. Must be non-negative and less than the size of the collection. (Parameter 'index').
  • X4 Structured logging — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, 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 (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • 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 Dockerfile (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.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • 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 Complexity3.1 / 10Weak✓ 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 3.1 / 10 · rule-coverage 100% · ceiling Prevented

248 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was isPossessive.isPossessive at 129. A further 32 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 compromise-html.startTagInBody at 109 — they are counted neither in the figure above nor in this dimension's score.

compromise-markdown.compiler::prepareList (cyclomatic 44) · ×2REDACTED:11432
compromise-markdown.tokenizeHtmlFlow::tagName (cyclomatic 17) · ×2REDACTED:7372
isPossessive.isPossessive (cyclomatic 129)src/2-two/contraction-two/compute/isPossessive.js:42
compromise-subtitle.$ (cyclomatic 124)plugins/subtitles/builds/compromise-subtitle.cjs:9
question.parseQuestion (cyclomatic 83)src/3-three/verbs/api/conjugate/question.js:62

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

What to do

  1. Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with isPossessive.isPossessive (cyclomatic 129), compromise-subtitle.$ (cyclomatic 124), question.parseQuestion (cyclomatic 83). — 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 5 together lifts Cyclomatic Complexity from 3.1 to about 4.8/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

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

300 method(s) exceeded the cognitive complexity threshold of 15; the worst was _compress at 150.

parseTime (cognitive 80) · ×2plugins/dates/builds/compromise-dates.cjs:433
compiler::prepareList (cognitive 67) · ×2REDACTED:11432
parseShift (cognitive 48) · ×2plugins/dates/builds/compromise-dates.cjs:183
shiftRange (cognitive 28) · ×2plugins/dates/builds/compromise-dates.cjs:4223
pickBoundaries (cognitive 26) · ×2REDACTED:322

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

What to do

  1. Bring the 19 bodies over 60 down to 60 or less in Cognitive Complexity — start with _compress (cognitive 150), isPossessive (cognitive 147), compromise-subtitle.$ (cognitive 126). — 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 19 together lifts Cognitive Complexity from 2.0 to about 4.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes9.6 / 10Stronggated by 11 serious findings✓ 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 9.6 / 10 · rule-coverage 100% · ceiling Prevented

11 god class(es) detected.

FunctionTooLong: 05-explicit.parseExplicit · ×5plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15
FileTooLong: REDACTED · ×3REDACTED
TooManyMethods: Tokenizer · ×3REDACTED:3779

What to do

  1. Resolve the 5 FunctionTooLong finding(s) in God Classes — start with 05-explicit.js, 02-parseToken.js, isPossessive.js. — One of this dimension's main actionable groups (5 warning-level).
  2. Resolve the 3 FileTooLong finding(s) in God Classes — start with REDACTED, REDACTED, compromise-dates.cjs. — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 3 TooManyMethods finding(s) in God Classes — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.4 / 10Stronggated by 2 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.4 / 10 · rule-coverage 100% · ceiling Verified

2 of 39 classes have LCOM4 above 3.

Low cohesion: WrapDoc (LCOM4 5) · ×2plugins/subtitles/builds/compromise-subtitle.cjs:127

What to do

  1. Resolve the 2 Low cohesion finding(s) in Cohesion (LCOM4) — start with compromise-subtitle.cjs, WrapDoc.js. — One of this dimension's main actionable groups (2 warning-level).

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

D10 · Test Quality9.7 / 10Adequategated by 1 critical finding✓ Tool-verified

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

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

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

1 skipped, 1659 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 2035 tests (7 harness-style project(s) excluded from the assertion penalty).

Assertions commented out: topics-basictests/03-three/topics/topic-selections.test.js:39
No assertions: returns a wrapped doc · ×40plugins/subtitles/tests/fromSubtitle.test.js:36
Skipped test: (unnamed test)tests/03-three/coreference/antecedent-boundaries.test.js:51
Test project verifies nothing: plugins/_experiments/wikipediaplugins/_experiments/wikipedia/tests/misc.test.js:5
No direct assertions: abbreviations · ×1618tests/_ignored/abbreviations.ignore.js:5

What to do

  1. Resolve the 1 Assertions commented out finding(s) in Test Quality — start with topic-selections.test.js. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 40 No assertions finding(s) in Test Quality — start with fromSubtitle.test.js (11), wrap.test.js (5), behavior.test.js (4). — One of this dimension's main actionable groups (40 warning-level).
  3. Resolve the 1 Skipped test finding(s) in Test Quality — start with antecedent-boundaries.test.js. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

3 outdated direct production npm dependency(ies) of 15 graded, 0 pinning defect(s), across 15 package.json (15 of them the product) and 1 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 0 direct dependency(ies) — production, development or optional — are marked DEPRECATED by their publisher (the registry's per-version mark, or the lockfile's copy of it when the registry could not be asked); deprecated transitive packages are listed but not charged. Whether any is UNMAINTAINED is not graded — the registry publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, and the frontend dependency lens (R8) answers it in this same run. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Deprecated: glob · ×2REDACTED:1456
Outdated (npm): hast-util-from-html · ×3

✓ On the Gold path — maintain.

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

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

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

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

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

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License 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 124 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 124 package(s) this repository's committed lockfile installs for a consumer — its 15 production, optional and peer dependency(ies), across 15 product package.json manifest(s), and everything those install in turn. Its 101 `devDependencies` declaration(s), and every package only they reach, are excluded: a consumer installs none of them. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. This repository publishes itself under MIT, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.8 / 10Stronggated by 51 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.8 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/2-two/contraction-two/compute/isPossessive.js (15×129=1935); src/3-three/verbs/api/conjugate/question.js (11×83=913); src/2-two/postTagger/compute/local-corrections.js (9×72=648) Repeated repair below the complexity floor: plugins/dates/src/api/parse/range/02-date-range.js (4 of 7 changes were fixes); src/3-three/verbs/find.js (3 of 5 changes were fixes); plugins/paragraphs/src/api.js (3 of 3 changes were fixes)

Hotspot: src/2-two/contraction-two/compute/isPossessive.js · ×48src/2-two/contraction-two/compute/isPossessive.js:42
Repeated repair: plugins/dates/src/api/parse/range/02-date-range.js · ×3plugins/dates/src/api/parse/range/02-date-range.js:9

What to do

  1. Resolve the 48 Hotspot finding(s) in Churn × Complexity Hotspots — start with index.js (7), 01-walk.js (2), isPossessive.js. — One of this dimension's main actionable groups (48 warning-level).
  2. Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with 02-date-range.js, find.js, api.js. — One of this dimension's main actionable groups (3 warning-level).

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

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

D19 · Documentation Quality9.1 / 10Exemplary✓ Tool-verified

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

1 of 2 documentation facets pass in full; short on: F2 example. 31 document(s) read across 21 unit(s).

Documentation: no build, run or usage example · ×3plugins/_experiments/ast/README.md:1

✓ On the Gold path — maintain.

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

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

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

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

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

No architecture decision records were found.

No ADRs foundpackage.json:80

What to do

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

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

D21 · Naming Consistency4.7 / 10Weak✓ Tool-verified

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

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

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

1 naming inconsistencies among 19 declarations measured against a convention their peers follow.

`currentNotInHTML` spells `HTML` where 18 names in the project spell it `Html`REDACTED:7367

What to do

  1. Resolve the 1 `currentNotInHTML` spells `HTML` where 18 names in the project spell it… finding(s) in Naming Consistency — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).

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

D23 · Boundary Type-Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.

Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.

Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.

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

No domain types leak across context boundaries (10 contexts). Contexts: dates, html, markdown, paragraphs, payload, speech, speed, stats, subtitles, unist.

✓ On the Gold path — maintain.

Detailed fixes: d23_recommendation.md.

D24 · Comment Value9.5 9.1 / 10Exemplary✓ Tool-verified

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

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

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

17 of 3562 judged comments only repeat the code they sit on (0.5 %). 405 comment(s) in another language or script were not judged.

redundant comment · ×13plugins/dates/builds/compromise-dates.cjs:2954
doc comments repeat the names · ×4src/1-one/match/methods/termMethods.js:19

✓ On the Gold path — maintain.

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

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

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

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

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

2 of 16 build units (npm) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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

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

D27 · Navigability10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

33 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated. Measured over the .js source only — this repository's .cjs was not sampled for call sites, so this score covers part of the tree, not all of it.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)0.0 / 10Critical✓ Tool-verified

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

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

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

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

REDACTED
REDACTED

What to do

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

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

D29 · Static Analysis (SAST)4.1 / 10Weak✓ 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 4.1 / 10 · rule-coverage 100% · ceiling Documented

8 finding(s): 0 critical, 4 high, 4 medium, 0 low. semgrep hit a parse error in 16 file(s) — `REDACTED`, `builds/one/compromise-one.cjs`, `builds/one/compromise-one.mjs`, `REDACTED`, `builds/three/compromise-three.mjs`, … (+11 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.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

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

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

D30 · Dependency Vulnerabilities9.6 / 10Stronggated by 2 serious findings✓ Tool-verified

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

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

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

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

REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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

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

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

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 126 of the 793 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

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

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

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

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

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

Strongest change-coupling: scratch.js↔_noun.js 100%; scratch.js↔_verb.js 100%; scratch.js↔insert.js 100%

Change coupling: compromise-dates.cjs ↔ _version.js · ×2plugins/dates/builds/compromise-dates.cjs:1
Change-coupling hub: scratch.js → adjectives.js, comparables.js, index.js, misc.js, adverbs.js, conjunctions.js, actors.js, organizations.js, properNouns.js, singulars.js, uncountables.js, units.js, femaleNames.js, lastnames.js, maleNames.js, people.js, cities.js, places.js, adj-gerund.js, adj-noun.js, adj-past.js, noun-verb.js, person-verb.js, infinitives.js, participles.js, phrasals.js, PastTense.js, dates.js, insert.js, insert.js, replace.js, index.js, multi-word.js, single-word.js, lookaround.js, match.js, 02-from-here.js, index.js, _text.js, out.js, fromSpec.js, 01-parse.js, index.js, tag.js, setTag.js, tokenize.js, apostrophe-s.js, index.js, isPossessive.js, index.js, 01-case.js, 05-year.js, 01-acronym.js, 06-switches.js, _adhoc.js, _fastTag.js, index.js, byTag.js, looksPlural.js, _adj.js, _noun.js, _verb.js, adj-gerund.js, adj-past.js, index.js, frozenLex.js, index.js, misc.js, suffixes.js, regex-normal.js, regex-text.js, misc.js, nouns.js, verbs.js, plugin.js, clauses.js, 04-fallback.js, index.js, api.js, api.js, toInfinitive.js, View.js, extend.js, REDACTED, one.js, three.d.tsscratch.js

What to do

  1. Resolve the 2 Change coupling finding(s) in Change Coupling — start with compromise-dates.cjs, scratch.js. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with scratch.js. — One of this dimension's main actionable groups (1 warning-level).

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

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

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

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

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

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

REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition6.9 / 10Adequate✓ Tool-verified

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

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

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

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

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

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unreviewed-generation residue in this repository's JavaScript/TypeScript: functions whose whole body still throws a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings and JSX of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

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

IC1 · Incompleteness & stubs10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's JavaScript/TypeScript: functions that only throw a "not implemented" error, functions that take inputs and return a constant or do nothing, async functions that never await, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

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

  • A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead. (×2) — plugins/_experiments/compress/src/lz.js:1, plugins/_experiments/markdown/scratch.js:1
  • A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. — tests/03-three/coreference/antecedent-boundaries.test.js:51

What to do

  • Clear the softer debt: re-enable or delete skipped tests, decide whether each empty function is a deliberate no-op (and say so in a comment), and replace blanket `eslint-disable` / `@ts-nocheck` with targeted, justified suppressions.
M1 · Documentation (README)9.6 / 10Exemplary✓ Tool-verified

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

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

M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

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

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

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

What to do

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

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

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

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

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

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

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

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

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

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

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

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

P2 · Observability0.0 / 10Critical✓ 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.

  • No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.

What to do

  • Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — .github/workflows/build-and-test.yml:4
  • `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — package.json:130

What to do

  • Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & 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.

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.

PF3 · Async & latency hygiene8.5 / 10Strong✓ Tool-verified

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

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

  • `execFileSync` in `getIt` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — plugins/_experiments/wikipedia/scripts/generate/01-download.js:29

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety0.1 / 10Critical✓ Tool-verified

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

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

  • 8 typed · 1398 plain JS — the untyped files are data/lexicon/adjectives/adjectives.js, data/lexicon/adjectives/comparables.js, data/lexicon/dates/dates.js, data/lexicon/dates/durations.js, data/lexicon/dates/months.js, data/lexicon/dates/timezones.js (+1392 more).
R10 · Code Duplication4.2 / 10Weak✓ Tool-verified

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

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

  • 41 duplicated blocks under plugins/dates/ have copies in at least two of the sibling directories builds, src — 33 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 41 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 41 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 41 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — plugins/dates/builds/compromise-dates.cjs:3309
  • 26 duplicated blocks under plugins/ have copies in at least two of the sibling directories _experiments, dates, html, markdown, paragraphs, payload (+5 more sibling(s) not listed) — 25 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 26 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 26 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 26 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:15777
  • 11 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/speed/. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:207
  • 9 duplicated blocks under plugins/markdown/ have copies in at least two of the sibling directories builds, src — 7 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:22467
  • 9 duplicated blocks under plugins/unist/ have copies in at least two of the sibling directories builds, src — 6 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — plugins/unist/builds/compromise-unist.cjs:54
  • 8 of the duplicated blocks reported below have copies in at least two of the sibling directories bin, plugins, scripts, src under the repository root. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — bin/_lib/sentences.js:8
  • 8 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/speech/. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:152
  • 5 duplicated blocks under plugins/html/ have copies in at least two of the sibling directories builds, src — 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:16340
  • 5 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/stats/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — plugins/stats/builds/compromise-stats.cjs:957
  • plugins/dates/builds/compromise-dates.cjs:3309 · plugins/dates/src/api/parse/range/02-date-range.js:44 — the two spans are one implementation copied and then locally edited — 2275 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:3309
  • plugins/dates/builds/compromise-dates.cjs:672 · plugins/dates/src/model/words/timezones.js:15 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — plugins/dates/builds/compromise-dates.cjs:672
  • plugins/subtitles/builds/compromise-subtitle.cjs:111 · plugins/subtitles/src/WrapDoc.js:21 — the two spans are one implementation copied and then locally edited — 945 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/subtitles/builds/compromise-subtitle.cjs:111
  • REDACTED:4824 · REDACTED:4972 — the two spans are one implementation copied and then locally edited — 511 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:4824
  • REDACTED:152 · REDACTED:12 — the two spans are one implementation copied and then locally edited — 699 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:152
  • plugins/dates/builds/compromise-dates.cjs:134 · plugins/dates/src/api/parse/one/01-tokenize/01-shift.js:1 — the two spans are one implementation copied and then locally edited — 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:134
  • REDACTED:459 · plugins/speech/src/sounds-like/transformations.js:2 — the two spans are one implementation copied and then locally edited — 490 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:459
  • plugins/dates/builds/compromise-dates.cjs:2642 · plugins/dates/src/api/parse/one/03-transform/addCounter.js:3 — the two spans are one implementation copied and then locally edited — 515 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:2642
  • REDACTED:15777 · REDACTED:13355 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:15777
  • plugins/dates/builds/compromise-dates.cjs:4501 · plugins/dates/src/api/durations/parse.js:1 — the two spans are one implementation copied and then locally edited — 494 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:4501
  • REDACTED:16391 · REDACTED:22383 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:16391
  • plugins/paragraphs/builds/compromise-paragraphs.cjs:40 · plugins/paragraphs/src/api.js:33 — the two spans are one implementation copied and then locally edited — 416 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/paragraphs/builds/compromise-paragraphs.cjs:40
  • REDACTED:13830 · REDACTED:14157 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:13830
  • REDACTED:44 · plugins/speech/src/syllables/split/find-cuts/00-exceptions.js:3 — the two spans are one implementation copied and then locally edited — 458 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:44
  • plugins/speed/builds/compromise-speed.browser.cjs:87 · REDACTED:328 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — plugins/speed/builds/compromise-speed.browser.cjs:87
  • plugins/_experiments/compress/src/lz.js:101 · plugins/_experiments/compress/src/lz.js:186 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/_experiments/compress/src/lz.js:101
  • plugins/html/src/update-tree/index.js:3 · plugins/markdown/src/update-tree/index.js:3 — the two spans are one implementation copied and then locally edited — 499 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/html/src/update-tree/index.js:3
  • plugins/payload/builds/compromise-payload.cjs:24 · plugins/payload/src/plugin.js:6 — the two spans are one implementation copied and then locally edited — 551 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/payload/builds/compromise-payload.cjs:24
  • REDACTED:22467 · plugins/markdown/src/update-tree/index.js:16 — the two spans are one implementation copied and then locally edited — 443 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:22467
  • plugins/dates/builds/compromise-dates.cjs:3999 · plugins/dates/src/api/normalize.js:2 — the two spans are one implementation copied and then locally edited — 442 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:3999
  • plugins/dates/builds/compromise-dates.cjs:281 · plugins/dates/src/api/parse/one/01-tokenize/02-counter.js:9 — the two spans are one implementation copied and then locally edited — 340 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:281
  • REDACTED:16474 · REDACTED:22467 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:16474
  • plugins/dates/builds/compromise-dates.cjs:4227 · plugins/dates/src/api/arithmetic/index.js:11 — the two spans are one implementation copied and then locally edited — 572 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:4227
  • plugins/dates/builds/compromise-dates.cjs:3921 · plugins/dates/src/api/parse/range/index.js:10 — the two spans are one implementation copied and then locally edited — 362 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:3921
  • plugins/dates/builds/compromise-dates.cjs:938 · plugins/dates/src/api/parse/one/01-tokenize/06-timezone.js:8 — the two spans are one implementation copied and then locally edited — 321 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:938
  • REDACTED:15100 · REDACTED:12467 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:15100
  • REDACTED:16533 · REDACTED:22532 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:16533
  • plugins/unist/builds/compromise-unist.cjs:54 · plugins/unist/src/toAst/02-terms.js:7 — the two spans are one implementation copied and then locally edited — 328 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/unist/builds/compromise-unist.cjs:54
  • plugins/dates/builds/compromise-dates.cjs:4170 · plugins/dates/src/api/arithmetic/_lib.js:20 — the two spans are one implementation copied and then locally edited — 426 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/dates/builds/compromise-dates.cjs:4170
  • plugins/html/src/read-tree/02-connect.js:1 · plugins/markdown/src/read-tree/02-connect.js:1 — the two spans are one implementation copied and then locally edited — 341 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/html/src/read-tree/02-connect.js:1
  • REDACTED:307 · plugins/speech/src/syllables/split/find-cuts/02-boundaries.js:15 — the two spans are one implementation copied and then locally edited — 448 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:307

What to do

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

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

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

  • plugins/_experiments/wikipedia/scratch.js:2 reaches into another package with a relative path (../../src/one.js) — import the package by name instead. — plugins/_experiments/wikipedia/scratch.js:2
  • plugins/_experiments/wikipedia/scripts/generate/02-filter.js:5 reaches into another package with a relative path (../../../../src/two.js) — import the package by name instead. — plugins/_experiments/wikipedia/scripts/generate/02-filter.js:5
  • plugins/_experiments/wikipedia/scripts/perf.js:3 reaches into another package with a relative path (../../../src/one.js) — import the package by name instead. — plugins/_experiments/wikipedia/scripts/perf.js:3
  • plugins/_experiments/wikipedia/src/plugin.js:2 reaches into another package with a relative path (./_model.js) — import the package by name instead. — plugins/_experiments/wikipedia/src/plugin.js:2

What to do

  • Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
R2 · Cyclomatic Complexity6.0 / 10Adequate✓ Tool-verified

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

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

  • isPossessive has cyclomatic complexity 116 and cognitive complexity 132; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/2-two/contraction-two/compute/isPossessive.js:42
  • parseQuestion has cyclomatic complexity 79 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/verbs/api/conjugate/question.js:62
  • (anonymous) has cyclomatic complexity 68 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/2-two/postTagger/compute/local-corrections.js:26
  • safe has cyclomatic complexity 53 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:16191
  • parseTime has cyclomatic complexity 51 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — plugins/dates/builds/compromise-dates.cjs:433, plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69
  • Ot has cyclomatic complexity 46 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/dates/builds/compromise-dates.cjs:341
  • doesMatch has cyclomatic complexity 45 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/match/methods/match/term/doesMatch.js:7
  • prepareList has cyclomatic complexity 44 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:11432
  • parseToken has cyclomatic complexity 43 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/match/methods/parseMatch/02-parseToken.js:36
  • parse has cyclomatic complexity 43 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/numbers/numbers/parse/toNumber/index.js:24
  • parseExplicit has cyclomatic complexity 43 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — plugins/dates/builds/compromise-dates.cjs:2422, plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15
  • markdownTable has cyclomatic complexity 42 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:20500
  • plan has cyclomatic complexity 41 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/verbs/api/conjugate/auxiliary.js:9
  • _compress has cyclomatic complexity 38 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/_experiments/compress/src/lz.js:75
  • isOrHas has cyclomatic complexity 38 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/2-two/contraction-two/compute/apostrophe-s.js:19
  • normalizePunctuation has cyclomatic complexity 34 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/tokenize/methods/03-whitespace/tokenize.js:28
  • _decompress has cyclomatic complexity 32 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/_experiments/compress/src/lz.js:298
  • resolveTable has cyclomatic complexity 32 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:18987
  • (anonymous) has cyclomatic complexity 32 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/subtitles/builds/compromise-subtitle.cjs:9
  • constructor has cyclomatic complexity 32 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:10723
  • parseArgs has cyclomatic complexity 31 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — bin/_lib/args.js:42
  • ambigDate has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/2-two/preTagger/compute/tagger/3rd-pass/10-ambig-date.js:26
  • shiftRange has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — plugins/dates/builds/compromise-dates.cjs:4223, plugins/dates/src/api/arithmetic/index.js:7
  • (anonymous) has cyclomatic complexity 29 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/output/fromSpec.js:13
  • list has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:14423
  • serializeAttribute has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:14388
  • (anonymous) has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/verbs/api/conjugate/groups.js:14
  • basicSplit has cyclomatic complexity 26 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/tokenize/methods/01-sentences/01-simple-split.js:12
  • pair has cyclomatic complexity 26 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:15640
  • parseNumber has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/numbers/numbers/parse/index.js:51
  • question has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/3-three/verbs/api/conjugate/question.js:263
  • (anonymous) has cyclomatic complexity 25 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/1-one/output/api/_text.js:20
  • subtokenize has cyclomatic complexity 24 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:5603
  • resolveAllAttention has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:3625
  • visitor has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:16006
  • imperative has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js:15
  • toHtml has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:14646
R3 · Large Files8.8 / 10Strong✓ Tool-verified

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

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

  • REDACTED has 20900 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • REDACTED has 15884 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • plugins/dates/builds/compromise-dates.cjs has 5372 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/dates/builds/compromise-dates.cjs:1
  • src/2-two/postTagger/model/index.js has 1167 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/2-two/postTagger/model/index.js:1
  • plugins/stats/builds/compromise-stats.cjs has 979 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/stats/builds/compromise-stats.cjs:1
  • REDACTED has 559 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • plugins/dates/src/api/parse/range/02-date-range.js has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/dates/src/api/parse/range/02-date-range.js:1
  • src/2-two/left-right/model/by-word.js has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/2-two/left-right/model/by-word.js:1
  • plugins/_experiments/compress/src/lz.js has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/_experiments/compress/src/lz.js:1

What to do

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

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

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

  • scripts/test/smoke.test.js:12 imports './.mjs', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — scripts/test/smoke.test.js:12
  • tests/_hmm/run.js:7 imports '../../plugins/dates/tests/_hmm/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing. — tests/_hmm/run.js:7
  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×38) — REDACTED:1, REDACTED:1, plugins/dates/builds/compromise-dates.cjs:1, …

What to do

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

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

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

  • This repository declares test tooling, and the ✓ above records that declaration — but scripts/test/smoke.test.js and 1 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to. — scripts/test/smoke.test.js:12
R7 · Dead Code9.6 / 10Exemplary✓ Tool-verified

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

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

  • Unreachable from the 137 application, 36 tooling and 598 test entry point(s) detected in this repo. Gate removals on `pnpm run build` — an undetected custom entry would make these reachable.
  • no import path from any entry point (137 application, 36 tooling, 598 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (plugins/_experiments/compress/src/index.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — plugins/_experiments/compress/src/lz.js
  • no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×15) — plugins/_experiments/sentiment/test.js, scripts/typescript/one.ts, scripts/typescript/three.ts, …
  • This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×2) — plugins/dates/scratch.js:9, plugins/unist/tests/types/api.cts:26

What to do

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

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

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

  • Imported but not declared in any reachable package.json — installs work only by hoisting accident. — plugins/_experiments/markdown/src/parse/index.js:1
  • Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json. (×3) — REDACTED:19419, REDACTED:19420, REDACTED:19421
  • Declared in plugins/_experiments/markdown/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.

What to do

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

X3 · Exception handling10.0 / 10Exemplary○ Nothing flagged

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

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

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.

Reference — by lens

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

LensScoreRatingImpact
Code Health49%Weak — gated by D1, D2, R1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture88%StrongStrongest area.
Maturity73%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness37%Weak — gated by R8, P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security48%Weak — gated by D28Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance85%StrongSolid.
Unscored — 2 check(s) recorded observations but carry no score

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

  • SC1 Supply-chain hygiene — 5 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 40 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 — 65 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.
  • AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — Not applicable: 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
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no data at rest for these controls to protect. If it does persist personal data (through a hosted backend configured outside this repository, for instance), the controls belong to wherever that data is stored.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server (no Express, Fastify, Koa, Hono, NestJS or similar app, no Next.js/SvelteKit/Nuxt server route, no edge function), creates no Supabase tables and talks to no hosted backend. Access control is therefore N/A here — a browser application or library is authorized by the server it calls, not by itself; a client-side route guard hides a page and authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend 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, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound. If it does (through a hosted backend configured outside this repository, for instance), the limit belongs wherever that data is stored.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a TypeORM/MikroORM/sequelize-typescript/NestJS-Mongoose entity, a Mongoose schema, a Sequelize or Drizzle table, a Knex migration or a Prisma model — and no database or data-store client in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over. If it does (through a hosted backend configured outside this repository, for instance), the rights are served wherever that data is stored.
  • D11 Test Reliability — Test reliability not included — no executor for the `tape` test runner
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • 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.
  • D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript surface was not measured.
  • D25 ADR Conformance — no ADRs to check
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 8 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • 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.
  • D4 Code Duplication — This repository's production source (.cjs, .js, .ts) is not read by D4's token comparison, which compares .NET source: duplication in it is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream. Not scored here — read the R10 card for this repository's duplication.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not measured — no executor for the `tape` test runner
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • 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'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for tinybench, mitata, benchmark.js, benny or vitest `bench(...)` calls in files that import them (or `*.bench.*` files), or one of those in a package.json, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R5 Dependency Freshness — uses a pnpm lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • S1 Web-Security Posture — Not assessed: 809 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation, obsolete TLS versions, passwords stored or checked as plaintext and session cookies set without HttpOnly, Secure or SameSite, and none was found. That half of the dimension is clean, but it is not scored on its own: a C# repository with the same clean reading is scored on its server controls as well, or is N/A for having no web surface, and neither can be decided here. Of the server controls, two are read where the source shows them: every session or sign-in cookie the code sets is read for HttpOnly, Secure and SameSite at the line that sets it (a raw `Set-Cookie` header, Express, Fastify, Hono, Koa, Next.js, `cookie.serialize`, express-session and cookie-session), and every Node listener for HTTPS enforcement. HSTS, security response headers and input validation are NOT assessed for JavaScript/TypeScript: each is scored as an absence, an absence is only reportable over the production HTTP server, and in this ecosystem the file that opens the port is build output or a framework launcher rather than a file in the source tree. Their absence here is not a finding about this repository.
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — Document value interpolated into markup unescaped could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — Not applicable: 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. 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.
  • X27 Collection changed while being enumerated — Not applicable: this check looks for a loop whose body adds to or removes from the very collection the loop is walking, invalidating the enumerator it holds, and in this repository's languages that cannot happen. JavaScript and TypeScript have no iterator that a change can invalidate: an `Array` is walked by index against its live length, and a `Map` or `Set` by the ECMAScript specification's live entry list, so a body that adds to, removes from or empties what it walks raises nothing — every loop form (`for…of`, `for…in`, `forEach`, `map`, `filter`, `reduce`, `entries()`) on every built-in collection (`Array`, `Map`, `Set`, plain objects, `URLSearchParams`, `Headers`, `FormData`) runs to completion. Such a loop can still skip an element or never end, which is a different defect and not the one this check asks about. Not a gap in the analyzer and not a finding about your code.
  • 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 — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X5 Nullable reference types — Not applicable: this check asks whether the null-typed discipline a language offers is switched on, and how much of that the assertion operator takes back, and in this repository's languages there is no such switch and no such operator. Plain JavaScript carries no type annotations and commits no tsconfig, so it states no null-typed discipline for this check to grade: there is nothing here that switches null checking on or off, and TypeScript (or `// @ts-check`) is how a repository acquires one — advice, not a defect this card measures. Not a gap in the analyzer and not a finding about your code.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — 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 — 27 finding(s)
D28 · Secrets (history) · REDACTED · ×21
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D10 · Test Quality · Assertions commented out · ×1
  • Assertions commented out: topics-basic tests/03-three/topics/topic-selections.test.js:39 — The test body contains commented-out assertion calls and no live one — it runs, verifies nothing, and still passes. Restore the assertions or delete the test; a green test that checks nothing is worse than an absent one.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
R8 · Dependency Hygiene · Unlisted import 'mdast-util-from-markdown' · ×1
  • Unlisted import 'mdast-util-from-markdown' plugins/_experiments/markdown/src/parse/index.js:1 — Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Serious — 609 finding(s)
D15 · Churn × Complexity Hotspots · Hotspot · ×48
  • Hotspot: src/2-two/contraction-two/compute/isPossessive.js src/2-two/contraction-two/compute/isPossessive.js:42 — src/2-two/contraction-two/compute/isPossessive.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in isPossessive.isPossessive at line 42. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/contraction-two/compute/isPossessive.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/verbs/api/conjugate/question.js src/3-three/verbs/api/conjugate/question.js:62 — src/3-three/verbs/api/conjugate/question.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in question.parseQuestion at line 62. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/verbs/api/conjugate/question.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/postTagger/compute/local-corrections.js src/2-two/postTagger/compute/local-corrections.js:14 — src/2-two/postTagger/compute/local-corrections.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in local-corrections.localCorrections at line 14. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/postTagger/compute/local-corrections.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/match/methods/parseMatch/02-parseToken.js src/1-one/match/methods/parseMatch/02-parseToken.js:36 — src/1-one/match/methods/parseMatch/02-parseToken.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in 02-parseToken.parseToken at line 36. 4 of those changes were fix/bug commits, and the other 6 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/match/methods/parseMatch/02-parseToken.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/contraction-two/compute/apostrophe-s.js src/2-two/contraction-two/compute/apostrophe-s.js:19 — src/2-two/contraction-two/compute/apostrophe-s.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in apostrophe-s.isOrHas at line 19. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/contraction-two/compute/apostrophe-s.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/output/fromSpec.js src/1-one/output/fromSpec.js:6 — src/1-one/output/fromSpec.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in fromSpec.fromSpec at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/output/fromSpec.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/dates/builds/compromise-dates.cjs plugins/dates/builds/compromise-dates.cjs:433 — plugins/dates/builds/compromise-dates.cjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in compromise-dates.parseTime at line 433. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- plugins/dates/builds/compromise-dates.cjs`: 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: plugins/dates/src/api/parse/one/01-tokenize/03-time.js plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69 — plugins/dates/src/api/parse/one/01-tokenize/03-time.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in 03-time.parseTime at line 69. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- plugins/dates/src/api/parse/one/01-tokenize/03-time.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js:40 — src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _adhoc.isQuestionVerb at line 40. 4 of those changes were fix/bug commits, and the other 11 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/verbs/api/conjugate/auxiliary.js src/3-three/verbs/api/conjugate/auxiliary.js:9 — src/3-three/verbs/api/conjugate/auxiliary.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in auxiliary.plan at line 9. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/verbs/api/conjugate/auxiliary.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/numbers/numbers/parse/index.js src/3-three/numbers/numbers/parse/index.js:51 — src/3-three/numbers/numbers/parse/index.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in index.parseNumber at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/numbers/numbers/parse/index.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js:68 — src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in 06-switches.doSwitches at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/numbers/numbers/parse/toNumber/index.js src/3-three/numbers/numbers/parse/toNumber/index.js:24 — src/3-three/numbers/numbers/parse/toNumber/index.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in index.parse at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/numbers/numbers/parse/toNumber/index.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/tokenize/methods/03-whitespace/tokenize.js src/1-one/tokenize/methods/03-whitespace/tokenize.js:28 — src/1-one/tokenize/methods/03-whitespace/tokenize.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in tokenize.normalizePunctuation at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/tokenize/methods/03-whitespace/tokenize.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js:22 — src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in 01-case.checkCase at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/verbs/api/conjugate/coordinate.js src/3-three/verbs/api/conjugate/coordinate.js:9 — src/3-three/verbs/api/conjugate/coordinate.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in coordinate.resultTense at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/verbs/api/conjugate/coordinate.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/output/api/_text.js src/1-one/output/api/_text.js:18 — src/1-one/output/api/_text.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _text.textFromTerms at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/output/api/_text.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/contraction-one/compute/contractions/index.js src/1-one/contraction-one/compute/contractions/index.js:84 — src/1-one/contraction-one/compute/contractions/index.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in index.contractions at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/contraction-one/compute/contractions/index.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/match/methods/match/index.js src/1-one/match/methods/match/index.js:29 — src/1-one/match/methods/match/index.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in index.runMatch at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/match/methods/match/index.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/tag/methods/setTag.js src/1-one/tag/methods/setTag.js:12 — src/1-one/tag/methods/setTag.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in setTag.tagTerm at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/tag/methods/setTag.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js:15 — src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in 08-imperative.imperative at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: bin/_lib/args.js bin/_lib/args.js:42 — bin/_lib/args.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in args.parseArgs at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- bin/_lib/args.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/3-three/verbs/api/conjugate/groups.js src/3-three/verbs/api/conjugate/groups.js:9 — src/3-three/verbs/api/conjugate/groups.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in groups.groups at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/verbs/api/conjugate/groups.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js:66 — src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in 05-year.tagYear at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: src/1-one/match/methods/match/term/doesMatch.js src/1-one/match/methods/match/term/doesMatch.js:7 — src/1-one/match/methods/match/term/doesMatch.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in doesMatch.doesMatch at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/1-one/match/methods/match/term/doesMatch.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • + 23 more in this group — see findings.md.
D10 · Test Quality · No assertions · ×40
  • No assertions: returns a wrapped doc plugins/subtitles/tests/fromSubtitle.test.js:36 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: cue data lines up with each doc plugins/subtitles/tests/fromSubtitle.test.js:47 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: unchanged output is the same as vttpeg plugins/subtitles/tests/fromSubtitle.test.js:61 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: samples from the vttpeg readme plugins/subtitles/tests/fromSubtitle.test.js:93 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: wrapped lines are one text plugins/subtitles/tests/fromSubtitle.test.js:121 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: broadcast speaker marks are not words plugins/subtitles/tests/fromSubtitle.test.js:139 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: changes are written to the file plugins/subtitles/tests/fromSubtitle.test.js:169 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: options go to vttpeg plugins/subtitles/tests/fromSubtitle.test.js:198 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: clones write their own text plugins/subtitles/tests/fromSubtitle.test.js:224 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: files with no cues plugins/subtitles/tests/fromSubtitle.test.js:234 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: cleaning up a file first, with vttpeg plugins/subtitles/tests/fromSubtitle.test.js:246 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: positions count across cues plugins/subtitles/tests/wrap.test.js:38 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: subclass methods and late plugins plugins/subtitles/tests/wrap.test.js:131 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: concat goes on the last cue plugins/subtitles/tests/wrap.test.js:185 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: a WrapDoc can be a param plugins/subtitles/tests/wrap.test.js:196 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: clone leaves the original plugins/subtitles/tests/wrap.test.js:206 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: keypress reuses sentences and isolates returned documents plugins/speed/tests/behavior.test.js:10 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: keypress invalidates lexical settings and keeps duplicate sentences independent plugins/speed/tests/behavior.test.js:32 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: lazy parsing agrees with ordinary matching plugins/speed/tests/behavior.test.js:49 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: worker pools can close pending jobs and reopen plugins/speed/tests/behavior.test.js:182 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: browser condition selects browser methods automatically plugins/speed/tests/browser.test.js:35 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: standalone browser build runs without Node globals plugins/speed/tests/browser.test.js:65 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: keypress resets, evicts, and reorders cached sentences plugins/speed/tests/keypress-edge.test.js:4 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: keypress returns independent terms and repairs positions after edits plugins/speed/tests/keypress-edge.test.js:27 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • No assertions: (unnamed test) plugins/speed/tests/stream.test.js:14 — This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
  • + 15 more in this group — see findings.md.
R4 · Test Coverage · No test reaches this file · ×38
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/dates/builds/compromise-dates.cjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/pairs/Gerund.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/pairs/PastTense.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/pairs/PresentTense.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/people/femaleNames.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/people/maleNames.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/stats/builds/compromise-stats.cjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/verbs/phrasals.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/switches/noun-verb.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/people/lastnames.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/adjectives/adjectives.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/verbs/infinitives.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/places/cities.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/nouns/actors.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/_experiments/compress/src/lz.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/pairs/AdjToNoun.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/nouns/singulars.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/subtitles/builds/compromise-subtitle.cjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/switches/adj-past.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/nouns/organizations.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/places/places.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file data/lexicon/adjectives/comparables.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • + 13 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×5
  • FunctionTooLong: 05-explicit.parseExplicit plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15 — FunctionTooLong — parseExplicit runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× 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: 02-parseToken.parseToken src/1-one/match/methods/parseMatch/02-parseToken.js:36 — FunctionTooLong — parseToken runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× 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: isPossessive.isPossessive src/2-two/contraction-two/compute/isPossessive.js:42 — FunctionTooLong — isPossessive runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: 03-time.parseTime plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69 — FunctionTooLong — parseTime runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: api.addMethod src/3-three/numbers/numbers/api.js:50 — FunctionTooLong — addMethod runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×5
  • JavaScript dependencies are not locked plugins/_experiments/ast/package.json:32 — plugins/_experiments/ast/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked plugins/_experiments/cmd-k/package.json:35 — plugins/_experiments/cmd-k/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked plugins/_experiments/markdown/package.json:31 — plugins/_experiments/markdown/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked plugins/_experiments/sentiment/package.json:30 — plugins/_experiments/sentiment/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked plugins/_experiments/wikipedia/package.json:44 — plugins/_experiments/wikipedia/package.json declares dependencies that no committed lockfile resolves — there is no package-lock.json / yarn.lock / REDACTED / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
R11 · Import Boundaries · Boundary violation [package · ×4
  • Boundary violation [package:relative-cross-package] plugins/_experiments/wikipedia/scratch.js:2 — plugins/_experiments/wikipedia/scratch.js:2 reaches into another package with a relative path (../../src/one.js) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] plugins/_experiments/wikipedia/scripts/generate/02-filter.js:5 — plugins/_experiments/wikipedia/scripts/generate/02-filter.js:5 reaches into another package with a relative path (../../../../src/two.js) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] plugins/_experiments/wikipedia/scripts/perf.js:3 — plugins/_experiments/wikipedia/scripts/perf.js:3 reaches into another package with a relative path (../../../src/one.js) — import the package by name instead.
  • Boundary violation [package:relative-cross-package] plugins/_experiments/wikipedia/src/plugin.js:2 — plugins/_experiments/wikipedia/src/plugin.js:2 reaches into another package with a relative path (./_model.js) — import the package by name instead.
D15 · Churn × Complexity Hotspots · Repeated repair · ×3
  • Repeated repair: plugins/dates/src/api/parse/range/02-date-range.js plugins/dates/src/api/parse/range/02-date-range.js:9 — plugins/dates/src/api/parse/range/02-date-range.js changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is 02-date-range.rollingWindow at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “date fixes”; “filesize reduction, contraction and date fixes”; “date fixes and firstname trimming”; “lint fix”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- plugins/dates/src/api/parse/range/02-date-range.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: src/3-three/verbs/find.js src/3-three/verbs/find.js:1 — src/3-three/verbs/find.js changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is find.findVerbs at line 1), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “verb conjugation fixes”; “more issues from bug cases”; “fix bug examples”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- src/3-three/verbs/find.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: plugins/paragraphs/src/api.js plugins/paragraphs/src/api.js:24 — plugins/paragraphs/src/api.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is api.api at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix plugins”; “possessive fixes and neg or match logic”; “lint fix”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-10 10:12:34 -05:00' --until='2026-11-08 10:12:34 -05:00' --full-history --no-merges -- plugins/paragraphs/src/api.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · FileTooLong · ×3
  • FileTooLong: REDACTED REDACTED — FileTooLong — 9957 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8457 over it, 6.64× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 9604 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8104 over it, 6.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: builds/compromise-dates.cjs plugins/dates/builds/compromise-dates.cjs — FileTooLong — 3780 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 2280 over it, 2.52× 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.
D3 · God Classes · TooManyMethods · ×3
  • TooManyMethods: Tokenizer REDACTED:3779 — TooManyMethods — 107 methods. The bar is 30 methods; this is 77 over it, 3.57× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Parser REDACTED:7348 — TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× 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: OpenElementStack REDACTED:6383 — TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
R10 · Code Duplication · Duplicated block with local edits (44 matched lines × 2 locations) · ×3
  • Duplicated block with local edits (44 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:4170 — plugins/dates/builds/compromise-dates.cjs:4170 · plugins/dates/src/api/arithmetic/_lib.js:20 — the two spans are one implementation copied and then locally edited — 426 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (44 matched lines × 2 locations) plugins/html/src/read-tree/02-connect.js:1 — plugins/html/src/read-tree/02-connect.js:1 · plugins/markdown/src/read-tree/02-connect.js:1 — the two spans are one implementation copied and then locally edited — 341 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (44 matched lines × 2 locations) REDACTED:307 — REDACTED:307 · plugins/speech/src/syllables/split/find-cuts/02-boundaries.js:15 — the two spans are one implementation copied and then locally edited — 448 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
D1 · Cyclomatic Complexity · compromise-markdown.compiler · ×2
  • compromise-markdown.compiler::prepareList (cyclomatic 44) REDACTED:11432 — compromise-markdown.compiler::prepareList has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (compromise-markdown.compiler::compile) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
  • compromise-markdown.compiler::compile (cyclomatic 17) REDACTED:11317 — compromise-markdown.compiler::compile 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. This shape REPEATS in the file: one other method here (compromise-markdown.compiler::prepareList) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeHtmlFlow · ×2
  • compromise-markdown.tokenizeHtmlFlow::tagName (cyclomatic 17) REDACTED:7372 — compromise-markdown.tokenizeHtmlFlow::tagName 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. This shape REPEATS in the file: one other method here (compromise-markdown.tokenizeHtmlFlow::continuation) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
  • compromise-markdown.tokenizeHtmlFlow::continuation (cyclomatic 16) REDACTED:7675 — compromise-markdown.tokenizeHtmlFlow::continuation has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (compromise-markdown.tokenizeHtmlFlow::tagName) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D2 · Cognitive Complexity · parseTime (cognitive 80) · ×2
  • parseTime (cognitive 80) plugins/dates/builds/compromise-dates.cjs:433 — parseTime has cognitive complexity 80 (threshold 15). Drivers by points: if/else 37 (62 pts), boolean chains 14, ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • parseTime (cognitive 80) plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69 — parseTime has cognitive complexity 80 (threshold 15). Drivers by points: if/else 37 (62 pts), boolean chains 14, ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compiler · ×2
  • compiler::prepareList (cognitive 67) REDACTED:11432 — compiler::prepareList has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (42 pts), boolean chains 11, loops 4 (8 pts), ternaries 1 (4 pts), match/switch 1 (2 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • compiler::compile (cognitive 23) REDACTED:11317 — compiler::compile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 3, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parseShift (cognitive 48) · ×2
  • parseShift (cognitive 48) plugins/dates/builds/compromise-dates.cjs:183 — parseShift has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 6 (18 pts), boolean chains 5 (nesting depth added 21). Of this number, 27 points are the body's own statements and 21 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • parseShift (cognitive 48) plugins/dates/src/api/parse/one/01-tokenize/01-shift.js:50 — parseShift has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 6 (18 pts), boolean chains 5 (nesting depth added 21). Of this number, 27 points are the body's own statements and 21 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · shiftRange (cognitive 28) · ×2
  • shiftRange (cognitive 28) plugins/dates/builds/compromise-dates.cjs:4223 — shiftRange has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (9 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
  • shiftRange (cognitive 28) plugins/dates/src/api/arithmetic/index.js:7 — shiftRange has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 17, if/else 8 (9 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · pickBoundaries (cognitive 26) · ×2
  • pickBoundaries (cognitive 26) REDACTED:322 — pickBoundaries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 349, 368, 325). 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.
  • pickBoundaries (cognitive 26) plugins/speech/src/syllables/split/find-cuts/02-boundaries.js:30 — pickBoundaries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 57, 76, 33). 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 · visitParents · ×2
  • visitParents::factory::visit (cognitive 25) REDACTED:15897 — visitParents::factory::visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • visitParents::factory::visit (cognitive 25) REDACTED:13475 — visitParents::factory::visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (7 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · update (cognitive 22) · ×2
  • update (cognitive 22) REDACTED:22454 — update has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 22491, sameNode, a function literal at line 22484, …). 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.
  • update (cognitive 22) plugins/markdown/src/update-tree/index.js:3 — update has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 40, sameNode, a function literal at line 33, …). 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 · location · ×2
  • location::toPoint (cognitive 18) REDACTED:1922 — location::toPoint has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 3 (7 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.
  • location::toOffset (cognitive 16) REDACTED:1949 — location::toOffset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 02-connect.connectNodes · ×2
  • 02-connect.connectNodes::consume (cognitive 17) plugins/html/src/read-tree/02-connect.js:33 — 02-connect.connectNodes::consume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • 02-connect.connectNodes::consume (cognitive 16) plugins/markdown/src/read-tree/02-connect.js:8 — 02-connect.connectNodes::consume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×2
  • REDACTED
  • REDACTED
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: compromise-dates.cjs ↔ _version.js plugins/dates/builds/compromise-dates.cjs:1 — `plugins/dates/builds/compromise-dates.cjs` and `plugins/dates/src/_version.js` change together 90% of the time (9 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 9 shared commits counted here, the most recent 3 are `ca129696` dates 3.9.0rc; `1a4469f8` 3.8.1rc; `44a60c4b` 3.8.0rc — run `git show` on any of them.
  • Change coupling: scratch.js ↔ 03-time.js plugins/dates/scratch.js:1 — `plugins/dates/scratch.js` and `plugins/dates/src/api/parse/one/01-tokenize/03-time.js` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — 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 `6c8adca8` one test failing; `230ef276` fix between month-month template; `5ffd07fb` fix in-the-morning — run `git show` on any of them.
D6 · Cohesion (LCOM4) · Low cohesion · ×2
  • Low cohesion: WrapDoc (LCOM4 5) plugins/subtitles/builds/compromise-subtitle.cjs:127 — WrapDoc'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: WrapDoc (LCOM4 5) plugins/subtitles/src/WrapDoc.js:37 — WrapDoc'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.
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (9 clone groups) · ×2
  • Duplication concentrated across 2 sibling directories (9 clone groups) REDACTED:22467 — 9 duplicated blocks under plugins/markdown/ have copies in at least two of the sibling directories builds, src — 7 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
  • Duplication concentrated across 2 sibling directories (9 clone groups) plugins/unist/builds/compromise-unist.cjs:54 — 9 duplicated blocks under plugins/unist/ have copies in at least two of the sibling directories builds, src — 6 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (5 clone groups) · ×2
  • Duplication concentrated across 2 sibling directories (5 clone groups) REDACTED:16340 — 5 duplicated blocks under plugins/html/ have copies in at least two of the sibling directories builds, src — 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
  • Duplication concentrated across 2 sibling directories (5 clone groups) plugins/stats/builds/compromise-stats.cjs:957 — 5 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/stats/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block (49 lines × 2 locations) · ×2
  • Duplicated block (49 lines × 2 locations) REDACTED:15100 — REDACTED:15100 · REDACTED:12467 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (49 lines × 2 locations) REDACTED:16533 — REDACTED:16533 · REDACTED:22532 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R2 · Cyclomatic Complexity · Complex function parseTime (cyclomatic 51, cognitive 80) · ×2
  • Complex function parseTime (cyclomatic 51, cognitive 80) plugins/dates/builds/compromise-dates.cjs:433 — parseTime has cyclomatic complexity 51 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
  • Complex function parseTime (cyclomatic 51, cognitive 80) plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69 — parseTime has cyclomatic complexity 51 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseExplicit (cyclomatic 43, cognitive 64) · ×2
  • Complex function parseExplicit (cyclomatic 43, cognitive 64) plugins/dates/builds/compromise-dates.cjs:2422 — parseExplicit has cyclomatic complexity 43 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
  • Complex function parseExplicit (cyclomatic 43, cognitive 64) plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15 — parseExplicit has cyclomatic complexity 43 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function shiftRange (cyclomatic 31, cognitive 28) · ×2
  • Complex function shiftRange (cyclomatic 31, cognitive 28) plugins/dates/builds/compromise-dates.cjs:4223 — shiftRange has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
  • Complex function shiftRange (cyclomatic 31, cognitive 28) plugins/dates/src/api/arithmetic/index.js:7 — shiftRange has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R4 · Test Coverage · This test file cannot be loaded · ×2
  • This test file cannot be loaded scripts/test/smoke.test.js:12 — scripts/test/smoke.test.js:12 imports './.mjs', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
  • This test file cannot be loaded tests/_hmm/run.js:7 — tests/_hmm/run.js:7 imports '../../plugins/dates/tests/_hmm/', which names no file in this repository — and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing.
D1 · Cyclomatic Complexity · isPossessive.isPossessive (cyclomatic 129) · ×1
  • isPossessive.isPossessive (cyclomatic 129) src/2-two/contraction-two/compute/isPossessive.js:42 — isPossessive.isPossessive has cyclomatic complexity 129 (threshold 15). Of this number, 117 points are the body's own statements and 12 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-subtitle.$ (cyclomatic 124) · ×1
  • compromise-subtitle.$ (cyclomatic 124) plugins/subtitles/builds/compromise-subtitle.cjs:9 — compromise-subtitle.$ has cyclomatic complexity 124 (threshold 15). Most of this is not in the body itself: 9 of the 124 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 9, 9, 9, …). 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 · question.parseQuestion (cyclomatic 83) · ×1
  • question.parseQuestion (cyclomatic 83) src/3-three/verbs/api/conjugate/question.js:62 — question.parseQuestion has cyclomatic complexity 83 (threshold 15). Of this number, 79 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeHtmlText (cyclomatic 81) · ×1
  • compromise-markdown.tokenizeHtmlText (cyclomatic 81) REDACTED:7962 — compromise-markdown.tokenizeHtmlText has cyclomatic complexity 81 (threshold 15). Most of this is not in the body itself: 1 of the 81 points is its own statement and the rest belongs to 26 function items inside it that branch (tagOpenAttributeValueBefore, tagOpenAttributeValueUnquoted, tagOpenBetween, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · local-corrections.localCorrections (cyclomatic 72) · ×1
  • local-corrections.localCorrections (cyclomatic 72) src/2-two/postTagger/compute/local-corrections.js:14 — local-corrections.localCorrections has cyclomatic complexity 72 (threshold 15). Most of this is not in the body itself: 1 of the 72 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 26, 17). 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 · compromise-dates.Ot (cyclomatic 56) · ×1
  • compromise-dates.Ot (cyclomatic 56) plugins/dates/builds/compromise-dates.cjs:341 — compromise-dates.Ot has cyclomatic complexity 56 (threshold 15). Of this number, 46 points are the body's own statements and 10 belong to one function literal 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 · compromise-markdown.safe (cyclomatic 53) · ×1
  • compromise-markdown.safe (cyclomatic 53) REDACTED:16191 — compromise-markdown.safe has cyclomatic complexity 53 (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 · compromise-markdown.tokenizeTable (cyclomatic 52) · ×1
  • compromise-markdown.tokenizeTable (cyclomatic 52) REDACTED:18456 — compromise-markdown.tokenizeTable has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 1 of the 52 points is its own statement and the rest belongs to 16 function items inside it that branch (start, headRowBreak, headDelimiterCellAfter, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-dates.parseTime (cyclomatic 51) · ×1
  • compromise-dates.parseTime (cyclomatic 51) plugins/dates/builds/compromise-dates.cjs:433 — compromise-dates.parseTime has cyclomatic complexity 51 (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 · 03-time.parseTime (cyclomatic 51) · ×1
  • 03-time.parseTime (cyclomatic 51) plugins/dates/src/api/parse/one/01-tokenize/03-time.js:69 — 03-time.parseTime has cyclomatic complexity 51 (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 · parseToken (cyclomatic 47) · ×1
  • parseToken (cyclomatic 47) src/1-one/match/methods/parseMatch/02-parseToken.js:36 — parseToken has cyclomatic complexity 47 (threshold 15). Of this number, 43 points are the body's own statements and 4 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · doesMatch.doesMatch (cyclomatic 45) · ×1
  • doesMatch.doesMatch (cyclomatic 45) src/1-one/match/methods/match/term/doesMatch.js:7 — doesMatch.doesMatch has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · index.parse (cyclomatic 43) · ×1
  • index.parse (cyclomatic 43) src/3-three/numbers/numbers/parse/toNumber/index.js:24 — index.parse has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-dates.parseExplicit (cyclomatic 43) · ×1
  • compromise-dates.parseExplicit (cyclomatic 43) plugins/dates/builds/compromise-dates.cjs:2422 — compromise-dates.parseExplicit has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 05-explicit.parseExplicit (cyclomatic 43) · ×1
  • 05-explicit.parseExplicit (cyclomatic 43) plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15 — 05-explicit.parseExplicit has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.markdownTable (cyclomatic 42) · ×1
  • compromise-markdown.markdownTable (cyclomatic 42) REDACTED:20500 — compromise-markdown.markdownTable has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · auxiliary.plan (cyclomatic 41) · ×1
  • auxiliary.plan (cyclomatic 41) src/3-three/verbs/api/conjugate/auxiliary.js:9 — auxiliary.plan has cyclomatic complexity 41 (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 · compromise-markdown.createTokenizer (cyclomatic 40) · ×1
  • compromise-markdown.createTokenizer (cyclomatic 40) REDACTED:10274 — compromise-markdown.createTokenizer has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 8 of the 40 points are its own statements and the rest belongs to 11 function items inside it that branch (constructFactory::hook::handleMapOfConstructs::start, main, consume, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · apostrophe-s.isOrHas (cyclomatic 38) · ×1
  • apostrophe-s.isOrHas (cyclomatic 38) src/2-two/contraction-two/compute/apostrophe-s.js:19 — apostrophe-s.isOrHas has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _compress (cyclomatic 38) · ×1
  • _compress (cyclomatic 38) plugins/_experiments/compress/src/lz.js:75 — _compress has cyclomatic complexity 38 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · tokenize.normalizePunctuation (cyclomatic 34) · ×1
  • tokenize.normalizePunctuation (cyclomatic 34) src/1-one/tokenize/methods/03-whitespace/tokenize.js:28 — tokenize.normalizePunctuation has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeCodeFenced (cyclomatic 34) · ×1
  • compromise-markdown.tokenizeCodeFenced (cyclomatic 34) REDACTED:4558 — compromise-markdown.tokenizeCodeFenced has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 13 function items inside it that branch (info, meta, sequenceOpen, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · i18n (cyclomatic 33) · ×1
  • i18n (cyclomatic 33) plugins/dates/builds/compromise-dates.cjs:341 — i18n has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 9 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 341, 341, 341, …). 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 · VFileMessage.constructor (cyclomatic 32) · ×1
  • VFileMessage.constructor (cyclomatic 32) REDACTED:10723 — VFileMessage.constructor has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.initializeDocument (cyclomatic 32) · ×1
  • compromise-markdown.initializeDocument (cyclomatic 32) REDACTED:3205 — compromise-markdown.initializeDocument has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 8 function items inside it that branch (writeToChild, documentContinue, checkNewContainers, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.resolveTable (cyclomatic 32) · ×1
  • compromise-markdown.resolveTable (cyclomatic 32) REDACTED:18987 — compromise-markdown.resolveTable has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _decompress (cyclomatic 32) · ×1
  • _decompress (cyclomatic 32) plugins/_experiments/compress/src/lz.js:298 — _decompress has cyclomatic complexity 32 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · 10-ambig-date.ambigDate (cyclomatic 31) · ×1
  • 10-ambig-date.ambigDate (cyclomatic 31) src/2-two/preTagger/compute/tagger/3rd-pass/10-ambig-date.js:26 — 10-ambig-date.ambigDate 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 · compromise-dates.shiftRange (cyclomatic 31) · ×1
  • compromise-dates.shiftRange (cyclomatic 31) plugins/dates/builds/compromise-dates.cjs:4223 — compromise-dates.shiftRange has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · index.shiftRange (cyclomatic 31) · ×1
  • index.shiftRange (cyclomatic 31) plugins/dates/src/api/arithmetic/index.js:7 — index.shiftRange has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · compromise-markdown.factoryDestination (cyclomatic 31) · ×1
  • compromise-markdown.factoryDestination (cyclomatic 31) REDACTED:6013 — compromise-markdown.factoryDestination has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 2 of the 31 points are its own statements and the rest belongs to 6 function items inside it that branch (raw, start, enclosed, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.list (cyclomatic 29) · ×1
  • compromise-markdown.list (cyclomatic 29) REDACTED:14423 — compromise-markdown.list has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · args.parseArgs (cyclomatic 28) · ×1
  • args.parseArgs (cyclomatic 28) bin/_lib/args.js:42 — args.parseArgs has cyclomatic complexity 28 (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 · groups.groups (cyclomatic 28) · ×1
  • groups.groups (cyclomatic 28) src/3-three/verbs/api/conjugate/groups.js:9 — groups.groups has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · compromise-dates.parseShift (cyclomatic 28) · ×1
  • compromise-dates.parseShift (cyclomatic 28) plugins/dates/builds/compromise-dates.cjs:183 — compromise-dates.parseShift has cyclomatic complexity 28 (threshold 15). Of this number, 16 points are the body's own statements and 12 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 01-shift.parseShift (cyclomatic 28) · ×1
  • 01-shift.parseShift (cyclomatic 28) plugins/dates/src/api/parse/one/01-tokenize/01-shift.js:50 — 01-shift.parseShift has cyclomatic complexity 28 (threshold 15). Of this number, 16 points are the body's own statements and 12 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-html.serializeAttribute (cyclomatic 28) · ×1
  • compromise-html.serializeAttribute (cyclomatic 28) REDACTED:14388 — compromise-html.serializeAttribute has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · _text.textFromTerms (cyclomatic 27) · ×1
  • _text.textFromTerms (cyclomatic 27) src/1-one/output/api/_text.js:18 — _text.textFromTerms has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 20). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · compromise-dates.ce (cyclomatic 27) · ×1
  • compromise-dates.ce (cyclomatic 27) plugins/dates/builds/compromise-dates.cjs:341 — compromise-dates.ce has cyclomatic complexity 27 (threshold 15). Of this number, 22 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · compromise-html.connectNodes (cyclomatic 27) · ×1
  • compromise-html.connectNodes (cyclomatic 27) REDACTED:16254 — compromise-html.connectNodes has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (consume, append, a function literal at line 16314, …). 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. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 02-connect.connectNodes (cyclomatic 27) · ×1
  • 02-connect.connectNodes (cyclomatic 27) plugins/html/src/read-tree/02-connect.js:1 — 02-connect.connectNodes has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (consume, append, a function literal at line 61, …). 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 · compromise-markdown.tokenizeAutolink (cyclomatic 27) · ×1
  • compromise-markdown.tokenizeAutolink (cyclomatic 27) REDACTED:3847 — compromise-markdown.tokenizeAutolink has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 8 function items inside it that branch (schemeInsideOrEmailAtext, urlInside, schemeOrEmailAtext, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · 01-simple-split.basicSplit (cyclomatic 26) · ×1
  • 01-simple-split.basicSplit (cyclomatic 26) src/1-one/tokenize/methods/01-sentences/01-simple-split.js:12 — 01-simple-split.basicSplit has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeListStart (cyclomatic 26) · ×1
  • compromise-markdown.tokenizeListStart (cyclomatic 26) REDACTED:9520 — compromise-markdown.tokenizeListStart has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 4 function items inside it that branch (start, inside, atMarker, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.pair (cyclomatic 26) · ×1
  • compromise-markdown.pair (cyclomatic 26) REDACTED:15640 — compromise-markdown.pair has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · parseNumber (cyclomatic 26) · ×1
  • parseNumber (cyclomatic 26) src/3-three/numbers/numbers/parse/index.js:51 — parseNumber has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · question.question (cyclomatic 25) · ×1
  • question.question (cyclomatic 25) src/3-three/verbs/api/conjugate/question.js:263 — question.question has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · compromise-markdown.gfmStrikethrough (cyclomatic 25) · ×1
  • compromise-markdown.gfmStrikethrough (cyclomatic 25) REDACTED:18024 — compromise-markdown.gfmStrikethrough has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 3 function items inside it that branch (resolveAllStrikethrough, tokenizeStrikethrough::more, tokenizeStrikethrough::start). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.update (cyclomatic 25) · ×1
  • compromise-markdown.update (cyclomatic 25) REDACTED:22454 — compromise-markdown.update has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 22491, sameNode, a function literal at line 22484, …). 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 · index.update (cyclomatic 25) · ×1
  • index.update (cyclomatic 25) plugins/markdown/src/update-tree/index.js:3 — index.update has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 40, sameNode, a function literal at line 33, …). 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 · 08-imperative.imperative (cyclomatic 24) · ×1
  • 08-imperative.imperative (cyclomatic 24) src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js:15 — 08-imperative.imperative has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · compromise-html.toHtml (cyclomatic 24) · ×1
  • compromise-html.toHtml (cyclomatic 24) REDACTED:14646 — compromise-html.toHtml has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-html.format · ×1
  • compromise-html.format::visitor (cyclomatic 24) REDACTED:16006 — compromise-html.format::visitor 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: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.resolveAllAttention (cyclomatic 24) · ×1
  • compromise-markdown.resolveAllAttention (cyclomatic 24) REDACTED:3625 — compromise-markdown.resolveAllAttention has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.subtokenize (cyclomatic 24) · ×1
  • compromise-markdown.subtokenize (cyclomatic 24) REDACTED:5603 — compromise-markdown.subtokenize has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · splitGroups.splitGroups (cyclomatic 23) · ×1
  • splitGroups.splitGroups (cyclomatic 23) src/1-one/match/methods/parseMatch/splitGroups.js:7 — splitGroups.splitGroups has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 05-year.tagYear (cyclomatic 23) · ×1
  • 05-year.tagYear (cyclomatic 23) src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js:66 — 05-year.tagYear has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-dates.api$2 (cyclomatic 23) · ×1
  • compromise-dates.api$2 (cyclomatic 23) plugins/dates/builds/compromise-dates.cjs:4309 — compromise-dates.api$2 has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 4335, 4350, 4394, …). 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 · dates.api (cyclomatic 23) · ×1
  • dates.api (cyclomatic 23) plugins/dates/src/api/dates.js:15 — dates.api has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 41, 56, 100, …). 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 · compromise-html.element$1 (cyclomatic 23) · ×1
  • compromise-html.element$1 (cyclomatic 23) REDACTED:14284 — compromise-html.element$1 has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-html.visitParents (cyclomatic 23) · ×1
  • compromise-html.visitParents (cyclomatic 23) REDACTED:15851 — compromise-html.visitParents has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (factory::visit, factory). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-html.walk (cyclomatic 23) · ×1
  • compromise-html.walk (cyclomatic 23) REDACTED:16185 — compromise-html.walk has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 01-walk.walk (cyclomatic 23) · ×1
  • 01-walk.walk (cyclomatic 23) plugins/html/src/read-tree/01-walk.js:12 — 01-walk.walk has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-markdown.visitParents (cyclomatic 23) · ×1
  • compromise-markdown.visitParents (cyclomatic 23) REDACTED:13429 — compromise-markdown.visitParents has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (factory::visit, factory). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.findAndReplace (cyclomatic 23) · ×1
  • compromise-markdown.findAndReplace (cyclomatic 23) REDACTED:19511 — compromise-markdown.findAndReplace has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (handler, visitor, handler::add). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · compromise-subtitle.I (cyclomatic 23) · ×1
  • compromise-subtitle.I (cyclomatic 23) plugins/subtitles/builds/compromise-subtitle.cjs:9 — compromise-subtitle.I has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · compromise-dates.D (cyclomatic 22) · ×1
  • compromise-dates.D (cyclomatic 22) plugins/dates/builds/compromise-dates.cjs:341 — compromise-dates.D has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Parser._resetInsertionMode (cyclomatic 22) · ×1
  • Parser._resetInsertionMode (cyclomatic 22) REDACTED:7790 — Parser._resetInsertionMode has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-html.normalizeString (cyclomatic 22) · ×1
  • compromise-html.normalizeString (cyclomatic 22) REDACTED:11284 — compromise-html.normalizeString 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. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.joinDefaults (cyclomatic 22) · ×1
  • compromise-markdown.joinDefaults (cyclomatic 22) REDACTED:14943 — compromise-markdown.joinDefaults 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 · compromise-markdown.check (cyclomatic 22) · ×1
  • compromise-markdown.check (cyclomatic 22) REDACTED:15471 — compromise-markdown.check has cyclomatic complexity 22 (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 · compromise-markdown.format (cyclomatic 22) · ×1
  • compromise-markdown.format (cyclomatic 22) REDACTED:21228 — compromise-markdown.format has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body's own statements and 2 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 · compromise-markdown.createConstruct (cyclomatic 22) · ×1
  • compromise-markdown.createConstruct (cyclomatic 22) REDACTED:21532 — compromise-markdown.createConstruct has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 11 function items inside it that branch (tokenizeFrontmatter::start, tokenizeFrontmatter::openSequence, tokenizeClosingFence::closeSequence, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · modeFor (cyclomatic 22) · ×1
  • modeFor (cyclomatic 22) plugins/markdown/src/read-tree/node-formats.js:35 — modeFor 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 · _fuzzy.editDistance (cyclomatic 21) · ×1
  • _fuzzy.editDistance (cyclomatic 21) src/1-one/match/methods/match/term/_fuzzy.js:5 — _fuzzy.editDistance has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 00-possessive.possessive (cyclomatic 21) · ×1
  • 00-possessive.possessive (cyclomatic 21) src/2-two/preTagger/compute/tagger/3rd-pass/00-possessive.js:14 — 00-possessive.possessive has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · find.splitNumbers (cyclomatic 21) · ×1
  • find.splitNumbers (cyclomatic 21) src/3-three/numbers/numbers/find.js:8 — find.splitNumbers has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · coordinate.resultTense (cyclomatic 21) · ×1
  • coordinate.resultTense (cyclomatic 21) src/3-three/verbs/api/conjugate/coordinate.js:9 — coordinate.resultTense has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · compromise-html.basename (cyclomatic 21) · ×1
  • compromise-html.basename (cyclomatic 21) REDACTED:11021 — compromise-html.basename 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. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.factoryLabel (cyclomatic 21) · ×1
  • compromise-markdown.factoryLabel (cyclomatic 21) REDACTED:6218 — compromise-markdown.factoryLabel has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function items inside it that branch (atBreak, labelInside, labelEscape). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.preprocess · ×1
  • compromise-markdown.preprocess::preprocessor (cyclomatic 21) REDACTED:10914 — compromise-markdown.preprocess::preprocessor 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. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · b.normalize (cyclomatic 21) · ×1
  • b.normalize (cyclomatic 21) plugins/subtitles/builds/compromise-subtitle.cjs:9 — b.normalize has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · api · ×1
  • api::sentiment (cyclomatic 21) plugins/_experiments/sentiment/src/plugin.js:12 — api::sentiment has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · match-debug.matchDebug (cyclomatic 20) · ×1
  • match-debug.matchDebug (cyclomatic 20) src/API/debug/match-debug.js:5 — match-debug.matchDebug has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 5 function items inside it that branch (matchLogged, includesWord, a function literal at line 12, …). 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 · splitRegs.splitRegs (cyclomatic 20) · ×1
  • splitRegs.splitRegs (cyclomatic 20) src/1-one/match/methods/parseMatch/splitRegs.js:11 — splitRegs.splitRegs 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 · 02-hyphens.byHyphen (cyclomatic 20) · ×1
  • 02-hyphens.byHyphen (cyclomatic 20) src/2-two/preTagger/compute/tagger/1st-pass/02-hyphens.js:5 — 02-hyphens.byHyphen has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · 01-case.checkCase (cyclomatic 20) · ×1
  • 01-case.checkCase (cyclomatic 20) src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js:22 — 01-case.checkCase 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 · compromise-dates.today (cyclomatic 20) · ×1
  • compromise-dates.today (cyclomatic 20) plugins/dates/builds/compromise-dates.cjs:1623 — compromise-dates.today 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 · 01-today.today (cyclomatic 20) · ×1
  • 01-today.today (cyclomatic 20) plugins/dates/src/api/parse/one/02-parse/01-today.js:46 — 01-today.today 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 · $ · ×1
  • $::h::(anonymous)::(anonymous)::(anonymous)::e (cyclomatic 20) plugins/subtitles/builds/compromise-subtitle.cjs:9 — $::h::(anonymous)::(anonymous)::(anonymous)::e has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · replaceWith (cyclomatic 20) · ×1
  • replaceWith (cyclomatic 20) src/1-one/change/api/replace.js:69 — replaceWith has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body's own statements and 3 belong to 10 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · index.contractions (cyclomatic 19) · ×1
  • index.contractions (cyclomatic 19) src/1-one/contraction-one/compute/contractions/index.js:84 — index.contractions has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 90). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · index.runMatch (cyclomatic 19) · ×1
  • index.runMatch (cyclomatic 19) src/1-one/match/methods/match/index.js:29 — index.runMatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 06-switches.doSwitches (cyclomatic 19) · ×1
  • 06-switches.doSwitches (cyclomatic 19) src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js:68 — 06-switches.doSwitches has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · compromise-html.location (cyclomatic 19) · ×1
  • compromise-html.location (cyclomatic 19) REDACTED:1909 — compromise-html.location has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (toOffset, toPoint). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-html.update (cyclomatic 19) · ×1
  • compromise-html.update (cyclomatic 19) REDACTED:16464 — compromise-html.update has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 16498, 16491, 16519, …). 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. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · index.update (cyclomatic 19) · ×1
  • index.update (cyclomatic 19) plugins/html/src/update-tree/index.js:3 — index.update has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 37, 30, 58, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · compromise-markdown.resolveAllLineSuffixes (cyclomatic 19) · ×1
  • compromise-markdown.resolveAllLineSuffixes (cyclomatic 19) REDACTED:10072 — compromise-markdown.resolveAllLineSuffixes 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. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-unist.read · ×1
  • compromise-unist.read::visit (cyclomatic 19) plugins/unist/builds/compromise-unist.cjs:201 — compromise-unist.read::visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · 01-read.read · ×1
  • 01-read.read::visit (cyclomatic 19) plugins/unist/src/fromAst/01-read.js:14 — 01-read.read::visit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _lib.canMatch (cyclomatic 18) · ×1
  • _lib.canMatch (cyclomatic 18) src/1-one/sweep/methods/sweep/_lib.js:4 — _lib.canMatch 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 · index.tagger (cyclomatic 18) · ×1
  • index.tagger (cyclomatic 18) src/1-one/sweep/methods/tagger/index.js:3 — index.tagger has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 10). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · compromise-dates.O (cyclomatic 18) · ×1
  • compromise-dates.O (cyclomatic 18) plugins/dates/builds/compromise-dates.cjs:341 — compromise-dates.O has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body's own statements and 9 belong to one function literal 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 · compromise-dates.transform (cyclomatic 18) · ×1
  • compromise-dates.transform (cyclomatic 18) plugins/dates/builds/compromise-dates.cjs:2734 — compromise-dates.transform 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 · index.transform (cyclomatic 18) · ×1
  • index.transform (cyclomatic 18) plugins/dates/src/api/parse/one/03-transform/index.js:5 — index.transform 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 · compromise-html.startTagInSelect (cyclomatic 18) · ×1
  • compromise-html.startTagInSelect (cyclomatic 18) REDACTED:10140 — compromise-html.startTagInSelect 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: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeAttention · ×1
  • compromise-markdown.tokenizeAttention::inside (cyclomatic 18) REDACTED:3785 — compromise-markdown.tokenizeAttention::inside has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.subcontent (cyclomatic 18) · ×1
  • compromise-markdown.subcontent (cyclomatic 18) REDACTED:5704 — compromise-markdown.subcontent 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: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.render (cyclomatic 18) · ×1
  • compromise-markdown.render (cyclomatic 18) REDACTED:15909 — compromise-markdown.render 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: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.connectNodes (cyclomatic 18) · ×1
  • compromise-markdown.connectNodes (cyclomatic 18) REDACTED:22311 — compromise-markdown.connectNodes 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 3 function items inside it that branch (consume, a function literal at line 22353, a function literal at line 22365). 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. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 02-connect.connectNodes (cyclomatic 18) · ×1
  • 02-connect.connectNodes (cyclomatic 18) plugins/markdown/src/read-tree/02-connect.js:1 — 02-connect.connectNodes 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 3 function items inside it that branch (consume, a function literal at line 43, a function literal at line 55). 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 · compromise-stats.unpack (cyclomatic 18) · ×1
  • compromise-stats.unpack (cyclomatic 18) plugins/stats/builds/compromise-stats.cjs:889 — compromise-stats.unpack has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 906, 897). 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 · compromise-subtitle.o (cyclomatic 18) · ×1
  • compromise-subtitle.o (cyclomatic 18) plugins/subtitles/builds/compromise-subtitle.cjs:9 — compromise-subtitle.o has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 18) · ×1
  • (anonymous) (cyclomatic 18) REDACTED:5 — (anonymous) has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · modeFor (cyclomatic 18) · ×1
  • modeFor (cyclomatic 18) REDACTED:22127 — modeFor 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. This is NOT this file's highest cyclomatic complexity: tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · dictionary (cyclomatic 18) · ×1
  • dictionary (cyclomatic 18) plugins/stats/builds/compromise-stats.cjs:783 — dictionary has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · multi-word.multiWord (cyclomatic 17) · ×1
  • multi-word.multiWord (cyclomatic 17) src/1-one/lexicon/compute/multi-word.js:2 — multi-word.multiWord has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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 · _adhoc.isQuestionVerb (cyclomatic 17) · ×1
  • _adhoc.isQuestionVerb (cyclomatic 17) src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js:40 — _adhoc.isQuestionVerb has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · auxiliary.convertAuxiliary (cyclomatic 17) · ×1
  • auxiliary.convertAuxiliary (cyclomatic 17) src/3-three/verbs/api/conjugate/auxiliary.js:100 — auxiliary.convertAuxiliary has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · compromise.main (cyclomatic 17) · ×1
  • compromise.main (cyclomatic 17) bin/compromise.js:46 — compromise.main 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 · compromise-markdown.listItem (cyclomatic 17) · ×1
  • compromise-markdown.listItem (cyclomatic 17) REDACTED:14553 — compromise-markdown.listItem has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeProtocolAutolink (cyclomatic 17) · ×1
  • compromise-markdown.tokenizeProtocolAutolink (cyclomatic 17) REDACTED:16955 — compromise-markdown.tokenizeProtocolAutolink has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function items inside it that branch (protocolPrefixInside, afterProtocol, protocolStart, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeDefinitionStart (cyclomatic 17) · ×1
  • compromise-markdown.tokenizeDefinitionStart (cyclomatic 17) REDACTED:17813 — compromise-markdown.tokenizeDefinitionStart has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (labelInside, labelEscape, labelAfter, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.walk (cyclomatic 17) · ×1
  • compromise-markdown.walk (cyclomatic 17) REDACTED:22243 — compromise-markdown.walk has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · 01-walk.walk (cyclomatic 17) · ×1
  • 01-walk.walk (cyclomatic 17) plugins/markdown/src/read-tree/01-walk.js:3 — 01-walk.walk has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-speech.pickBoundaries (cyclomatic 17) · ×1
  • compromise-speech.pickBoundaries (cyclomatic 17) REDACTED:322 — compromise-speech.pickBoundaries has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 349, 368, 325). 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 · 02-boundaries.pickBoundaries (cyclomatic 17) · ×1
  • 02-boundaries.pickBoundaries (cyclomatic 17) plugins/speech/src/syllables/split/find-cuts/02-boundaries.js:30 — 02-boundaries.pickBoundaries has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 57, 76, 33). 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 · N.constructor (cyclomatic 17) · ×1
  • N.constructor (cyclomatic 17) plugins/subtitles/builds/compromise-subtitle.cjs:9 — N.constructor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 9). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · extend.extend (cyclomatic 16) · ×1
  • extend.extend (cyclomatic 16) src/API/extend.js:70 — extend.extend has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · getDoc.getDoc (cyclomatic 16) · ×1
  • getDoc.getDoc (cyclomatic 16) src/1-one/pointers/methods/getDoc.js:35 — getDoc.getDoc has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · setTag.tagTerm (cyclomatic 16) · ×1
  • setTag.tagTerm (cyclomatic 16) src/1-one/tag/methods/setTag.js:12 — setTag.tagTerm 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 · _lib.parse (cyclomatic 16) · ×1
  • _lib.parse (cyclomatic 16) src/2-two/left-right/model/_lib.js:28 — _lib.parse has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · isValid.checkNumeric (cyclomatic 16) · ×1
  • isValid.checkNumeric (cyclomatic 16) src/3-three/numbers/numbers/isValid.js:18 — isValid.checkNumeric 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 · compromise-dates.split (cyclomatic 16) · ×1
  • compromise-dates.split (cyclomatic 16) plugins/dates/builds/compromise-dates.cjs:8 — compromise-dates.split has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · split.split (cyclomatic 16) · ×1
  • split.split (cyclomatic 16) plugins/dates/src/api/find/split.js:2 — split.split has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compromise-html.addProperty (cyclomatic 16) · ×1
  • compromise-html.addProperty (cyclomatic 16) REDACTED:1672 — compromise-html.addProperty has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: compromise-html.startTagInBody (cyclomatic 109) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.resolveToLabelEnd (cyclomatic 16) · ×1
  • compromise-markdown.resolveToLabelEnd (cyclomatic 16) REDACTED:8675 — compromise-markdown.resolveToLabelEnd 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: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-markdown.tokenizeGfmFootnoteCall (cyclomatic 16) · ×1
  • compromise-markdown.tokenizeGfmFootnoteCall (cyclomatic 16) REDACTED:17696 — compromise-markdown.tokenizeGfmFootnoteCall has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (callData, callEscape, callStart). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file's highest cyclomatic complexity: compromise-markdown.tokenizePath::pathInside (cyclomatic 22) 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 method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · compromise-speech.vowelSpan (cyclomatic 16) · ×1
  • compromise-speech.vowelSpan (cyclomatic 16) REDACTED:236 — compromise-speech.vowelSpan has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body's own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · 01-vowel-span.vowelSpan (cyclomatic 16) · ×1
  • 01-vowel-span.vowelSpan (cyclomatic 16) REDACTED:96 — 01-vowel-span.vowelSpan has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body's own statements and 6 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · re (cyclomatic 16) · ×1
  • re (cyclomatic 16) plugins/dates/builds/compromise-dates.cjs:341 — re has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 341). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D10 · Test Quality · Skipped test · ×1
  • Skipped test: (unnamed test) tests/03-three/coreference/antecedent-boundaries.test.js:51 — Skipped — switched off by test.skip
D10 · Test Quality · Test project verifies nothing · ×1
  • Test project verifies nothing: plugins/_experiments/wikipedia plugins/_experiments/wikipedia/tests/misc.test.js:5 — No conventional assertion call was detected in 2 of 2 tests in `plugins/_experiments/wikipedia` — the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail.
D2 · Cognitive Complexity · _compress (cognitive 150) · ×1
  • _compress (cognitive 150) plugins/_experiments/compress/src/lz.js:75 — _compress has cognitive complexity 150 (threshold 15). Drivers by points: if/else 41 (104 pts), loops 13 (46 pts) (nesting depth added 96). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · isPossessive (cognitive 147) · ×1
  • isPossessive (cognitive 147) src/2-two/contraction-two/compute/isPossessive.js:42 — isPossessive has cognitive complexity 147 (threshold 15). Drivers by points: if/else 48 (81 pts), boolean chains 54, match/switch 4 (10 pts), loops 1 (2 pts) (nesting depth added 40). Of this number, 132 points are the body's own statements and 15 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-subtitle.$ (cognitive 126) · ×1
  • compromise-subtitle.$ (cognitive 126) plugins/subtitles/builds/compromise-subtitle.cjs:9 — compromise-subtitle.$ has cognitive complexity 126 (threshold 15). Drivers by points: boolean chains 44, if/else 21 (43 pts), loops 10 (28 pts), ternaries 7 (8 pts), match/switch 1 (3 pts) (nesting depth added 43). Most of this is not in the body itself: 8 of the 126 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 9, 9, 9, …). 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 · parseToken (cognitive 100) · ×1
  • parseToken (cognitive 100) src/1-one/match/methods/parseMatch/02-parseToken.js:36 — parseToken has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (88 pts), boolean chains 7, match/switch 1 (3 pts), loops 1, other 1 (nesting depth added 51). Of this number, 87 points are the body's own statements and 13 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parseQuestion (cognitive 94) · ×1
  • parseQuestion (cognitive 94) src/3-three/verbs/api/conjugate/question.js:62 — parseQuestion has cognitive complexity 94 (threshold 15). Drivers by points: if/else 29 (56 pts), boolean chains 32, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 29). Of this number, 90 points are the body's own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.markdownTable (cognitive 80) · ×1
  • compromise-markdown.markdownTable (cognitive 80) REDACTED:20500 — compromise-markdown.markdownTable has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (53 pts), boolean chains 12, loops 7 (11 pts), ternaries 2 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parse (cognitive 78) · ×1
  • parse (cognitive 78) src/3-three/numbers/numbers/parse/toNumber/index.js:24 — parse has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (59 pts), boolean chains 14, ternaries 2 (4 pts), loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · localCorrections (cognitive 74) · ×1
  • localCorrections (cognitive 74) src/2-two/postTagger/compute/local-corrections.js:14 — localCorrections has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 22, match/switch 7 (15 pts), loops 3 (6 pts) (nesting depth added 21). None of this is in the body itself: all 74 points belong to 3 function items inside it that branch (a function literal at line 26, a function literal at line 17, add). 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 · compromise-markdown.tokenizeHtmlText (cognitive 69) · ×1
  • compromise-markdown.tokenizeHtmlText (cognitive 69) REDACTED:7962 — compromise-markdown.tokenizeHtmlText has cognitive complexity 69 (threshold 15). Drivers by points: if/else 49, boolean chains 11, ternaries 6 (9 pts) (nesting depth added 3). None of this is in the body itself: all 69 points belong to 26 function items inside it that branch (tagOpenAttributeValueBefore, tagOpenBetween, open, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · _decompress (cognitive 69) · ×1
  • _decompress (cognitive 69) plugins/_experiments/compress/src/lz.js:298 — _decompress has cognitive complexity 69 (threshold 15). Drivers by points: if/else 13 (32 pts), ternaries 6 (19 pts), loops 8 (15 pts), match/switch 2 (3 pts) (nesting depth added 40). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · safe (cognitive 66) · ×1
  • safe (cognitive 66) REDACTED:16191 — safe has cognitive complexity 66 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 17, ternaries 7 (13 pts), loops 4 (7 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.
D2 · Cognitive Complexity · compromise-dates.parseExplicit (cognitive 64) · ×1
  • compromise-dates.parseExplicit (cognitive 64) plugins/dates/builds/compromise-dates.cjs:2422 — compromise-dates.parseExplicit has cognitive complexity 64 (threshold 15). Drivers by points: if/else 35 (58 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 05-explicit.parseExplicit (cognitive 64) · ×1
  • 05-explicit.parseExplicit (cognitive 64) plugins/dates/src/api/parse/one/02-parse/05-explicit.js:15 — 05-explicit.parseExplicit has cognitive complexity 64 (threshold 15). Drivers by points: if/else 35 (58 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Ot (cognitive 64) · ×1
  • Ot (cognitive 64) plugins/dates/builds/compromise-dates.cjs:341 — Ot has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 23, ternaries 7 (11 pts) (nesting depth added 11). Of this number, 51 points are the body's own statements and 13 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolveTable (cognitive 62) · ×1
  • resolveTable (cognitive 62) REDACTED:18987 — resolveTable has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (45 pts), ternaries 2 (8 pts), boolean chains 7, loops 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · doesMatch (cognitive 61) · ×1
  • doesMatch (cognitive 61) src/1-one/match/methods/match/term/doesMatch.js:7 — doesMatch has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 14, match/switch 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.subtokenize (cognitive 59) · ×1
  • compromise-markdown.subtokenize (cognitive 59) REDACTED:5603 — compromise-markdown.subtokenize has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-markdown.resolveAllAttention (cognitive 58) · ×1
  • compromise-markdown.resolveAllAttention (cognitive 58) REDACTED:3625 — compromise-markdown.resolveAllAttention has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 5 (25 pts), if/else 6 (23 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · normalizeString (cognitive 56) · ×1
  • normalizeString (cognitive 56) REDACTED:11284 — normalizeString has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (46 pts), ternaries 1 (5 pts), boolean chains 4, loops 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · isOrHas (cognitive 55) · ×1
  • isOrHas (cognitive 55) src/2-two/contraction-two/compute/apostrophe-s.js:19 — isOrHas has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 11, match/switch 1 (3 pts), loops 1 (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.
D2 · Cognitive Complexity · 01-simple-split.basicSplit (cognitive 54) · ×1
  • 01-simple-split.basicSplit (cognitive 54) src/1-one/tokenize/methods/01-sentences/01-simple-split.js:12 — 01-simple-split.basicSplit has cognitive complexity 54 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 7 (19 pts), boolean chains 6, ternaries 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.tokenizeTable (cognitive 54) · ×1
  • compromise-markdown.tokenizeTable (cognitive 54) REDACTED:18456 — compromise-markdown.tokenizeTable has cognitive complexity 54 (threshold 15). Drivers by points: if/else 32 (35 pts), boolean chains 12, ternaries 5 (6 pts), loops 1 (nesting depth added 4). None of this is in the body itself: all 54 points belong to 16 function items inside it that branch (start, headRowBreak, headDelimiterCellAfter, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · plan (cognitive 50) · ×1
  • plan (cognitive 50) src/3-three/verbs/api/conjugate/auxiliary.js:9 — plan has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 10, ternaries 5 (8 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 · compromise-markdown.createTokenizer (cognitive 49) · ×1
  • compromise-markdown.createTokenizer (cognitive 49) REDACTED:10274 — compromise-markdown.createTokenizer has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 13, ternaries 7 (10 pts), loops 2 (4 pts) (nesting depth added 9). Most of this is not in the body itself: 7 of the 49 points are its own statements and the rest belongs to 11 function items inside it that branch (main, constructFactory::hook::handleMapOfConstructs::start, consume, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · tokenize.normalizePunctuation (cognitive 48) · ×1
  • tokenize.normalizePunctuation (cognitive 48) src/1-one/tokenize/methods/03-whitespace/tokenize.js:28 — tokenize.normalizePunctuation has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 14, loops 4 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pair (cognitive 47) · ×1
  • pair (cognitive 47) REDACTED:15640 — pair has cognitive complexity 47 (threshold 15). Drivers by points: if/else 5 (16 pts), ternaries 4 (14 pts), boolean chains 9, loops 3 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 05-year.tagYear (cognitive 46) · ×1
  • 05-year.tagYear (cognitive 46) src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js:66 — 05-year.tagYear has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (36 pts), boolean chains 10 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-markdown.resolveAllLineSuffixes (cognitive 46) · ×1
  • compromise-markdown.resolveAllLineSuffixes (cognitive 46) REDACTED:10072 — compromise-markdown.resolveAllLineSuffixes has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (9 pts), ternaries 2 (8 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-html.basename (cognitive 42) · ×1
  • compromise-html.basename (cognitive 42) REDACTED:11021 — compromise-html.basename has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-html.walk (cognitive 36) · ×1
  • compromise-html.walk (cognitive 36) REDACTED:16185 — compromise-html.walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 14). Of this number, 31 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 01-walk.walk (cognitive 36) · ×1
  • 01-walk.walk (cognitive 36) plugins/html/src/read-tree/01-walk.js:12 — 01-walk.walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 14). Of this number, 31 points are the body's own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.runMatch (cognitive 35) · ×1
  • index.runMatch (cognitive 35) src/1-one/match/methods/match/index.js:29 — index.runMatch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.tokenizeCodeFenced (cognitive 35) · ×1
  • compromise-markdown.tokenizeCodeFenced (cognitive 35) REDACTED:4558 — compromise-markdown.tokenizeCodeFenced has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15, boolean chains 11, ternaries 6 (9 pts) (nesting depth added 3). None of this is in the body itself: all 35 points belong to 13 function items inside it that branch (info, infoBefore, meta, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · ce (cognitive 34) · ×1
  • ce (cognitive 34) plugins/dates/builds/compromise-dates.cjs:341 — ce has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 9, ternaries 3 (5 pts), loops 1 (nesting depth added 9). Of this number, 21 points are the body's own statements and 13 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · parseNumber (cognitive 34) · ×1
  • parseNumber (cognitive 34) src/3-three/numbers/numbers/parse/index.js:51 — parseNumber has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (2 pts), other 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · constructor (cognitive 33) · ×1
  • constructor (cognitive 33) REDACTED:10723 — constructor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 13, ternaries 4 (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 · preprocess · ×1
  • preprocess::preprocessor (cognitive 33) REDACTED:10914 — preprocess::preprocessor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · find.splitNumbers (cognitive 32) · ×1
  • find.splitNumbers (cognitive 32) src/3-three/numbers/numbers/find.js:8 — find.splitNumbers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · i18n (cognitive 32) · ×1
  • i18n (cognitive 32) plugins/dates/builds/compromise-dates.cjs:341 — i18n has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 32. Most of this is not in the body itself: 8 of the 32 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 341, 341, 341, …). 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 · question (cognitive 32) · ×1
  • question (cognitive 32) src/3-three/verbs/api/conjugate/question.js:263 — question has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 4 (6 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ambigDate (cognitive 32) · ×1
  • ambigDate (cognitive 32) src/2-two/preTagger/compute/tagger/3rd-pass/10-ambig-date.js:26 — ambigDate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 12, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.contractions (cognitive 31) · ×1
  • index.contractions (cognitive 31) src/1-one/contraction-one/compute/contractions/index.js:84 — index.contractions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, loops 1 (nesting depth added 13). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to one function literal inside it that branches (line 90). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · compromise-unist.read · ×1
  • compromise-unist.read::visit (cognitive 31) plugins/unist/builds/compromise-unist.cjs:201 — compromise-unist.read::visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 7 (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 · 01-read.read · ×1
  • 01-read.read::visit (cognitive 31) plugins/unist/src/fromAst/01-read.js:14 — 01-read.read::visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 7 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · api · ×1
  • api::sentiment (cognitive 31) plugins/_experiments/sentiment/src/plugin.js:12 — api::sentiment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.check (cognitive 30) · ×1
  • compromise-markdown.check (cognitive 30) REDACTED:15471 — compromise-markdown.check has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 9, loops 5 (9 pts), ternaries 4 (8 pts), if/else 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.
D2 · Cognitive Complexity · compromise-markdown.render (cognitive 30) · ×1
  • compromise-markdown.render (cognitive 30) REDACTED:15909 — compromise-markdown.render has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 4 (9 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.subcontent (cognitive 28) · ×1
  • compromise-markdown.subcontent (cognitive 28) REDACTED:5704 — compromise-markdown.subcontent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (6 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.
D2 · Cognitive Complexity · gfmTableAlign (cognitive 28) · ×1
  • gfmTableAlign (cognitive 28) REDACTED:18391 — gfmTableAlign has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (10 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · splitRegs.splitRegs (cognitive 27) · ×1
  • splitRegs.splitRegs (cognitive 27) src/1-one/match/methods/parseMatch/splitRegs.js:11 — splitRegs.splitRegs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _text.textFromTerms (cognitive 27) · ×1
  • _text.textFromTerms (cognitive 27) src/1-one/output/api/_text.js:18 — _text.textFromTerms has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 10 (nesting depth added 4). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 20). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · setTag.tagTerm (cognitive 27) · ×1
  • setTag.tagTerm (cognitive 27) src/1-one/tag/methods/setTag.js:12 — setTag.tagTerm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-html.format · ×1
  • compromise-html.format::visitor (cognitive 27) REDACTED:16006 — compromise-html.format::visitor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 9, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.walk (cognitive 27) · ×1
  • compromise-markdown.walk (cognitive 27) REDACTED:22243 — compromise-markdown.walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 25 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 01-walk.walk (cognitive 27) · ×1
  • 01-walk.walk (cognitive 27) plugins/markdown/src/read-tree/01-walk.js:3 — 01-walk.walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 25 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · serializeAttribute (cognitive 27) · ×1
  • serializeAttribute (cognitive 27) REDACTED:14388 — serializeAttribute has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (9 pts), ternaries 6 (7 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · joinDefaults (cognitive 27) · ×1
  • joinDefaults (cognitive 27) REDACTED:14943 — joinDefaults has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · format (cognitive 27) · ×1
  • format (cognitive 27) REDACTED:21228 — format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (5 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 11). Of this number, 25 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · splitGroups.splitGroups (cognitive 26) · ×1
  • splitGroups.splitGroups (cognitive 26) src/1-one/match/methods/parseMatch/splitGroups.js:7 — splitGroups.splitGroups has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _lib.canMatch (cognitive 26) · ×1
  • _lib.canMatch (cognitive 26) src/1-one/sweep/methods/sweep/_lib.js:4 — _lib.canMatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 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 · compromise-markdown.tokenizeListStart (cognitive 26) · ×1
  • compromise-markdown.tokenizeListStart (cognitive 26) REDACTED:9520 — compromise-markdown.tokenizeListStart has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (10 pts), ternaries 3 (5 pts) (nesting depth added 5). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 4 function items inside it that branch (start, inside, atMarker, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · compromise-markdown.list (cognitive 26) · ×1
  • compromise-markdown.list (cognitive 26) REDACTED:14423 — compromise-markdown.list has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 5 (7 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · N.constructor (cognitive 26) · ×1
  • N.constructor (cognitive 26) plugins/subtitles/builds/compromise-subtitle.cjs:9 — N.constructor has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (14 pts), boolean chains 7, if/else 3 (4 pts), loops 1 (nesting depth added 11). None of this is in the body itself: all 26 points belong to one function literal inside it that branches (line 9). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · findAndReplace · ×1
  • findAndReplace::handler (cognitive 26) REDACTED:19564 — findAndReplace::handler has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (5 pts), ternaries 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.
D2 · Cognitive Complexity · unpack (cognitive 26) · ×1
  • unpack (cognitive 26) plugins/stats/builds/compromise-stats.cjs:889 — unpack has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 906, 897). 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 · args.parseArgs (cognitive 25) · ×1
  • args.parseArgs (cognitive 25) bin/_lib/args.js:42 — args.parseArgs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6, loops 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 · multi-word.multiWord (cognitive 25) · ×1
  • multi-word.multiWord (cognitive 25) src/1-one/lexicon/compute/multi-word.js:2 — multi-word.multiWord has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 11). Of this number, 24 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _fuzzy.editDistance (cognitive 25) · ×1
  • _fuzzy.editDistance (cognitive 25) src/1-one/match/methods/match/term/_fuzzy.js:5 — _fuzzy.editDistance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (5 pts), boolean chains 4 (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 · 08-imperative.imperative (cognitive 25) · ×1
  • 08-imperative.imperative (cognitive 25) src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js:15 — 08-imperative.imperative has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 11 (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 · arithmetic.replace (cognitive 25) · ×1
  • arithmetic.replace (cognitive 25) src/3-three/numbers/money/arithmetic.js:8 — arithmetic.replace has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-dates.today (cognitive 25) · ×1
  • compromise-dates.today (cognitive 25) plugins/dates/builds/compromise-dates.cjs:1623 — compromise-dates.today has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 01-today.today (cognitive 25) · ×1
  • 01-today.today (cognitive 25) plugins/dates/src/api/parse/one/02-parse/01-today.js:46 — 01-today.today has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolveToLabelEnd (cognitive 25) · ×1
  • resolveToLabelEnd (cognitive 25) REDACTED:8675 — resolveToLabelEnd has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · I (cognitive 25) · ×1
  • I (cognitive 25) plugins/subtitles/builds/compromise-subtitle.cjs:9 — I has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (11 pts), boolean chains 10, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.tagger (cognitive 24) · ×1
  • index.tagger (cognitive 24) src/1-one/sweep/methods/tagger/index.js:3 — index.tagger has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4 (nesting depth added 7). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 10). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · compromise-dates.parse (cognitive 24) · ×1
  • compromise-dates.parse (cognitive 24) plugins/dates/builds/compromise-dates.cjs:4563 — compromise-dates.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5 (nesting depth added 11). Of this number, 19 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · parse.parse (cognitive 24) · ×1
  • parse.parse (cognitive 24) plugins/dates/src/api/durations/parse.js:63 — parse.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5 (nesting depth added 11). Of this number, 19 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-html.createLocation (cognitive 24) · ×1
  • compromise-html.createLocation (cognitive 24) REDACTED:2224 — compromise-html.createLocation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-markdown.tokenizeHtmlFlow · ×1
  • compromise-markdown.tokenizeHtmlFlow::tagName (cognitive 24) REDACTED:7372 — compromise-markdown.tokenizeHtmlFlow::tagName has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 5 (9 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.createConstruct (cognitive 24) · ×1
  • compromise-markdown.createConstruct (cognitive 24) REDACTED:21532 — compromise-markdown.createConstruct has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 5 (nesting depth added 3). None of this is in the body itself: all 24 points belong to 11 function items inside it that branch (tokenizeFrontmatter::start, tokenizeFrontmatter::openSequence, tokenizeClosingFence::closeSequence, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · phrasing (cognitive 24) · ×1
  • phrasing (cognitive 24) REDACTED:15795 — phrasing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · groups.groups (cognitive 23) · ×1
  • groups.groups (cognitive 23) src/3-three/verbs/api/conjugate/groups.js:9 — groups.groups has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 10. None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · compromise-dates.parseYearly (cognitive 23) · ×1
  • compromise-dates.parseYearly (cognitive 23) plugins/dates/builds/compromise-dates.cjs:2349 — compromise-dates.parseYearly has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-dates.api$2 (cognitive 23) · ×1
  • compromise-dates.api$2 (cognitive 23) plugins/dates/builds/compromise-dates.cjs:4309 — compromise-dates.api$2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 11 (nesting depth added 4). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 4350, 4335, 4320, …). 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 · 04-yearly.parseYearly (cognitive 23) · ×1
  • 04-yearly.parseYearly (cognitive 23) plugins/dates/src/api/parse/one/02-parse/04-yearly.js:21 — 04-yearly.parseYearly has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dates.api (cognitive 23) · ×1
  • dates.api (cognitive 23) plugins/dates/src/api/dates.js:15 — dates.api has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 11 (nesting depth added 4). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 56, 41, 26, …). 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 · compromise-html.element$1 (cognitive 23) · ×1
  • compromise-html.element$1 (cognitive 23) REDACTED:14284 — compromise-html.element$1 has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), ternaries 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-html.toHtml (cognitive 23) · ×1
  • compromise-html.toHtml (cognitive 23) REDACTED:14646 — compromise-html.toHtml has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 19, ternaries 3, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · coordinate.resultTense (cognitive 22) · ×1
  • coordinate.resultTense (cognitive 22) src/3-three/verbs/api/conjugate/coordinate.js:9 — coordinate.resultTense has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, ternaries 4 (7 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · compromise.main (cognitive 22) · ×1
  • compromise.main (cognitive 22) bin/compromise.js:46 — compromise.main 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.
D2 · Cognitive Complexity · compromise-dates.split (cognitive 22) · ×1
  • compromise-dates.split (cognitive 22) plugins/dates/builds/compromise-dates.cjs:8 — compromise-dates.split has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1 (nesting depth added 7). Of this number, 21 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · split.split (cognitive 22) · ×1
  • split.split (cognitive 22) plugins/dates/src/api/find/split.js:2 — split.split has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1 (nesting depth added 7). Of this number, 21 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-html.location (cognitive 22) · ×1
  • compromise-html.location (cognitive 22) REDACTED:1909 — compromise-html.location has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). None of this is in the body itself: all 22 points belong to 2 function items inside it that branch (toOffset, toPoint). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · compromise-html.stopParsing (cognitive 22) · ×1
  • compromise-html.stopParsing (cognitive 22) REDACTED:8589 — compromise-html.stopParsing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-markdown.syntaxExtension (cognitive 22) · ×1
  • compromise-markdown.syntaxExtension (cognitive 22) REDACTED:2391 — compromise-markdown.syntaxExtension has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (11 pts), if/else 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.initializeDocument · ×1
  • compromise-markdown.initializeDocument::writeToChild (cognitive 22) REDACTED:3401 — compromise-markdown.initializeDocument::writeToChild has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.factoryDestination (cognitive 22) · ×1
  • compromise-markdown.factoryDestination (cognitive 22) REDACTED:6013 — compromise-markdown.factoryDestination has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, boolean chains 9, ternaries 2. Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 6 function items inside it that branch (raw, enclosed, start, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · compromise-markdown.extension (cognitive 22) · ×1
  • compromise-markdown.extension (cognitive 22) REDACTED:12321 — compromise-markdown.extension has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 1 (3 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.
D2 · Cognitive Complexity · O (cognitive 22) · ×1
  • O (cognitive 22) plugins/dates/builds/compromise-dates.cjs:341 — O has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 5). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 341, 341). 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 · D (cognitive 22) · ×1
  • D (cognitive 22) plugins/dates/builds/compromise-dates.cjs:341 — D has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (8 pts), if/else 3 (nesting depth added 4). Of this number, 16 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · unixFmt (cognitive 22) · ×1
  • unixFmt (cognitive 22) plugins/dates/builds/compromise-dates.cjs:341 — unixFmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), boolean chains 5, ternaries 1 (nesting depth added 9). None of this is in the body itself: all 22 points belong to 7 function items inside it that branch ((anonymous)::n, (anonymous)::n, a function literal at line 341, …). 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 · parse (cognitive 22) · ×1
  • parse (cognitive 22) src/2-two/left-right/model/_lib.js:28 — parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 8). Of this number, 20 points are the body's own statements and 2 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.buildTrie (cognitive 21) · ×1
  • index.buildTrie (cognitive 21) src/1-one/lookup/api/buildTrie/index.js:11 — index.buildTrie has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 9). Of this number, 16 points are the body's own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · unTag.unTag (cognitive 21) · ×1
  • unTag.unTag (cognitive 21) src/1-one/tag/methods/unTag.js:5 — unTag.unTag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 04-placeWords.tagOrgs (cognitive 21) · ×1
  • 04-placeWords.tagOrgs (cognitive 21) src/2-two/preTagger/compute/tagger/3rd-pass/04-placeWords.js:28 — 04-placeWords.tagOrgs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-dates.parseIntervals (cognitive 21) · ×1
  • compromise-dates.parseIntervals (cognitive 21) plugins/dates/builds/compromise-dates.cjs:2865 — compromise-dates.parseIntervals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.parseIntervals (cognitive 21) · ×1
  • index.parseIntervals (cognitive 21) plugins/dates/src/api/parse/range/intervals/index.js:32 — index.parseIntervals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.tokenizeAutolink (cognitive 21) · ×1
  • compromise-markdown.tokenizeAutolink (cognitive 21) REDACTED:3847 — compromise-markdown.tokenizeAutolink has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 6, ternaries 2 (3 pts) (nesting depth added 1). None of this is in the body itself: all 21 points belong to 8 function items inside it that branch (emailValue, schemeInsideOrEmailAtext, urlInside, …). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · compromise-markdown.resolveCodeText (cognitive 21) · ×1
  • compromise-markdown.resolveCodeText (cognitive 21) REDACTED:5135 — compromise-markdown.resolveCodeText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-markdown.exitParagraphWithTaskListItem (cognitive 21) · ×1
  • compromise-markdown.exitParagraphWithTaskListItem (cognitive 21) REDACTED:21066 — compromise-markdown.exitParagraphWithTaskListItem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · compromise-unist.terms$1 (cognitive 21) · ×1
  • compromise-unist.terms$1 (cognitive 21) plugins/unist/builds/compromise-unist.cjs:67 — compromise-unist.terms$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 pts) (nesting depth added 10). None of this is in the body itself: all 21 points belong to 4 function literals inside it that branch (lines 87, 78, 70, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · 02-terms.terms (cognitive 21) · ×1
  • 02-terms.terms (cognitive 21) plugins/unist/src/toAst/02-terms.js:20 — 02-terms.terms has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 pts) (nesting depth added 10). None of this is in the body itself: all 21 points belong to 4 function literals inside it that branch (lines 40, 31, 23, …). 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 · isChild (cognitive 21) · ×1
  • isChild (cognitive 21) REDACTED:1619 — isChild has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · addProperty (cognitive 21) · ×1
  • addProperty (cognitive 21) REDACTED:1672 — addProperty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · 01-case.checkCase (cognitive 20) · ×1
  • 01-case.checkCase (cognitive 20) src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js:22 — 01-case.checkCase has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6 (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 · compromise-markdown.gfmStrikethrough · ×1
  • compromise-markdown.gfmStrikethrough::resolveAllStrikethrough (cognitive 20) REDACTED:18052 — compromise-markdown.gfmStrikethrough::resolveAllStrikethrough has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 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 · greedy.getGreedy (cognitive 19) · ×1
  • greedy.getGreedy (cognitive 19) src/1-one/match/methods/match/steps/logic/greedy.js:7 — greedy.getGreedy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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 · 04-quote-merge.quoteMerge (cognitive 19) · ×1
  • 04-quote-merge.quoteMerge (cognitive 19) src/1-one/tokenize/methods/01-sentences/04-quote-merge.js:46 — 04-quote-merge.quoteMerge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _fillTags.fillTags (cognitive 19) · ×1
  • _fillTags.fillTags (cognitive 19) src/2-two/preTagger/compute/tagger/3rd-pass/_fillTags.js:48 — _fillTags.fillTags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 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 · gender.predictGender (cognitive 19) · ×1
  • gender.predictGender (cognitive 19) src/3-three/topics/people/gender.js:42 — gender.predictGender has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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 · compromise-markdown.resolveToSetextUnderline (cognitive 19) · ×1
  • compromise-markdown.resolveToSetextUnderline (cognitive 19) REDACTED:9707 — compromise-markdown.resolveToSetextUnderline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 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 · normalize (cognitive 19) · ×1
  • normalize (cognitive 19) plugins/subtitles/builds/compromise-subtitle.cjs:9 — normalize has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, loops 1, ternaries 1. None of this is in the body itself: all 19 points belong to 39 function items inside it that branch (a function literal at line 9, a function literal at line 9, a function literal at line 9, …). 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 · isSingularSubject (cognitive 19) · ×1
  • isSingularSubject (cognitive 19) src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js:73 — isSingularSubject has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · doSwitches (cognitive 19) · ×1
  • doSwitches (cognitive 19) src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js:68 — doSwitches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 2 (3 pts) (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 · replace.fns.replaceWith (cognitive 18) · ×1
  • replace.fns.replaceWith (cognitive 18) src/1-one/change/api/replace.js:69 — replace.fns.replaceWith has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). Of this number, 13 points are the body's own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · getDoc.getDoc (cognitive 18) · ×1
  • getDoc.getDoc (cognitive 18) src/1-one/pointers/methods/getDoc.js:35 — getDoc.getDoc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 3). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 37). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · 01-getHooks.getIndexed (cognitive 18) · ×1
  • 01-getHooks.getIndexed (cognitive 18) src/1-one/sweep/methods/sweep/01-getHooks.js:5 — 01-getHooks.getIndexed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 18 points belong to 2 function literals inside it that branch (lines 8, 40). 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 · toFuture.toFuture (cognitive 18) · ×1
  • toFuture.toFuture (cognitive 18) src/3-three/sentences/conjugate/toFuture.js:4 — toFuture.toFuture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 18, 43). 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 · compromise-html.extname (cognitive 18) · ×1
  • compromise-html.extname (cognitive 18) REDACTED:11157 — compromise-html.extname has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 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.
D2 · Cognitive Complexity · compromise-markdown.encodeInfo (cognitive 18) · ×1
  • compromise-markdown.encodeInfo (cognitive 18) REDACTED:15281 — compromise-markdown.encodeInfo has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · (anonymous) (cognitive 18) · ×1
  • (anonymous) (cognitive 18) REDACTED:5 — (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 1 (2 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · $ · ×1
  • $::h::(anonymous)::(anonymous)::(anonymous)::e (cognitive 18) plugins/subtitles/builds/compromise-subtitle.cjs:9 — $::h::(anonymous)::(anonymous)::(anonymous)::e has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, ternaries 5, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · 05-postProcess.doFastOrMode (cognitive 17) · ×1
  • 05-postProcess.doFastOrMode (cognitive 17) src/1-one/match/methods/parseMatch/05-postProcess.js:26 — 05-postProcess.doFastOrMode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 27, 37). 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 · negative.doNegative (cognitive 17) · ×1
  • negative.doNegative (cognitive 17) src/1-one/match/methods/match/steps/negative.js:6 — negative.doNegative has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · index.splitWords (cognitive 17) · ×1
  • index.splitWords (cognitive 17) src/1-one/tokenize/methods/02-terms/index.js:35 — index.splitWords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · 00-possessive.possessive (cognitive 17) · ×1
  • 00-possessive.possessive (cognitive 17) src/2-two/preTagger/compute/tagger/3rd-pass/00-possessive.js:14 — 00-possessive.possessive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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 · _adhoc.isQuestionVerb (cognitive 17) · ×1
  • _adhoc.isQuestionVerb (cognitive 17) src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js:40 — _adhoc.isQuestionVerb has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 5, loops 2 (3 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · apostrophe-t.apostropheT (cognitive 17) · ×1
  • apostrophe-t.apostropheT (cognitive 17) src/2-two/contraction-two/compute/apostrophe-t.js:13 — apostrophe-t.apostropheT has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · index.contractionTwo (cognitive 17) · ×1
  • index.contractionTwo (cognitive 17) src/2-two/contraction-two/compute/index.js:86 — index.contractionTwo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 89). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · isValid.checkNumeric (cognitive 17) · ×1
  • isValid.checkNumeric (cognitive 17) src/3-three/numbers/numbers/isValid.js:18 — isValid.checkNumeric has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-dates.applyCounter (cognitive 17) · ×1
  • compromise-dates.applyCounter (cognitive 17) plugins/dates/builds/compromise-dates.cjs:2693 — compromise-dates.applyCounter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · addCounter.applyCounter (cognitive 17) · ×1
  • addCounter.applyCounter (cognitive 17) plugins/dates/src/api/parse/one/03-transform/addCounter.js:54 — addCounter.applyCounter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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 · EntityDecoder.stateNamedEntity (cognitive 17) · ×1
  • EntityDecoder.stateNamedEntity (cognitive 17) REDACTED:2975 — EntityDecoder.stateNamedEntity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, ternaries 1 (3 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 · compromise-html.serializeAttributes (cognitive 17) · ×1
  • compromise-html.serializeAttributes (cognitive 17) REDACTED:14352 — compromise-html.serializeAttributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-html.connectNodes · ×1
  • compromise-html.connectNodes::consume (cognitive 17) REDACTED:16286 — compromise-html.connectNodes::consume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-speech.vowelSpan (cognitive 17) · ×1
  • compromise-speech.vowelSpan (cognitive 17) REDACTED:236 — compromise-speech.vowelSpan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). Of this number, 10 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · 01-vowel-span.vowelSpan (cognitive 17) · ×1
  • 01-vowel-span.vowelSpan (cognitive 17) REDACTED:96 — 01-vowel-span.vowelSpan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). Of this number, 10 points are the body's own statements and 7 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · tokenizeListStart · ×1
  • tokenizeListStart::start (cognitive 17) REDACTED:9528 — tokenizeListStart::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 4 (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 · compilePattern (cognitive 17) · ×1
  • compilePattern (cognitive 17) REDACTED:15187 — compilePattern has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 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 · tryHere (cognitive 17) · ×1
  • tryHere (cognitive 17) src/1-one/match/methods/match/02-from-here.js:58 — tryHere has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · extend.mergeDeep (cognitive 16) · ×1
  • extend.mergeDeep (cognitive 16) src/API/extend.js:8 — extend.mergeDeep has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _block.makeBlock.<returned closure> (cognitive 16) · ×1
  • _block.makeBlock.<returned closure> (cognitive 16) src/1-one/match/methods/match/steps/_block.js:6 — _block.makeBlock.<returned closure> has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _text.textFromDoc (cognitive 16) · ×1
  • _text.textFromDoc (cognitive 16) src/1-one/output/api/_text.js:79 — _text.textFromDoc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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.
D2 · Cognitive Complexity · apostrophe-d.hadOrWould (cognitive 16) · ×1
  • apostrophe-d.hadOrWould (cognitive 16) src/2-two/contraction-two/compute/apostrophe-d.js:13 — apostrophe-d.hadOrWould has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-dates.transform (cognitive 16) · ×1
  • compromise-dates.transform (cognitive 16) plugins/dates/builds/compromise-dates.cjs:2734 — compromise-dates.transform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · index.transform (cognitive 16) · ×1
  • index.transform (cognitive 16) plugins/dates/src/api/parse/one/03-transform/index.js:5 — index.transform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · compromise-html.startTagInSelect (cognitive 16) · ×1
  • compromise-html.startTagInSelect (cognitive 16) REDACTED:10140 — compromise-html.startTagInSelect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (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.
D2 · Cognitive Complexity · compromise-html.update (cognitive 16) · ×1
  • compromise-html.update (cognitive 16) REDACTED:16464 — compromise-html.update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 16498, 16491, 16519, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · index.update (cognitive 16) · ×1
  • index.update (cognitive 16) plugins/html/src/update-tree/index.js:3 — index.update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 37, 30, 58, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · compromise-markdown.htmlKind (cognitive 16) · ×1
  • compromise-markdown.htmlKind (cognitive 16) REDACTED:14895 — compromise-markdown.htmlKind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, ternaries 2, loops 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.
D2 · Cognitive Complexity · compromise-markdown.connectNodes · ×1
  • compromise-markdown.connectNodes::consume (cognitive 16) REDACTED:22318 — compromise-markdown.connectNodes::consume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compromise-stats.parseNodes (cognitive 16) · ×1
  • compromise-stats.parseNodes (cognitive 16) plugins/stats/builds/compromise-stats.cjs:816 — compromise-stats.parseNodes has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 2 (3 pts), loops 1 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 2 function literals inside it that branch (lines 817, 835). 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 · createH (cognitive 16) · ×1
  • createH (cognitive 16) REDACTED:1538 — createH has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (h). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · _resetInsertionMode (cognitive 16) · ×1
  • _resetInsertionMode (cognitive 16) REDACTED:7790 — _resetInsertionMode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), ternaries 2 (6 pts), match/switch 1 (2 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 · endTagAfterBody (cognitive 16) · ×1
  • endTagAfterBody (cognitive 16) REDACTED:10350 — endTagAfterBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · constructor (cognitive 16) · ×1
  • constructor (cognitive 16) REDACTED:11539 — constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · serializeChunks (cognitive 16) · ×1
  • serializeChunks (cognitive 16) REDACTED:10757 — serializeChunks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 1 (4 pts), match/switch 1 (3 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 · listItem (cognitive 16) · ×1
  • listItem (cognitive 16) REDACTED:14553 — listItem has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 6, if/else 3 (nesting depth added 3). Of this number, 12 points are the body's own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · modeFor (cognitive 16) · ×1
  • modeFor (cognitive 16) plugins/markdown/src/read-tree/node-formats.js:35 — modeFor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, other 6, boolean chains 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.
D35 · Change Coupling · Change-coupling hub · ×1
  • Change-coupling hub: scratch.js → adjectives.js, comparables.js, index.js, misc.js, adverbs.js, conjunctions.js, actors.js, organizations.js, properNouns.js, singulars.js, uncountables.js, units.js, femaleNames.js, lastnames.js, maleNames.js, people.js, cities.js, places.js, adj-gerund.js, adj-noun.js, adj-past.js, noun-verb.js, person-verb.js, infinitives.js, participles.js, phrasals.js, PastTense.js, dates.js, insert.js, insert.js, replace.js, index.js, multi-word.js, single-word.js, lookaround.js, match.js, 02-from-here.js, index.js, _text.js, out.js, fromSpec.js, 01-parse.js, index.js, tag.js, setTag.js, tokenize.js, apostrophe-s.js, index.js, isPossessive.js, index.js, 01-case.js, 05-year.js, 01-acronym.js, 06-switches.js, _adhoc.js, _fastTag.js, index.js, byTag.js, looksPlural.js, _adj.js, _noun.js, _verb.js, adj-gerund.js, adj-past.js, index.js, frozenLex.js, index.js, misc.js, suffixes.js, regex-normal.js, regex-text.js, misc.js, nouns.js, verbs.js, plugin.js, clauses.js, 04-fallback.js, index.js, api.js, api.js, toInfinitive.js, View.js, extend.js, REDACTED, one.js, three.d.ts scratch.js — `scratch.js` changes together with 86 other files — `data/lexicon/adjectives/adjectives.js`, `data/lexicon/adjectives/comparables.js`, `data/lexicon/index.js`, `data/lexicon/misc.js`, `data/lexicon/misc/adverbs.js`, `data/lexicon/misc/conjunctions.js`, `data/lexicon/nouns/actors.js`, `data/lexicon/nouns/organizations.js`, `data/lexicon/nouns/properNouns.js`, `data/lexicon/nouns/singulars.js`, `data/lexicon/nouns/uncountables.js`, `data/lexicon/numbers/units.js`, `data/lexicon/people/femaleNames.js`, `data/lexicon/people/lastnames.js`, `data/lexicon/people/maleNames.js`, `data/lexicon/people/people.js`, `data/lexicon/places/cities.js`, `data/lexicon/places/places.js`, `data/lexicon/switches/adj-gerund.js`, `data/lexicon/switches/adj-noun.js`, `data/lexicon/switches/adj-past.js`, `data/lexicon/switches/noun-verb.js`, `data/lexicon/switches/person-verb.js`, `data/lexicon/verbs/infinitives.js`, `data/lexicon/verbs/participles.js`, `data/lexicon/verbs/phrasals.js`, `data/pairs/PastTense.js`, `plugins/dates/src/api/dates.js`, `src/1-one/change/api/insert.js`, `src/1-one/change/api/lib/insert.js`, `src/1-one/change/api/replace.js`, `src/1-one/contraction-one/compute/contractions/index.js`, `src/1-one/lexicon/compute/multi-word.js`, `src/1-one/lexicon/compute/single-word.js`, `src/1-one/match/api/lookaround.js`, `src/1-one/match/api/match.js`, `src/1-one/match/methods/match/02-from-here.js`, `src/1-one/match/methods/match/index.js`, `src/1-one/output/api/_text.js`, `src/1-one/output/api/out.js`, `src/1-one/output/fromSpec.js`, `src/1-one/sweep/methods/buildNet/01-parse.js`, `src/1-one/sweep/methods/tagger/index.js`, `src/1-one/tag/api/tag.js`, `src/1-one/tag/methods/setTag.js`, `src/1-one/tokenize/methods/03-whitespace/tokenize.js`, `src/2-two/contraction-two/compute/apostrophe-s.js`, `src/2-two/contraction-two/compute/index.js`, `src/2-two/contraction-two/compute/isPossessive.js`, `src/2-two/postTagger/compute/index.js`, `src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js`, `src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js`, `src/2-two/preTagger/compute/tagger/3rd-pass/01-acronym.js`, `src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js`, `src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js`, `src/2-two/preTagger/compute/tagger/_fastTag.js`, `src/2-two/preTagger/compute/tagger/index.js`, `src/2-two/preTagger/methods/expand/byTag.js`, `src/2-two/preTagger/methods/looksPlural.js`, `src/2-two/preTagger/model/clues/_adj.js`, `src/2-two/preTagger/model/clues/_noun.js`, `src/2-two/preTagger/model/clues/_verb.js`, `src/2-two/preTagger/model/clues/adj-gerund.js`, `src/2-two/preTagger/model/clues/adj-past.js`, `src/2-two/preTagger/model/index.js`, `src/2-two/preTagger/model/lexicon/frozenLex.js`, `src/2-two/preTagger/model/lexicon/index.js`, `src/2-two/preTagger/model/lexicon/misc.js`, `src/2-two/preTagger/model/patterns/suffixes.js`, `src/2-two/preTagger/model/regex/regex-normal.js`, `src/2-two/preTagger/model/regex/regex-text.js`, `src/2-two/preTagger/tagSet/misc.js`, `src/2-two/preTagger/tagSet/nouns.js`, `src/2-two/preTagger/tagSet/verbs.js`, `src/3-three/adjectives/plugin.js`, `src/3-three/chunker/api/clauses.js`, `src/3-three/chunker/compute/04-fallback.js`, `src/3-three/misc/selections/index.js`, `src/3-three/nouns/api/api.js`, `src/3-three/numbers/numbers/api.js`, `src/3-three/verbs/api/conjugate/toInfinitive.js`, `src/API/View.js`, `src/API/extend.js`, `src/nlp.js`, `src/one.js`, `types/view/three.d.ts` — none of which declares a dependency on it: one file is the hub of 86 separate couplings, not 86 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 86.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×1
  • Sync-over-async blocking plugins/_experiments/wikipedia/scripts/generate/01-download.js:29 — `execFileSync` in `getIt` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 8 typed · 1398 plain JS — the untyped files are data/lexicon/adjectives/adjectives.js, data/lexicon/adjectives/comparables.js, data/lexicon/dates/dates.js, data/lexicon/dates/durations.js, data/lexicon/dates/months.js, data/lexicon/dates/timezones.js (+1392 more).
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (41 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (41 clone groups) plugins/dates/builds/compromise-dates.cjs:3309 — 41 duplicated blocks under plugins/dates/ have copies in at least two of the sibling directories builds, src — 33 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 41 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 41 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 41 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 11 sibling directories (26 clone groups) · ×1
  • Duplication concentrated across 11 sibling directories (26 clone groups) REDACTED:15777 — 26 duplicated blocks under plugins/ have copies in at least two of the sibling directories _experiments, dates, html, markdown, paragraphs, payload (+5 more sibling(s) not listed) — 25 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 26 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 26 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 26 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (11 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (11 clone groups) REDACTED:207 — 11 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/speed/. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (8 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (8 clone groups) bin/_lib/sentences.js:8 — 8 of the duplicated blocks reported below have copies in at least two of the sibling directories bin, plugins, scripts, src under the repository root. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplication concentrated across 2 sibling directories (8 clone groups) · ×1
  • Duplication concentrated across 2 sibling directories (8 clone groups) REDACTED:152 — 8 of the duplicated blocks reported below have copies in at least two of the sibling directories builds, src under plugins/speech/. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block with local edits (299 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (299 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:3309 — plugins/dates/builds/compromise-dates.cjs:3309 · plugins/dates/src/api/parse/range/02-date-range.js:44 — the two spans are one implementation copied and then locally edited — 2275 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (238 lines × 2 locations) · ×1
  • Duplicated block (238 lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:672 — plugins/dates/builds/compromise-dates.cjs:672 · plugins/dates/src/model/words/timezones.js:15 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
R10 · Code Duplication · Duplicated block with local edits (129 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (129 matched lines × 2 locations) plugins/subtitles/builds/compromise-subtitle.cjs:111 — plugins/subtitles/builds/compromise-subtitle.cjs:111 · plugins/subtitles/src/WrapDoc.js:21 — the two spans are one implementation copied and then locally edited — 945 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (106 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (106 matched lines × 2 locations) REDACTED:4824 — REDACTED:4824 · REDACTED:4972 — the two spans are one implementation copied and then locally edited — 511 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (103 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (103 matched lines × 2 locations) REDACTED:152 — REDACTED:152 · REDACTED:12 — the two spans are one implementation copied and then locally edited — 699 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (94 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (94 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:134 — plugins/dates/builds/compromise-dates.cjs:134 · plugins/dates/src/api/parse/one/01-tokenize/01-shift.js:1 — the two spans are one implementation copied and then locally edited — 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (78 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (78 matched lines × 2 locations) REDACTED:459 — REDACTED:459 · plugins/speech/src/sounds-like/transformations.js:2 — the two spans are one implementation copied and then locally edited — 490 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (76 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (76 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:2642 — plugins/dates/builds/compromise-dates.cjs:2642 · plugins/dates/src/api/parse/one/03-transform/addCounter.js:3 — the two spans are one implementation copied and then locally edited — 515 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (76 lines × 2 locations) · ×1
  • Duplicated block (76 lines × 2 locations) REDACTED:15777 — REDACTED:15777 · REDACTED:13355 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block with local edits (73 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (73 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:4501 — plugins/dates/builds/compromise-dates.cjs:4501 · plugins/dates/src/api/durations/parse.js:1 — the two spans are one implementation copied and then locally edited — 494 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (70 lines × 2 locations) · ×1
  • Duplicated block (70 lines × 2 locations) REDACTED:16391 — REDACTED:16391 · REDACTED:22383 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block with local edits (69 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (69 matched lines × 2 locations) plugins/paragraphs/builds/compromise-paragraphs.cjs:40 — plugins/paragraphs/builds/compromise-paragraphs.cjs:40 · plugins/paragraphs/src/api.js:33 — the two spans are one implementation copied and then locally edited — 416 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (68 lines × 2 locations) · ×1
  • Duplicated block (68 lines × 2 locations) REDACTED:13830 — REDACTED:13830 · REDACTED:14157 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block with local edits (66 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (66 matched lines × 2 locations) REDACTED:44 — REDACTED:44 · plugins/speech/src/syllables/split/find-cuts/00-exceptions.js:3 — the two spans are one implementation copied and then locally edited — 458 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (66 lines × 2 locations) · ×1
  • Duplicated block (66 lines × 2 locations) plugins/speed/builds/compromise-speed.browser.cjs:87 — plugins/speed/builds/compromise-speed.browser.cjs:87 · REDACTED:328 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Duplicated block (64 lines × 2 locations) · ×1
  • Duplicated block (64 lines × 2 locations) plugins/_experiments/compress/src/lz.js:101 — plugins/_experiments/compress/src/lz.js:101 · plugins/_experiments/compress/src/lz.js:186 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (62 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (62 matched lines × 2 locations) plugins/html/src/update-tree/index.js:3 — plugins/html/src/update-tree/index.js:3 · plugins/markdown/src/update-tree/index.js:3 — the two spans are one implementation copied and then locally edited — 499 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (60 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (60 matched lines × 2 locations) plugins/payload/builds/compromise-payload.cjs:24 — plugins/payload/builds/compromise-payload.cjs:24 · plugins/payload/src/plugin.js:6 — the two spans are one implementation copied and then locally edited — 551 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (57 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (57 matched lines × 2 locations) REDACTED:22467 — REDACTED:22467 · plugins/markdown/src/update-tree/index.js:16 — the two spans are one implementation copied and then locally edited — 443 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (56 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (56 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:3999 — plugins/dates/builds/compromise-dates.cjs:3999 · plugins/dates/src/api/normalize.js:2 — the two spans are one implementation copied and then locally edited — 442 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (53 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (53 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:281 — plugins/dates/builds/compromise-dates.cjs:281 · plugins/dates/src/api/parse/one/01-tokenize/02-counter.js:9 — the two spans are one implementation copied and then locally edited — 340 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (53 lines × 2 locations) · ×1
  • Duplicated block (53 lines × 2 locations) REDACTED:16474 — REDACTED:16474 · REDACTED:22467 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block with local edits (52 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (52 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:4227 — plugins/dates/builds/compromise-dates.cjs:4227 · plugins/dates/src/api/arithmetic/index.js:11 — the two spans are one implementation copied and then locally edited — 572 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (50 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (50 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:3921 — plugins/dates/builds/compromise-dates.cjs:3921 · plugins/dates/src/api/parse/range/index.js:10 — the two spans are one implementation copied and then locally edited — 362 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (49 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (49 matched lines × 2 locations) plugins/dates/builds/compromise-dates.cjs:938 — plugins/dates/builds/compromise-dates.cjs:938 · plugins/dates/src/api/parse/one/01-tokenize/06-timezone.js:8 — the two spans are one implementation copied and then locally edited — 321 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (45 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (45 matched lines × 2 locations) plugins/unist/builds/compromise-unist.cjs:54 — plugins/unist/builds/compromise-unist.cjs:54 · plugins/unist/src/toAst/02-terms.js:7 — the two spans are one implementation copied and then locally edited — 328 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R2 · Cyclomatic Complexity · Complex function isPossessive (cyclomatic 116, cognitive 132) · ×1
  • Complex function isPossessive (cyclomatic 116, cognitive 132) src/2-two/contraction-two/compute/isPossessive.js:42 — isPossessive has cyclomatic complexity 116 and cognitive complexity 132; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseQuestion (cyclomatic 79, cognitive 90) · ×1
  • Complex function parseQuestion (cyclomatic 79, cognitive 90) src/3-three/verbs/api/conjugate/question.js:62 — parseQuestion has cyclomatic complexity 79 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 68, cognitive 70) · ×1
  • Complex function (anonymous) (cyclomatic 68, cognitive 70) src/2-two/postTagger/compute/local-corrections.js:26 — (anonymous) has cyclomatic complexity 68 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function safe (cyclomatic 53, cognitive 66) · ×1
  • Complex function safe (cyclomatic 53, cognitive 66) REDACTED:16191 — safe has cyclomatic complexity 53 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Ot (cyclomatic 46, cognitive 51) · ×1
  • Complex function Ot (cyclomatic 46, cognitive 51) plugins/dates/builds/compromise-dates.cjs:341 — Ot has cyclomatic complexity 46 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function doesMatch (cyclomatic 45, cognitive 61) · ×1
  • Complex function doesMatch (cyclomatic 45, cognitive 61) src/1-one/match/methods/match/term/doesMatch.js:7 — doesMatch has cyclomatic complexity 45 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function prepareList (cyclomatic 44, cognitive 67) · ×1
  • Complex function prepareList (cyclomatic 44, cognitive 67) REDACTED:11432 — prepareList has cyclomatic complexity 44 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseToken (cyclomatic 43, cognitive 87) · ×1
  • Complex function parseToken (cyclomatic 43, cognitive 87) src/1-one/match/methods/parseMatch/02-parseToken.js:36 — parseToken has cyclomatic complexity 43 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parse (cyclomatic 43, cognitive 78) · ×1
  • Complex function parse (cyclomatic 43, cognitive 78) src/3-three/numbers/numbers/parse/toNumber/index.js:24 — parse has cyclomatic complexity 43 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function markdownTable (cyclomatic 42, cognitive 80) · ×1
  • Complex function markdownTable (cyclomatic 42, cognitive 80) REDACTED:20500 — markdownTable has cyclomatic complexity 42 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function plan (cyclomatic 41, cognitive 50) · ×1
  • Complex function plan (cyclomatic 41, cognitive 50) src/3-three/verbs/api/conjugate/auxiliary.js:9 — plan has cyclomatic complexity 41 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _compress (cyclomatic 38, cognitive 150) · ×1
  • Complex function _compress (cyclomatic 38, cognitive 150) plugins/_experiments/compress/src/lz.js:75 — _compress has cyclomatic complexity 38 and cognitive complexity 150; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function isOrHas (cyclomatic 38, cognitive 55) · ×1
  • Complex function isOrHas (cyclomatic 38, cognitive 55) src/2-two/contraction-two/compute/apostrophe-s.js:19 — isOrHas has cyclomatic complexity 38 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function normalizePunctuation (cyclomatic 34, cognitive 48) · ×1
  • Complex function normalizePunctuation (cyclomatic 34, cognitive 48) src/1-one/tokenize/methods/03-whitespace/tokenize.js:28 — normalizePunctuation has cyclomatic complexity 34 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function _decompress (cyclomatic 32, cognitive 69) · ×1
  • Complex function _decompress (cyclomatic 32, cognitive 69) plugins/_experiments/compress/src/lz.js:298 — _decompress has cyclomatic complexity 32 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function resolveTable (cyclomatic 32, cognitive 62) · ×1
  • Complex function resolveTable (cyclomatic 32, cognitive 62) REDACTED:18987 — resolveTable has cyclomatic complexity 32 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 32, cognitive 50) · ×1
  • Complex function (anonymous) (cyclomatic 32, cognitive 50) plugins/subtitles/builds/compromise-subtitle.cjs:9 — (anonymous) has cyclomatic complexity 32 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function constructor (cyclomatic 32, cognitive 33) · ×1
  • Complex function constructor (cyclomatic 32, cognitive 33) REDACTED:10723 — constructor has cyclomatic complexity 32 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseArgs (cyclomatic 31, cognitive 34) · ×1
  • Complex function parseArgs (cyclomatic 31, cognitive 34) bin/_lib/args.js:42 — parseArgs has cyclomatic complexity 31 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function ambigDate (cyclomatic 31, cognitive 32) · ×1
  • Complex function ambigDate (cyclomatic 31, cognitive 32) src/2-two/preTagger/compute/tagger/3rd-pass/10-ambig-date.js:26 — ambigDate has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 29, cognitive 33) · ×1
  • Complex function (anonymous) (cyclomatic 29, cognitive 33) src/1-one/output/fromSpec.js:13 — (anonymous) has cyclomatic complexity 29 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function list (cyclomatic 29, cognitive 26) · ×1
  • Complex function list (cyclomatic 29, cognitive 26) REDACTED:14423 — list has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function serializeAttribute (cyclomatic 28, cognitive 27) · ×1
  • Complex function serializeAttribute (cyclomatic 28, cognitive 27) REDACTED:14388 — serializeAttribute has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 28, cognitive 23) · ×1
  • Complex function (anonymous) (cyclomatic 28, cognitive 23) src/3-three/verbs/api/conjugate/groups.js:14 — (anonymous) has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function basicSplit (cyclomatic 26, cognitive 58) · ×1
  • Complex function basicSplit (cyclomatic 26, cognitive 58) src/1-one/tokenize/methods/01-sentences/01-simple-split.js:12 — basicSplit has cyclomatic complexity 26 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function pair (cyclomatic 26, cognitive 47) · ×1
  • Complex function pair (cyclomatic 26, cognitive 47) REDACTED:15640 — pair has cyclomatic complexity 26 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseNumber (cyclomatic 26, cognitive 34) · ×1
  • Complex function parseNumber (cyclomatic 26, cognitive 34) src/3-three/numbers/numbers/parse/index.js:51 — parseNumber has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function question (cyclomatic 25, cognitive 32) · ×1
  • Complex function question (cyclomatic 25, cognitive 32) src/3-three/verbs/api/conjugate/question.js:263 — question has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 25, cognitive 24) · ×1
  • Complex function (anonymous) (cyclomatic 25, cognitive 24) src/1-one/output/api/_text.js:20 — (anonymous) has cyclomatic complexity 25 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function subtokenize (cyclomatic 24, cognitive 59) · ×1
  • Complex function subtokenize (cyclomatic 24, cognitive 59) REDACTED:5603 — subtokenize has cyclomatic complexity 24 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function resolveAllAttention (cyclomatic 24, cognitive 58) · ×1
  • Complex function resolveAllAttention (cyclomatic 24, cognitive 58) REDACTED:3625 — resolveAllAttention has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function visitor (cyclomatic 24, cognitive 27) · ×1
  • Complex function visitor (cyclomatic 24, cognitive 27) REDACTED:16006 — visitor has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function imperative (cyclomatic 24, cognitive 26) · ×1
  • Complex function imperative (cyclomatic 24, cognitive 26) src/2-two/preTagger/compute/tagger/3rd-pass/08-imperative.js:15 — imperative has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function toHtml (cyclomatic 24, cognitive 23) · ×1
  • Complex function toHtml (cyclomatic 24, cognitive 23) REDACTED:14646 — toHtml has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 20900 lines of code REDACTED:1 — REDACTED has 20900 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 15884 lines of code REDACTED:1 — REDACTED has 15884 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/dates/builds/compromise-dates.cjs · ×1
  • plugins/dates/builds/compromise-dates.cjs: 5372 lines of code plugins/dates/builds/compromise-dates.cjs:1 — plugins/dates/builds/compromise-dates.cjs has 5372 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/2-two/postTagger/model/index.js · ×1
  • src/2-two/postTagger/model/index.js: 1167 lines of code src/2-two/postTagger/model/index.js:1 — src/2-two/postTagger/model/index.js has 1167 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/stats/builds/compromise-stats.cjs · ×1
  • plugins/stats/builds/compromise-stats.cjs: 979 lines of code plugins/stats/builds/compromise-stats.cjs:1 — plugins/stats/builds/compromise-stats.cjs has 979 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 559 lines of code REDACTED:1 — REDACTED has 559 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/dates/src/api/parse/range/02-date-range.js · ×1
  • plugins/dates/src/api/parse/range/02-date-range.js: 481 lines of code plugins/dates/src/api/parse/range/02-date-range.js:1 — plugins/dates/src/api/parse/range/02-date-range.js has 481 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/2-two/left-right/model/by-word.js · ×1
  • src/2-two/left-right/model/by-word.js: 477 lines of code src/2-two/left-right/model/by-word.js:1 — src/2-two/left-right/model/by-word.js has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/_experiments/compress/src/lz.js · ×1
  • plugins/_experiments/compress/src/lz.js: 428 lines of code plugins/_experiments/compress/src/lz.js:1 — plugins/_experiments/compress/src/lz.js has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · The declared test suite includes a file that cannot be loaded · ×1
  • The declared test suite includes a file that cannot be loaded scripts/test/smoke.test.js:12 — This repository declares test tooling, and the ✓ above records that declaration — but scripts/test/smoke.test.js and 1 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) — each one is reported with its failing import under Test Coverage — then the declared script exercises what it claims to.
R7 · Dead Code · Dead file (~460 LoC) · ×1
  • Dead file (~460 LoC) plugins/_experiments/compress/src/lz.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (plugins/_experiments/compress/src/index.js) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~211 LoC) · ×1
  • Dead file (~211 LoC) plugins/_experiments/sentiment/test.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~158 LoC) · ×1
  • Dead file (~158 LoC) scripts/typescript/one.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~129 LoC) · ×1
  • Dead file (~129 LoC) scripts/typescript/three.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~65 LoC) · ×1
  • Dead file (~65 LoC) plugins/_experiments/markdown/src/parse/uuid.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~59 LoC) · ×1
  • Dead file (~59 LoC) scripts/typescript/imports.cts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~51 LoC) · ×1
  • Dead file (~51 LoC) scripts/typescript/imports.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~47 LoC) · ×1
  • Dead file (~47 LoC) plugins/_experiments/markdown/src/parse/crawl.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~33 LoC) · ×1
  • Dead file (~33 LoC) plugins/_experiments/wikipedia/scripts/generate/01-download.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~29 LoC) · ×1
  • Dead file (~29 LoC) scripts/typescript/money-methods.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~22 LoC) · ×1
  • Dead file (~22 LoC) scripts/typescript/two.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~14 LoC) · ×1
  • Dead file (~14 LoC) scripts/typescript/money.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~13 LoC) · ×1
  • Dead file (~13 LoC) plugins/_experiments/compress/src/index.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~7 LoC) · ×1
  • Dead file (~7 LoC) scripts/typescript/decimal-currencies.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~4 LoC) · ×1
  • Dead file (~4 LoC) scripts/typescript/adjective-root.ts — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~0 LoC) · ×1
  • Dead file (~0 LoC) plugins/_experiments/markdown/src/Wrap.js — no import path from any entry point (137 application, 36 tooling, 598 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R8 · Dependency Hygiene · Unlisted import 'micromark-extension-gfm-footnote' · ×1
  • Unlisted import 'micromark-extension-gfm-footnote' REDACTED:19419 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
R8 · Dependency Hygiene · Unlisted import 'micromark-extension-gfm-strikethrough' · ×1
  • Unlisted import 'micromark-extension-gfm-strikethrough' REDACTED:19420 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
R8 · Dependency Hygiene · Unlisted import 'micromark-util-types' · ×1
  • Unlisted import 'micromark-util-types' REDACTED:19421 — Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it — but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json.
R8 · Dependency Hygiene · Unused dependency 'hast-util-to-mdast' · ×1
  • Unused dependency 'hast-util-to-mdast' — Declared in plugins/_experiments/markdown/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Minor — 1692 finding(s)
D10 · Test Quality · No direct assertions · ×1618
  • No direct assertions: abbreviations tests/_ignored/abbreviations.ignore.js:5 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: abbreviations tests/_ignored/abbreviations.ignore.js:16 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/emoji-shortcodes.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/implicit-unit-aliases.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/match-array-selections.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/match-escaped-symbols.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/match-group-whitespace.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: more-coreference: tests/_ignored/more.ignore.js:218 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/normalize-dash-whitespace.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/number-normalization.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: number-fraction overlap tests/_ignored/overlap.ignore.js:5 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/participle-verb-selection.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/redact-tag.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/sentence-append-punctuation.ignore.js:6 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: toPast finds participle form tests/_ignored/sentence-participle.ignore.js:5 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: toParticiple tests/_ignored/sentence-participle.ignore.js:37 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: modal-present-to-past tests/_ignored/sentence-participle.ignore.js:55 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_ignored/tag-inheritance-array.ignore.js:7 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: simple chanage-punct tests/_ignored/to-question.ignore.js:5 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: toquestion edge-cases tests/_ignored/to-question.ignore.js:25 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_hmm/adverb-past.hmm.js:48 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_hmm/al18ner-tests.hmm.js:41 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_hmm/contractions.hmm.js:9 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_hmm/contractions.hmm.js:16 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • No direct assertions: (unnamed test) tests/_hmm/contractions.hmm.js:23 — No conventional assertion call was detected, and 1298 of 1582 tests in `the repository root` read the same way — so this is treated as that project's convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing.
  • + 1593 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×40
  • Duplicated predicate src/3-three/numbers/numbers/toFraction.js:11 — `!Number.isFinite(num) || value.has('#Money')` appears character-identically in 2 files — src/3-three/numbers/numbers/toFraction.js, src/3-three/numbers/numbers/toPercentage.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:263 — `!Number.isSafeInteger(value) || value < minimum` appears character-identically in 2 files — REDACTED, plugins/speed/src/workerPool/_lib.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:210 — `!arg.startsWith('--input-type') && args[i - 1] !== '--input-type'` appears character-identically in 2 files — REDACTED, plugins/speed/src/workerPool/pool/create.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/speed/builds/compromise-speed.browser.cjs:48 — `!cache || opts.reset || cache.revision !== state.revision || cache.hooks !== hooks` appears character-identically in 3 files — plugins/speed/builds/compromise-speed.browser.cjs, REDACTED, plugins/speed/src/keypress/_lib.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/unist/builds/compromise-unist.cjs:214 — `!child || !children[node.type].includes(child.type)` appears character-identically in 2 files — plugins/unist/builds/compromise-unist.cjs, plugins/unist/src/fromAst/01-read.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/html/src/read-tree/02-connect.js:63 — `!consume(term.pre, null, true) || !consume(term.text, source) || !consume(term.post, null, true)` appears character-identically in 3 files — plugins/html/src/read-tree/02-connect.js, REDACTED, plugins/markdown/src/read-tree/02-connect.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22322 — `!node && whitespace && !remaining.trim()` appears character-identically in 2 files — REDACTED, plugins/markdown/src/read-tree/02-connect.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/html/src/update-tree/index.js:31 — `!present.has(term) || term.text !== original.text || term.implicit !== original.implicit` appears character-identically in 3 files — plugins/html/src/update-tree/index.js, REDACTED, plugins/markdown/src/update-tree/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22467 — `!sameNode(node, nodes[i]) || node.value !== values[i]` appears character-identically in 2 files — REDACTED, plugins/markdown/src/update-tree/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/html/src/update-tree/index.js:35 — `!unist.protectedTerms.has(term) || terms.get(term)?.parts.length` appears character-identically in 3 files — plugins/html/src/update-tree/index.js, REDACTED, plugins/markdown/src/update-tree/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:276 — `(!isVowel.test(word[i]) && !voiced.has(i)) || silent.has(i)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22093 — `(start === 0 && end === 0) || (start === 1 && end === 1)` appears character-identically in 2 files — REDACTED, plugins/markdown/src/read-tree/_lib.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/1-one/lexicon/methods/expand.js:17 — `_multi[split[0]] === undefined || split.length > _multi[split[0]]` appears character-identically in 2 files — src/1-one/lexicon/methods/expand.js, src/2-two/preTagger/methods/expand/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:152 — `batch && batch.length + sentence.length > batchSize` appears character-identically in 2 files — REDACTED, plugins/speed/src/workerPool/rip.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/unist/builds/compromise-unist.cjs:17 — `ch === '\r' || (ch === '\n' && !carriage)` appears character-identically in 2 files — plugins/unist/builds/compromise-unist.cjs, plugins/unist/src/toAst/01-positions.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:189 — `closed || slot.job || cursor === queue.length` appears character-identically in 2 files — REDACTED, plugins/speed/src/workerPool/pool/create.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate src/1-one/match/methods/parseMatch/splitGroups.js:21 — `end === length || whitespace.test(str[end])` appears character-identically in 2 files — src/1-one/match/methods/parseMatch/splitGroups.js, src/1-one/match/methods/parseMatch/splitRegs.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:351 — `gap.length < rule.minGap || (rule.maxGap !== undefined && gap.length > rule.maxGap) || (rule.gap && !rule.gap.test(gap)) || (rule.tail && !r…` appears character-identically in 2 files — REDACTED, plugins/speech/src/syllables/split/find-cuts/02-boundaries.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/speed/builds/compromise-speed.browser.cjs:41 — `lex && JSON.stringify(lex) !== state.lex` appears character-identically in 3 files — plugins/speed/builds/compromise-speed.browser.cjs, REDACTED, plugins/speed/src/keypress/_lib.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/unist/builds/compromise-unist.cjs:232 — `literals.includes(node.type) && typeof node.value === 'string'` appears character-identically in 2 files — plugins/unist/builds/compromise-unist.cjs, plugins/unist/src/fromAst/01-read.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/speed/builds/compromise-speed.browser.cjs:60 — `next.get(str) || cache.sentences.get(str)` appears character-identically in 3 files — plugins/speed/builds/compromise-speed.browser.cjs, REDACTED, plugins/speed/src/keypress/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22462 — `node === previous || (node.generated === true && previous?.generated === true && node.value === previous.value)` appears character-identically in 2 files — REDACTED, plugins/markdown/src/update-tree/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22524 — `node.generated && output[i] !== values[i]` appears character-identically in 2 files — REDACTED, plugins/markdown/src/update-tree/index.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate REDACTED:22086 — `node.type !== 'link' || node.children?.length !== 1 || node.children[0].type !== 'text'` appears character-identically in 2 files — REDACTED, plugins/markdown/src/read-tree/_lib.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/unist/builds/compromise-unist.cjs:209 — `node.type === 'ParagraphNode' || node.type === 'SentenceNode'` appears character-identically in 2 files — plugins/unist/builds/compromise-unist.cjs, plugins/unist/src/fromAst/01-read.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • + 15 more in this group — see findings.md.
D24 · Comment Value · redundant comment · ×13
  • redundant comment plugins/dates/builds/compromise-dates.cjs:2954 — "mondays, 'tuesdays and thursdays'" repeats the code it sits on: 3 of its 3 words (mondays, tuesdays, thursdays) are already in `m = doc.match(`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment plugins/dates/builds/compromise-dates.cjs:4886 — "{ match: '', tag: '', reason:'' }," repeats the code it sits on: 3 of its 3 words (match, tag, reason) are already in `const matches = [`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment plugins/dates/src/api/parse/range/intervals/index.js:121 — "mondays, 'tuesdays and thursdays'" repeats the code it sits on: 3 of its 3 words (mondays, tuesdays, thursdays) are already in `m = doc.match(`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment plugins/dates/src/compute/matches.js:8 — "{ match: '', tag: '', reason:'' }," repeats the code it sits on: 3 of its 3 words (match, tag, reason) are already in `const matches = [`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:3056 — 5 comments in this file only repeat the code they sit on (lines 3056, 6382, 6682, 7153, 7192), for example "Emit a named entity if we have one.". Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment REDACTED:14944 — "Indented code after list or another indented code." repeats the code it sits on: 3 of its 3 words (indented, code, list) are already in `if (`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment plugins/payload/scratch.js:10 — "add payload to each color" repeats the code it sits on: 3 of its 3 words (add, payload, color) are already in `doc.match('(red|blue|green)').forEach(m => m.addPayload({ color: m.text() }))`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/2-two/preTagger/compute/tagger/3rd-pass/09-first-word.js:6 — "[well].. [so] [okay] [now] shoot, say, like, hello" repeats the code it sits on: 7 of its 8 words (well, so, okay, now, shoot, say, like) are already in `const expressions = {`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment src/3-three/chunker/api/api.js:16 — "isVerb(), isNoun(), isAdjective(), isPivot()" repeats the code it sits on: 4 of its 4 words (verb, noun, adjective, pivot) are already in `'Verb Noun Adjective Pivot'.split(' ').forEach(name =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tests/01-one/tokenize/hyphens.test.js:32 — "t.equal(doc.has('pro'), true, here + 'pro') t.equal(doc.has('choice'), true, here + 'choice')" repeats the code it sits on: 5 of its 5 words (equal, doc, pro, true, choice) are already in `t.equal(doc.has('pro-choice'), true, here + 'pro-choice')`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tests/01-one/tokenize/hyphens.test.js:67 — "t.equal(doc.has('counterargument'), true, here + 'counter one word')" repeats the code it sits on: 5 of its 6 words (equal, doc, true, counter, word) are already in `t.equal(doc.has('counter-argument'), true, here + 'counter dashed word')`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tests/01-one/tokenize/hyphens.test.js:75 — "t.equal(doc.has('additional nonurgent'), true, here + 'additional nonurgent')" repeats the code it sits on: 4 of its 5 words (equal, doc, additional, true) are already in `t.equal(doc.has('additional non-urgent'), true, here + 'additional non-urgent')`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
  • redundant comment tests/03-three/topics/topic-selections.test.js:69 — "t.equal(things.join(', '), want.join(', '), here + 'found right things')" repeats the code it sits on: 5 of its 6 words (equal, things, want, found, right) are already in `t.equal(things.length, want.length, here + 'found right things')`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
D19 · Documentation Quality · Documentation · ×3
  • Documentation: no build, run or usage example plugins/_experiments/ast/README.md:1 — `ast` is a published package (`package.json` without `"private": true`) and neither `plugins/_experiments/ast/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
  • Documentation: no build, run or usage example plugins/_experiments/markdown/README.md:1 — `markdown` is a published package (`package.json` without `"private": true`) and neither `plugins/_experiments/markdown/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
  • Documentation: no build, run or usage example plugins/_experiments/sentiment/README.md:1 — `sentiment` is a published package (`package.json` without `"private": true`) and neither `plugins/_experiments/sentiment/README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D12 · Dependency Hygiene · Deprecated · ×2
  • Deprecated: glob REDACTED:1456 — glob 7.2.3 is resolved in REDACTED and is marked deprecated by its publisher: "Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting i@izs.me". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: inflight REDACTED:1558 — inflight 1.0.6 is resolved in REDACTED and is marked deprecated by its publisher: "This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
IC1 · Incompleteness & stubs · Blanket warning suppression · ×2
  • Blanket warning suppression plugins/_experiments/compress/src/lz.js:1 — A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead.
  • Blanket warning suppression plugins/_experiments/markdown/scratch.js:1 — A bare `eslint-disable` or `@ts-nocheck` with no rule list switches every lint rule or the whole type checker off for the rest of the file — hidden debt. Disable the specific rule on the specific line, with a justification, instead.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found package.json:80 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `package.json` makes this repository a deployable product (line 80).
D21 · Naming Consistency · `currentNotInHTML` spells `HTML` where 18 names in the project spell it `Html` · ×1
  • `currentNotInHTML` spells `HTML` where 18 names in the project spell it `Html` REDACTED:7367 — 18 of 19 names in project compromise spell the token `Html` (18 of 19; unit: names in project compromise containing `Html`). Peers: Preprocessor.insertHtmlAtCurrentPos (REDACTED:2536); Tokenizer.insertHtmlAtCurrentPos (REDACTED:3882); OpenElementStack.popAllUpToHtmlElement (REDACTED:6481); OpenElementStack.isRootHtmlElementCurrent (REDACTED:6535); compromise-html.isHtmlIntegrationPoint (REDACTED:7284). Rename to `currentNotInHtml`. [rule N6]
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 2 of 16 project(s) overshoot their size bounds, lowering Project Cohesion to 7.6/10. The most over is `(repository root)` (47139 LoC, 420 module-visible types across 144 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.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Low CVE · ×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
IC1 · Incompleteness & stubs · Disabled test · ×1
  • Disabled test tests/03-three/coreference/antecedent-boundaries.test.js:51 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST .github/workflows/build-and-test.yml:4 — No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/typescript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation package.json:130 — `package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
R7 · Dead Code · Unused module-local declaration 'fmt' · ×1
  • Unused module-local declaration 'fmt' plugins/dates/scratch.js:9 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code · Unused module-local declaration 'invalidWord' · ×1
  • Unused module-local declaration 'invalidWord' plugins/unist/tests/types/api.cts:26 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Minor — 7 finding(s)
D24 · Comment Value · doc comments repeat the names · ×4
  • doc comments repeat the names src/1-one/match/methods/termMethods.js:19 — 0 of 0 documented parameters and 2 of 86 summaries in `compromise` only repeat the member or parameter name (e.g. "does it have a comma?" for `hasComma`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names REDACTED:16 — 52 of 281 documented parameters and 5 of 160 summaries in `compromise-html` only repeat the member or parameter name (e.g. "Property." for `property`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names REDACTED:53 — 58 of 397 documented parameters and 4 of 490 summaries in `compromise-markdown` only repeat the member or parameter name (e.g. "Include HTML." for `includeHtml`). Delete the restating tags, or add what the name does not say.
  • doc comments repeat the names plugins/_experiments/sentiment/src/lib.js:77 — 1 of 9 documented parameters and 0 of 8 summaries in `compromise-sentiment` only repeat the member or parameter name (e.g. "The word at which split" for `splitWord`). Delete the restating tags, or add what the name does not say.
D12 · Dependency Hygiene · Outdated (npm) · ×3
  • Outdated (npm): hast-util-from-html — hast-util-from-html is pinned at 2.0.3; registry.npmjs.org publishes 2.1.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): hast-util-to-html — hast-util-to-html is pinned at 9.0.5; registry.npmjs.org publishes 9.0.6 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): mdast-util-to-markdown — mdast-util-to-markdown is pinned at 2.2.0; registry.npmjs.org publishes 2.2.3 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-8648adacbc704b73867f09ae02035ba7/history.json --exit-code 0 --source .60artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-8648adacbc704b73867f09ae02035ba7/tree.json --exit-code 0 --source .1artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt --exclude plugins/_experiments/markdown/builds .8artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .3artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 8 file(s) — `REDACTED`, `REDACTED`, `builds/three/compromise-three.mjs`, `builds/two/compromise-two.mjs`, `plugins/dates/builds/compromise-dates.cjs`, … (+3 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D37 · Vulnerability-disclosure Policydisclosure—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 Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1dda8-60db-7bf7-847e-e187b8686425 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

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