Public report of josdejong/mathjs, published 29 October 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.10.5). 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, 29 October 2026, 23:26 UTC · Survey ID cd_10e6fbe4701c4c47a4bf374a7b9efc67

josdejong/mathjs

Measured 29 October 2026, 23:08 UTC, at code version db2639f

Regression: 1 dimension fell since the last survey

A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.

CAI score 53out of 100 At risk Down 2 since the last survey

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

A medium codebase: 61,286 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.8 person-years · Weakest lens: Production Readiness, 43

Findings by how serious they are

46 critical 639 serious 114 minor

9 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks 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

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
29 October 2026, 23:08 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 Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

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

The score is deterministic, which means the same code always gets the same score. Watchdog works 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 ▸

72of 72 dimensions measured by tools.
771of 799 findings point to an exact file and line, so you can open each one in the code. The other 28 concern the repository as a whole, such as missing documentation.
72dimensions across 6 lenses, read from 61,286 lines of product code in 1 project.
Chapters

Executive summary

josdejong/mathjs is rated At risk because critical security findings are open, most of them in the packages it uses. Its score is held back 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 53 out of 100, which the At risk rating leaves unchanged.

Production Readiness, at 43, is the weakest lens and counts most in the score. The best first step is fixing the password or key in the code, worth about 7 points. Adding a diagnostic log would lift Production Readiness itself, worth about 6 points. Raising Production Readiness to 70 would lift the score to about 60.

Twenty-four known security holes in the packages the code depends on can be used by attackers. Fourteen pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and three secrets can leak from the build pipeline. Updating the vulnerable packages, pinning each tool to an exact version and limiting each secret to its own step would close these risks. The two tests that check nothing need to check the result they produce.

The product code is 61,286 lines, about €110,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 43 · counts for 46%Code Health 53 · counts for 25%Security and Compliance 58 · counts for 14%Maturity 73 · counts for 8%Architecture 84 · counts for 4%Performance 91 · counts for 2%

If Production Readiness rose from 43 to 70, the lowest score rated Strong, the score would rise from 53 to about 60.

Code composition: what the lines of code are
Product code 54%Tests 46%
New since the last survey: 58 findings

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

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

Fixed since the last survey: 175 findings

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

  • Cognitive Complexity · (anonymous) (cognitive 18) src/function/matrix/transpose.js
  • Dependency Vulnerabilities · Critical CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · Critical CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · Medium CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · Medium CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · Medium CVE: REDACTED REDACTED
  • Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · Medium CVE: [GHSA redacted] REDACTED
  • Supply-chain Provenance & Signing REDACTED
  • Code Duplication · Duplicated block (82 lines × 2 locations) src/function/bitwise/leftShift.js
  • Code Duplication · Duplicated block (74 lines × 2 locations) src/function/relational/larger.js
  • Code Duplication · Duplicated block with local edits (59 matched lines × 2 locations) src/function/logical/or.js
  • Code Duplication · Duplicated block with local edits (37 matched lines × 2 locations) src/function/relational/largerEq.js
  • Code Duplication · Duplicated block (23 lines × 2 locations) src/function/algebra/derivative.js
  • Code Duplication · Duplicated block with local edits (19 matched lines × 2 locations) src/type/fraction/function/fraction.js
  • Code Duplication · Duplicated block (19 lines × 2 locations) src/type/matrix/DenseMatrix.js
  • Code Duplication · Duplicated block (18 lines × 2 locations) src/function/relational/compare.js
  • Code Duplication · Duplicated block (18 lines × 3 locations) src/function/trigonometry/acoth.js
  • Code Duplication · Duplicated block (18 lines × 2 locations) src/type/matrix/DenseMatrix.js
  • Code Duplication · Duplicated block (17 lines × 4 locations) src/type/matrix/utils/matAlgo04xSidSid.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) src/expression/parse.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) src/function/algebra/simplify/util.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) src/function/arithmetic/norm.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) src/type/unit/Unit.js
  • Code Duplication · Duplicated block (16 lines × 2 locations) src/utils/bignumber/formatter.js
  • Code Duplication · Duplicated block (15 lines × 2 locations) src/core/function/typed.js
  • Code Duplication · Duplicated block (15 lines × 3 locations) src/function/algebra/derivative.js
  • Code Duplication · Duplicated block with local edits (15 matched lines × 2 locations) src/type/bignumber/function/bignumber.js
  • Code Duplication · Duplicated block (15 lines × 4 locations) src/type/matrix/utils/matAlgo04xSidSid.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/core/function/typed.js
  • Code Duplication · Duplicated block (14 lines × 3 locations) src/expression/parse.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/function/arithmetic/multiply.js
  • Code Duplication · Duplicated block with local edits (14 matched lines × 2 locations) src/function/arithmetic/unaryPlus.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/function/matrix/cross.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/function/matrix/mapSlices.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/function/set/setSymDifference.js
  • Code Duplication · Duplicated block with local edits (14 matched lines × 2 locations) src/function/utils/isNegative.js
  • Code Duplication · Duplicated block (14 lines × 2 locations) src/type/unit/Unit.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/core/function/typed.js
  • Code Duplication · Duplicated block with local edits (13 matched lines × 2 locations) src/expression/function/compile.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/expression/node/ConditionalNode.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/expression/node/FunctionNode.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/expression/node/IndexNode.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/expression/node/OperatorNode.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/expression/transform/max.transform.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/function/algebra/simplifyCore.js
  • Code Duplication · Duplicated block (13 lines × 5 locations) src/function/arithmetic/nthRoot.js
  • Code Duplication · Duplicated block (13 lines × 4 locations) src/function/arithmetic/round.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/function/matrix/range.js
  • Code Duplication · Duplicated block (13 lines × 2 locations) src/function/trigonometry/acot.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/expression/node/OperatorNode.js
  • Code Duplication · Duplicated block (12 lines × 3 locations) src/expression/node/RelationalNode.js
  • Code Duplication · Duplicated block (12 lines × 3 locations) src/expression/transform/diff.transform.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/expression/transform/mean.transform.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/algebra/sparse/csChol.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/arithmetic/lcm.js
  • Code Duplication · Duplicated block (12 lines × 3 locations) src/function/arithmetic/log.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/arithmetic/multiply.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/arithmetic/multiply.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/matrix/range.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/function/statistics/mean.js
  • Code Duplication · Duplicated block with local edits (12 matched lines × 2 locations) src/function/statistics/mean.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/type/matrix/DenseMatrix.js
  • Code Duplication · Duplicated block with local edits (12 matched lines × 2 locations) src/type/matrix/Range.js
  • Code Duplication · Duplicated block (12 lines × 2 locations) src/type/matrix/utils/matAlgo03xDSf.js
  • Code Duplication · Duplicated block (11 lines × 2 locations) src/expression/node/FunctionNode.js
  • Code Duplication · Duplicated block (11 lines × 3 locations) src/function/arithmetic/addScalar.js
  • Code Duplication · Duplicated block with local edits (11 matched lines × 2 locations) src/function/arithmetic/unaryPlus.js
  • Code Duplication · Duplicated block (11 lines × 6 locations) src/function/bitwise/leftShift.js
  • Code Duplication · Duplicated block (11 lines × 2 locations) src/function/matrix/eigs/realSymmetric.js
  • Code Duplication · Duplicated block (11 lines × 4 locations) src/function/probability/pickRandom.js
  • Code Duplication · Duplicated block (11 lines × 3 locations) src/function/relational/compare.js
  • Code Duplication · Duplicated block (11 lines × 2 locations) src/type/matrix/DenseMatrix.js
  • Code Duplication · Duplicated block (11 lines × 2 locations) src/type/matrix/utils/matAlgo04xSidSid.js
  • Code Duplication · Duplicated block (11 lines × 2 locations) src/utils/bignumber/bitwise.js
  • Code Duplication · Duplicated block with local edits (11 matched lines × 2 locations) src/utils/number.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/core/function/import.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/expression/node/AccessorNode.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/algebra/solver/utils/solveValidation.js
  • Code Duplication · Duplicated block (10 lines × 5 locations) src/function/arithmetic/add.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/arithmetic/exp.js
  • Code Duplication · Duplicated block (10 lines × 4 locations) src/function/arithmetic/multiply.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/arithmetic/round.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/matrix/eigs/realSymmetric.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/matrix/identity.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/probability/permutations.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/probability/random.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/function/set/setDifference.js
  • Code Duplication · Duplicated block (10 lines × 2 locations) src/utils/map.js
  • Code Duplication · Duplicated block (9 lines × 3 locations) src/expression/node/ArrayNode.js
Rebuild cost: about €110,000 · Estimate
Cost to rebuild€37,000 to €180,000, for 612 to 1,940 hours of work, about 0.8 person-years for 1 to 2 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 53. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 61,286 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: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

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

1
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 7 points · Low effort · Secret Scanning
2
Resolve the 16 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (16).
Raises the score by about 6 points · Medium effort · Dependency Hygiene
3
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 6 points · Medium effort · Observability

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 €110,000 to build again, about 0.8 person-years of work. Its weakest lens is Production Readiness, at 43 (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 Leaked secret finding(s) in Secret Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 7 points for low effort, because it clears the 1 Secret Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 843 lines over the last 90 days, which is about 3,419 lines a year. At that pace, the extra work comes to an estimated 0.5 to 2.8 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 Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

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

81 modules, with 15 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; 41 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 (global)2 bin3 src4 src.core5 src.core.function6 src.entry7 src.error8 src.expression9 src.expression.function10 src.expression.node11 src.expression.node.Node12 src.expression.node.utils13 src.expression.transform14 src.expression.transform.utils15 src.function.algebra16 src.function.algebra.decomposition17 src.function.algebra.simplify18 src.function.algebra.solver19 src.function.algebra.solver.utils20 src.function.algebra.sparse21 src.function.arithmetic22 src.function.bitwise23 src.function.combinatorics24 src.function.complex25 src.function.fraction26 src.expression.node.AccessorNode27 src.expression.node.ArrayNode28 src.expression.node.AssignmentNode29 src.expression.node.BlockNode30 src.expression.node.ConditionalNode31 src.expression.node.ConstantNode32 src.expression.node.FunctionAssignmentNode33 src.expression.node.FunctionNode34 src.expression.node.IndexNode35 src.expression.node.ObjectNode36 src.expression.node.OperatorNode37 src.expression.node.ParenthesisNode38 src.expression.node.RangeNode39 src.expression.node.RelationalNode40 src.expression.node.SymbolNode
1 (global)
2 bin
3 src
4 src.core
5 src.core.function
6 src.entry
7 src.error
8 src.expression
9 src.expression.function
10 src.expression.node
11 src.expression.node.Node
12 src.expression.node.utils
13 src.expression.transform
14 src.expression.transform.utils
15 src.function.algebra
16 src.function.algebra.decomposition
17 src.function.algebra.simplify
18 src.function.algebra.solver
19 src.function.algebra.solver.utils
20 src.function.algebra.sparse
21 src.function.arithmetic
22 src.function.bitwise
23 src.function.combinatorics
24 src.function.complex
25 src.function.fraction
26 src.expression.node.AccessorNode1
27 src.expression.node.ArrayNode1
28 src.expression.node.AssignmentNode1
29 src.expression.node.BlockNode1
30 src.expression.node.ConditionalNode1
31 src.expression.node.ConstantNode1
32 src.expression.node.FunctionAssignmentNode1
33 src.expression.node.FunctionNode1
34 src.expression.node.IndexNode1
35 src.expression.node.ObjectNode1
36 src.expression.node.OperatorNode1
37 src.expression.node.ParenthesisNode1
38 src.expression.node.RangeNode1
39 src.expression.node.RelationalNode1
40 src.expression.node.SymbolNode1
Uses a module listed above itPart of a loopThe module itself
1 (global)2 bin3 src4 src.core5 src.core.function6 src.entry7 src.error8 src.expression9 src.expression.function10 src.expression.node11 src.expression.node.Node12 src.expression.node.utils13 src.expression.transform14 src.expression.transform.utils15 src.function.algebra16 src.function.algebra.decomposition17 src.function.algebra.simplify18 src.function.algebra.solver19 src.function.algebra.solver.utils20 src.function.algebra.sparse21 src.function.arithmetic22 src.function.bitwise23 src.function.combinatorics24 src.function.complex25 src.function.fraction26 src.expression.node.AccessorNode27 src.expression.node.ArrayNode28 src.expression.node.AssignmentNode29 src.expression.node.BlockNode30 src.expression.node.ConditionalNode31 src.expression.node.ConstantNode32 src.expression.node.FunctionAssignmentNode33 src.expression.node.FunctionNode34 src.expression.node.IndexNode35 src.expression.node.ObjectNode36 src.expression.node.OperatorNode37 src.expression.node.ParenthesisNode38 src.expression.node.RangeNode39 src.expression.node.RelationalNode40 src.expression.node.SymbolNode(global)1bin2src3src.core4src.core.function5src.entry6src.error7src.expression8src.expression.function9src.expression.node10src.expression.node.Node11src.expression.node.utils12src.expression.transform13src.expression.transform.utils14src.function.algebra15src.function.algebra.decomposition16src.function.algebra.simplify17src.function.algebra.solver18src.function.algebra.solver.utils19src.function.algebra.sparse20src.function.arithmetic21src.function.bitwise22src.function.combinatorics23src.function.complex24src.function.fraction25src.expression.node.AccessorNode26src.expression.node.ArrayNode27src.expression.node.AssignmentNode28src.expression.node.BlockNode29src.expression.node.ConditionalNode30src.expression.node.ConstantNode31src.expression.node.FunctionAssignmentNode32src.expression.node.FunctionNode33src.expression.node.IndexNode34src.expression.node.ObjectNode35src.expression.node.OperatorNode36src.expression.node.ParenthesisNode37src.expression.node.RangeNode38src.expression.node.RelationalNode39src.expression.node.SymbolNode40111111111111111+41 more modules (most-connected shown)

At a glance — Code Health · 53% · Adequate · gated by D1, D2, R1 ·

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

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

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

At a glance — Security · 58% · Adequate · gated by D30, D36 ·

At a glance — Performance · 91% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures44High / Critical
A05:2025 — Injection23High / Critical
A07:2025 — Authentication Failures1High / Critical

Roadmap

Immediately resolve the leaked secret in REDACTED and address the 16 deprecated dependencies to secure the codebase. Enhance observability by implementing a diagnostic log file accessible via a verbose flag, focusing first on error paths that currently provide no output. Integrate a static analysis tool into the CI pipeline to prevent security regressions from being merged. Finally, begin migrating the remaining JavaScript files to TypeScript to improve type safety and maintainability.

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

Do thisHelpsEffortDimension
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.+7.2 ptsLowSecret Scanning
Resolve the 16 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (16).+6.0 ptsMediumDependency Hygiene
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.9 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security — so a security regression fails the build instead of landing.+5.9 ptsMediumSecurity & performance tooling
Resolve the 1 Assertions commented out finding(s) in Test Quality — start with multiply.test.js.+2.3 ptsLowTest Quality
Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with variance.test.js.+2.3 ptsLowTest Quality
Migrate the remaining .js/.jsx files to TypeScript.+3.3 ptsMediumType Safety
Resolve the 1 No ADRs found finding(s) in ADR Quality.+1.4 ptsLowADR Quality

File quality

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

FileScoreBandWorst signal
REDACTED0.0SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.0SlopSecret Scanning: Leaked secret: REDACTED
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.7SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
src/type/matrix/DenseMatrix.js5.6MixedCyclomatic Complexity: DenseMatrix.createDenseMatrixClass (cyclomatic 125)
test/unit-tests/function/arithmetic/multiply.test.js5.8MixedTest Quality: Assertions commented out: should throw an error in case of unit non-numeric argument
src/expression/node/Node.js6.3MixedCyclomatic Complexity: Node.createNode (cyclomatic 16)
test/typescript-tests/testTypes.ts6.9MixedExplicit Debt: TodoComment
src/type/unit/Unit.js7.0MixedCyclomatic Complexity: Unit.createUnitClass (cyclomatic 297)
src/expression/node/OperatorNode.js7.0MixedCyclomatic Complexity: OperatorNode.createOperatorNode (cyclomatic 82)
src/expression/node/FunctionNode.js7.0MixedCyclomatic Complexity: FunctionNode.createFunctionNode (cyclomatic 82)
src/function/algebra/simplify.js7.0MixedCyclomatic Complexity: simplify.createSimplify::_ruleMatch (cyclomatic 52)
src/function/algebra/rationalize.js7.0MixedCyclomatic Complexity: rationalize.createRationalize::polyToCanonical::recurPol (cyclomatic 49)
src/expression/parse.js7.0MixedCyclomatic Complexity: parse.createParse::getToken (cyclomatic 48)
src/type/matrix/SparseMatrix.js7.0MixedCyclomatic Complexity: (anonymous)::_swapRows (cyclomatic 25)
src/function/arithmetic/multiply.js7.0MixedCyclomatic Complexity: multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cyclomatic 24)
tools/docgenerator.js7.0MixedCyclomatic Complexity: generateDoc (cyclomatic 73)
src/expression/node/ConditionalNode.js7.0MixedCyclomatic Complexity: ConditionalNode.createConditionalNode (cyclomatic 51)

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

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

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

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

Could not be resolved — 9

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

Methodology & how to trust this report

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

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

What we checked — 72 dimensions across the health lenses
D1D2D3D4D6D8D9D10D11D12D13D14D15D16D17D19D20D26D28D29D30D34D35D36D37D43D44AX10AX3AX4AX6GD1IC1M1M2M3M4P1P10P2P3P6PF1PF3R1R10R2R3R4R5R6R7R8R9X1X12X13X14X15X16X17X18X19X21X22X23X24X25X28X29X3X30

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, 771 of 799 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, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — 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
Watchdog 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
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement—◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a189ec-2b6a-7f03-8628-95ff757a819d.

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

Run transparency — what happened this run

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

  • D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 5,534 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 1 test source file(s) (.py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (REDACTED), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published REDACTED's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (dev). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
  • M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 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 — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 148 further occurrence(s) are not listed individually; the score already reflects all 188.
  • S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 689 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled certificate validation and obsolete TLS versions, and none was found. The server controls this dimension also scores were not assessed, so no score is given.
  • X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, 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; 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.
  • X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, 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

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • 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.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • 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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.0 / 10Critical✓ Tool-verified

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

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

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

194 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Unit.createUnitClass at 297. A further 3 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 Complex.createComplexClass at 24 — they are counted neither in the figure above nor in this dimension's score. 3 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: src/type/complex/Complex.js (Complex.createComplexClass at 24), src/expression/Help.js (Help.createHelpClass at 18), src/type/matrix/Spa.js (Spa.createSpaClass at 18). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

(anonymous)::_simplifyCore (cyclomatic 86) · ×46src/function/algebra/simplifyCore.js:104
multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cyclomatic 24) · ×4src/function/arithmetic/multiply.js:648
(anonymous) (cyclomatic 20) · ×4src/expression/node/IndexNode.js:13
(anonymous) (cyclomatic 17) · ×4src/function/matrix/diff.js:8
simplify.createSimplify::_ruleMatch (cyclomatic 52) · ×3src/function/algebra/simplify.js:841

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

What to do

  1. Bring the 11 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Unit.createUnitClass (cyclomatic 297), DenseMatrix.createDenseMatrixClass (cyclomatic 125), distance.createDistance (cyclomatic 106). — 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 11 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

276 method(s) exceeded the cognitive complexity threshold of 15; the worst was simplifyCore.createSimplifyCore::_simplifyCore at 200.

(anonymous)::_simplifyCore (cognitive 200) · ×87src/function/algebra/simplifyCore.js:104
parse.createParse::getToken (cognitive 87) · ×7src/expression/parse.js:291
simplify.createSimplify::_ruleMatch (cognitive 109) · ×5src/function/algebra/simplify.js:841
rationalize.createRationalize::polyToCanonical::recurPol (cognitive 72) · ×5src/function/algebra/rationalize.js:531
multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cognitive 42) · ×5src/function/arithmetic/multiply.js:648

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

What to do

  1. Bring the 22 bodies over 60 down to 60 or less in Cognitive Complexity — start with simplifyCore.createSimplifyCore::_simplifyCore (cognitive 200), (anonymous)::_simplifyCore (cognitive 200), distance.createDistance (cognitive 115). — 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 22 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D3 · God Classes7.7 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

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

32 over-large unit(s) detected — types, modules or files that carry too much.

FunctionTooLong: parse.createParse · ×27src/expression/parse.js:29
FileTooLong: unit/Unit.js · ×4src/type/unit/Unit.js
MethodTooLong: FunctionNode._compilesrc/expression/node/FunctionNode.js:142

What to do

  1. Resolve the 27 FunctionTooLong finding(s) in God Classes — start with parse.js, simplify.js, DenseMatrix.js. — One of this dimension's main actionable groups (27 warning-level).
  2. Resolve the 4 FileTooLong finding(s) in God Classes — start with Unit.js, parse.js, SparseMatrix.js. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 1 MethodTooLong finding(s) in God Classes — start with FunctionNode.js. — One of this dimension's main actionable groups (1 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D4 · Code Duplication10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 duplicated block group(s) detected.

✓ On the Gold path — maintain.

Detailed fixes: d4_recommendation.md.

D6 · Cohesion (LCOM4)9.4 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

1 of 19 classes have LCOM4 above 3.

Low cohesion: Node (LCOM4 5)src/expression/node/Node.js:25

What to do

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

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

D8 · Code Coverage10.0 / 10Stronggated by 6 serious findings✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

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

Line coverage 96.7% — 6 file(s) below 50%. Measured from the JavaScript/TypeScript suite (mocha + c8 via `npm ci --ignore-scripts` in the repository root).

Low coverage: src/function/algebra/sparse/csCounts.js · ×6src/function/algebra/sparse/csCounts.js:1

What to do

  1. Resolve the 6 Low coverage finding(s) in Code Coverage — start with csCounts.js, csEtree.js, csLeaf.js. — One of this dimension's main actionable groups (6 warning-level).
  2. Enforce Code Coverage in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

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

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

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

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

5534 test methods: 5534 unit, 0 integration, 0 BDD, 0 e2e. The JavaScript/TypeScript suite contributes 5534 `it`/`test` case(s) across 324 test file(s) declaring at least one; its tier split is read from package names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D10 · Test Quality9.9 / 10Adequategated by 2 critical findings✓ Tool-verified

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

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

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

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

No assertions (empty test): should throw an error if the axis exceeds the dimension of the matrixtest/unit-tests/function/statistics/variance.test.js:120
Assertions commented out: should throw an error in case of unit non-numeric argumenttest/unit-tests/function/arithmetic/multiply.test.js:231
Skipped test: should order functions by their dependencies (1) · ×22test/unit-tests/utils/factory.test.js:35
No assertions: should merge nested matrices · ×6test/unit-tests/expression/parse.test.js:838

What to do

  1. Resolve the 1 No assertions (empty test) finding(s) in Test Quality — start with variance.test.js. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 Assertions commented out finding(s) in Test Quality — start with multiply.test.js. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 22 Skipped test finding(s) in Test Quality — start with import.test.js (5), factory.test.js (2), SparseMatrix.test.js (2). — One of this dimension's main actionable groups (22 warning-level).
  4. Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

0 flaky across 1 measured tier(s). JavaScript/TypeScript (mocha via `npm ci --ignore-scripts` in the repository root (6669 tests)): measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.md.

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

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

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

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

10 outdated direct production npm dependency(ies) of 15 graded, 0 pinning defect(s), across 2 REDACTED (1 of them the product) and 2 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 3 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: codecov · ×3REDACTED:52
Deprecated: @humanwhocodes/config-array · ×16REDACTED:1886
Outdated (npm): @babel/runtime · ×10

What to do

  1. Resolve the 16 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (16). — One of this dimension's main actionable groups (16 recommendation-level).
  2. Resolve the 3 Deprecated finding(s) in Dependency Hygiene — start with REDACTED (3). — One of this dimension's main actionable groups (3 warning-level).
  3. Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

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

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

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

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

1 secret(s) detected.

REDACTED

What to do

  1. Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Enforce Secret Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

0 of 15 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 15 production dependency(ies) this repository's committed lockfile resolves, across 1 product REDACTED manifest(s). Its 59 `devDependencies` declaration(s) are excluded: a consumer installs none of them. ★ DEPTH: this is the DIRECT production set the lockfile resolves, NOT the transitive closure — only one of the four lock dialects this pass reads states a full graph, so a banned licence pulled in only by a dependency's OWN dependencies is outside this verdict, exactly as the JVM arm's declaration-site verdict is. ★ 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 Apache-2.0, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

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

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

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

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

5 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/type/matrix/DenseMatrix.js. Counted over 185 of the 666 production source files in this repository: 464 are under the ~2,400-byte size floor this dimension measures over, and the remaining 17 have no attributable history left to measure.

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

✓ On the Gold path — maintain.

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

D17 · Explicit Debt9.7 / 10Stronggated by 3 serious findings✓ Tool-verified

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

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

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

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

TodoComment · ×3test/typescript-tests/testTypes.ts:218

What to do

  1. Resolve the 3 TodoComment finding(s) in Explicit Debt — start with testTypes.ts (3). — One of this dimension's main actionable groups (3 warning-level).
  2. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

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

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

No architecture decision records were found.

No ADRs found

What to do

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

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

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

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

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

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

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

23 finding(s): 0 critical, 17 high, 6 medium, 0 low. 14 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `src/type/unit/Unit.js` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

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

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

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

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

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

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

36 finding(s): 3 critical, 21 high, 9 medium, 3 low.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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

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

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

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

23 of 202 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/function/matrix/eigs/complexEigs.js. Counted over 202 of the 666 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledgesrc/function/matrix/eigs/complexEigs.js:1
Orphaned file · ×22src/function/matrix/eigs.js:1
Further orphaned files (smaller)

What to do

  1. Resolve the 1 Orphaned knowledge finding(s) in Knowledge Freshness — start with complexEigs.js. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 22 Orphaned file finding(s) in Knowledge Freshness — start with eigs.js, realSymmetric.js, rotationMatrix.js. — One of this dimension's main actionable groups (22 recommendation-level).
  3. Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

D35 · Change Coupling10.0 / 10Stronggated by 2 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: embeddedDocs.js↔factoriesAny.js 71%; DenseMatrix.js↔SparseMatrix.js 62%

Change coupling: embeddedDocs.js ↔ factoriesAny.js · ×2src/expression/embeddedDocs/embeddedDocs.js:1

What to do

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

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

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

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

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

D44 · Platform End-of-Life6.0 / 10Adequate✓ 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 6.0 / 10 · rule-coverage 100% · ceiling Documented

1 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 9 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.

End-of-life runtime: Node.js 18REDACTED:164

What to do

  1. Resolve the 1 End-of-life runtime finding(s) in Platform End-of-Life — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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

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

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

What to do

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

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

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

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

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

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

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

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

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

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 & stubs8.9 / 10Strong✓ Tool-verified

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.

  • The guard above `return 0;` also returns `0`, so no input can make it matter. Implement the distinction that was intended, or delete the guard. — src/function/matrix/map.js:243
  • A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. (×22) — test/unit-tests/core/import.test.js:363, test/unit-tests/core/import.test.js:368, test/unit-tests/core/import.test.js:373, …

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)10.0 / 10Exemplary✓ Tool-verified

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

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

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 repo is organised deliberately — src/test separation and consistent project naming.

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

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

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

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 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/javascript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2429 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:8
  • `REDACTED` 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`. — REDACTED:27

What to do

  • Add a SAST step to CI running what this repository's stack ships: CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, 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.
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.

PF1 · Benchmark discipline8.5 / 10Strong✓ Tool-verified

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

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

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

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

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

R1 · Type Safety0.0 / 10Critical✓ Tool-verified

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

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

  • 1 typed · 1020 plain JS — the untyped files are src/constants.js, src/core/config.js, src/core/create.js, src/core/function/config.js, src/core/function/import.js, src/core/function/typed.js (+1014 more). tsconfig.json switches off strictNullChecks, so the typed files are only partly type-checked.

What to do

  • Migrate the remaining .js/.jsx files to TypeScript.
R10 · Code Duplication8.5 / 10Strong✓ Tool-verified

React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): 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. Deterministic.

  • 33 duplicated blocks under src/function/ have copies in at least two of the sibling directories algebra, arithmetic, bitwise, combinatorics, complex, fraction (+9 more sibling(s) not listed) — 19 of them are reported below, and 14 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 33 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 33 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 33 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. — src/function/algebra/decomposition/lup.js:19
  • 24 duplicated blocks under src/ have copies in at least two of the sibling directories expression, function, plain, type, utils — 16 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 24 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 24 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 24 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. — src/function/matrix/mapSlices.js:53
  • src/function/statistics/max.js:9 · src/function/statistics/min.js:9 — 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. — src/function/statistics/max.js:9
  • src/type/matrix/utils/matAlgo10xSids.js:6 · src/type/matrix/utils/matAlgo12xSfs.js:6 — 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. — src/type/matrix/utils/matAlgo10xSids.js:6
  • src/type/matrix/DenseMatrix.js:65 · src/type/matrix/SparseMatrix.js:159 — the two spans are one implementation copied and then locally edited — 474 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. — src/type/matrix/DenseMatrix.js:65
  • src/function/algebra/solver/lsolveAll.js:1 · src/function/algebra/solver/usolveAll.js:1 — these 2 files are line-for-line copies of one another — 72 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — src/function/algebra/solver/lsolveAll.js:1
  • src/function/logical/or.js:16 · src/function/logical/xor.js:16 — the two spans are one implementation copied and then locally edited — 219 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. — src/function/logical/or.js:16
  • src/function/matrix/ones.js:44 · src/function/matrix/zeros.js:42 — 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. — src/function/matrix/ones.js:44
  • src/function/algebra/solver/lsolve.js:1 · src/function/algebra/solver/usolve.js:1 — these 2 files are line-for-line copies of one another — 59 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — src/function/algebra/solver/lsolve.js:1
  • src/function/arithmetic/ceil.js:127 · src/function/arithmetic/floor.js:137 — 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. — src/function/arithmetic/ceil.js:127
  • src/function/matrix/column.js:9 · src/function/matrix/row.js:9 — 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. — src/function/matrix/column.js:9
  • src/function/algebra/solver/usolve.js:15 · src/function/algebra/solver/usolveAll.js:15 — the two spans are one implementation copied and then locally edited — 399 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. — src/function/algebra/solver/usolve.js:15
  • src/function/arithmetic/ceil.js:11 · src/function/arithmetic/floor.js:11 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — src/function/arithmetic/ceil.js:11
  • src/function/bitwise/leftShift.js:1 · src/function/bitwise/rightArithShift.js:2 · src/function/bitwise/rightLogShift.js:1 — these 3 files are line-for-line copies of one another — 51 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — src/function/bitwise/leftShift.js:1
  • src/function/arithmetic/addScalar.js:7 · src/function/arithmetic/subtractScalar.js:7 — 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. — src/function/arithmetic/addScalar.js:7
  • src/function/trigonometry/acos.js:6 · src/function/trigonometry/asin.js:6 — 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. — src/function/trigonometry/acos.js:6
  • src/function/matrix/matrixFromColumns.js:3 · src/function/matrix/matrixFromRows.js:3 — the two spans are one implementation copied and then locally edited — 263 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. — src/function/matrix/matrixFromColumns.js:3
  • src/function/relational/largerEq.js:10 · src/function/relational/smallerEq.js:10 — the two spans are one implementation copied and then locally edited — 232 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. — src/function/relational/largerEq.js:10
  • src/function/trigonometry/cot.js:8 · src/function/trigonometry/csc.js:8 · src/function/trigonometry/sec.js:8 — the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — src/function/trigonometry/cot.js:8
  • src/function/trigonometry/coth.js:7 · src/function/trigonometry/csch.js:7 · src/function/trigonometry/sech.js:7 — the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — src/function/trigonometry/coth.js:7
  • src/function/matrix/mapSlices.js:53 · src/utils/collection.js:74 — the two spans are one implementation copied and then locally edited — 226 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/function/matrix/mapSlices.js:53
  • src/type/matrix/utils/matAlgo01xDSid.js:4 · src/type/matrix/utils/matAlgo03xDSf.js:4 — the two spans are one implementation copied and then locally edited — 357 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. — src/type/matrix/utils/matAlgo01xDSid.js:4
  • src/function/matrix/eigs/realSymmetric.js:25 · src/function/matrix/eigs/realSymmetric.js:56 — 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. — src/function/matrix/eigs/realSymmetric.js:25
  • src/type/matrix/DenseMatrix.js:904 · src/type/matrix/SparseMatrix.js:1292 — 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. — src/type/matrix/DenseMatrix.js:904
  • src/expression/transform/filter.transform.js:22 · src/expression/transform/forEach.transform.js:20 — 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. — src/expression/transform/filter.transform.js:22
  • src/function/probability/combinations.js:38 · src/function/probability/combinationsWithRep.js:56 — 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. — src/function/probability/combinations.js:38
  • src/type/matrix/utils/matAlgo02xDS0.js:68 · src/type/matrix/utils/matAlgo11xS0s.js:59 — 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. — src/type/matrix/utils/matAlgo02xDS0.js:68
  • src/function/algebra/derivative.js:324 · src/function/algebra/derivative.js:440 — 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. — src/function/algebra/derivative.js:324
  • src/function/arithmetic/log.js:59 · src/function/arithmetic/log10.js:38 — 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. — src/function/arithmetic/log.js:59
  • src/function/relational/equal.js:7 · src/function/relational/unequal.js:7 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — src/function/relational/equal.js:7
  • src/function/arithmetic/multiply.js:341 · src/function/arithmetic/multiply.js:551 — 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. — src/function/arithmetic/multiply.js:341
  • src/function/matrix/inv.js:64 · src/function/matrix/pinv.js:74 — the two spans are one implementation copied and then locally edited — 109 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. — src/function/matrix/inv.js:64
  • src/function/relational/larger.js:11 · src/function/relational/smaller.js:11 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — src/function/relational/larger.js:11
  • src/expression/transform/column.transform.js:16 · src/expression/transform/row.transform.js:16 — 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. — src/expression/transform/column.transform.js:16
  • src/function/algebra/simplify.js:945 · src/function/algebra/simplify.js:972 — 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. — src/function/algebra/simplify.js:945
  • src/type/matrix/DenseMatrix.js:808 · src/type/matrix/SparseMatrix.js:1151 — 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. — src/type/matrix/DenseMatrix.js:808
  • src/type/bignumber/function/bignumber.js:60 · src/type/fraction/function/fraction.js:75 — the two spans are one implementation copied and then locally edited — 99 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. — src/type/bignumber/function/bignumber.js:60
  • src/expression/node/ConditionalNode.js:169 · src/expression/node/RangeNode.js:187 — 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. — src/expression/node/ConditionalNode.js:169
  • src/expression/node/utils/access.js:16 · src/expression/node/utils/assign.js:19 — the two spans are one implementation copied and then locally edited — 105 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. — src/expression/node/utils/access.js:16
  • src/function/arithmetic/ceil.js:154 · src/function/arithmetic/fix.js:124 · src/function/arithmetic/floor.js:164 — the 3 copies are spread across 3 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. — src/function/arithmetic/ceil.js:154

What to do

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

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

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

  • _simplifyCore has cyclomatic complexity 86 and cognitive complexity 200; 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/function/algebra/simplifyCore.js:104
  • csAmd has cyclomatic complexity 55 and cognitive complexity 141; 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/function/algebra/sparse/csAmd.js:26
  • _ruleMatch has cyclomatic complexity 52 and cognitive complexity 110; 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/function/algebra/simplify.js:841
  • recurPol has cyclomatic complexity 49 and cognitive complexity 85; 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/function/algebra/rationalize.js:531
  • getToken has cyclomatic complexity 48 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/expression/parse.js:291
  • FunctionNode, function has cyclomatic complexity 48 and cognitive complexity 19; 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/function/algebra/derivative.js:225
  • calculateNecessaryParentheses has cyclomatic complexity 45 and cognitive complexity 73; 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/expression/node/OperatorNode.js:48
  • createUnitSingle has cyclomatic complexity 43 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/type/unit/Unit.js:3228
  • Object, Object has cyclomatic complexity 40 and cognitive complexity 56; 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/function/geometry/distance.js:139
  • foldFraction has cyclomatic complexity 38 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. — src/function/algebra/simplifyConstant.js:355
  • applyRule has cyclomatic complexity 34 and cognitive complexity 54; 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/function/algebra/simplify.js:589
  • (anonymous) has cyclomatic complexity 33 and cognitive complexity 42; 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/function/numeric/solveODE.js:98
  • approxEqual has cyclomatic complexity 33 and cognitive complexity 39; 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. — tools/approx.js:22
  • matAlgo04xSidSid has cyclomatic complexity 32 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/type/matrix/utils/matAlgo04xSidSid.js:26
  • matAlgo05xSfSf has cyclomatic complexity 30 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/type/matrix/utils/matAlgo05xSfSf.js:26
  • parse has cyclomatic complexity 29 and cognitive complexity 49; 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/type/unit/Unit.js:254
  • _toTex has cyclomatic complexity 27 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/expression/node/OperatorNode.js:600
  • (anonymous) has cyclomatic complexity 26 and cognitive complexity 46; 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/function/algebra/sparse/csCounts.js:23
  • _denseLUP has cyclomatic complexity 25 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. — src/function/algebra/decomposition/lup.js:88
  • parseAccessors has cyclomatic complexity 25 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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/expression/parse.js:1421

What to do

  • Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
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.

  • src/type/unit/Unit.js has 3147 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/type/unit/Unit.js:1
  • src/expression/parse.js has 1602 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/expression/parse.js:1
  • src/type/matrix/SparseMatrix.js has 1346 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/type/matrix/SparseMatrix.js:1
  • src/function/algebra/simplify.js has 1006 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/function/algebra/simplify.js:1
  • src/type/matrix/DenseMatrix.js has 939 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/type/matrix/DenseMatrix.js:1
  • src/utils/array.js has 860 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/utils/array.js:1
  • src/function/arithmetic/multiply.js has 813 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/function/arithmetic/multiply.js:1
  • src/function/algebra/derivative.js has 704 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/function/algebra/derivative.js:1
  • src/utils/number.js has 679 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/utils/number.js:1
  • tools/docgenerator.js has 653 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/docgenerator.js:1
  • src/expression/node/OperatorNode.js has 636 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/expression/node/OperatorNode.js:1
  • src/function/matrix/eigs/complexEigs.js has 568 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/function/matrix/eigs/complexEigs.js:1
  • src/function/algebra/rationalize.js has 564 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/function/algebra/rationalize.js:1
  • src/function/algebra/sparse/csAmd.js has 507 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/function/algebra/sparse/csAmd.js:1
  • tools/entryGenerator.js has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — tools/entryGenerator.js:1
  • src/expression/node/FunctionNode.js has 479 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/expression/node/FunctionNode.js:1
  • src/function/algebra/simplifyConstant.js has 460 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/function/algebra/simplifyConstant.js:1
  • src/core/function/typed.js has 422 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/core/function/typed.js:1
  • src/expression/operators.js has 402 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/expression/operators.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 Coverage9.7 / 10Exemplary✓ Tool-verified

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

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

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×15) — tools/whitelistgenerator.js:1, src/function/algebra/sparse/csChol.js:1, tools/update-authors.js:1, …

What to do

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

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

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

  • 37 outdated package(s); JS/npm CVEs scored in D30

What to do

  • Bump outdated dependencies to current versions to limit upgrade debt.
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each REDACTED 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: REDACTED scanned for test/lint/typecheck script wiring. Deterministic presence check.

R7 · Dead Code9.8 / 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.

  • 1040 file(s) (~133310 LoC) were excluded from dead-code analysis. This package's entry point(s) resolved, but the walk stopped one hop in: src/entry/mainAny.js imports './pureFunctionsAny.generated.js', which is not in the scanned tree. That is usually a generated or build-output module, so reachability cannot see past it and no dead-code claim is made about this package. Nothing is necessarily wrong here.
  • Nothing ultimately consumes this binding: its only referrer is the re-export in src/plain/number/index.js, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in src/plain/number/index.js in the same commit, or the barrel will import a name that no longer exists. — src/plain/number/probability.js:79
  • Nothing imports this binding — it is safe to review for removal. (×3) — src/utils/array.js:665, src/utils/array.js:674, src/utils/factory.js:105

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 Hygiene7.5 / 10Strong✓ 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.

  • Declared in the root REDACTED 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. (×3)

What to do

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

  • src/utils/customs.js → src/utils/object.js → src/utils/is.js → src/utils/map.js → src/utils/customs.js — src/utils/customs.js:1

What to do

  • Break each cycle by extracting the shared piece into a module both sides can import.
X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

  • `approxDeepEqual` is exported and takes `a: object` from its caller, and it calls itself at line 90 (`approxDeepEqual`) with a piece of `a` (and at line 97, line 105) — and nowhere in `approxDeepEqual` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `approxDeepEqual` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — tools/approx.js:90
  • `clone` is exported and takes `x: object` from its caller, and it calls itself at line 31 (`clone`) with a piece of `x` (and at line 40) — and nowhere in `clone` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/utils/object.js:31
  • `deepExtend` is exported and takes `a: object` from its caller, and it calls itself at line 105 (`deepExtend`) with a piece of `a` — and nowhere in `deepExtend` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `deepExtend` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/utils/object.js:105

What to do

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

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

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

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

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

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

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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

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

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 element6.2 / 10Adequate✓ Tool-verified

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.

  • This loop runs once per element of `a`, and the statement it guards acts on the element it is on — `a[j]`. The test deciding whether that statement runs does not: `a[0].length === 2` reads `a[0]`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out. — src/function/geometry/distance.js:298
  • This loop runs once per element of `a`, and the statement it guards acts on the element it is on — `a[j]`. The test deciding whether that statement runs does not: `a[0].length === 3` reads `a[0]`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out. — src/function/geometry/distance.js:301

What to do

  • Each finding names the test and the statement it guards, which index the same collection at two different subscripts — one fixed, one the loop variable. Confirm from the two, then decide which subscript the test meant. If it was meant to be per-element, give it the loop variable so each element is judged on itself. If it really is one answer for the whole collection, hoist the test OUT of the loop, where a reader can see it is asked once and where it is not re-evaluated on every pass — leaving it inside, reading a fixed element, is the one arrangement that cannot be right under either reading.
X3 · Exception handling5.7 / 10Adequate✓ Tool-verified

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

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

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×4) — src/utils/object.js:206, src/type/matrix/DenseMatrix.js:342, src/function/arithmetic/pow.js:127, …
  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — src/function/matrix/eigs/complexEigs.js:603

What to do

  • Swallowed exception (empty catch)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

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

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

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 Health53%Adequate — gated by D1, D2, R1Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture84%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity73%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness43%Weak — gated by P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security58%Adequate — gated by D30, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance91%ExemplaryStrongest area.
Unscored — 2 check(s) recorded observations but carry no score

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

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 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.

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 56 check(s) not relevant to this codebase

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: 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 — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, 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.
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Python, TypeScript, html not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — No hand-written C# or Visual Basic source; comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.html,.js), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • 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) — 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.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D5 Coupling — Not applicable — this npm build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • 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
  • 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 data present for 659 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
  • PF2 Allocation hygiene — Not applicable: TypeScript/JavaScript runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • S1 Web-Security Posture — Not assessed: 689 JavaScript/TypeScript file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, 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. The server controls — HTTPS enforcement, HSTS, cookie flags, 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.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.
  • 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 — 46 finding(s)
D30 · Dependency Vulnerabilities · High CVE · ×20
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D10 · Test Quality · No assertions (empty test) · ×1
  • No assertions (empty test): should throw an error if the axis exceeds the dimension of the matrix test/unit-tests/function/statistics/variance.test.js:120 — Test method has an empty body — it asserts nothing and exercises no code.
D10 · Test Quality · Assertions commented out · ×1
  • Assertions commented out: should throw an error in case of unit non-numeric argument test/unit-tests/function/arithmetic/multiply.test.js:231 — 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.
D13 · Secret Scanning · Leaked secret · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High vulnerability · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned knowledge · ×1
  • Orphaned knowledge src/function/matrix/eigs/complexEigs.js:1 — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
R9 · Circular Imports · Import cycle (4 files) · ×1
  • Import cycle (4 files) src/utils/customs.js:1 — src/utils/customs.js → src/utils/object.js → src/utils/is.js → src/utils/map.js → src/utils/customs.js
Serious — 639 finding(s)
D2 · Cognitive Complexity · (anonymous) · ×87
  • (anonymous)::_simplifyCore (cognitive 200) src/function/algebra/simplifyCore.js:104 — (anonymous)::_simplifyCore has cognitive complexity 200 (threshold 15). Drivers by points: if/else 66 (171 pts), boolean chains 16, ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 114). 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.
  • (anonymous)::_ruleMatch (cognitive 110) src/function/algebra/simplify.js:841 — (anonymous)::_ruleMatch has cognitive complexity 110 (threshold 15). Drivers by points: if/else 37 (86 pts), boolean chains 11, loops 2 (6 pts), ternaries 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 58). 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.
  • (anonymous)::getToken (cognitive 87) src/expression/parse.js:291 — (anonymous)::getToken has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 10 (27 pts), boolean chains 12 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::polyToCanonical::recurPol (cognitive 85) src/function/algebra/rationalize.js:531 — (anonymous)::polyToCanonical::recurPol has cognitive complexity 85 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 13, ternaries 4 (13 pts), loops 2 (5 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::calculateNecessaryParentheses (cognitive 73) src/expression/node/OperatorNode.js:48 — (anonymous)::calculateNecessaryParentheses has cognitive complexity 73 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 9, loops 1 (2 pts), match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::createUnitSingle (cognitive 71) src/type/unit/Unit.js:3228 — (anonymous)::createUnitSingle has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 7 (15 pts), boolean chains 11, error handling 1 (2 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.
  • (anonymous)::_denseLUP (cognitive 66) src/function/algebra/decomposition/lup.js:88 — (anonymous)::_denseLUP has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 9 (18 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::foldFraction (cognitive 59) src/function/algebra/simplifyConstant.js:355 — (anonymous)::foldFraction has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 3 (10 pts), error handling 1 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 32). 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.
  • (anonymous)::_inv (cognitive 59) src/function/matrix/inv.js:103 — (anonymous)::_inv has cognitive complexity 59 (threshold 15). Drivers by points: loops 8 (32 pts), if/else 11 (27 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • (anonymous)::_foldAccessor (cognitive 56) src/function/algebra/simplifyConstant.js:230 — (anonymous)::_foldAccessor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 30). 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.
  • (anonymous)::Object, Object (cognitive 56) src/function/geometry/distance.js:139 — (anonymous)::Object, Object has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 23 (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.
  • (anonymous)::matAlgo04xSidSid (cognitive 55) src/type/matrix/utils/matAlgo04xSidSid.js:26 — (anonymous)::matAlgo04xSidSid has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 9, loops 4 (8 pts), ternaries 6 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::matAlgo05xSfSf (cognitive 55) src/type/matrix/utils/matAlgo05xSfSf.js:26 — (anonymous)::matAlgo05xSfSf has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 8 (16 pts), loops 4 (8 pts), boolean chains 7 (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.
  • (anonymous)::applyRule (cognitive 54) src/function/algebra/simplify.js:589 — (anonymous)::applyRule has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (41 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::parseAccessors (cognitive 53) src/expression/parse.js:1421 — (anonymous)::parseAccessors has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (10 pts), boolean chains 7, ternaries 1 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::parse (cognitive 49) src/type/unit/Unit.js:254 — (anonymous)::parse has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 4 (7 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::_swapRows (cognitive 47) src/type/matrix/SparseMatrix.js:1434 — (anonymous)::_swapRows has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 6 (20 pts), boolean chains 5, loops 1 (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.
  • (anonymous)::_createFromArray (cognitive 44) src/type/matrix/SparseMatrix.js:87 — (anonymous)::_createFromArray has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 28). 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.
  • (anonymous)::_multiplySparseMatrixSparseMatrix (cognitive 43) src/function/arithmetic/multiply.js:648 — (anonymous)::_multiplySparseMatrixSparseMatrix has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (14 pts), boolean chains 6, ternaries 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::OperatorNode, function (cognitive 41) src/function/algebra/derivative.js:581 — (anonymous)::OperatorNode, function has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • (anonymous)::matAlgo06xS0S0 (cognitive 40) src/type/matrix/utils/matAlgo06xS0S0.js:27 — (anonymous)::matAlgo06xS0S0 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (7 pts), boolean chains 6, ternaries 5 (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.
  • (anonymous)::_toTex (cognitive 36) src/expression/node/OperatorNode.js:600 — (anonymous)::_toTex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, match/switch 2 (5 pts), ternaries 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous)::simplify (cognitive 35) src/type/unit/Unit.js:957 — (anonymous)::simplify has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). 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.
  • (anonymous)::parseMatrix (cognitive 34) src/expression/parse.js:1596 — (anonymous)::parseMatrix has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (8 pts) (nesting depth added 23). 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.
  • (anonymous)::_resize (cognitive 34) src/type/matrix/SparseMatrix.js:625 — (anonymous)::_resize has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 8 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
  • + 62 more in this group — see findings.md.
D1 · Cyclomatic Complexity · (anonymous) · ×46
  • (anonymous)::_simplifyCore (cyclomatic 86) src/function/algebra/simplifyCore.js:104 — (anonymous)::_simplifyCore has cyclomatic complexity 86 (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.
  • (anonymous)::_ruleMatch (cyclomatic 52) src/function/algebra/simplify.js:841 — (anonymous)::_ruleMatch has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::polyToCanonical::recurPol (cyclomatic 49) src/function/algebra/rationalize.js:531 — (anonymous)::polyToCanonical::recurPol has cyclomatic complexity 49 (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.
  • (anonymous)::getToken (cyclomatic 48) src/expression/parse.js:291 — (anonymous)::getToken has cyclomatic complexity 48 (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.
  • (anonymous)::FunctionNode, function (cyclomatic 48) src/function/algebra/derivative.js:225 — (anonymous)::FunctionNode, function has cyclomatic complexity 48 (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.
  • (anonymous)::calculateNecessaryParentheses (cyclomatic 45) src/expression/node/OperatorNode.js:48 — (anonymous)::calculateNecessaryParentheses 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.
  • (anonymous)::createUnitSingle (cyclomatic 43) src/type/unit/Unit.js:3228 — (anonymous)::createUnitSingle 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.
  • (anonymous)::Object, Object (cyclomatic 40) src/function/geometry/distance.js:139 — (anonymous)::Object, Object has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::foldFraction (cyclomatic 38) src/function/algebra/simplifyConstant.js:355 — (anonymous)::foldFraction 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.
  • (anonymous)::applyRule (cyclomatic 34) src/function/algebra/simplify.js:589 — (anonymous)::applyRule 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.
  • (anonymous)::matAlgo04xSidSid (cyclomatic 32) src/type/matrix/utils/matAlgo04xSidSid.js:26 — (anonymous)::matAlgo04xSidSid 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.
  • (anonymous)::matAlgo05xSfSf (cyclomatic 30) src/type/matrix/utils/matAlgo05xSfSf.js:26 — (anonymous)::matAlgo05xSfSf has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::parse (cyclomatic 29) src/type/unit/Unit.js:254 — (anonymous)::parse has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::_toTex (cyclomatic 27) src/expression/node/OperatorNode.js:600 — (anonymous)::_toTex has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::parseAccessors (cyclomatic 25) src/expression/parse.js:1421 — (anonymous)::parseAccessors has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::_swapRows (cyclomatic 25) src/type/matrix/SparseMatrix.js:1434 — (anonymous)::_swapRows has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::_denseLUP (cyclomatic 25) src/function/algebra/decomposition/lup.js:88 — (anonymous)::_denseLUP has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • (anonymous)::_multiplySparseMatrixSparseMatrix (cyclomatic 24) src/function/arithmetic/multiply.js:648 — (anonymous)::_multiplySparseMatrixSparseMatrix 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.
  • (anonymous)::_foldAccessor (cyclomatic 24) src/function/algebra/simplifyConstant.js:230 — (anonymous)::_foldAccessor 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.
  • (anonymous)::_denseDot (cyclomatic 24) src/function/matrix/dot.js:63 — (anonymous)::_denseDot has cyclomatic complexity 24 (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.
  • (anonymous)::_toString (cyclomatic 23) src/expression/node/OperatorNode.js:396 — (anonymous)::_toString 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.
  • (anonymous)::OperatorNode, function (cyclomatic 23) src/function/algebra/derivative.js:581 — (anonymous)::OperatorNode, function 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.
  • (anonymous)::_compareNatural (cyclomatic 23) src/function/relational/compareNatural.js:90 — (anonymous)::_compareNatural has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
  • (anonymous)::matAlgo06xS0S0 (cyclomatic 23) src/type/matrix/utils/matAlgo06xS0S0.js:27 — (anonymous)::matAlgo06xS0S0 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.
  • (anonymous)::Range (cyclomatic 22) src/type/matrix/Range.js:47 — (anonymous)::Range 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.
  • + 21 more in this group — see findings.md.
D3 · God Classes · FunctionTooLong · ×27
  • FunctionTooLong: parse.createParse src/expression/parse.js:29 — FunctionTooLong — createParse runs 845 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 745 over it, 8.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: simplify.createSimplify src/function/algebra/simplify.js:28 — FunctionTooLong — createSimplify runs 504 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 404 over it, 5.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: DenseMatrix.createDenseMatrixClass src/type/matrix/DenseMatrix.js:17 — FunctionTooLong — createDenseMatrixClass runs 432 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 332 over it, 4.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: OperatorNode.createOperatorNode src/expression/node/OperatorNode.js:15 — FunctionTooLong — createOperatorNode runs 379 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 279 over it, 3.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: multiply.createMultiply src/function/arithmetic/multiply.js:17 — FunctionTooLong — createMultiply runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.78× 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: complexEigs.createComplexEigs src/function/matrix/eigs/complexEigs.js:3 — FunctionTooLong — createComplexEigs runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.80× 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: simplifyConstant.createSimplifyConstant src/function/algebra/simplifyConstant.js:26 — FunctionTooLong — createSimplifyConstant runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78× 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: FunctionNode.createFunctionNode src/expression/node/FunctionNode.js:16 — FunctionTooLong — createFunctionNode runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 158 over it, 2.58× 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: import.importFactory src/core/function/import.js:6 — FunctionTooLong — importFactory runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× 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: lup.createLup src/function/algebra/decomposition/lup.js:21 — FunctionTooLong — createLup runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85× 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: realSymmetric.createRealSymmetric src/function/matrix/eigs/realSymmetric.js:3 — FunctionTooLong — createRealSymmetric runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× 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: distance.createDistance src/function/geometry/distance.js:16 — FunctionTooLong — createDistance runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× 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: simplifyCore.createSimplifyCore src/function/algebra/simplifyCore.js:28 — FunctionTooLong — createSimplifyCore runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61× 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: solveODE.createSolveODE src/function/numeric/solveODE.js:23 — FunctionTooLong — createSolveODE runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× 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: FibonacciHeap.createFibonacciHeapClass src/type/matrix/FibonacciHeap.js:6 — FunctionTooLong — createFibonacciHeapClass runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× 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: matrixmarket._importFromStream REDACTED:7 — FunctionTooLong — _importFromStream runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: RangeNode.createRangeNode src/expression/node/RangeNode.js:10 — FunctionTooLong — createRangeNode runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× 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: AssignmentNode.createAssignmentNode src/expression/node/AssignmentNode.js:15 — FunctionTooLong — createAssignmentNode runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35× 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: ConditionalNode.createConditionalNode src/expression/node/ConditionalNode.js:10 — FunctionTooLong — createConditionalNode 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: Range.createRangeClass src/type/matrix/Range.js:8 — FunctionTooLong — createRangeClass runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: util.createUtil src/function/algebra/simplify/util.js:12 — FunctionTooLong — createUtil runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: MatrixIndex.createIndexClass src/type/matrix/MatrixIndex.js:9 — FunctionTooLong — createIndexClass runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× 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: FunctionAssignmentNode.createFunctionAssignmentNode src/expression/node/FunctionAssignmentNode.js:16 — FunctionTooLong — createFunctionAssignmentNode runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× 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: RelationalNode.createRelationalNode src/expression/node/RelationalNode.js:12 — FunctionTooLong — createRelationalNode runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: map.createMap src/function/matrix/map.js:8 — FunctionTooLong — createMap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06× 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.
  • + 2 more in this group — see findings.md.
D10 · Test Quality · Skipped test · ×22
  • Skipped test: should order functions by their dependencies (1) test/unit-tests/utils/factory.test.js:35 — Skipped — switched off by it.skip
  • Skipped test: should not go crazy with circular dependencies test/unit-tests/utils/factory.test.js:67 — Skipped — switched off by it.skip
  • Skipped test: should cancel units in numerator and denominator test/unit-tests/type/unit/Unit.test.js:1170 — Skipped — switched off by it.skip
  • Skipped test: should throw an error when input array does not have two dimensions test/unit-tests/type/matrix/SparseMatrix.test.js:170 — Skipped — switched off by it.skip
  • Skipped test: should throw an error when the dimensions of the input array are invalid test/unit-tests/type/matrix/SparseMatrix.test.js:177 — Skipped — switched off by it.skip
  • Skipped test: should skip zero values if skipZeros is true test/unit-tests/type/matrix/utils/deepMap.test.js:66 — Skipped — switched off by it.skip
  • Skipped test: should return the product of strings (with BigNumber config) test/unit-tests/function/statistics/prod.test.js:29 — Skipped — switched off by it.skip
  • Skipped test: should return the product of strings (with bigint config) test/unit-tests/function/statistics/prod.test.js:37 — Skipped — switched off by it.skip
  • Skipped test: should return the quantileSeq of an array of bignumbers with number probability test/unit-tests/function/statistics/quantileSeq.test.js:97 — Skipped — switched off by it.skip
  • Skipped test: should return the max of strings by their numerical value (with BigNumber config) test/unit-tests/function/statistics/sum.test.js:31 — Skipped — switched off by it.skip
  • Skipped test: should return the max of strings by their numerical value (with bigint config) test/unit-tests/function/statistics/sum.test.js:39 — Skipped — switched off by it.skip
  • Skipped test: should calculate the modulus of bignumbers for fractions test/unit-tests/function/arithmetic/mod.test.js:81 — Skipped — switched off by it.skip
  • Skipped test: should multiply a bignumber and a unit correctly test/unit-tests/function/arithmetic/multiply.test.js:213 — Skipped — switched off by it.skip
  • Skipped test: should multiply a bignumber and a unit without value correctly test/unit-tests/function/arithmetic/multiply.test.js:222 — Skipped — switched off by it.skip
  • Skipped test: should return bignumber unary minus of a boolean test/unit-tests/function/arithmetic/unaryMinus.test.js:17 — Skipped — switched off by it.skip
  • Skipped test: processes a really complex expression test/unit-tests/function/algebra/rationalize.test.js:126 — Skipped — switched off by it.skip
  • Skipped test: should compute and simplify derivatives (3) test/unit-tests/function/algebra/simplify.test.js:608 — Skipped — switched off by it.skip
  • Skipped test: should import a factory with name test/unit-tests/core/import.test.js:363 — Skipped — switched off by it.skip
  • Skipped test: should import a factory with path test/unit-tests/core/import.test.js:368 — Skipped — switched off by it.skip
  • Skipped test: should import a factory without name test/unit-tests/core/import.test.js:373 — Skipped — switched off by it.skip
  • Skipped test: should pass the namespace to a factory function test/unit-tests/core/import.test.js:378 — Skipped — switched off by it.skip
  • Skipped test: should import an Array test/unit-tests/core/import.test.js:383 — Skipped — switched off by it.skip
R4 · Test Coverage · No test reaches this file · ×15
  • No test reaches this file tools/whitelistgenerator.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 src/function/algebra/sparse/csChol.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 tools/update-authors.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 src/function/algebra/sparse/csSymperm.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 tools/validateAsciiChars.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 src/function/algebra/sparse/csEreach.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 src/function/algebra/sparse/csCumsum.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 src/plain/bignumber/arithmetic.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 src/expression/embeddedDocs/function/probability/distribution.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 src/utils/log.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 src/plain/bignumber/index.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 bin/repl.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 src/entry/allFactoriesAny.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 src/entry/allFactoriesNumber.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 src/header.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.
D30 · Dependency Vulnerabilities · Medium CVE · ×9
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D2 · Cognitive Complexity · parse.createParse · ×7
  • parse.createParse::getToken (cognitive 87) src/expression/parse.js:291 — parse.createParse::getToken has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 10 (27 pts), boolean chains 12 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::parseBlock, parse.createParse::parseRange, parse.createParse::parseAccessors, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseAccessors (cognitive 49) src/expression/parse.js:1421 — parse.createParse::parseAccessors has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (10 pts), boolean chains 7 (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. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseMatrix (cognitive 34) src/expression/parse.js:1596 — parse.createParse::parseMatrix has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (8 pts) (nesting depth added 23). 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. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseBlock (cognitive 22) src/expression/parse.js:644 — parse.createParse::parseBlock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseRange, parse.createParse::parseAccessors, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseObject (cognitive 21) src/expression/parse.js:1688 — parse.createParse::parseObject has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseRange (cognitive 18) src/expression/parse.js:979 — parse.createParse::parseRange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseAccessors, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
  • parse.createParse::parseStringToken (cognitive 16) src/expression/parse.js:1550 — parse.createParse::parseStringToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 6 other methods here (parse.createParse::getToken, parse.createParse::parseBlock, parse.createParse::parseRange, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 7 times rather than 7 independent problems. Splitting this body alone leaves the other 6 exactly as they are. Where these are variations on one operation, the change that clears all 7 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.
D10 · Test Quality · No assertions · ×6
  • No assertions: should merge nested matrices test/unit-tests/expression/parse.test.js:838 — 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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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: should parse the user defined members test/unit-tests/core/import.test.js:106 — 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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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: should have all expected functions in lib/browser/main.js test/node-tests/browser.test.cjs:21 — 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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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: should be ES2020 compatible test/node-tests/browser.test.cjs: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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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: should contain embedded docs for every function test/node-tests/browser.test.cjs:92 — 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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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: should multiply matrix x matrix 1220 x 1220, Matrix Market, sparse x sparse test/node-tests/function/arithmetic/multiply.test.js:9 — 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* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, 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.
D8 · Code Coverage · Low coverage · ×6
  • Low coverage: src/function/algebra/sparse/csCounts.js src/function/algebra/sparse/csCounts.js:1 — 22.6% line coverage (24/106).
  • Low coverage: src/function/algebra/sparse/csEtree.js src/function/algebra/sparse/csEtree.js:1 — 19.0% line coverage (12/63).
  • Low coverage: src/function/algebra/sparse/csLeaf.js src/function/algebra/sparse/csLeaf.js:1 — 37.3% line coverage (19/51).
  • Low coverage: src/function/algebra/sparse/csPost.js src/function/algebra/sparse/csPost.js:1 — 26.1% line coverage (12/46).
  • Low coverage: src/function/algebra/sparse/csSqr.js src/function/algebra/sparse/csSqr.js:1 — 39.1% line coverage (61/156).
  • Low coverage: src/utils/noop.js src/utils/noop.js:1 — 47.4% line coverage (9/19).
D2 · Cognitive Complexity · simplify.createSimplify · ×5
  • simplify.createSimplify::_ruleMatch (cognitive 109) src/function/algebra/simplify.js:841 — simplify.createSimplify::_ruleMatch has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (86 pts), boolean chains 10, loops 2 (6 pts), ternaries 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 58). 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. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • simplify.createSimplify::applyRule (cognitive 55) src/function/algebra/simplify.js:589 — simplify.createSimplify::applyRule has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::mergeMatch, simplify.createSimplify::_ruleMatch, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • simplify.createSimplify::_exactMatch (cognitive 30) src/function/algebra/simplify.js:1032 — simplify.createSimplify::_exactMatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • simplify.createSimplify::_simplify (cognitive 25) src/function/algebra/simplify.js:524 — simplify.createSimplify::_simplify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::mergeMatch, simplify.createSimplify::_ruleMatch, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • simplify.createSimplify::mergeMatch (cognitive 17) src/function/algebra/simplify.js:750 — simplify.createSimplify::mergeMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (simplify.createSimplify::_simplify, simplify.createSimplify::applyRule, simplify.createSimplify::_ruleMatch, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · rationalize.createRationalize · ×5
  • rationalize.createRationalize::polyToCanonical::recurPol (cognitive 72) src/function/algebra/rationalize.js:531 — rationalize.createRationalize::polyToCanonical::recurPol has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 13, loops 2 (5 pts) (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. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • rationalize.createRationalize::expandPower (cognitive 30) src/function/algebra/rationalize.js:388 — rationalize.createRationalize::expandPower has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::polyToCanonical, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • rationalize.createRationalize::polyToCanonical (cognitive 25) src/function/algebra/rationalize.js:475 — rationalize.createRationalize::polyToCanonical has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (4 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. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • rationalize.createRationalize::polynomial::recPoly (cognitive 21) src/function/algebra/rationalize.js:241 — rationalize.createRationalize::polynomial::recPoly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::_rationalize, rationalize.createRationalize::expandPower, rationalize.createRationalize::polyToCanonical, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • rationalize.createRationalize::_rationalize (cognitive 20) src/function/algebra/rationalize.js:115 — rationalize.createRationalize::_rationalize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 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. This shape REPEATS in the file: 4 other methods here (rationalize.createRationalize::polynomial::recPoly, rationalize.createRationalize::expandPower, rationalize.createRationalize::polyToCanonical, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · multiply.createMultiply · ×5
  • multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cognitive 42) src/function/arithmetic/multiply.js:648 — multiply.createMultiply::_multiplySparseMatrixSparseMatrix has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (14 pts), boolean chains 5, ternaries 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • multiply.createMultiply::_multiplyDenseMatrixSparseMatrix (cognitive 29) src/function/arithmetic/multiply.js:326 — multiply.createMultiply::_multiplyDenseMatrixSparseMatrix has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (8 pts), boolean chains 5, ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • multiply.createMultiply::_multiplySparseMatrixDenseMatrix (cognitive 26) src/function/arithmetic/multiply.js:537 — multiply.createMultiply::_multiplySparseMatrixDenseMatrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (9 pts), boolean chains 4, ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • multiply.createMultiply::_multiplySparseMatrixVector (cognitive 20) src/function/arithmetic/multiply.js:435 — multiply.createMultiply::_multiplySparseMatrixVector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 4, 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. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_validateMatrixDimensions, multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • multiply.createMultiply::_validateMatrixDimensions (cognitive 17) src/function/arithmetic/multiply.js:21 — multiply.createMultiply::_validateMatrixDimensions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 4 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · multiply.createMultiply · ×4
  • multiply.createMultiply::_multiplySparseMatrixSparseMatrix (cyclomatic 24) src/function/arithmetic/multiply.js:648 — multiply.createMultiply::_multiplySparseMatrixSparseMatrix 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 shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • multiply.createMultiply::_multiplyDenseMatrixSparseMatrix (cyclomatic 19) src/function/arithmetic/multiply.js:326 — multiply.createMultiply::_multiplyDenseMatrixSparseMatrix 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 shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • multiply.createMultiply::_multiplySparseMatrixDenseMatrix (cyclomatic 18) src/function/arithmetic/multiply.js:537 — multiply.createMultiply::_multiplySparseMatrixDenseMatrix has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixVector, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • multiply.createMultiply::_multiplySparseMatrixVector (cyclomatic 17) src/function/arithmetic/multiply.js:435 — multiply.createMultiply::_multiplySparseMatrixVector 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: 3 other methods here (multiply.createMultiply::_multiplyDenseMatrixSparseMatrix, multiply.createMultiply::_multiplySparseMatrixDenseMatrix, multiply.createMultiply::_multiplySparseMatrixSparseMatrix) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 20) · ×4
  • (anonymous) (cyclomatic 20) src/expression/node/IndexNode.js:13 — (anonymous) 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 19 function items inside it that branch (constructor, _compile::(anonymous)::evalDimension, isObjectProperty, …). 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.
  • (anonymous) (cyclomatic 20) src/function/statistics/quantileSeq.js:8 — (anonymous) 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 11 function items inside it that branch (_quantileSeq, _quantileSeqProbNumber, _quantileSeqProbCollection, …). 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.
  • (anonymous) (cyclomatic 20) src/function/algebra/solver/usolveAll.js:15 — (anonymous) 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 12 function items inside it that branch (_sparseBackwardSubstitution, _denseBackwardSubstitution, SparseMatrix, Array | Matrix, …). 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.
  • (anonymous) (cyclomatic 20) src/function/algebra/solver/lsolveAll.js:15 — (anonymous) 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 12 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution, SparseMatrix, Array | Matrix, …). 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 · (anonymous) (cyclomatic 17) · ×4
  • (anonymous) (cyclomatic 17) src/function/matrix/diff.js:8 — (anonymous) 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 11 function items inside it that branch (_ElementDiff, _recursive, Array | Matrix, number, …). 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.
  • (anonymous) (cyclomatic 17) src/expression/node/ConstantNode.js:11 — (anonymous) 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 12 function items inside it that branch (_toHTML, _toTex, constructor, …). 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.
  • (anonymous) (cyclomatic 17) src/expression/node/ParenthesisNode.js:9 — (anonymous) 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 12 function items inside it that branch (_toString, _toHTML, _toTex, …). 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.
  • (anonymous) (cyclomatic 17) src/function/matrix/partitionSelect.js:8 — (anonymous) 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 5 function items inside it that branch (quickSelect, _partitionSelect, Array | Matrix, number, string, …). 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 · complexEigs.createComplexEigs · ×4
  • complexEigs.createComplexEigs::balance (cognitive 50) src/function/matrix/eigs/complexEigs.js:60 — complexEigs.createComplexEigs::balance has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 6 (19 pts), ternaries 6 (7 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • complexEigs.createComplexEigs::iterateUntilTriangular (cognitive 42) src/function/matrix/eigs/complexEigs.js:241 — complexEigs.createComplexEigs::iterateUntilTriangular has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (11 pts), ternaries 5 (6 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • complexEigs.createComplexEigs::reduceToHessenberg (cognitive 38) src/function/matrix/eigs/complexEigs.js:158 — complexEigs.createComplexEigs::reduceToHessenberg has cognitive complexity 38 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 7 (17 pts), ternaries 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::iterateUntilTriangular, complexEigs.createComplexEigs::findEigenvectors) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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.
  • complexEigs.createComplexEigs::findEigenvectors (cognitive 16) src/function/matrix/eigs/complexEigs.js:398 — complexEigs.createComplexEigs::findEigenvectors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 4 (6 pts), loops 3 (4 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. This shape REPEATS in the file: 3 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · SparseMatrix.createSparseMatrixClass · ×4
  • SparseMatrix.createSparseMatrixClass::_createFromArray (cognitive 42) src/type/matrix/SparseMatrix.js:87 — SparseMatrix.createSparseMatrixClass::_createFromArray has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (33 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 27). 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. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_setsubset, SparseMatrix.createSparseMatrixClass::_resize, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • SparseMatrix.createSparseMatrixClass::_resize (cognitive 34) src/type/matrix/SparseMatrix.js:625 — SparseMatrix.createSparseMatrixClass::_resize has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 8 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • SparseMatrix.createSparseMatrixClass::_setsubset (cognitive 25) src/type/matrix/SparseMatrix.js:364 — SparseMatrix.createSparseMatrixClass::_setsubset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_resize, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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.
  • SparseMatrix.createSparseMatrixClass::_map (cognitive 24) src/type/matrix/SparseMatrix.js:900 — SparseMatrix.createSparseMatrixClass::_map has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass, SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · (anonymous) (cognitive 16) · ×4
  • (anonymous) (cognitive 16) src/expression/Parser.js:8 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 13 function items inside it that branch (toJSON, isValidVariableName, Parser, …). 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.
  • (anonymous) (cognitive 16) src/function/matrix/diag.js:9 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5, boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 15 function items inside it that branch (_getDiagonal, _diag, _createDiagonalMatrix, …). 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.
  • (anonymous) (cognitive 16) src/function/special/zeta.js:6 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 1). None of this is in the body itself: all 16 points belong to 15 function items inside it that branch (zetaComplex, zetaNumeric, zeta, …). 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.
  • (anonymous) (cognitive 16) src/expression/node/ParenthesisNode.js:9 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 4. None of this is in the body itself: all 16 points belong to 12 function items inside it that branch (_toString, _toHTML, _toTex, …). 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.
D3 · God Classes · FileTooLong · ×4
  • FileTooLong: unit/Unit.js src/type/unit/Unit.js — FileTooLong — 2176 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), about 99% of them inside a single declaration: createUnitClass (29-3411). The bar is 1500 significant lines; this is 676 over it, 1.45× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: expression/parse.js src/expression/parse.js — FileTooLong — 870 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: createParse (29-1857). The bar is 500 significant lines; this is 370 over it, 1.74× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: matrix/SparseMatrix.js src/type/matrix/SparseMatrix.js — FileTooLong — 618 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: createSparseMatrixClass (17-1483). The bar is 500 significant lines; this is 118 over it, 1.24× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: algebra/simplify.js src/function/algebra/simplify.js — FileTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06× 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×4
  • Swallowed exception (empty catch) src/utils/object.js:206 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) src/type/matrix/DenseMatrix.js:342 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) src/function/arithmetic/pow.js:127 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) src/function/algebra/simplifyConstant.js:382 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D1 · Cyclomatic Complexity · simplify.createSimplify · ×3
  • simplify.createSimplify::_ruleMatch (cyclomatic 52) src/function/algebra/simplify.js:841 — simplify.createSimplify::_ruleMatch has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::_exactMatch) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • simplify.createSimplify::applyRule (cyclomatic 35) src/function/algebra/simplify.js:589 — simplify.createSimplify::applyRule has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (simplify.createSimplify::_ruleMatch, simplify.createSimplify::_exactMatch) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • simplify.createSimplify::_exactMatch (cyclomatic 19) src/function/algebra/simplify.js:1032 — simplify.createSimplify::_exactMatch 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 shape REPEATS in the file: 2 other methods here (simplify.createSimplify::applyRule, simplify.createSimplify::_ruleMatch) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · parse.createParse · ×3
  • parse.createParse::getToken (cyclomatic 48) src/expression/parse.js:291 — parse.createParse::getToken has cyclomatic complexity 48 (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: 2 other methods here (parse.createParse::parseBlock, parse.createParse::parseAccessors) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • parse.createParse::parseAccessors (cyclomatic 25) src/expression/parse.js:1421 — parse.createParse::parseAccessors has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (parse.createParse::getToken, parse.createParse::parseBlock) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • parse.createParse::parseBlock (cyclomatic 16) src/expression/parse.js:644 — parse.createParse::parseBlock has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (parse.createParse::getToken, parse.createParse::parseAccessors) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · complexEigs.createComplexEigs · ×3
  • complexEigs.createComplexEigs::iterateUntilTriangular (cyclomatic 23) src/function/matrix/eigs/complexEigs.js:241 — complexEigs.createComplexEigs::iterateUntilTriangular 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 shape REPEATS in the file: 2 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::reduceToHessenberg) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • complexEigs.createComplexEigs::balance (cyclomatic 20) src/function/matrix/eigs/complexEigs.js:60 — complexEigs.createComplexEigs::balance 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. This shape REPEATS in the file: 2 other methods here (complexEigs.createComplexEigs::reduceToHessenberg, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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.
  • complexEigs.createComplexEigs::reduceToHessenberg (cyclomatic 17) src/function/matrix/eigs/complexEigs.js:158 — complexEigs.createComplexEigs::reduceToHessenberg 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: 2 other methods here (complexEigs.createComplexEigs::balance, complexEigs.createComplexEigs::iterateUntilTriangular) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 18) · ×3
  • (anonymous) (cyclomatic 18) src/function/algebra/decomposition/qr.js:22 — (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 7 function items inside it that branch (_denseQRimpl, _denseQR, DenseMatrix, …). 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.
  • (anonymous) (cyclomatic 18) src/function/matrix/rotationMatrix.js:20 — (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 14 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, number | BigNumber | Complex | Unit, Matrix, …). 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.
  • (anonymous) (cyclomatic 18) src/expression/node/SymbolNode.js:13 — (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 17 function items inside it that branch (_toHTML, _toTex, _compile, …). 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 · (anonymous) (cyclomatic 16) · ×3
  • (anonymous) (cyclomatic 16) src/expression/node/Node.js:11 — (anonymous) 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 31 function items inside it that branch (_getCustomString, _validateScope, equals, …). 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.
  • (anonymous) (cyclomatic 16) src/function/matrix/diag.js:9 — (anonymous) 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 15 function items inside it that branch (_diag, _createDiagonalMatrix, _getDiagonal, …). 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.
  • (anonymous) (cyclomatic 16) src/function/algebra/solver/lsolve.js:15 — (anonymous) 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 5 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution, SparseMatrix, Array | Matrix, …). 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.
D12 · Dependency Hygiene · Deprecated · ×3
  • Deprecated: codecov REDACTED:52 — codecov 3.8.3, declared in REDACTED, is marked deprecated by its publisher: "https://about.codecov.io/blog/codecov-uploader-deprecation-plan/". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: eslint REDACTED:56 — eslint 8.57.1, declared in REDACTED, is marked deprecated by its publisher: "This version is no longer supported. Please see https://eslint.org/version-support for other options.". Replace it with the package or version that message names, or record why this one must stay.
  • Deprecated: glob REDACTED:67 — glob 11.0.3, declared in REDACTED, 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". Replace it with the package or version that message names, or record why this one must stay.
D17 · Explicit Debt · TodoComment · ×3
  • TodoComment test/typescript-tests/testTypes.ts:218 — // TODO: Typescript type declarations are not understanding typed-function's — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment test/typescript-tests/testTypes.ts:1008 — // TODO complete the rest of these... — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment test/typescript-tests/testTypes.ts:2914 — // TODO add proper types for toTex options — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · (anonymous) (cognitive 30) · ×3
  • (anonymous) (cognitive 30) src/expression/node/FunctionAssignmentNode.js:16 — (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 4 (5 pts), loops 3 (nesting depth added 2). None of this is in the body itself: all 30 points belong to 18 function items inside it that branch (constructor, _toHTML, _toString, …). 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.
  • (anonymous) (cognitive 30) src/expression/node/RelationalNode.js:12 — (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 6, if/else 4 (5 pts), loops 4 (nesting depth added 1). None of this is in the body itself: all 30 points belong to 18 function items inside it that branch (_toString, a function literal at line 126, _toHTML, …). 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.
  • (anonymous) (cognitive 30) src/expression/node/AccessorNode.js:22 — (anonymous) has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 5). None of this is in the body itself: all 30 points belong to 15 function items inside it that branch (name, _compile::evalAccessorNode, _compile::evalAccessorNode, …). 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 · (anonymous) (cognitive 21) · ×3
  • (anonymous) (cognitive 21) src/expression/node/IndexNode.js:13 — (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 3, ternaries 3 (nesting depth added 1). None of this is in the body itself: all 21 points belong to 19 function items inside it that branch (constructor, _toHTML, a function literal at line 69, …). 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.
  • (anonymous) (cognitive 21) src/expression/node/SymbolNode.js:13 — (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, ternaries 4 (7 pts), boolean chains 2 (nesting depth added 3). None of this is in the body itself: all 21 points belong to 17 function items inside it that branch (_toHTML, _compile, _toTex, …). 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.
  • (anonymous) (cognitive 21) src/type/chain/Chain.js:9 — (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 14 function items inside it that branch (createProxy, a function literal at line 132, Chain, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D36 · Supply-chain Provenance & Signing REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
R10 · Code Duplication · Duplicated block (24 lines × 2 locations) · ×3
  • Duplicated block (24 lines × 2 locations) src/expression/transform/filter.transform.js:22 — src/expression/transform/filter.transform.js:22 · src/expression/transform/forEach.transform.js:20 — 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.
  • Duplicated block (24 lines × 2 locations) src/function/probability/combinations.js:38 — src/function/probability/combinations.js:38 · src/function/probability/combinationsWithRep.js:56 — 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.
  • Duplicated block (24 lines × 2 locations) src/type/matrix/utils/matAlgo02xDS0.js:68 — src/type/matrix/utils/matAlgo02xDS0.js:68 · src/type/matrix/utils/matAlgo11xS0s.js:59 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (23 lines × 2 locations) · ×3
  • Duplicated block (23 lines × 2 locations) src/function/algebra/derivative.js:324 — src/function/algebra/derivative.js:324 · src/function/algebra/derivative.js:440 — 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.
  • Duplicated block (23 lines × 2 locations) src/function/arithmetic/log.js:59 — src/function/arithmetic/log.js:59 · src/function/arithmetic/log10.js:38 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (23 lines × 2 locations) src/function/relational/equal.js:7 — src/function/relational/equal.js:7 · src/function/relational/unequal.js:7 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (21 lines × 2 locations) · ×3
  • Duplicated block (21 lines × 2 locations) src/expression/transform/column.transform.js:16 — src/expression/transform/column.transform.js:16 · src/expression/transform/row.transform.js:16 — 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.
  • Duplicated block (21 lines × 2 locations) src/function/algebra/simplify.js:945 — src/function/algebra/simplify.js:945 · src/function/algebra/simplify.js:972 — 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.
  • Duplicated block (21 lines × 2 locations) src/type/matrix/DenseMatrix.js:808 — src/type/matrix/DenseMatrix.js:808 · src/type/matrix/SparseMatrix.js:1151 — 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.
X17 · Uncapped recursion over a caller-supplied document · Recursive walk over a caller-supplied document has no depth cap · ×3
  • Recursive walk over a caller-supplied document has no depth cap tools/approx.js:90 — `approxDeepEqual` is exported and takes `a: object` from its caller, and it calls itself at line 90 (`approxDeepEqual`) with a piece of `a` (and at line 97, line 105) — and nowhere in `approxDeepEqual` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `approxDeepEqual` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/utils/object.js:31 — `clone` is exported and takes `x: object` from its caller, and it calls itself at line 31 (`clone`) with a piece of `x` (and at line 40) — and nowhere in `clone` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
  • Recursive walk over a caller-supplied document has no depth cap src/utils/object.js:105 — `deepExtend` is exported and takes `a: object` from its caller, and it calls itself at line 105 (`deepExtend`) with a piece of `a` — and nowhere in `deepExtend` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: `JSON.parse` accepts any depth, so a 100,000-byte body — inside Express's default 100kb limit — parses to 50,000 levels, and a walk like this one throws `RangeError: Maximum call stack size exceeded` long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any `try` — an event handler, a timer, a promise nobody awaits — takes the Node process down with every other request in flight. Thread a depth argument through `deepExtend` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
D1 · Cyclomatic Complexity · rationalize.createRationalize · ×2
  • rationalize.createRationalize::polyToCanonical::recurPol (cyclomatic 49) src/function/algebra/rationalize.js:531 — rationalize.createRationalize::polyToCanonical::recurPol has cyclomatic complexity 49 (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 (rationalize.createRationalize::expandPower) 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.
  • rationalize.createRationalize::expandPower (cyclomatic 17) src/function/algebra/rationalize.js:388 — rationalize.createRationalize::expandPower 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 (rationalize.createRationalize::polyToCanonical::recurPol) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 40) · ×2
  • (anonymous) (cyclomatic 40) src/function/numeric/solveODE.js:23 — (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 23 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, …). 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.
  • (anonymous) (cyclomatic 40) src/expression/node/RangeNode.js:10 — (anonymous) has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 16 function items inside it that branch (calculateNecessaryParentheses, _toString, _toHTML, …). 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 · simplifyConstant.createSimplifyConstant · ×2
  • simplifyConstant.createSimplifyConstant::foldFraction (cyclomatic 38) src/function/algebra/simplifyConstant.js:355 — simplifyConstant.createSimplifyConstant::foldFraction 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::_foldAccessor) 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.
  • simplifyConstant.createSimplifyConstant::_foldAccessor (cyclomatic 24) src/function/algebra/simplifyConstant.js:230 — simplifyConstant.createSimplifyConstant::_foldAccessor 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 shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::foldFraction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 36) · ×2
  • (anonymous) (cyclomatic 36) src/expression/node/AssignmentNode.js:15 — (anonymous) has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 4 of the 36 points are its own statements and the rest belongs to 18 function items inside it that branch (constructor, _compile, _toString, …). 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.
  • (anonymous) (cyclomatic 36) src/function/geometry/intersect.js:8 — (anonymous) has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 13 function items inside it that branch (_AAAA, _coerceArr, _4d, …). 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 · (anonymous) (cyclomatic 34) · ×2
  • (anonymous) (cyclomatic 34) src/function/matrix/map.js:8 — (anonymous) 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 26 function items inside it that branch (_mapMultiple, mapMultiple::iterate, _getCallbackArgCount, …). 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.
  • (anonymous) (cyclomatic 34) src/type/matrix/MatrixIndex.js:9 — (anonymous) 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 16 function items inside it that branch (Index, _createImmutableMatrix, size, …). 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 · (anonymous) (cyclomatic 24) · ×2
  • (anonymous) (cyclomatic 24) src/type/matrix/ImmutableDenseMatrix.js:11 — (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 13 function items inside it that branch (ImmutableDenseMatrix, subset, min, …). 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.
  • (anonymous) (cyclomatic 24) src/type/complex/Complex.js:9 — (anonymous) has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 6 function items inside it that branch (format, fromPolar, compare, …). 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 · (anonymous) (cyclomatic 21) · ×2
  • (anonymous) (cyclomatic 21) src/expression/node/ObjectNode.js:12 — (anonymous) 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 13 function items inside it that branch (constructor, _compile, _compile::evalObjectNode, …). 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.
  • (anonymous) (cyclomatic 21) src/function/matrix/det.js:9 — (anonymous) 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 4 function items inside it that branch (_det, det, any, …). 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 · simplifyConstant.createSimplifyConstant · ×2
  • simplifyConstant.createSimplifyConstant::foldFraction (cognitive 59) src/function/algebra/simplifyConstant.js:355 — simplifyConstant.createSimplifyConstant::foldFraction has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 3 (10 pts), error handling 1 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 32). 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::_foldAccessor) 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.
  • simplifyConstant.createSimplifyConstant::_foldAccessor (cognitive 56) src/function/algebra/simplifyConstant.js:230 — simplifyConstant.createSimplifyConstant::_foldAccessor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 2 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 30). 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. This shape REPEATS in the file: one other method here (simplifyConstant.createSimplifyConstant::foldFraction) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · lsolveAll.createLsolveAll · ×2
  • lsolveAll.createLsolveAll::_sparseForwardSubstitution (cognitive 29) src/function/algebra/solver/lsolveAll.js:117 — lsolveAll.createLsolveAll::_sparseForwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 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. This shape REPEATS in the file: one other method here (lsolveAll.createLsolveAll::_denseForwardSubstitution) 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.
  • lsolveAll.createLsolveAll::_denseForwardSubstitution (cognitive 21) src/function/algebra/solver/lsolveAll.js:59 — lsolveAll.createLsolveAll::_denseForwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (lsolveAll.createLsolveAll::_sparseForwardSubstitution) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · usolveAll.createUsolveAll · ×2
  • usolveAll.createUsolveAll::_sparseBackwardSubstitution (cognitive 29) src/function/algebra/solver/usolveAll.js:117 — usolveAll.createUsolveAll::_sparseBackwardSubstitution has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (14 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. This shape REPEATS in the file: one other method here (usolveAll.createUsolveAll::_denseBackwardSubstitution) 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.
  • usolveAll.createUsolveAll::_denseBackwardSubstitution (cognitive 21) src/function/algebra/solver/usolveAll.js:59 — usolveAll.createUsolveAll::_denseBackwardSubstitution has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (usolveAll.createUsolveAll::_sparseBackwardSubstitution) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · (anonymous) (cognitive 29) · ×2
  • (anonymous) (cognitive 29) src/function/arithmetic/norm.js:23 — (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 9 (nesting depth added 2). None of this is in the body itself: all 29 points belong to 22 function items inside it that branch (_vectorNorm, _norm, _matrixNorm, …). 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.
  • (anonymous) (cognitive 29) src/expression/node/ObjectNode.js:12 — (anonymous) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8, boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 29 points belong to 13 function items inside it that branch (constructor, _compile, _compile::evalObjectNode, …). 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 · (anonymous) (cognitive 19) · ×2
  • (anonymous) (cognitive 19) src/function/matrix/rotationMatrix.js:20 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10, if/else 5 (7 pts), boolean chains 2 (nesting depth added 2). None of this is in the body itself: all 19 points belong to 14 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, number | BigNumber | Complex | Unit, Matrix, …). 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.
  • (anonymous) (cognitive 19) src/function/matrix/diff.js:8 — (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2. None of this is in the body itself: all 19 points belong to 11 function items inside it that branch (_ElementDiff, _recursive, Array | Matrix, number, …). 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 · (anonymous) (cognitive 18) · ×2
  • (anonymous) (cognitive 18) src/function/arithmetic/nthRoot.js:17 — (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, ternaries 4 (6 pts), boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 17 function items inside it that branch (_bigNthRoot, a function literal at line 86, a function literal at line 97, …). 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.
  • (anonymous) (cognitive 18) src/function/matrix/expm.js:8 — (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to 4 function items inside it that branch (Matrix, findParams, infinityNorm, …). 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 · (anonymous) (cognitive 17) · ×2
  • (anonymous) (cognitive 17) src/type/unit/Unit.js:29 — (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 179 (294 pts), loops 48 (71 pts), boolean chains 68, ternaries 13 (20 pts), error handling 3 (7 pts), other 1 (nesting depth added 149). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • (anonymous) (cognitive 17) src/function/algebra/polynomialRoot.js:20 — (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 3 function items inside it that branch (number|Complex, ...number|Complex, a function literal at line 145, a function literal at line 144). 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.
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: embeddedDocs.js ↔ factoriesAny.js src/expression/embeddedDocs/embeddedDocs.js:1 — `src/expression/embeddedDocs/embeddedDocs.js` and `src/factoriesAny.js` change together 71% of the time (27 of the 38 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 27 shared commits counted here, the most recent 3 are `f7c10b1b` feat: Fraction numerator and denominator helper functions (#3605); `faf249b6` feature: add function `bernoulli` to calculate Bernoulli numbers (#3551); `9ee2a008` feat: implement functions `isFinite` and `isBounded` (#3554) — run `git show` on any of them.
  • Change coupling: DenseMatrix.js ↔ SparseMatrix.js src/type/matrix/DenseMatrix.js:1 — `src/type/matrix/DenseMatrix.js` and `src/type/matrix/SparseMatrix.js` change together 62% of the time (53 of the 86 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 53 shared commits counted here, the most recent 3 are `10602fdb` feat: matrix subset according to type of input (#3485); `7c154a0e` feat: return arity and use it for faster alrogithms; `367c0d3d` chore: improve performance of functions `map`, `filter` and `forEach`… — run `git show` on any of them.
R10 · Code Duplication · Duplicated block (31 lines × 3 locations) · ×2
  • Duplicated block (31 lines × 3 locations) src/function/trigonometry/cot.js:8 — src/function/trigonometry/cot.js:8 · src/function/trigonometry/csc.js:8 · src/function/trigonometry/sec.js:8 — the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
  • Duplicated block (31 lines × 3 locations) src/function/trigonometry/coth.js:7 — src/function/trigonometry/coth.js:7 · src/function/trigonometry/csch.js:7 · src/function/trigonometry/sech.js:7 — the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R10 · Code Duplication · Duplicated block (27 lines × 2 locations) · ×2
  • Duplicated block (27 lines × 2 locations) src/function/matrix/eigs/realSymmetric.js:25 — src/function/matrix/eigs/realSymmetric.js:25 · src/function/matrix/eigs/realSymmetric.js:56 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (27 lines × 2 locations) src/type/matrix/DenseMatrix.js:904 — src/type/matrix/DenseMatrix.js:904 · src/type/matrix/SparseMatrix.js:1292 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (22 lines × 2 locations) · ×2
  • Duplicated block (22 lines × 2 locations) src/function/arithmetic/multiply.js:341 — src/function/arithmetic/multiply.js:341 · src/function/arithmetic/multiply.js:551 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (22 lines × 2 locations) src/function/relational/larger.js:11 — src/function/relational/larger.js:11 · src/function/relational/smaller.js:11 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
X29 · Per-element action decided by a fixed element · Per-element action decided by a fixed element · ×2
  • Per-element action decided by a fixed element src/function/geometry/distance.js:298 — This loop runs once per element of `a`, and the statement it guards acts on the element it is on — `a[j]`. The test deciding whether that statement runs does not: `a[0].length === 2` reads `a[0]`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out.
  • Per-element action decided by a fixed element src/function/geometry/distance.js:301 — This loop runs once per element of `a`, and the statement it guards acts on the element it is on — `a[j]`. The test deciding whether that statement runs does not: `a[0].length === 3` reads `a[0]`, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One `if` names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The `if` is in the wrong place under both readings. Give the test the loop variable, or hoist it out.
D1 · Cyclomatic Complexity · Unit.createUnitClass (cyclomatic 297) · ×1
  • Unit.createUnitClass (cyclomatic 297) src/type/unit/Unit.js:29 — Unit.createUnitClass has cyclomatic complexity 297 (threshold 15). Of this number, 60 points are the body's own statements and 237 belong to 45 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · DenseMatrix.createDenseMatrixClass (cyclomatic 125) · ×1
  • DenseMatrix.createDenseMatrixClass (cyclomatic 125) src/type/matrix/DenseMatrix.js:17 — DenseMatrix.createDenseMatrixClass has cyclomatic complexity 125 (threshold 15). Most of this is not in the body itself: 9 of the 125 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 875, _set, DenseMatrix, …). 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 · distance.createDistance (cyclomatic 106) · ×1
  • distance.createDistance (cyclomatic 106) src/function/geometry/distance.js:16 — distance.createDistance has cyclomatic complexity 106 (threshold 15). Most of this is not in the body itself: 1 of the 106 points is its own statement and the rest belongs to 16 function items inside it that branch (a function literal at line 139, a function literal at line 85, a function literal at line 104, …). 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 · simplifyCore.createSimplifyCore · ×1
  • simplifyCore.createSimplifyCore::_simplifyCore (cyclomatic 86) src/function/algebra/simplifyCore.js:104 — simplifyCore.createSimplifyCore::_simplifyCore has cyclomatic complexity 86 (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 · OperatorNode.createOperatorNode (cyclomatic 82) · ×1
  • OperatorNode.createOperatorNode (cyclomatic 82) src/expression/node/OperatorNode.js:15 — OperatorNode.createOperatorNode has cyclomatic complexity 82 (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 (OperatorNode.createOperatorNode::calculateNecessaryParentheses) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · FunctionNode.createFunctionNode (cyclomatic 82) · ×1
  • FunctionNode.createFunctionNode (cyclomatic 82) src/expression/node/FunctionNode.js:16 — FunctionNode.createFunctionNode has cyclomatic complexity 82 (threshold 15). Of this number, 44 points are the body's own statements and 38 belong to 11 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 · derivative.createDerivative (cyclomatic 82) · ×1
  • derivative.createDerivative (cyclomatic 82) src/function/algebra/derivative.js:21 — derivative.createDerivative has cyclomatic complexity 82 (threshold 15). Most of this is not in the body itself: 1 of the 82 points is its own statement and the rest belongs to 13 function items inside it that branch (a function literal at line 225, a function literal at line 581, a function literal at line 126, …). 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 · (anonymous) (cyclomatic 82) · ×1
  • (anonymous) (cyclomatic 82) src/expression/node/FunctionNode.js:16 — (anonymous) has cyclomatic complexity 82 (threshold 15). Most of this is not in the body itself: 1 of the 82 points is its own statement and the rest belongs to 37 function items inside it that branch (_compile, _toTex, expandTemplate, …). 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 · generateDoc (cyclomatic 73) · ×1
  • generateDoc (cyclomatic 73) tools/docgenerator.js:67 — generateDoc has cyclomatic complexity 73 (threshold 15). Most of this is not in the body itself: 13 of the 73 points are its own statements and the rest belongs to 24 function items inside it that branch (parseParameters, parseThrows, parseHistory, …). 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 · ConditionalNode.createConditionalNode (cyclomatic 51) · ×1
  • ConditionalNode.createConditionalNode (cyclomatic 51) src/expression/node/ConditionalNode.js:10 — ConditionalNode.createConditionalNode has cyclomatic complexity 51 (threshold 15). Of this number, 40 points are the body's own statements and 11 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · OperatorNode.createOperatorNode · ×1
  • OperatorNode.createOperatorNode::calculateNecessaryParentheses (cyclomatic 46) src/expression/node/OperatorNode.js:48 — OperatorNode.createOperatorNode::calculateNecessaryParentheses has cyclomatic complexity 46 (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 (OperatorNode.createOperatorNode) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · FunctionNode._compile (cyclomatic 41) · ×1
  • FunctionNode._compile (cyclomatic 41) src/expression/node/FunctionNode.js:142 — FunctionNode._compile has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 14 of the 41 points are its own statements and the rest belongs to 9 function items inside it that branch (resolveFn, a function literal at line 227, a function literal at line 257, …). 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 · realSymmetric.createRealSymmetric (cyclomatic 41) · ×1
  • realSymmetric.createRealSymmetric (cyclomatic 41) src/function/matrix/eigs/realSymmetric.js:3 — realSymmetric.createRealSymmetric has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 12 function items inside it that branch (sorting, diag, diagBig, …). 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 · solveODE.createSolveODE (cyclomatic 40) · ×1
  • solveODE.createSolveODE (cyclomatic 40) src/function/numeric/solveODE.js:23 — solveODE.createSolveODE has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, …). 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 · RangeNode.createRangeNode (cyclomatic 40) · ×1
  • RangeNode.createRangeNode (cyclomatic 40) src/expression/node/RangeNode.js:10 — RangeNode.createRangeNode has cyclomatic complexity 40 (threshold 15). Of this number, 32 points are the body's own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · AssignmentNode.createAssignmentNode (cyclomatic 36) · ×1
  • AssignmentNode.createAssignmentNode (cyclomatic 36) src/expression/node/AssignmentNode.js:15 — AssignmentNode.createAssignmentNode has cyclomatic complexity 36 (threshold 15). Of this number, 33 points are the body's own statements and 3 belong to one function item 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 · intersect.createIntersect (cyclomatic 36) · ×1
  • intersect.createIntersect (cyclomatic 36) src/function/geometry/intersect.js:8 — intersect.createIntersect has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 10 function items inside it that branch (_AAAA, _coerceArr, _4d, …). 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 · matrixmarket._importFromStream (cyclomatic 35) · ×1
  • matrixmarket._importFromStream (cyclomatic 35) REDACTED:7 — matrixmarket._importFromStream has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 120, 198, 27, …). 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 · map.createMap (cyclomatic 34) · ×1
  • map.createMap (cyclomatic 34) src/function/matrix/map.js:8 — map.createMap 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 14 function items inside it that branch (_mapMultiple, mapMultiple::iterate, _getCallbackArgCount, …). 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 · MatrixIndex.createIndexClass (cyclomatic 33) · ×1
  • MatrixIndex.createIndexClass (cyclomatic 33) src/type/matrix/MatrixIndex.js:9 — MatrixIndex.createIndexClass has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 6 of the 33 points are its own statements and the rest belongs to 10 function items inside it that branch (Index, _createImmutableMatrix, a function literal at line 130, …). 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 · approx.approxEqual (cyclomatic 33) · ×1
  • approx.approxEqual (cyclomatic 33) tools/approx.js:22 — approx.approxEqual has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · matAlgo04xSidSid.createMatAlgo04xSidSid (cyclomatic 32) · ×1
  • matAlgo04xSidSid.createMatAlgo04xSidSid (cyclomatic 32) src/type/matrix/utils/matAlgo04xSidSid.js:7 — matAlgo04xSidSid.createMatAlgo04xSidSid 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 one function literal inside it that branches (line 26). 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 · typed.createTyped (cyclomatic 31) · ×1
  • typed.createTyped (cyclomatic 31) src/core/function/typed.js:106 — typed.createTyped has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 19 function literals inside it that branch (lines 401, 420, 174, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · docgenerator.validateDoc (cyclomatic 30) · ×1
  • docgenerator.validateDoc (cyclomatic 30) tools/docgenerator.js:402 — docgenerator.validateDoc has cyclomatic complexity 30 (threshold 15). Of this number, 21 points are the body's own statements and 9 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 · matAlgo05xSfSf.createMatAlgo05xSfSf (cyclomatic 30) · ×1
  • matAlgo05xSfSf.createMatAlgo05xSfSf (cyclomatic 30) src/type/matrix/utils/matAlgo05xSfSf.js:7 — matAlgo05xSfSf.createMatAlgo05xSfSf has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 26). 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 · RelationalNode.createRelationalNode (cyclomatic 30) · ×1
  • RelationalNode.createRelationalNode (cyclomatic 30) src/expression/node/RelationalNode.js:12 — RelationalNode.createRelationalNode has cyclomatic complexity 30 (threshold 15). Of this number, 16 points are the body's own statements and 14 belong to 4 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 · (anonymous) (cyclomatic 30) · ×1
  • (anonymous) (cyclomatic 30) src/expression/node/RelationalNode.js:12 — (anonymous) has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 18 function items inside it that branch (_toString, a function literal at line 126, _toHTML, …). 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 · isPrime.createIsPrime (cyclomatic 29) · ×1
  • isPrime.createIsPrime (cyclomatic 29) src/function/utils/isPrime.js:7 — isPrime.createIsPrime has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 67, 37, 52, …). 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 · AccessorNode.createAccessorNode (cyclomatic 29) · ×1
  • AccessorNode.createAccessorNode (cyclomatic 29) src/expression/node/AccessorNode.js:22 — AccessorNode.createAccessorNode has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (needParenthesis, a function literal at line 106, a function literal at line 123). 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 · (anonymous) (cyclomatic 29) · ×1
  • (anonymous) (cyclomatic 29) src/expression/node/AccessorNode.js:22 — (anonymous) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 15 function items inside it that branch (needParenthesis, _compile::evalAccessorNode, _compile::evalAccessorNode, …). 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 · FunctionAssignmentNode.createFunctionAssignmentNode (cyclomatic 28) · ×1
  • FunctionAssignmentNode.createFunctionAssignmentNode (cyclomatic 28) src/expression/node/FunctionAssignmentNode.js:16 — FunctionAssignmentNode.createFunctionAssignmentNode has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · OperatorNode._toTex (cyclomatic 28) · ×1
  • OperatorNode._toTex (cyclomatic 28) src/expression/node/OperatorNode.js:600 — OperatorNode._toTex has cyclomatic complexity 28 (threshold 15). Of this number, 27 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 · (anonymous) (cyclomatic 28) · ×1
  • (anonymous) (cyclomatic 28) src/expression/node/FunctionAssignmentNode.js:16 — (anonymous) 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 18 function items inside it that branch (constructor, _toHTML, _toString, …). 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 · norm.createNorm (cyclomatic 27) · ×1
  • norm.createNorm (cyclomatic 27) src/function/arithmetic/norm.js:23 — norm.createNorm 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 9 function items inside it that branch (_vectorNorm, _matrixNorm, _norm, …). 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 · (anonymous) (cyclomatic 27) · ×1
  • (anonymous) (cyclomatic 27) src/function/arithmetic/norm.js:23 — (anonymous) 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 22 function items inside it that branch (_vectorNorm, _matrixNorm, _norm, …). 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 · FibonacciHeap.createFibonacciHeapClass (cyclomatic 25) · ×1
  • FibonacciHeap.createFibonacciHeapClass (cyclomatic 25) src/type/matrix/FibonacciHeap.js:6 — FibonacciHeap.createFibonacciHeapClass has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 8 function items inside it that branch (_findMinimumNode, a function literal at line 98, _decreaseKey, …). 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 · lup.createLup · ×1
  • lup.createLup::_denseLUP (cyclomatic 25) src/function/algebra/decomposition/lup.js:88 — lup.createLup::_denseLUP has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 25) · ×1
  • (anonymous) (cyclomatic 25) src/type/matrix/FibonacciHeap.js:6 — (anonymous) has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 12 function items inside it that branch (_findMinimumNode, extractMinimum, _decreaseKey, …). 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 · bitwise.bitOrBigNumber (cyclomatic 24) · ×1
  • bitwise.bitOrBigNumber (cyclomatic 24) src/utils/bignumber/bitwise.js:110 — bitwise.bitOrBigNumber 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 · solveValidation.createSolveValidation (cyclomatic 24) · ×1
  • solveValidation.createSolveValidation (cyclomatic 24) src/function/algebra/solver/utils/solveValidation.js:5 — solveValidation.createSolveValidation has cyclomatic complexity 24 (threshold 15). 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 15). 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 · ImmutableDenseMatrix.createImmutableDenseMatrixClass (cyclomatic 24) · ×1
  • ImmutableDenseMatrix.createImmutableDenseMatrixClass (cyclomatic 24) src/type/matrix/ImmutableDenseMatrix.js:11 — ImmutableDenseMatrix.createImmutableDenseMatrixClass has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (ImmutableDenseMatrix, a function literal at line 66, a function literal at line 183, …). 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 · dot.createDot · ×1
  • dot.createDot::_denseDot (cyclomatic 24) src/function/matrix/dot.js:63 — dot.createDot::_denseDot has cyclomatic complexity 24 (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 · OperatorNode._toString (cyclomatic 24) · ×1
  • OperatorNode._toString (cyclomatic 24) src/expression/node/OperatorNode.js:396 — OperatorNode._toString has cyclomatic complexity 24 (threshold 15). Of this number, 23 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 · SparseMatrix.createSparseMatrixClass (cyclomatic 23) · ×1
  • SparseMatrix.createSparseMatrixClass (cyclomatic 23) src/type/matrix/SparseMatrix.js:17 — SparseMatrix.createSparseMatrixClass 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 shape REPEATS in the file: one other method here (SparseMatrix.createSparseMatrixClass::_resize) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · matAlgo06xS0S0.createMatAlgo06xS0S0 (cyclomatic 23) · ×1
  • matAlgo06xS0S0.createMatAlgo06xS0S0 (cyclomatic 23) src/type/matrix/utils/matAlgo06xS0S0.js:8 — matAlgo06xS0S0.createMatAlgo06xS0S0 has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 27). 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 · matAlgo09xS0Sf.createMatAlgo09xS0Sf (cyclomatic 23) · ×1
  • matAlgo09xS0Sf.createMatAlgo09xS0Sf (cyclomatic 23) src/type/matrix/utils/matAlgo09xS0Sf.js:7 — matAlgo09xS0Sf.createMatAlgo09xS0Sf has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 26). 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 · bitwise.bitAndBigNumber (cyclomatic 23) · ×1
  • bitwise.bitAndBigNumber (cyclomatic 23) src/utils/bignumber/bitwise.js:22 — bitwise.bitAndBigNumber 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 · compareNatural.createCompareNatural · ×1
  • compareNatural.createCompareNatural::_compareNatural (cyclomatic 23) src/function/relational/compareNatural.js:90 — compareNatural.createCompareNatural::_compareNatural has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · pinv.createPinv (cyclomatic 23) · ×1
  • pinv.createPinv (cyclomatic 23) src/function/matrix/pinv.js:23 — pinv.createPinv has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 58, _rref, a function literal at line 105, …). 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 · (anonymous) (cyclomatic 23) · ×1
  • (anonymous) (cyclomatic 23) src/function/matrix/pinv.js:23 — (anonymous) has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 10 function items inside it that branch (Array | Matrix, _rref, any, …). 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 · cli.completer (cyclomatic 22) · ×1
  • cli.completer (cyclomatic 22) bin/cli.js:103 — cli.completer has cyclomatic complexity 22 (threshold 15). Of this number, 21 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 · Range.createRangeClass · ×1
  • Range.createRangeClass::Range (cyclomatic 22) src/type/matrix/Range.js:47 — Range.createRangeClass::Range 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 · resize.createResize (cyclomatic 22) · ×1
  • resize.createResize (cyclomatic 22) src/function/matrix/resize.js:13 — resize.createResize 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 3 function items inside it that branch (a function literal at line 41, _resizeString, a function literal at line 52). 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 · pow.createPow · ×1
  • pow.createPow::_pow (cyclomatic 22) src/function/arithmetic/pow.js:114 — pow.createPow::_pow 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 · cli.runStream (cyclomatic 21) · ×1
  • cli.runStream (cyclomatic 21) bin/cli.js:185 — cli.runStream has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 203). 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 · matrixAlgorithmSuite.createMatrixAlgorithmSuite (cyclomatic 21) · ×1
  • matrixAlgorithmSuite.createMatrixAlgorithmSuite (cyclomatic 21) src/type/matrix/utils/matrixAlgorithmSuite.js:12 — matrixAlgorithmSuite.createMatrixAlgorithmSuite 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 one function literal inside it that branches (line 34). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · matAlgo08xS0Sid.createMatAlgo08xS0Sid (cyclomatic 21) · ×1
  • matAlgo08xS0Sid.createMatAlgo08xS0Sid (cyclomatic 21) src/type/matrix/utils/matAlgo08xS0Sid.js:7 — matAlgo08xS0Sid.createMatAlgo08xS0Sid 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 one function literal inside it that branches (line 26). 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 · ObjectNode.createObjectNode (cyclomatic 21) · ×1
  • ObjectNode.createObjectNode (cyclomatic 21) src/expression/node/ObjectNode.js:12 — ObjectNode.createObjectNode has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body's own statements and 2 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 · OperatorNode._toHTML (cyclomatic 21) · ×1
  • OperatorNode._toHTML (cyclomatic 21) src/expression/node/OperatorNode.js:503 — OperatorNode._toHTML has cyclomatic complexity 21 (threshold 15). Of this number, 20 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 · det.createDet (cyclomatic 21) · ×1
  • det.createDet (cyclomatic 21) src/function/matrix/det.js:9 — det.createDet 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 2 function items inside it that branch (_det, a function literal at line 40). 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 · eigs.createEigs · ×1
  • eigs.createEigs::coerceTypes (cyclomatic 21) src/function/matrix/eigs.js:185 — eigs.createEigs::coerceTypes has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · matAlgo03xDSf.createMatAlgo03xDSf (cyclomatic 20) · ×1
  • matAlgo03xDSf.createMatAlgo03xDSf (cyclomatic 20) src/type/matrix/utils/matAlgo03xDSf.js:7 — matAlgo03xDSf.createMatAlgo03xDSf 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 one function literal inside it that branches (line 27). 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 · matAlgo01xDSid.createMatAlgo01xDSid (cyclomatic 20) · ×1
  • matAlgo01xDSid.createMatAlgo01xDSid (cyclomatic 20) src/type/matrix/utils/matAlgo01xDSid.js:7 — matAlgo01xDSid.createMatAlgo01xDSid 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 one function literal inside it that branches (line 27). 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 · matAlgo07xSSf.createMatAlgo07xSSf (cyclomatic 20) · ×1
  • matAlgo07xSSf.createMatAlgo07xSSf (cyclomatic 20) src/type/matrix/utils/matAlgo07xSSf.js:7 — matAlgo07xSSf.createMatAlgo07xSSf 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 2 function items inside it that branch (a function literal at line 22, _scatter). 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 · lsolveAll.createLsolveAll (cyclomatic 20) · ×1
  • lsolveAll.createLsolveAll (cyclomatic 20) src/function/algebra/solver/lsolveAll.js:15 — lsolveAll.createLsolveAll 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 2 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution). 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 · usolveAll.createUsolveAll (cyclomatic 20) · ×1
  • usolveAll.createUsolveAll (cyclomatic 20) src/function/algebra/solver/usolveAll.js:15 — usolveAll.createUsolveAll 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 2 function items inside it that branch (_sparseBackwardSubstitution, _denseBackwardSubstitution). 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 · IndexNode.createIndexNode (cyclomatic 20) · ×1
  • IndexNode.createIndexNode (cyclomatic 20) src/expression/node/IndexNode.js:13 — IndexNode.createIndexNode has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body's own statements and 5 belong to 2 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 · quantileSeq.createQuantileSeq (cyclomatic 20) · ×1
  • quantileSeq.createQuantileSeq (cyclomatic 20) src/function/statistics/quantileSeq.js:8 — quantileSeq.createQuantileSeq 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 3 function items inside it that branch (_quantileSeq, _quantileSeqProbNumber, _quantileSeqProbCollection). 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 · importFactory · ×1
  • importFactory::_importFactory (cyclomatic 20) src/core/function/import.js:245 — importFactory::_importFactory 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 · ConditionalNode._toString (cyclomatic 19) · ×1
  • ConditionalNode._toString (cyclomatic 19) src/expression/node/ConditionalNode.js:132 — ConditionalNode._toString 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. This shape REPEATS in the file: one other method here (ConditionalNode._toHTML) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · ConditionalNode._toHTML (cyclomatic 19) · ×1
  • ConditionalNode._toHTML (cyclomatic 19) src/expression/node/ConditionalNode.js:207 — ConditionalNode._toHTML 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. This shape REPEATS in the file: one other method here (ConditionalNode._toString) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · rotationMatrix.createRotationMatrix (cyclomatic 18) · ×1
  • rotationMatrix.createRotationMatrix (cyclomatic 18) src/function/matrix/rotationMatrix.js:20 — rotationMatrix.createRotationMatrix has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 7 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, a function literal at line 82, …). 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 · SymbolNode.createSymbolNode (cyclomatic 18) · ×1
  • SymbolNode.createSymbolNode (cyclomatic 18) src/expression/node/SymbolNode.js:13 — SymbolNode.createSymbolNode has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · qr.createQr (cyclomatic 18) · ×1
  • qr.createQr (cyclomatic 18) src/function/algebra/decomposition/qr.js:22 — qr.createQr has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (_denseQRimpl, _denseQR). 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 · inv.createInv · ×1
  • inv.createInv::_inv (cyclomatic 18) src/function/matrix/inv.js:103 — inv.createInv::_inv has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D1 · Cyclomatic Complexity · stirlingS2.createStirlingS2 (cyclomatic 18) · ×1
  • stirlingS2.createStirlingS2 (cyclomatic 18) src/function/combinatorics/stirlingS2.js:21 — stirlingS2.createStirlingS2 has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · SparseMatrix.createSparseMatrixClass · ×1
  • SparseMatrix.createSparseMatrixClass::_resize (cyclomatic 17) src/type/matrix/SparseMatrix.js:625 — SparseMatrix.createSparseMatrixClass::_resize has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SparseMatrix.createSparseMatrixClass) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D1 · Cyclomatic Complexity · matAlgo02xDS0.createMatAlgo02xDS0 (cyclomatic 17) · ×1
  • matAlgo02xDS0.createMatAlgo02xDS0 (cyclomatic 17) src/type/matrix/utils/matAlgo02xDS0.js:7 — matAlgo02xDS0.createMatAlgo02xDS0 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 27). 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 · bitwise.bitXor (cyclomatic 17) · ×1
  • bitwise.bitXor (cyclomatic 17) src/utils/bignumber/bitwise.js:292 — bitwise.bitXor has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · diff.createDiff (cyclomatic 17) · ×1
  • diff.createDiff (cyclomatic 17) src/function/matrix/diff.js:8 — diff.createDiff 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 6 function items inside it that branch (_ElementDiff, _recursive, a function literal at line 63, …). 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 · partitionSelect.createPartitionSelect (cyclomatic 17) · ×1
  • partitionSelect.createPartitionSelect (cyclomatic 17) src/function/matrix/partitionSelect.js:8 — partitionSelect.createPartitionSelect 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 3 function items inside it that branch (quickSelect, _partitionSelect, a function literal at line 54). 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 · ConstantNode.createConstantNode (cyclomatic 17) · ×1
  • ConstantNode.createConstantNode (cyclomatic 17) src/expression/node/ConstantNode.js:11 — ConstantNode.createConstantNode has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ParenthesisNode.createParenthesisNode (cyclomatic 17) · ×1
  • ParenthesisNode.createParenthesisNode (cyclomatic 17) src/expression/node/ParenthesisNode.js:9 — ParenthesisNode.createParenthesisNode 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 · pickRandom.createPickRandom · ×1
  • pickRandom.createPickRandom::_pickRandom (cyclomatic 17) src/function/probability/pickRandom.js:92 — pickRandom.createPickRandom::_pickRandom 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 · validateAsciiChars.validateChars (cyclomatic 17) · ×1
  • validateAsciiChars.validateChars (cyclomatic 17) tools/validateAsciiChars.js:8 — validateAsciiChars.validateChars 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 · docgenerator.generateMarkdown (cyclomatic 16) · ×1
  • docgenerator.generateMarkdown (cyclomatic 16) tools/docgenerator.js:481 — docgenerator.generateMarkdown has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs 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 · docgenerator.iteratePath (cyclomatic 16) · ×1
  • docgenerator.iteratePath (cyclomatic 16) tools/docgenerator.js:663 — docgenerator.iteratePath has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (functionEntry, compareAsc, compareCategory, …). 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 · formatter.format (cyclomatic 16) · ×1
  • formatter.format (cyclomatic 16) src/utils/bignumber/formatter.js:122 — formatter.format has cyclomatic complexity 16 (threshold 15). Of this number, 15 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 · diag.createDiag (cyclomatic 16) · ×1
  • diag.createDiag (cyclomatic 16) src/function/matrix/diag.js:9 — diag.createDiag 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 3 function items inside it that branch (_diag, _createDiagonalMatrix, _getDiagonal). 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 · identity.createIdentity · ×1
  • identity.createIdentity::_identity (cyclomatic 16) src/function/matrix/identity.js:106 — identity.createIdentity::_identity 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 · lsolve.createLsolve (cyclomatic 16) · ×1
  • lsolve.createLsolve (cyclomatic 16) src/function/algebra/solver/lsolve.js:15 — lsolve.createLsolve has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function items inside it that branch (_sparseForwardSubstitution, _denseForwardSubstitution). 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 · Node.createNode (cyclomatic 16) · ×1
  • Node.createNode (cyclomatic 16) src/expression/node/Node.js:11 — Node.createNode has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · simplifyCore.createSimplifyCore · ×1
  • simplifyCore.createSimplifyCore::_simplifyCore (cognitive 200) src/function/algebra/simplifyCore.js:104 — simplifyCore.createSimplifyCore::_simplifyCore has cognitive complexity 200 (threshold 15). Drivers by points: if/else 66 (171 pts), boolean chains 16, ternaries 2 (7 pts), loops 2 (6 pts) (nesting depth added 114). 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 · distance.createDistance (cognitive 115) · ×1
  • distance.createDistance (cognitive 115) src/function/geometry/distance.js:16 — distance.createDistance has cognitive complexity 115 (threshold 15). Drivers by points: if/else 57 (88 pts), boolean chains 22, loops 4 (5 pts) (nesting depth added 32). None of this is in the body itself: all 115 points belong to 16 function items inside it that branch (a function literal at line 139, a function literal at line 104, a function literal at line 85, …). 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 · OperatorNode.createOperatorNode (cognitive 104) · ×1
  • OperatorNode.createOperatorNode (cognitive 104) src/expression/node/OperatorNode.js:15 — OperatorNode.createOperatorNode has cognitive complexity 104 (threshold 15). Drivers by points: if/else 80 (139 pts), boolean chains 32, match/switch 4 (8 pts), loops 4 (6 pts), ternaries 6 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OperatorNode.createOperatorNode::calculateNecessaryParentheses) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · FunctionNode._compile (cognitive 87) · ×1
  • FunctionNode._compile (cognitive 87) src/expression/node/FunctionNode.js:142 — FunctionNode._compile has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (66 pts), boolean chains 14, match/switch 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 42). Of this number, 21 points are the body's own statements and 66 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · derivative.createDerivative (cognitive 76) · ×1
  • derivative.createDerivative (cognitive 76) src/function/algebra/derivative.js:21 — derivative.createDerivative has cognitive complexity 76 (threshold 15). Drivers by points: if/else 38 (58 pts), boolean chains 11, ternaries 3 (6 pts), match/switch 1 (nesting depth added 23). None of this is in the body itself: all 76 points belong to 13 function items inside it that branch (a function literal at line 581, a function literal at line 225, a function literal at line 126, …). 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 · OperatorNode.createOperatorNode · ×1
  • OperatorNode.createOperatorNode::calculateNecessaryParentheses (cognitive 74) src/expression/node/OperatorNode.js:48 — OperatorNode.createOperatorNode::calculateNecessaryParentheses has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (61 pts), boolean chains 10, loops 1 (2 pts), match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OperatorNode.createOperatorNode) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · cli.completer (cognitive 73) · ×1
  • cli.completer (cognitive 73) bin/cli.js:103 — cli.completer has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (52 pts), loops 6 (19 pts), boolean chains 2 (nesting depth added 52). Of this number, 71 points are the body's own statements and 2 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 · Unit.createUnitClass (cognitive 67) · ×1
  • Unit.createUnitClass (cognitive 67) src/type/unit/Unit.js:29 — Unit.createUnitClass has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 69, if/else 43 (69 pts), loops 12 (16 pts), ternaries 3 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Unit.createUnitClass::parseNumber) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · lup.createLup · ×1
  • lup.createLup::_denseLUP (cognitive 66) src/function/algebra/decomposition/lup.js:88 — lup.createLup::_denseLUP has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 9 (18 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · matrixmarket._importFromStream (cognitive 66) · ×1
  • matrixmarket._importFromStream (cognitive 66) REDACTED:7 — matrixmarket._importFromStream has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (37 pts), loops 4 (12 pts), ternaries 4 (11 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 34). None of this is in the body itself: all 66 points belong to 8 function literals inside it that branch (lines 198, 120, 27, …). 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 · realSymmetric.createRealSymmetric (cognitive 61) · ×1
  • realSymmetric.createRealSymmetric (cognitive 61) src/function/matrix/eigs/realSymmetric.js:3 — realSymmetric.createRealSymmetric has cognitive complexity 61 (threshold 15). Drivers by points: loops 22 (30 pts), if/else 18 (29 pts), boolean chains 2 (nesting depth added 19). None of this is in the body itself: all 61 points belong to 12 function items inside it that branch (sorting, diag, diagBig, …). 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 · inv.createInv · ×1
  • inv.createInv::_inv (cognitive 59) src/function/matrix/inv.js:103 — inv.createInv::_inv has cognitive complexity 59 (threshold 15). Drivers by points: loops 8 (32 pts), if/else 11 (27 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · solveValidation.createSolveValidation (cognitive 58) · ×1
  • solveValidation.createSolveValidation (cognitive 58) src/function/algebra/solver/utils/solveValidation.js:5 — solveValidation.createSolveValidation has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 6 (22 pts), boolean chains 2 (nesting depth added 35). None of this is in the body itself: all 58 points belong to one function literal inside it that branches (line 15). 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 · matAlgo05xSfSf.createMatAlgo05xSfSf (cognitive 55) · ×1
  • matAlgo05xSfSf.createMatAlgo05xSfSf (cognitive 55) src/type/matrix/utils/matAlgo05xSfSf.js:7 — matAlgo05xSfSf.createMatAlgo05xSfSf has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 8 (16 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 26). None of this is in the body itself: all 55 points belong to one function literal inside it that branches (line 26). 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 · matAlgo04xSidSid.createMatAlgo04xSidSid (cognitive 55) · ×1
  • matAlgo04xSidSid.createMatAlgo04xSidSid (cognitive 55) src/type/matrix/utils/matAlgo04xSidSid.js:7 — matAlgo04xSidSid.createMatAlgo04xSidSid has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 9, loops 4 (8 pts), ternaries 6 (nesting depth added 22). None of this is in the body itself: all 55 points belong to one function literal inside it that branches (line 26). 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 · (anonymous) (cognitive 51) · ×1
  • (anonymous) (cognitive 51) src/function/numeric/solveODE.js:23 — (anonymous) has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 15 (21 pts), if/else 13 (17 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 11). None of this is in the body itself: all 51 points belong to 23 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, …). 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 · (anonymous) (cognitive 48) · ×1
  • (anonymous) (cognitive 48) src/function/matrix/map.js:8 — (anonymous) has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 14 (22 pts), if/else 17 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 14). None of this is in the body itself: all 48 points belong to 26 function items inside it that branch (mapMultiple::iterate, _mapMultiple, _getCallbackArgCount, …). 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 · ConditionalNode.createConditionalNode (cognitive 46) · ×1
  • ConditionalNode.createConditionalNode (cognitive 46) src/expression/node/ConditionalNode.js:10 — ConditionalNode.createConditionalNode has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 25, if/else 15 (18 pts), ternaries 3 (nesting depth added 3). Of this number, 33 points are the body's own statements and 13 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · FunctionNode.createFunctionNode (cognitive 46) · ×1
  • FunctionNode.createFunctionNode (cognitive 46) src/expression/node/FunctionNode.js:16 — FunctionNode.createFunctionNode has cognitive complexity 46 (threshold 15). Drivers by points: if/else 50 (99 pts), boolean chains 23, match/switch 4 (11 pts), ternaries 2 (4 pts), loops 3 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (FunctionNode.createFunctionNode::expandTemplate) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · solveODE.createSolveODE (cognitive 44) · ×1
  • solveODE.createSolveODE (cognitive 44) src/function/numeric/solveODE.js:23 — solveODE.createSolveODE has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 12 (14 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 7). None of this is in the body itself: all 44 points belong to 7 function items inside it that branch (a function literal at line 98, _solveODE, a function literal at line 173, …). 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 · isPrime.createIsPrime (cognitive 43) · ×1
  • isPrime.createIsPrime (cognitive 43) src/function/utils/isPrime.js:7 — isPrime.createIsPrime has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 8 (12 pts), boolean chains 6 (nesting depth added 13). None of this is in the body itself: all 43 points belong to 4 function literals inside it that branch (lines 67, 37, 52, …). 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 · RangeNode.createRangeNode (cognitive 43) · ×1
  • RangeNode.createRangeNode (cognitive 43) src/expression/node/RangeNode.js:10 — RangeNode.createRangeNode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 17, ternaries 3 (nesting depth added 3). Of this number, 35 points are the body's own statements and 8 belong to 2 function items 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 · (anonymous) (cognitive 43) · ×1
  • (anonymous) (cognitive 43) src/expression/node/RangeNode.js:10 — (anonymous) has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 17, ternaries 3 (nesting depth added 3). None of this is in the body itself: all 43 points belong to 16 function items inside it that branch (_toString, _toHTML, _toTex, …). 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 · (anonymous) (cognitive 41) · ×1
  • (anonymous) (cognitive 41) src/expression/node/AssignmentNode.js:15 — (anonymous) has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 13, ternaries 7 (8 pts) (nesting depth added 3). Most of this is not in the body itself: 5 of the 41 points are its own statements and the rest belongs to 18 function items inside it that branch (_compile, constructor, _toString, …). 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 · docgenerator.validateDoc (cognitive 40) · ×1
  • docgenerator.validateDoc (cognitive 40) tools/docgenerator.js:402 — docgenerator.validateDoc has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 12 (nesting depth added 9). Of this number, 27 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 · matAlgo06xS0S0.createMatAlgo06xS0S0 (cognitive 40) · ×1
  • matAlgo06xS0S0.createMatAlgo06xS0S0 (cognitive 40) src/type/matrix/utils/matAlgo06xS0S0.js:8 — matAlgo06xS0S0.createMatAlgo06xS0S0 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (7 pts), boolean chains 6, ternaries 5 (nesting depth added 15). None of this is in the body itself: all 40 points belong to one function literal inside it that branches (line 27). 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 · AssignmentNode.createAssignmentNode (cognitive 40) · ×1
  • AssignmentNode.createAssignmentNode (cognitive 40) src/expression/node/AssignmentNode.js:15 — AssignmentNode.createAssignmentNode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 13, ternaries 6 (7 pts) (nesting depth added 3). Of this number, 37 points are the body's own statements and 3 belong to one function item inside it that branches. 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 · importFactory · ×1
  • importFactory::_importFactory (cognitive 40) src/core/function/import.js:245 — importFactory::_importFactory has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 4, ternaries 2, other 1 (nesting depth added 18). 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 · approx.approxEqual (cognitive 39) · ×1
  • approx.approxEqual (cognitive 39) tools/approx.js:22 — approx.approxEqual has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 10 (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 · cli.runStream (cognitive 38) · ×1
  • cli.runStream (cognitive 38) bin/cli.js:185 — cli.runStream has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 3 (9 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 20). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 203). 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 · map.createMap (cognitive 38) · ×1
  • map.createMap (cognitive 38) src/function/matrix/map.js:8 — map.createMap has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 10 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). None of this is in the body itself: all 38 points belong to 14 function items inside it that branch (mapMultiple::iterate, _mapMultiple, _getCallbackArgCount, …). 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 · OperatorNode._toTex (cognitive 36) · ×1
  • OperatorNode._toTex (cognitive 36) src/expression/node/OperatorNode.js:600 — OperatorNode._toTex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, match/switch 2 (5 pts), ternaries 2 (nesting depth added 12). Of this number, 34 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · matrixAlgorithmSuite.createMatrixAlgorithmSuite (cognitive 34) · ×1
  • matrixAlgorithmSuite.createMatrixAlgorithmSuite (cognitive 34) src/type/matrix/utils/matrixAlgorithmSuite.js:12 — matrixAlgorithmSuite.createMatrixAlgorithmSuite has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 4, ternaries 1 (nesting depth added 11). None of this is in the body itself: all 34 points belong to one function literal inside it that branches (line 34). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · matAlgo09xS0Sf.createMatAlgo09xS0Sf (cognitive 34) · ×1
  • matAlgo09xS0Sf.createMatAlgo09xS0Sf (cognitive 34) src/type/matrix/utils/matAlgo09xS0Sf.js:7 — matAlgo09xS0Sf.createMatAlgo09xS0Sf has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 6 (9 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 12). None of this is in the body itself: all 34 points belong to one function literal inside it that branches (line 26). 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 · bitwise.bitAndBigNumber (cognitive 34) · ×1
  • bitwise.bitAndBigNumber (cognitive 34) src/utils/bignumber/bitwise.js:22 — bitwise.bitAndBigNumber has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 8 (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 · det.createDet · ×1
  • det.createDet::_det (cognitive 33) src/function/matrix/det.js:99 — det.createDet::_det has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (13 pts), ternaries 2 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · eigs.createEigs · ×1
  • eigs.createEigs::coerceTypes (cognitive 33) src/function/matrix/eigs.js:185 — eigs.createEigs::coerceTypes has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 10 (12 pts), boolean chains 3 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · qr.createQr · ×1
  • qr.createQr::_denseQRimpl (cognitive 32) src/function/algebra/decomposition/qr.js:107 — qr.createQr::_denseQRimpl has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (28 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · DenseMatrix.createDenseMatrixClass · ×1
  • DenseMatrix.createDenseMatrixClass::_set (cognitive 31) src/type/matrix/DenseMatrix.js:306 — DenseMatrix.createDenseMatrixClass::_set has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (6 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AccessorNode.createAccessorNode (cognitive 31) · ×1
  • AccessorNode.createAccessorNode (cognitive 31) src/expression/node/AccessorNode.js:22 — AccessorNode.createAccessorNode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 9, ternaries 3 (5 pts) (nesting depth added 6). Of this number, 16 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 · OperatorNode._toHTML (cognitive 30) · ×1
  • OperatorNode._toHTML (cognitive 30) src/expression/node/OperatorNode.js:503 — OperatorNode._toHTML has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, ternaries 2 (nesting depth added 9). Of this number, 28 points are the body's own statements and 2 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 · RelationalNode.createRelationalNode (cognitive 30) · ×1
  • RelationalNode.createRelationalNode (cognitive 30) src/expression/node/RelationalNode.js:12 — RelationalNode.createRelationalNode has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 6, if/else 4 (5 pts), loops 4 (nesting depth added 1). Of this number, 15 points are the body's own statements and 15 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · norm.createNorm (cognitive 29) · ×1
  • norm.createNorm (cognitive 29) src/function/arithmetic/norm.js:23 — norm.createNorm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 9 (nesting depth added 2). None of this is in the body itself: all 29 points belong to 9 function items inside it that branch (_vectorNorm, _norm, _matrixNorm, …). 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 · FunctionAssignmentNode.createFunctionAssignmentNode (cognitive 29) · ×1
  • FunctionAssignmentNode.createFunctionAssignmentNode (cognitive 29) src/expression/node/FunctionAssignmentNode.js:16 — FunctionAssignmentNode.createFunctionAssignmentNode has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (10 pts), ternaries 4 (5 pts), loops 2 (nesting depth added 2). Of this number, 27 points are the body's own statements and 2 belong to 2 function items 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 · ObjectNode.createObjectNode (cognitive 29) · ×1
  • ObjectNode.createObjectNode (cognitive 29) src/expression/node/ObjectNode.js:12 — ObjectNode.createObjectNode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8, boolean chains 2 (nesting depth added 9). Of this number, 26 points are the body's own statements and 3 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 · pickRandom.createPickRandom · ×1
  • pickRandom.createPickRandom::_pickRandom (cognitive 29) src/function/probability/pickRandom.js:92 — pickRandom.createPickRandom::_pickRandom has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), ternaries 4 (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 · resize.createResize (cognitive 28) · ×1
  • resize.createResize (cognitive 28) src/function/matrix/resize.js:13 — resize.createResize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). None of this is in the body itself: all 28 points belong to 3 function items inside it that branch (a function literal at line 41, _resizeString, a function literal at line 52). 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 · FunctionNode.createFunctionNode · ×1
  • FunctionNode.createFunctionNode::expandTemplate (cognitive 28) src/expression/node/FunctionNode.js:28 — FunctionNode.createFunctionNode::expandTemplate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (FunctionNode.createFunctionNode) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · (anonymous) (cognitive 28) · ×1
  • (anonymous) (cognitive 28) src/type/matrix/ImmutableDenseMatrix.js:11 — (anonymous) has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 4 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 7). None of this is in the body itself: all 28 points belong to 13 function items inside it that branch (ImmutableDenseMatrix, subset, min, …). 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 · scatter (cognitive 28) · ×1
  • scatter (cognitive 28) src/utils/collection.js:123 — scatter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (9 pts), loops 2 (4 pts) (nesting depth added 16). 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 · object.deepStrictEqual (cognitive 27) · ×1
  • object.deepStrictEqual (cognitive 27) src/utils/object.js:126 — object.deepStrictEqual has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · matAlgo08xS0Sid.createMatAlgo08xS0Sid (cognitive 27) · ×1
  • matAlgo08xS0Sid.createMatAlgo08xS0Sid (cognitive 27) src/type/matrix/utils/matAlgo08xS0Sid.js:7 — matAlgo08xS0Sid.createMatAlgo08xS0Sid has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), boolean chains 6, ternaries 3 (nesting depth added 7). None of this is in the body itself: all 27 points belong to one function literal inside it that branches (line 26). 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 · OperatorNode._toString (cognitive 27) · ×1
  • OperatorNode._toString (cognitive 27) src/expression/node/OperatorNode.js:396 — OperatorNode._toString has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, ternaries 2 (nesting depth added 7). Of this number, 25 points are the body's own statements and 2 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 · optimizeCallback (cognitive 27) · ×1
  • optimizeCallback (cognitive 27) src/utils/optimizeCallback.js:13 — optimizeCallback has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (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 · createTyped (cognitive 26) · ×1
  • createTyped (cognitive 26) src/core/function/typed.js:106 — createTyped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, error handling 4, boolean chains 3. None of this is in the body itself: all 26 points belong to 26 function items inside it that branch (convert, convert, convert, …). 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 · bitwise.bitOrBigNumber (cognitive 25) · ×1
  • bitwise.bitOrBigNumber (cognitive 25) src/utils/bignumber/bitwise.js:110 — bitwise.bitOrBigNumber has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), ternaries 2 (5 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 · bitwise.decCoefficientToBinaryString (cognitive 25) · ×1
  • bitwise.decCoefficientToBinaryString (cognitive 25) src/utils/bignumber/bitwise.js:215 — bitwise.decCoefficientToBinaryString has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 5 (11 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · matAlgo07xSSf.createMatAlgo07xSSf (cognitive 25) · ×1
  • matAlgo07xSSf.createMatAlgo07xSSf (cognitive 25) src/type/matrix/utils/matAlgo07xSSf.js:7 — matAlgo07xSSf.createMatAlgo07xSSf has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 6, if/else 4 (6 pts), loops 3 (4 pts) (nesting depth added 7). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (a function literal at line 22, _scatter). 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 · concat.createConcat (cognitive 25) · ×1
  • concat.createConcat (cognitive 25) src/function/matrix/concat.js:11 — concat.createConcat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 10). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 43). 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 · compareNatural.createCompareNatural · ×1
  • compareNatural.createCompareNatural::_compareNatural (cognitive 25) src/function/relational/compareNatural.js:90 — compareNatural.createCompareNatural::_compareNatural has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · dot.createDot · ×1
  • dot.createDot::_denseDot (cognitive 24) src/function/matrix/dot.js:63 — dot.createDot::_denseDot has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 7, if/else 5, ternaries 4 (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 · pow.createPow · ×1
  • pow.createPow::_pow (cognitive 23) src/function/arithmetic/pow.js:114 — pow.createPow::_pow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 10, error handling 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 · validateAsciiChars.validateChars (cognitive 23) · ×1
  • validateAsciiChars.validateChars (cognitive 23) tools/validateAsciiChars.js:8 — validateAsciiChars.validateChars has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SparseMatrix.createSparseMatrixClass (cognitive 22) · ×1
  • SparseMatrix.createSparseMatrixClass (cognitive 22) src/type/matrix/SparseMatrix.js:17 — SparseMatrix.createSparseMatrixClass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 55 (98 pts), loops 24 (51 pts), boolean chains 37, ternaries 2 (5 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (SparseMatrix.createSparseMatrixClass::_createFromArray, SparseMatrix.createSparseMatrixClass::_setsubset, SparseMatrix.createSparseMatrixClass::_resize, …) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · matAlgo01xDSid.createMatAlgo01xDSid (cognitive 22) · ×1
  • matAlgo01xDSid.createMatAlgo01xDSid (cognitive 22) src/type/matrix/utils/matAlgo01xDSid.js:7 — matAlgo01xDSid.createMatAlgo01xDSid has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), boolean chains 5, ternaries 4 (nesting depth added 4). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 27). 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 · MatrixIndex.createIndexClass · ×1
  • MatrixIndex.createIndexClass::Index (cognitive 22) src/type/matrix/MatrixIndex.js:32 — MatrixIndex.createIndexClass::Index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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 · setDifference.createSetDifference (cognitive 22) · ×1
  • setDifference.createSetDifference (cognitive 22) src/function/set/setDifference.js:7 — setDifference.createSetDifference has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 30). 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 · SymbolNode.createSymbolNode (cognitive 22) · ×1
  • SymbolNode.createSymbolNode (cognitive 22) src/expression/node/SymbolNode.js:13 — SymbolNode.createSymbolNode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, ternaries 4 (8 pts), boolean chains 2 (nesting depth added 4). Of this number, 14 points are the body's own statements and 8 belong to 3 function items 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 · pinv.createPinv · ×1
  • pinv.createPinv::_rref (cognitive 22) src/function/matrix/pinv.js:138 — pinv.createPinv::_rref has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 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 · deepExtend (cognitive 22) · ×1
  • deepExtend (cognitive 22) src/utils/object.js:90 — deepExtend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, 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 · Range.createRangeClass · ×1
  • Range.createRangeClass::Range (cognitive 21) src/type/matrix/Range.js:47 — Range.createRangeClass::Range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (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 · matAlgo03xDSf.createMatAlgo03xDSf (cognitive 21) · ×1
  • matAlgo03xDSf.createMatAlgo03xDSf (cognitive 21) src/type/matrix/utils/matAlgo03xDSf.js:7 — matAlgo03xDSf.createMatAlgo03xDSf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), boolean chains 5, ternaries 2 (nesting depth added 4). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 27). 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 · FibonacciHeap.createFibonacciHeapClass · ×1
  • FibonacciHeap.createFibonacciHeapClass::_findMinimumNode (cognitive 21) src/type/matrix/FibonacciHeap.js:257 — FibonacciHeap.createFibonacciHeapClass::_findMinimumNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Unit.createUnitClass · ×1
  • Unit.createUnitClass::parseNumber (cognitive 21) src/type/unit/Unit.js:143 — Unit.createUnitClass::parseNumber has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Unit.createUnitClass) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D2 · Cognitive Complexity · import.importFactory · ×1
  • import.importFactory::mathImport::flattenImports (cognitive 21) src/core/function/import.js:79 — import.importFactory::mathImport::flattenImports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · matAlgo02xDS0.createMatAlgo02xDS0 (cognitive 20) · ×1
  • matAlgo02xDS0.createMatAlgo02xDS0 (cognitive 20) src/type/matrix/utils/matAlgo02xDS0.js:7 — matAlgo02xDS0.createMatAlgo02xDS0 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 5). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 27). 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 · subset._setSubstring (cognitive 20) · ×1
  • subset._setSubstring (cognitive 20) src/function/matrix/subset.js:185 — subset._setSubstring has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · lsolve.createLsolve · ×1
  • lsolve.createLsolve::_sparseForwardSubstitution (cognitive 20) src/function/algebra/solver/lsolve.js:106 — lsolve.createLsolve::_sparseForwardSubstitution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace.createTrace · ×1
  • trace.createTrace::_sparseTrace (cognitive 20) src/function/matrix/trace.js:85 — trace.createTrace::_sparseTrace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · IndexNode.createIndexNode (cognitive 20) · ×1
  • IndexNode.createIndexNode (cognitive 20) src/expression/node/IndexNode.js:13 — IndexNode.createIndexNode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, loops 3, ternaries 3 (nesting depth added 1). Of this number, 14 points are the body's own statements and 6 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 · stirlingS2.createStirlingS2 (cognitive 20) · ×1
  • stirlingS2.createStirlingS2 (cognitive 20) src/function/combinatorics/stirlingS2.js:21 — stirlingS2.createStirlingS2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 5). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 69). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · generateDoc · ×1
  • generateDoc::parseParameters (cognitive 20) tools/docgenerator.js:268 — generateDoc::parseParameters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), ternaries 1 (4 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 · string._format (cognitive 19) · ×1
  • string._format (cognitive 19) src/utils/string.js:63 — string._format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · diff.createDiff (cognitive 19) · ×1
  • diff.createDiff (cognitive 19) src/function/matrix/diff.js:8 — diff.createDiff has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2. None of this is in the body itself: all 19 points belong to 6 function items inside it that branch (_ElementDiff, _recursive, a function literal at line 63, …). 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 · usolve.createUsolve · ×1
  • usolve.createUsolve::_sparseBackwardSubstitution (cognitive 19) src/function/algebra/solver/usolve.js:109 — usolve.createUsolve::_sparseBackwardSubstitution has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · setIntersect.createSetIntersect (cognitive 19) · ×1
  • setIntersect.createSetIntersect (cognitive 19) src/function/set/setIntersect.js:7 — setIntersect.createSetIntersect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 8). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 30). 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 · intersect.createIntersect · ×1
  • intersect.createIntersect::_AAAA (cognitive 19) src/function/geometry/intersect.js:65 — intersect.createIntersect::_AAAA has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 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 · docgenerator.collectDocs (cognitive 18) · ×1
  • docgenerator.collectDocs (cognitive 18) tools/docgenerator.js:581 — docgenerator.collectDocs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 1). None of this is in the body itself: all 18 points belong to 2 function literals inside it that branch (lines 592, 638). 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 · bitwise.bitXor (cognitive 18) · ×1
  • bitwise.bitXor (cognitive 18) src/utils/bignumber/bitwise.js:292 — bitwise.bitXor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (2 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 · rotationMatrix.createRotationMatrix (cognitive 18) · ×1
  • rotationMatrix.createRotationMatrix (cognitive 18) src/function/matrix/rotationMatrix.js:20 — rotationMatrix.createRotationMatrix has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, if/else 5 (7 pts), boolean chains 2 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 7 function items inside it that branch (_rotationMatrix3x3, _convertToFormat, _validateVector, …). 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 · transpose.createTranspose (cognitive 18) · ×1
  • transpose.createTranspose (cognitive 18) src/function/matrix/transpose.js:8 — transpose.createTranspose has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 2 (5 pts), match/switch 2 (3 pts), ternaries 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (_sparseTranspose, transposeMatrix, _denseTranspose). 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 · deepEqual.createDeepEqual · ×1
  • deepEqual.createDeepEqual::_deepEqual (cognitive 18) src/function/relational/deepEqual.js:56 — deepEqual.createDeepEqual::_deepEqual has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), 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 · expm.createExpm (cognitive 18) · ×1
  • expm.createExpm (cognitive 18) src/function/matrix/expm.js:8 — expm.createExpm has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to 4 function items inside it that branch (a function literal at line 36, findParams, infinityNorm, …). 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 · nthRoot.createNthRoot (cognitive 17) · ×1
  • nthRoot.createNthRoot (cognitive 17) src/function/arithmetic/nthRoot.js:17 — nthRoot.createNthRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, ternaries 3 (5 pts), boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (_bigNthRoot, a function literal at line 86, a function literal at line 97, …). 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 · bitwise.bitwise (cognitive 17) · ×1
  • bitwise.bitwise (cognitive 17) src/utils/bignumber/bitwise.js:149 — bitwise.bitwise has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (6 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 · identity.createIdentity · ×1
  • identity.createIdentity::_identity (cognitive 17) src/function/matrix/identity.js:106 — identity.createIdentity::_identity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · range.createRange (cognitive 17) · ×1
  • range.createRange (cognitive 17) src/function/matrix/range.js:7 — range.createRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (7 pts), loops 1, match/switch 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (_range, _strRange, _out, …). 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 · partitionSelect.createPartitionSelect · ×1
  • partitionSelect.createPartitionSelect::quickSelect (cognitive 17) src/function/matrix/partitionSelect.js:95 — partitionSelect.createPartitionSelect::quickSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AccessorNode._compile (cognitive 17) · ×1
  • AccessorNode._compile (cognitive 17) src/expression/node/AccessorNode.js:97 — AccessorNode._compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7 (nesting depth added 4). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 106, 123). 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 · polynomialRoot.createPolynomialRoot (cognitive 17) · ×1
  • polynomialRoot.createPolynomialRoot (cognitive 17) src/function/algebra/polynomialRoot.js:20 — polynomialRoot.createPolynomialRoot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 75, 145). 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 · cumsum.createCumSum (cognitive 17) · ×1
  • cumsum.createCumSum (cognitive 17) src/function/statistics/cumsum.js:11 — cumsum.createCumSum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), error handling 2, boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 5 function items inside it that branch (_cumsumDimensional, _ncumSumDim, _cumsummap, …). 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 · quantileSeq.createQuantileSeq · ×1
  • quantileSeq.createQuantileSeq::_quantileSeq (cognitive 17) src/function/statistics/quantileSeq.js:124 — quantileSeq.createQuantileSeq::_quantileSeq has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · approx.approxDeepEqual (cognitive 17) · ×1
  • approx.approxDeepEqual (cognitive 17) tools/approx.js:84 — approx.approxDeepEqual has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generateMarkdown (cognitive 17) · ×1
  • generateMarkdown (cognitive 17) tools/docgenerator.js:481 — generateMarkdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 2). Of this number, 15 points are the body's own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · _importFromStream · ×1
  • _importFromStream::(anonymous)::readData (cognitive 17) REDACTED:120 — _importFromStream::(anonymous)::readData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (5 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · createSnapshotFromFactories (cognitive 17) · ×1
  • createSnapshotFromFactories (cognitive 17) src/utils/snapshot.js:97 — createSnapshotFromFactories has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, other 1, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 108, 143, 168). 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 · number.toEngineering (cognitive 16) · ×1
  • number.toEngineering (cognitive 16) src/utils/number.js:398 — number.toEngineering has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (5 pts), boolean chains 4, ternaries 3 (4 pts), if/else 3 (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 · formatter.format (cognitive 16) · ×1
  • formatter.format (cognitive 16) src/utils/bignumber/formatter.js:122 — formatter.format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 6). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · array._resize (cognitive 16) · ×1
  • array._resize (cognitive 16) src/utils/array.js:187 — array._resize has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · diag.createDiag (cognitive 16) · ×1
  • diag.createDiag (cognitive 16) src/function/matrix/diag.js:9 — diag.createDiag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5, boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (_getDiagonal, _diag, _createDiagonalMatrix). 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 · zeta.createZeta (cognitive 16) · ×1
  • zeta.createZeta (cognitive 16) src/function/special/zeta.js:6 — zeta.createZeta has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 1). None of this is in the body itself: all 16 points belong to 5 function items inside it that branch (zetaComplex, zetaNumeric, zeta, …). 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 · zpk2tf.createZpk2tf (cognitive 16) · ×1
  • zpk2tf.createZpk2tf (cognitive 16) src/function/signal/zpk2tf.js:13 — zpk2tf.createZpk2tf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 2 function items inside it that branch (_zpk2tf, _multiply). 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · MethodTooLong · ×1
  • MethodTooLong: FunctionNode._compile src/expression/node/FunctionNode.js:142 — MethodTooLong — _compile runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D44 · Platform End-of-Life · End-of-life runtime · ×1
  • End-of-life runtime: Node.js 18 REDACTED:164 — REDACTED declares Node.js 18 as this project's engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: Node (LCOM4 5) src/expression/node/Node.js:25 — Node'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.
IC1 · Incompleteness & stubs · Guard cannot change the result · ×1
  • Guard cannot change the result — returns what the code already falls through to src/function/matrix/map.js:243 — The guard above `return 0;` also returns `0`, so no input can make it matter. Implement the distinction that was intended, or delete the guard.
P12 · CI test-gate honesty · Coverage collected but not gated · ×1
  • Coverage collected but not gated — CI collects a coverage report but no step enforces a minimum — coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool's minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository's CI files AND its coverage configuration — the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited — matched against the threshold settings this check knows by name. A floor set in your coverage service's web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here.
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.
R1 · Type Safety · Type Safety · ×1
  • Type Safety — 1 typed · 1020 plain JS — the untyped files are src/constants.js, src/core/config.js, src/core/create.js, src/core/function/config.js, src/core/function/import.js, src/core/function/typed.js (+1014 more). tsconfig.json switches off strictNullChecks, so the typed files are only partly type-checked.
R10 · Code Duplication · Duplication concentrated across 15 sibling directories (33 clone groups) · ×1
  • Duplication concentrated across 15 sibling directories (33 clone groups) src/function/algebra/decomposition/lup.js:19 — 33 duplicated blocks under src/function/ have copies in at least two of the sibling directories algebra, arithmetic, bitwise, combinatorics, complex, fraction (+9 more sibling(s) not listed) — 19 of them are reported below, and 14 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 33 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 33 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 33 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 5 sibling directories (24 clone groups) · ×1
  • Duplication concentrated across 5 sibling directories (24 clone groups) src/function/matrix/mapSlices.js:53 — 24 duplicated blocks under src/ have copies in at least two of the sibling directories expression, function, plain, type, utils — 16 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 24 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 24 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 24 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 (99 lines × 2 locations) · ×1
  • Duplicated block (99 lines × 2 locations) src/function/statistics/max.js:9 — src/function/statistics/max.js:9 · src/function/statistics/min.js:9 — 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 (96 lines × 2 locations) · ×1
  • Duplicated block (96 lines × 2 locations) src/type/matrix/utils/matAlgo10xSids.js:6 — src/type/matrix/utils/matAlgo10xSids.js:6 · src/type/matrix/utils/matAlgo12xSfs.js:6 — 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 with local edits (74 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (74 matched lines × 2 locations) src/type/matrix/DenseMatrix.js:65 — src/type/matrix/DenseMatrix.js:65 · src/type/matrix/SparseMatrix.js:159 — the two spans are one implementation copied and then locally edited — 474 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Wholesale file copy (72 identical lines × 2 files) · ×1
  • Wholesale file copy (72 identical lines × 2 files) src/function/algebra/solver/lsolveAll.js:1 — src/function/algebra/solver/lsolveAll.js:1 · src/function/algebra/solver/usolveAll.js:1 — these 2 files are line-for-line copies of one another — 72 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block with local edits (65 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (65 matched lines × 2 locations) src/function/logical/or.js:16 — src/function/logical/or.js:16 · src/function/logical/xor.js:16 — the two spans are one implementation copied and then locally edited — 219 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 (62 lines × 2 locations) · ×1
  • Duplicated block (62 lines × 2 locations) src/function/matrix/ones.js:44 — src/function/matrix/ones.js:44 · src/function/matrix/zeros.js:42 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication · Wholesale file copy (59 identical lines × 2 files) · ×1
  • Wholesale file copy (59 identical lines × 2 files) src/function/algebra/solver/lsolve.js:1 — src/function/algebra/solver/lsolve.js:1 · src/function/algebra/solver/usolve.js:1 — these 2 files are line-for-line copies of one another — 59 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (57 lines × 2 locations) · ×1
  • Duplicated block (57 lines × 2 locations) src/function/arithmetic/ceil.js:127 — src/function/arithmetic/ceil.js:127 · src/function/arithmetic/floor.js:137 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (53 lines × 2 locations) · ×1
  • Duplicated block (53 lines × 2 locations) src/function/matrix/column.js:9 — src/function/matrix/column.js:9 · src/function/matrix/row.js:9 — 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 with local edits (52 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (52 matched lines × 2 locations) src/function/algebra/solver/usolve.js:15 — src/function/algebra/solver/usolve.js:15 · src/function/algebra/solver/usolveAll.js:15 — the two spans are one implementation copied and then locally edited — 399 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 (52 lines × 2 locations) · ×1
  • Duplicated block (52 lines × 2 locations) src/function/arithmetic/ceil.js:11 — src/function/arithmetic/ceil.js:11 · src/function/arithmetic/floor.js:11 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Wholesale file copy (51 identical lines × 3 files) · ×1
  • Wholesale file copy (51 identical lines × 3 files) src/function/bitwise/leftShift.js:1 — src/function/bitwise/leftShift.js:1 · src/function/bitwise/rightArithShift.js:2 · src/function/bitwise/rightLogShift.js:1 — these 3 files are line-for-line copies of one another — 51 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication · Duplicated block (50 lines × 2 locations) · ×1
  • Duplicated block (50 lines × 2 locations) src/function/arithmetic/addScalar.js:7 — src/function/arithmetic/addScalar.js:7 · src/function/arithmetic/subtractScalar.js:7 — 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 (43 lines × 2 locations) · ×1
  • Duplicated block (43 lines × 2 locations) src/function/trigonometry/acos.js:6 — src/function/trigonometry/acos.js:6 · src/function/trigonometry/asin.js:6 — 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 with local edits (40 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (40 matched lines × 2 locations) src/function/matrix/matrixFromColumns.js:3 — src/function/matrix/matrixFromColumns.js:3 · src/function/matrix/matrixFromRows.js:3 — the two spans are one implementation copied and then locally edited — 263 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 (37 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (37 matched lines × 2 locations) src/function/relational/largerEq.js:10 — src/function/relational/largerEq.js:10 · src/function/relational/smallerEq.js:10 — the two spans are one implementation copied and then locally edited — 232 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 (30 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (30 matched lines × 2 locations) src/function/matrix/mapSlices.js:53 — src/function/matrix/mapSlices.js:53 · src/utils/collection.js:74 — the two spans are one implementation copied and then locally edited — 226 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (29 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (29 matched lines × 2 locations) src/type/matrix/utils/matAlgo01xDSid.js:4 — src/type/matrix/utils/matAlgo01xDSid.js:4 · src/type/matrix/utils/matAlgo03xDSf.js:4 — the two spans are one implementation copied and then locally edited — 357 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 (22 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (22 matched lines × 2 locations) src/function/matrix/inv.js:64 — src/function/matrix/inv.js:64 · src/function/matrix/pinv.js:74 — the two spans are one implementation copied and then locally edited — 109 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 (20 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (20 matched lines × 2 locations) src/type/bignumber/function/bignumber.js:60 — src/type/bignumber/function/bignumber.js:60 · src/type/fraction/function/fraction.js:75 — the two spans are one implementation copied and then locally edited — 99 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 (19 lines × 2 locations) · ×1
  • Duplicated block (19 lines × 2 locations) src/expression/node/ConditionalNode.js:169 — src/expression/node/ConditionalNode.js:169 · src/expression/node/RangeNode.js:187 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (19 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (19 matched lines × 2 locations) src/expression/node/utils/access.js:16 — src/expression/node/utils/access.js:16 · src/expression/node/utils/assign.js:19 — the two spans are one implementation copied and then locally edited — 105 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 (19 lines × 3 locations) · ×1
  • Duplicated block (19 lines × 3 locations) src/function/arithmetic/ceil.js:154 — src/function/arithmetic/ceil.js:154 · src/function/arithmetic/fix.js:124 · src/function/arithmetic/floor.js:164 — the 3 copies are spread across 3 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 _simplifyCore (cyclomatic 86, cognitive 200) · ×1
  • Complex function _simplifyCore (cyclomatic 86, cognitive 200) src/function/algebra/simplifyCore.js:104 — _simplifyCore has cyclomatic complexity 86 and cognitive complexity 200; 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 csAmd (cyclomatic 55, cognitive 141) · ×1
  • Complex function csAmd (cyclomatic 55, cognitive 141) src/function/algebra/sparse/csAmd.js:26 — csAmd has cyclomatic complexity 55 and cognitive complexity 141; 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 _ruleMatch (cyclomatic 52, cognitive 110) · ×1
  • Complex function _ruleMatch (cyclomatic 52, cognitive 110) src/function/algebra/simplify.js:841 — _ruleMatch has cyclomatic complexity 52 and cognitive complexity 110; 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 recurPol (cyclomatic 49, cognitive 85) · ×1
  • Complex function recurPol (cyclomatic 49, cognitive 85) src/function/algebra/rationalize.js:531 — recurPol has cyclomatic complexity 49 and cognitive complexity 85; 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 getToken (cyclomatic 48, cognitive 87) · ×1
  • Complex function getToken (cyclomatic 48, cognitive 87) src/expression/parse.js:291 — getToken has cyclomatic complexity 48 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 FunctionNode, function (cyclomatic 48, cognitive 19) · ×1
  • Complex function FunctionNode, function (cyclomatic 48, cognitive 19) src/function/algebra/derivative.js:225 — FunctionNode, function has cyclomatic complexity 48 and cognitive complexity 19; 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 calculateNecessaryParentheses (cyclomatic 45, cognitive 73) · ×1
  • Complex function calculateNecessaryParentheses (cyclomatic 45, cognitive 73) src/expression/node/OperatorNode.js:48 — calculateNecessaryParentheses has cyclomatic complexity 45 and cognitive complexity 73; 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 createUnitSingle (cyclomatic 43, cognitive 71) · ×1
  • Complex function createUnitSingle (cyclomatic 43, cognitive 71) src/type/unit/Unit.js:3228 — createUnitSingle has cyclomatic complexity 43 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function Object, Object (cyclomatic 40, cognitive 56) · ×1
  • Complex function Object, Object (cyclomatic 40, cognitive 56) src/function/geometry/distance.js:139 — Object, Object has cyclomatic complexity 40 and cognitive complexity 56; 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 foldFraction (cyclomatic 38, cognitive 59) · ×1
  • Complex function foldFraction (cyclomatic 38, cognitive 59) src/function/algebra/simplifyConstant.js:355 — foldFraction has cyclomatic complexity 38 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 applyRule (cyclomatic 34, cognitive 54) · ×1
  • Complex function applyRule (cyclomatic 34, cognitive 54) src/function/algebra/simplify.js:589 — applyRule has cyclomatic complexity 34 and cognitive complexity 54; 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 33, cognitive 42) · ×1
  • Complex function (anonymous) (cyclomatic 33, cognitive 42) src/function/numeric/solveODE.js:98 — (anonymous) has cyclomatic complexity 33 and cognitive complexity 42; 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 approxEqual (cyclomatic 33, cognitive 39) · ×1
  • Complex function approxEqual (cyclomatic 33, cognitive 39) tools/approx.js:22 — approxEqual has cyclomatic complexity 33 and cognitive complexity 39; 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 matAlgo04xSidSid (cyclomatic 32, cognitive 55) · ×1
  • Complex function matAlgo04xSidSid (cyclomatic 32, cognitive 55) src/type/matrix/utils/matAlgo04xSidSid.js:26 — matAlgo04xSidSid has cyclomatic complexity 32 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 matAlgo05xSfSf (cyclomatic 30, cognitive 55) · ×1
  • Complex function matAlgo05xSfSf (cyclomatic 30, cognitive 55) src/type/matrix/utils/matAlgo05xSfSf.js:26 — matAlgo05xSfSf has cyclomatic complexity 30 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 parse (cyclomatic 29, cognitive 49) · ×1
  • Complex function parse (cyclomatic 29, cognitive 49) src/type/unit/Unit.js:254 — parse has cyclomatic complexity 29 and cognitive complexity 49; 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 _toTex (cyclomatic 27, cognitive 36) · ×1
  • Complex function _toTex (cyclomatic 27, cognitive 36) src/expression/node/OperatorNode.js:600 — _toTex has cyclomatic complexity 27 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 26, cognitive 46) · ×1
  • Complex function (anonymous) (cyclomatic 26, cognitive 46) src/function/algebra/sparse/csCounts.js:23 — (anonymous) has cyclomatic complexity 26 and cognitive complexity 46; 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 _denseLUP (cyclomatic 25, cognitive 66) · ×1
  • Complex function _denseLUP (cyclomatic 25, cognitive 66) src/function/algebra/decomposition/lup.js:88 — _denseLUP has cyclomatic complexity 25 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 parseAccessors (cyclomatic 25, cognitive 53) · ×1
  • Complex function parseAccessors (cyclomatic 25, cognitive 53) src/expression/parse.js:1421 — parseAccessors has cyclomatic complexity 25 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · src/type/unit/Unit.js · ×1
  • src/type/unit/Unit.js: 3147 lines of code src/type/unit/Unit.js:1 — src/type/unit/Unit.js has 3147 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/expression/parse.js · ×1
  • src/expression/parse.js: 1602 lines of code src/expression/parse.js:1 — src/expression/parse.js has 1602 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/type/matrix/SparseMatrix.js · ×1
  • src/type/matrix/SparseMatrix.js: 1346 lines of code src/type/matrix/SparseMatrix.js:1 — src/type/matrix/SparseMatrix.js has 1346 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/function/algebra/simplify.js · ×1
  • src/function/algebra/simplify.js: 1006 lines of code src/function/algebra/simplify.js:1 — src/function/algebra/simplify.js has 1006 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/type/matrix/DenseMatrix.js · ×1
  • src/type/matrix/DenseMatrix.js: 939 lines of code src/type/matrix/DenseMatrix.js:1 — src/type/matrix/DenseMatrix.js has 939 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/utils/array.js · ×1
  • src/utils/array.js: 860 lines of code src/utils/array.js:1 — src/utils/array.js has 860 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/function/arithmetic/multiply.js · ×1
  • src/function/arithmetic/multiply.js: 813 lines of code src/function/arithmetic/multiply.js:1 — src/function/arithmetic/multiply.js has 813 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/function/algebra/derivative.js · ×1
  • src/function/algebra/derivative.js: 704 lines of code src/function/algebra/derivative.js:1 — src/function/algebra/derivative.js has 704 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/utils/number.js · ×1
  • src/utils/number.js: 679 lines of code src/utils/number.js:1 — src/utils/number.js has 679 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 · tools/docgenerator.js · ×1
  • tools/docgenerator.js: 653 lines of code tools/docgenerator.js:1 — tools/docgenerator.js has 653 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/expression/node/OperatorNode.js · ×1
  • src/expression/node/OperatorNode.js: 636 lines of code src/expression/node/OperatorNode.js:1 — src/expression/node/OperatorNode.js has 636 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/function/matrix/eigs/complexEigs.js · ×1
  • src/function/matrix/eigs/complexEigs.js: 568 lines of code src/function/matrix/eigs/complexEigs.js:1 — src/function/matrix/eigs/complexEigs.js has 568 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/function/algebra/rationalize.js · ×1
  • src/function/algebra/rationalize.js: 564 lines of code src/function/algebra/rationalize.js:1 — src/function/algebra/rationalize.js has 564 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/function/algebra/sparse/csAmd.js · ×1
  • src/function/algebra/sparse/csAmd.js: 507 lines of code src/function/algebra/sparse/csAmd.js:1 — src/function/algebra/sparse/csAmd.js has 507 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 · tools/entryGenerator.js · ×1
  • tools/entryGenerator.js: 482 lines of code tools/entryGenerator.js:1 — tools/entryGenerator.js has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · src/expression/node/FunctionNode.js · ×1
  • src/expression/node/FunctionNode.js: 479 lines of code src/expression/node/FunctionNode.js:1 — src/expression/node/FunctionNode.js has 479 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/function/algebra/simplifyConstant.js · ×1
  • src/function/algebra/simplifyConstant.js: 460 lines of code src/function/algebra/simplifyConstant.js:1 — src/function/algebra/simplifyConstant.js has 460 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/core/function/typed.js · ×1
  • src/core/function/typed.js: 422 lines of code src/core/function/typed.js:1 — src/core/function/typed.js has 422 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/expression/operators.js · ×1
  • src/expression/operators.js: 402 lines of code src/expression/operators.js:1 — src/expression/operators.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R5 · Dependency Freshness · Dependency Freshness · ×1
  • Dependency Freshness — 37 outdated package(s); JS/npm CVEs scored in D30
R8 · Dependency Hygiene · Unused dependency 'assert' · ×1
  • Unused dependency 'assert' — Declared in the root REDACTED but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'codecov' · ×1
  • Unused dependency 'codecov' — Declared in the root REDACTED but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
R8 · Dependency Hygiene · Unused dependency 'expr-eval' · ×1
  • Unused dependency 'expr-eval' — Declared in the root REDACTED 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.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×1
  • Swallowed exception (caught, then discarded) src/function/matrix/eigs/complexEigs.js:603 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Minor — 104 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate src/expression/node/FunctionNode.js:106 — `!Array.isArray(args) || !args.every(isNode)` appears character-identically in 2 files — src/expression/node/FunctionNode.js, src/expression/node/OperatorNode.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/type/matrix/DenseMatrix.js:1003 — `!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)` appears character-identically in 2 files — src/type/matrix/DenseMatrix.js, src/type/matrix/SparseMatrix.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/type/matrix/SparseMatrix.js:613 — `!isNumber(value) || !isInteger(value) || value < 0` appears character-identically in 2 files — src/type/matrix/SparseMatrix.js, src/utils/array.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/function/probability/combinations.js:40 — `!isPositiveInteger(n) || !isPositiveInteger(k)` appears character-identically in 3 files — src/function/probability/combinations.js, src/function/probability/combinationsWithRep.js, src/function/probability/permutations.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/function/arithmetic/pow.js:150 — `( x * x < 1 && y === Infinity) || (x * x > 1 && y === -Infinity)` appears character-identically in 2 files — src/function/arithmetic/pow.js, src/plain/number/arithmetic.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/expression/node/AssignmentNode.js:33 — `(parenthesis === 'all') || ((exprPrecedence !== null) && (exprPrecedence <= precedence))` appears character-identically in 2 files — src/expression/node/AssignmentNode.js, src/expression/node/FunctionAssignmentNode.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/function/trigonometry/asech.js:32 — `(x <= 1 && x >= -1) || config.predictable` appears character-identically in 2 files — src/function/trigonometry/asech.js, src/function/trigonometry/atanh.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/function/trigonometry/acos.js:33 — `(x >= -1 && x <= 1) || config.predictable` appears character-identically in 2 files — src/function/trigonometry/acos.js, src/function/trigonometry/asin.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/type/matrix/DenseMatrix.js:442 — `Array.isArray(value) && value.length === 1` appears character-identically in 2 files — src/type/matrix/DenseMatrix.js, src/type/matrix/SparseMatrix.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/function/arithmetic/multiply.js:130 — `adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed'` appears character-identically in 2 files — src/function/arithmetic/multiply.js, src/function/matrix/dot.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/function/arithmetic/multiply.js:157 — `adt === a._datatype && bdt === b._datatype` appears character-identically in 7 files — src/function/arithmetic/multiply.js, src/type/matrix/utils/matAlgo04xSidSid.js, src/type/matrix/utils/matAlgo05xSfSf.js, src/type/matrix/utils/matAlgo06xS0S0.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/type/matrix/utils/matAlgo01xDSid.js:100 — `adt === denseMatrix._datatype && bdt === sparseMatrix._datatype` appears character-identically in 3 files — src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.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/expression/transform/cumsum.transform.js:22 — `args.length === 2 && isCollection(args[0])` appears character-identically in 2 files — src/expression/transform/cumsum.transform.js, src/expression/transform/utils/lastDimToZeroBase.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/type/matrix/utils/matAlgo01xDSid.js:43 — `asize[0] !== bsize[0] || asize[1] !== bsize[1]` appears character-identically in 9 files — src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js, src/type/matrix/utils/matAlgo04xSidSid.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/function/set/setDifference.js:44 — `compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier` appears character-identically in 3 files — src/function/set/setDifference.js, src/function/set/setIntersect.js, src/function/set/setIsSubset.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/type/matrix/DenseMatrix.js:40 — `data && isArray(data.data) && isArray(data.size)` appears character-identically in 2 files — src/type/matrix/DenseMatrix.js, src/type/matrix/ImmutableDenseMatrix.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/type/matrix/utils/matAlgo01xDSid.js:31 — `denseMatrix._datatype || denseMatrix.getDataType()` appears character-identically in 3 files — src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.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/expression/transform/filter.transform.js:39 — `isSymbolNode(callback) || isFunctionAssignmentNode(callback)` appears character-identically in 3 files — src/expression/transform/filter.transform.js, src/expression/transform/forEach.transform.js, src/expression/transform/map.transform.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/utils/object.js:276 — `object && Object.hasOwnProperty.call(object, property)` appears character-identically in 2 files — src/utils/object.js, tools/utils.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/expression/node/utils/access.js:20 — `object && typeof object.subset === 'function'` appears character-identically in 2 files — src/expression/node/utils/access.js, src/expression/node/utils/assign.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/type/matrix/utils/matAlgo01xDSid.js:37 — `sparseMatrix._datatype || sparseMatrix._data === undefined` appears character-identically in 3 files — src/type/matrix/utils/matAlgo01xDSid.js, src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.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/type/matrix/utils/matAlgo02xDS0.js:62 — `typeof adt === 'string' && adt === bdt && adt !== 'mixed'` appears character-identically in 8 files — src/type/matrix/utils/matAlgo02xDS0.js, src/type/matrix/utils/matAlgo03xDSf.js, src/type/matrix/utils/matAlgo04xSidSid.js, src/type/matrix/utils/matAlgo05xSfSf.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/expression/node/FunctionNode.js:154 — `typeof fn === 'function' && fn.rawArgs === true` appears character-identically in 2 files — src/expression/node/FunctionNode.js, src/expression/node/OperatorNode.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/function/matrix/ones.js:121 — `typeof value !== 'number' || !isInteger(value) || value < 0` appears character-identically in 2 files — src/function/matrix/ones.js, src/function/matrix/zeros.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/function/arithmetic/addScalar.js:41 — `x.value === null || x.value === undefined` appears character-identically in 2 files — src/function/arithmetic/addScalar.js, src/function/arithmetic/subtractScalar.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.
D34 · Knowledge Freshness · Orphaned file · ×22
  • Orphaned file src/function/matrix/eigs.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/eigs/realSymmetric.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/rotationMatrix.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/diff.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/algebra/polynomialRoot.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/algebra/solver/usolveAll.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/pinv.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/algebra/solver/lsolveAll.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/probability/lgamma.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/matrixFromFunction.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/fft.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/algebra/sylvester.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/probability/bernoulli.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/algebra/resolve.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/signal/freqz.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/logical/nullish.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/mapSlices.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/statistics/corr.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/rotate.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/probability/combinationsWithRep.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/matrix/matrixFromColumns.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file src/function/signal/zpk2tf.js:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
IC1 · Incompleteness & stubs · Disabled test · ×22
  • Disabled test test/unit-tests/core/import.test.js:363 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/core/import.test.js:368 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/core/import.test.js:373 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/core/import.test.js:378 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/core/import.test.js:383 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/algebra/rationalize.test.js:126 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/algebra/simplify.test.js:608 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/arithmetic/mod.test.js:81 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/arithmetic/multiply.test.js:213 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/arithmetic/multiply.test.js:222 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/arithmetic/unaryMinus.test.js:17 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/statistics/prod.test.js:29 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/statistics/prod.test.js:37 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/statistics/quantileSeq.test.js:97 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/statistics/sum.test.js:31 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/function/statistics/sum.test.js:39 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/type/matrix/SparseMatrix.test.js:170 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/type/matrix/SparseMatrix.test.js:177 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/type/matrix/utils/deepMap.test.js:66 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/type/unit/Unit.test.js:1170 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/utils/factory.test.js:35 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test test/unit-tests/utils/factory.test.js:67 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
D12 · Dependency Hygiene · Deprecated · ×16
  • Deprecated: @humanwhocodes/config-array REDACTED:1886 — @humanwhocodes/config-array 0.13.0 is resolved in REDACTED and is marked deprecated by its publisher: "Use @eslint/config-array instead". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: @humanwhocodes/object-schema REDACTED:1940 — @humanwhocodes/object-schema 2.0.3 is resolved in REDACTED and is marked deprecated by its publisher: "Use @eslint/object-schema instead". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: glob REDACTED:3048 — 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: glob REDACTED:3171 — 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: argv REDACTED:3240 — argv 0.0.2 is resolved in REDACTED and is marked deprecated by its publisher: "Package no longer supported. Contact Support at https://www.npmjs.com/support for more info.". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: har-validator REDACTED:7011 — har-validator 5.1.5 is resolved in REDACTED and is marked deprecated by its publisher: "this library is no longer supported". 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:7356 — 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.
  • Deprecated: glob REDACTED:8617 — 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: glob REDACTED:8675 — 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: glob REDACTED:9379 — glob 10.5.0 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: q REDACTED:10400 — q 1.5.1 is resolved in REDACTED and is marked deprecated by its publisher: "You or someone you depend on is using Q, the JavaScript Promise library that gave JavaScript developers strong feelings about promises. They can almost certainly migrate to the native JavaScript promise now. Thank you literally everyone for joining me in this bet against the odds. Be excellent to each other. (For a CapTP with native promises, see @endo/eventual-send and @endo/captp)". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: request REDACTED:10672 — request 2.88.0 is resolved in REDACTED and is marked deprecated by its publisher: "request has been deprecated, see https://github.com/request/request/issues/3142". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: rimraf REDACTED:10828 — rimraf 3.0.2 is resolved in REDACTED and is marked deprecated by its publisher: "Rimraf versions prior to v4 are no longer supported". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
  • Deprecated: glob REDACTED:10856 — 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: glob REDACTED:11898 — glob 10.5.0 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: uuid REDACTED:12723 — uuid 3.4.0 is resolved in REDACTED and is marked deprecated by its publisher: "uuid@10 and below is no longer supported. For ESM codebases, update to uuid@latest. For CommonJS codebases, use uuid@11 (but be aware this version will likely be deprecated in 2028).". This repository does not declare it — a direct dependency pulls it in, so the move is to upgrade or replace that dependency.
D30 · Dependency Vulnerabilities · Low CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: src/function/matrix/subset.js, src/function/geometry/intersect.js, src/function/matrix/transpose.js. Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (5 single-owned of 185 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 185 of the 666 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/type/matrix/DenseMatrix.js, tools/update-authors.js.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (58253 LoC, 447 module-visible types across 67 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 22 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: src/function/matrix/eigs.js, src/function/matrix/eigs/realSymmetric.js, src/function/matrix/rotationMatrix.js, src/function/matrix/diff.js, src/function/algebra/polynomialRoot.js, src/function/algebra/solver/usolveAll.js, src/function/matrix/pinv.js, src/function/algebra/solver/lsolveAll.js (and 14 more) (23 orphaned of 202 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 202 of the 666 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:8 — No static application security testing detected. For this repository's stack, add CodeQL's javascript-typescript pack, `semgrep --config=p/javascript`, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2429 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 REDACTED:27 — `REDACTED` 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 export 'lgammaN' · ×1
  • Unused export 'lgammaN' src/plain/number/probability.js:79 — Nothing ultimately consumes this binding: its only referrer is the re-export in src/plain/number/index.js, whose re-exported name has no consumer either. Removing it is therefore not a one-file change — drop the re-export line in src/plain/number/index.js in the same commit, or the barrel will import a name that no longer exists.
R7 · Dead Code · Unused export 'last' · ×1
  • Unused export 'last' src/utils/array.js:665 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'initial' · ×1
  • Unused export 'initial' src/utils/array.js:674 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'create' · ×1
  • Unused export 'create' src/utils/factory.js:105 — Nothing imports this binding — it is safe to review for removal.
Minor — 10 finding(s)
D12 · Dependency Hygiene · Outdated (npm) · ×10
  • Outdated (npm): @babel/runtime — @babel/runtime is pinned at 7.28.6; registry.npmjs.org publishes 8.0.10 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): @codemirror/language — @codemirror/language is pinned at 6.11.3; registry.npmjs.org publishes 6.13.1 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): @codemirror/state — @codemirror/state is pinned at 6.5.2; registry.npmjs.org publishes 6.7.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): complex.js — complex.js is pinned at 2.4.2; registry.npmjs.org publishes 2.4.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.
  • Outdated (npm): decimal.js — decimal.js is pinned at 10.5.0; registry.npmjs.org publishes 10.6.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): fraction.js — fraction.js is pinned at 5.2.2; registry.npmjs.org publishes 5.3.4 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): github-markdown-css — github-markdown-css is pinned at 5.8.1; registry.npmjs.org publishes 5.9.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): katex — katex is pinned at 0.16.22; registry.npmjs.org publishes 0.19.1 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): mathjs — mathjs is pinned at 14.6.0; registry.npmjs.org publishes 15.2.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): typed-function — typed-function is pinned at 4.2.1; registry.npmjs.org publishes 4.2.2 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/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-4585c2edf2c94014889fe451e1f6216e/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-4585c2edf2c94014889fe451e1f6216e/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .23artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update36artifacts/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.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/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a189ec-2b6a-7f03-8628-95ff757a819d · 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