Public report of quickwit-oss/tantivy, published 27 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 reportMeasured 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, 27 October 2026, 01:17 UTC · Survey ID cd_3d6db3524e264f12ab47486933648eae
quickwit-oss/tantivy
Measured 27 October 2026, 01:15 UTC, at code version 6bced0b
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.
Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.
CAI scoreStrong
CriticalWeakAdequateStrongExemplary
Down 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 153,937 lines of product code in 12 projects, tests not counted · Estimated rebuild effort: about 1.6 person-years · Weakest lens: Maturity, 58
Findings by how serious they are
10 critical381 serious34 minor
14 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
27 October 2026, 01:15 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.
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 ▸
55of 55 dimensions measured by tools.
408of 425 findings point to an exact file and line, so you can open each one in the code. The other 17 concern the repository as a whole, such as missing documentation.
55dimensions across 6 lenses, read from 153,937 lines of product code in 12 projects.
quickwit-oss/tantivy meets our standard for a preview release, though the project keeps no record of its design decisions. It scores 73 out of 100 and is rated Strong, and three of its ten critical findings are security problems.
Maturity, at 58, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 13 points. Raising Maturity to 62 would lift the score to about 75.
Two passwords or keys are open to anyone who can read the repository. One automatic update takes new releases before a bad one can be spotted, and five sets of files in separate parts keep changing together, which points to hidden dependencies. Replacing each exposed password or key, setting a waiting period for automatic updates and making the hidden dependencies explicit would close these risks. The two parts of the code nobody has worked on for a long time need someone to learn and document them before anyone changes them.
The product code is 153,937 lines, about €230,000 to rebuild.
How the score is built: what each lens counts forThe 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.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 4 findings
These 4 critical or serious findings were in the previous survey, on 13 October 2026, and are gone from this one.
€78,000 to €390,000, for 1,297 to 4,113 hours of work, about 1.6 person-years for 1 to 4 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×1.1 at a score of 73. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 153,937 lines of product code
What it is not
Not 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 No ADRs found finding(s) in ADR Quality.
Raises the score by about 13 points · Low effort · ADR Quality
2
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.
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 €230,000 to build again, about 1.6 person-years of work. Its weakest lens is Maturity, at 58 (Adequate). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 13 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
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.
429 modules, with 1411 dependencies between them. 4 loops run through 151 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 389 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.
jitexpr.compile.typed_expr uses jitexpr.types, so a change to jitexpr.types can break jitexpr.compile.typed_expr, while a change to jitexpr.compile.typed_expr can't break jitexpr.types.
Position
Below the diagonal: jitexpr.compile.typed_expr uses a module listed above it, which is the healthy direction.
ownedbytes uses tantivy_common.file_slice, so a change to tantivy_common.file_slice can break ownedbytes, while a change to ownedbytes can't break tantivy_common.file_slice.
Position
Below the diagonal: ownedbytes uses a module listed above it, which is the healthy direction.
tantivy.schema.field uses tantivy_common.serialize, so a change to tantivy_common.serialize can break tantivy.schema.field, while a change to tantivy.schema.field can't break tantivy_common.serialize.
Position
Below the diagonal: tantivy.schema.field uses a module listed above it, which is the healthy direction.
tantivy.schema.field_type uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy.schema.field_type, while a change to tantivy.schema.field_type can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy.schema.field_type uses a module listed above it, which is the healthy direction.
tantivy_columnar uses tantivy_common.serialize, so a change to tantivy_common.serialize can break tantivy_columnar, while a change to tantivy_columnar can't break tantivy_common.serialize.
Position
Below the diagonal: tantivy_columnar uses a module listed above it, which is the healthy direction.
jitexpr.compile uses jitexpr.types, so a change to jitexpr.types can break jitexpr.compile, while a change to jitexpr.compile can't break jitexpr.types.
Position
Below the diagonal: jitexpr.compile uses a module listed above it, which is the healthy direction.
jitexpr.compile uses jitexpr.compile.typed_expr, so a change to jitexpr.compile.typed_expr can break jitexpr.compile, while a change to jitexpr.compile can't break jitexpr.compile.typed_expr.
Position
Below the diagonal: jitexpr.compile uses a module listed above it, which is the healthy direction.
jitexpr.compile uses tantivy.schema.field_type, so a change to tantivy.schema.field_type can break jitexpr.compile, while a change to jitexpr.compile can't break tantivy.schema.field_type.
Position
Below the diagonal: jitexpr.compile uses a module listed above it, which is the healthy direction.
12→23 jitexpr.compile uses jitexpr.ast.untyped_exprpart of a loop✕
Connections
1 pair of types, where a type in jitexpr.compile uses a type in jitexpr.ast.untyped_expr.
jitexpr.compile uses jitexpr.ast.untyped_expr, so a change to jitexpr.ast.untyped_expr can break jitexpr.compile, while a change to jitexpr.compile can't break jitexpr.ast.untyped_expr.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jitexpr.compile.compile_fn_builder uses jitexpr.types, so a change to jitexpr.types can break jitexpr.compile.compile_fn_builder, while a change to jitexpr.compile.compile_fn_builder can't break jitexpr.types.
Position
Below the diagonal: jitexpr.compile.compile_fn_builder uses a module listed above it, which is the healthy direction.
jitexpr.compile.compile_fn_builder uses jitexpr.compile.typed_expr, so a change to jitexpr.compile.typed_expr can break jitexpr.compile.compile_fn_builder, while a change to jitexpr.compile.compile_fn_builder can't break jitexpr.compile.typed_expr.
Position
Below the diagonal: jitexpr.compile.compile_fn_builder uses a module listed above it, which is the healthy direction.
13→23 jitexpr.compile.compile_fn_builder uses jitexpr.ast.untyped_exprpart of a loop✕
Connections
1 pair of types, where a type in jitexpr.compile.compile_fn_builder uses a type in jitexpr.ast.untyped_expr.
jitexpr.compile.compile_fn_builder uses jitexpr.ast.untyped_expr, so a change to jitexpr.ast.untyped_expr can break jitexpr.compile.compile_fn_builder, while a change to jitexpr.compile.compile_fn_builder can't break jitexpr.ast.untyped_expr.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
13→27 jitexpr.compile.compile_fn_builder uses jitexpr.ast.infer_typespart of a loop✕
Connections
2 pairs of types, where a type in jitexpr.compile.compile_fn_builder uses a type in jitexpr.ast.infer_types.
jitexpr.compile.compile_fn_builder uses jitexpr.ast.infer_types, so a change to jitexpr.ast.infer_types can break jitexpr.compile.compile_fn_builder, while a change to jitexpr.compile.compile_fn_builder can't break jitexpr.ast.infer_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy_columnar.column uses tantivy_columnar, so a change to tantivy_columnar can break tantivy_columnar.column, while a change to tantivy_columnar.column can't break tantivy_columnar.
Position
Below the diagonal: tantivy_columnar.column uses a module listed above it, which is the healthy direction.
tantivy_common.bitset uses ownedbytes, so a change to ownedbytes can break tantivy_common.bitset, while a change to tantivy_common.bitset can't break ownedbytes.
Position
Below the diagonal: tantivy_common.bitset uses a module listed above it, which is the healthy direction.
tantivy_common.datetime uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy_common.datetime, while a change to tantivy_common.datetime can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy_common.datetime uses a module listed above it, which is the healthy direction.
tantivy_common.datetime uses tantivy_common.serialize, so a change to tantivy_common.serialize can break tantivy_common.datetime, while a change to tantivy_common.datetime can't break tantivy_common.serialize.
Position
Below the diagonal: tantivy_common.datetime uses a module listed above it, which is the healthy direction.
tantivy_common.datetime uses tantivy.schema.field_type, so a change to tantivy.schema.field_type can break tantivy_common.datetime, while a change to tantivy_common.datetime can't break tantivy.schema.field_type.
Position
Below the diagonal: tantivy_common.datetime uses a module listed above it, which is the healthy direction.
16→18 tantivy_common.datetime uses tantivy.schema.document.valuepart of a loop✕
Connections
2 pairs of types, where a type in tantivy_common.datetime uses a type in tantivy.schema.document.value.
tantivy_common.datetime uses tantivy.schema.document.value, so a change to tantivy.schema.document.value can break tantivy_common.datetime, while a change to tantivy_common.datetime can't break tantivy.schema.document.value.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
jitexpr.functions.concat uses jitexpr.types, so a change to jitexpr.types can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break jitexpr.types.
Position
Below the diagonal: jitexpr.functions.concat uses a module listed above it, which is the healthy direction.
jitexpr.functions.concat uses tantivy.schema.field_type, so a change to tantivy.schema.field_type can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break tantivy.schema.field_type.
Position
Below the diagonal: jitexpr.functions.concat uses a module listed above it, which is the healthy direction.
jitexpr.functions.concat uses jitexpr.compile, so a change to jitexpr.compile can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break jitexpr.compile.
Position
Below the diagonal: jitexpr.functions.concat uses a module listed above it, which is the healthy direction.
jitexpr.functions.concat uses jitexpr.compile.compile_fn_builder, so a change to jitexpr.compile.compile_fn_builder can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break jitexpr.compile.compile_fn_builder.
Position
Below the diagonal: jitexpr.functions.concat uses a module listed above it, which is the healthy direction.
17→20 jitexpr.functions.concat uses jitexpr.functionspart of a loop✕
Connections
2 pairs of types, where a type in jitexpr.functions.concat uses a type in jitexpr.functions.
jitexpr.functions.concat uses jitexpr.functions, so a change to jitexpr.functions can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break jitexpr.functions.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
17→27 jitexpr.functions.concat uses jitexpr.ast.infer_typespart of a loop✕
Connections
2 pairs of types, where a type in jitexpr.functions.concat uses a type in jitexpr.ast.infer_types.
jitexpr.functions.concat uses jitexpr.ast.infer_types, so a change to jitexpr.ast.infer_types can break jitexpr.functions.concat, while a change to jitexpr.functions.concat can't break jitexpr.ast.infer_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.schema.document.value uses tantivy_common.datetime, so a change to tantivy_common.datetime can break tantivy.schema.document.value, while a change to tantivy.schema.document.value can't break tantivy_common.datetime.
Position
Below the diagonal: tantivy.schema.document.value uses a module listed above it, which is the healthy direction.
tantivy_columnar.column.dictionary_encoded uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy_columnar.column.dictionary_encoded, while a change to tantivy_columnar.column.dictionary_encoded can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy_columnar.column.dictionary_encoded uses a module listed above it, which is the healthy direction.
tantivy_columnar.column.dictionary_encoded uses tantivy_columnar, so a change to tantivy_columnar can break tantivy_columnar.column.dictionary_encoded, while a change to tantivy_columnar.column.dictionary_encoded can't break tantivy_columnar.
Position
Below the diagonal: tantivy_columnar.column.dictionary_encoded uses a module listed above it, which is the healthy direction.
tantivy_columnar.column.dictionary_encoded uses tantivy_columnar.column, so a change to tantivy_columnar.column can break tantivy_columnar.column.dictionary_encoded, while a change to tantivy_columnar.column.dictionary_encoded can't break tantivy_columnar.column.
Position
Below the diagonal: tantivy_columnar.column.dictionary_encoded uses a module listed above it, which is the healthy direction.
jitexpr.functions uses jitexpr.types, so a change to jitexpr.types can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.types.
Position
Below the diagonal: jitexpr.functions uses a module listed above it, which is the healthy direction.
jitexpr.functions uses jitexpr.compile, so a change to jitexpr.compile can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.compile.
Position
Below the diagonal: jitexpr.functions uses a module listed above it, which is the healthy direction.
jitexpr.functions uses jitexpr.compile.compile_fn_builder, so a change to jitexpr.compile.compile_fn_builder can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.compile.compile_fn_builder.
Position
Below the diagonal: jitexpr.functions uses a module listed above it, which is the healthy direction.
jitexpr.functions uses jitexpr.functions.concat, so a change to jitexpr.functions.concat can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.functions.concat.
Position
Below the diagonal: jitexpr.functions uses a module listed above it, which is the healthy direction.
20→23 jitexpr.functions uses jitexpr.ast.untyped_exprpart of a loop✕
Connections
1 pair of types, where a type in jitexpr.functions uses a type in jitexpr.ast.untyped_expr.
jitexpr.functions uses jitexpr.ast.untyped_expr, so a change to jitexpr.ast.untyped_expr can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.ast.untyped_expr.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
20→27 jitexpr.functions uses jitexpr.ast.infer_typespart of a loop✕
Connections
2 pairs of types, where a type in jitexpr.functions uses a type in jitexpr.ast.infer_types.
jitexpr.functions uses jitexpr.ast.infer_types, so a change to jitexpr.ast.infer_types can break jitexpr.functions, while a change to jitexpr.functions can't break jitexpr.ast.infer_types.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.schema.schema uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.schema.schema, while a change to tantivy.schema.schema can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.schema.schema uses a module listed above it, which is the healthy direction.
tantivy.schema.schema uses tantivy.schema.document.value, so a change to tantivy.schema.document.value can break tantivy.schema.schema, while a change to tantivy.schema.schema can't break tantivy.schema.document.value.
Position
Below the diagonal: tantivy.schema.schema uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses tantivy_common.file_slice, so a change to tantivy_common.file_slice can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break tantivy_common.file_slice.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses ownedbytes, so a change to ownedbytes can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break ownedbytes.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses tantivy_columnar, so a change to tantivy_columnar can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break tantivy_columnar.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses tantivy_columnar.column, so a change to tantivy_columnar.column can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break tantivy_columnar.column.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
tantivy_columnar.dynamic_column uses tantivy_columnar.column.dictionary_encoded, so a change to tantivy_columnar.column.dictionary_encoded can break tantivy_columnar.dynamic_column, while a change to tantivy_columnar.dynamic_column can't break tantivy_columnar.column.dictionary_encoded.
Position
Below the diagonal: tantivy_columnar.dynamic_column uses a module listed above it, which is the healthy direction.
jitexpr.ast.untyped_expr uses jitexpr.functions, so a change to jitexpr.functions can break jitexpr.ast.untyped_expr, while a change to jitexpr.ast.untyped_expr can't break jitexpr.functions.
Position
Below the diagonal: jitexpr.ast.untyped_expr uses a module listed above it, which is the healthy direction.
tantivy.index.index_meta uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.index.index_meta, while a change to tantivy.index.index_meta can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.index.index_meta uses a module listed above it, which is the healthy direction.
tantivy.query.query uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.query.query, while a change to tantivy.query.query can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.query.query uses a module listed above it, which is the healthy direction.
25→35 tantivy.query.query uses tantivy.core.searcherpart of a loop✕
Connections
2 pairs of types, where a type in tantivy.query.query uses a type in tantivy.core.searcher.
tantivy.query.query uses tantivy.core.searcher, so a change to tantivy.core.searcher can break tantivy.query.query, while a change to tantivy.query.query can't break tantivy.core.searcher.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.schema.term uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.schema.term, while a change to tantivy.schema.term can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.schema.term uses a module listed above it, which is the healthy direction.
tantivy.schema.term uses tantivy.schema.field_type, so a change to tantivy.schema.field_type can break tantivy.schema.term, while a change to tantivy.schema.term can't break tantivy.schema.field_type.
Position
Below the diagonal: tantivy.schema.term uses a module listed above it, which is the healthy direction.
tantivy.schema.term uses tantivy_common.datetime, so a change to tantivy_common.datetime can break tantivy.schema.term, while a change to tantivy.schema.term can't break tantivy_common.datetime.
Position
Below the diagonal: tantivy.schema.term uses a module listed above it, which is the healthy direction.
tantivy.schema.term uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.schema.term, while a change to tantivy.schema.term can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.schema.term uses a module listed above it, which is the healthy direction.
jitexpr.ast.infer_types uses jitexpr.types, so a change to jitexpr.types can break jitexpr.ast.infer_types, while a change to jitexpr.ast.infer_types can't break jitexpr.types.
Position
Below the diagonal: jitexpr.ast.infer_types uses a module listed above it, which is the healthy direction.
jitexpr.ast.infer_types uses jitexpr.ast.untyped_expr, so a change to jitexpr.ast.untyped_expr can break jitexpr.ast.infer_types, while a change to jitexpr.ast.infer_types can't break jitexpr.ast.untyped_expr.
Position
Below the diagonal: jitexpr.ast.infer_types uses a module listed above it, which is the healthy direction.
tantivy.index.segment uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.index.segment, while a change to tantivy.index.segment can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.index.segment uses a module listed above it, which is the healthy direction.
tantivy.index.segment uses tantivy.index.index_meta, so a change to tantivy.index.index_meta can break tantivy.index.segment, while a change to tantivy.index.segment can't break tantivy.index.index_meta.
Position
Below the diagonal: tantivy.index.segment uses a module listed above it, which is the healthy direction.
28→32 tantivy.index.segment uses tantivy.index.indexpart of a loop✕
Connections
1 pair of types, where a type in tantivy.index.segment uses a type in tantivy.index.index.
tantivy.index.segment uses tantivy.index.index, so a change to tantivy.index.index can break tantivy.index.segment, while a change to tantivy.index.segment can't break tantivy.index.index.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.indexer.doc_id_mapping uses tantivy_common.bitset, so a change to tantivy_common.bitset can break tantivy.indexer.doc_id_mapping, while a change to tantivy.indexer.doc_id_mapping can't break tantivy_common.bitset.
Position
Below the diagonal: tantivy.indexer.doc_id_mapping uses a module listed above it, which is the healthy direction.
tantivy.indexer.doc_id_mapping uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.indexer.doc_id_mapping, while a change to tantivy.indexer.doc_id_mapping can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.indexer.doc_id_mapping uses a module listed above it, which is the healthy direction.
tantivy.indexer.doc_id_mapping uses tantivy.index.index_meta, so a change to tantivy.index.index_meta can break tantivy.indexer.doc_id_mapping, while a change to tantivy.indexer.doc_id_mapping can't break tantivy.index.index_meta.
Position
Below the diagonal: tantivy.indexer.doc_id_mapping uses a module listed above it, which is the healthy direction.
tantivy.indexer.index_writer uses tantivy_common.bitset, so a change to tantivy_common.bitset can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy_common.bitset.
Position
Below the diagonal: tantivy.indexer.index_writer uses a module listed above it, which is the healthy direction.
tantivy.indexer.index_writer uses tantivy.index.index_meta, so a change to tantivy.index.index_meta can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy.index.index_meta.
Position
Below the diagonal: tantivy.indexer.index_writer uses a module listed above it, which is the healthy direction.
tantivy.indexer.index_writer uses tantivy.schema.term, so a change to tantivy.schema.term can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy.schema.term.
Position
Below the diagonal: tantivy.indexer.index_writer uses a module listed above it, which is the healthy direction.
tantivy.indexer.index_writer uses tantivy.index.segment, so a change to tantivy.index.segment can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy.index.segment.
Position
Below the diagonal: tantivy.indexer.index_writer uses a module listed above it, which is the healthy direction.
30→32 tantivy.indexer.index_writer uses tantivy.index.indexpart of a loop✕
Connections
1 pair of types, where a type in tantivy.indexer.index_writer uses a type in tantivy.index.index.
tantivy.indexer.index_writer uses tantivy.index.index, so a change to tantivy.index.index can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy.index.index.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
30→33 tantivy.indexer.index_writer uses tantivy.index.segment_readerpart of a loop✕
Connections
1 pair of types, where a type in tantivy.indexer.index_writer uses a type in tantivy.index.segment_reader.
tantivy.indexer.index_writer uses tantivy.index.segment_reader, so a change to tantivy.index.segment_reader can break tantivy.indexer.index_writer, while a change to tantivy.indexer.index_writer can't break tantivy.index.segment_reader.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.postings.serializer uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.postings.serializer, while a change to tantivy.postings.serializer can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.postings.serializer uses a module listed above it, which is the healthy direction.
tantivy.postings.serializer uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.postings.serializer, while a change to tantivy.postings.serializer can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.postings.serializer uses a module listed above it, which is the healthy direction.
tantivy.postings.serializer uses tantivy.index.segment, so a change to tantivy.index.segment can break tantivy.postings.serializer, while a change to tantivy.postings.serializer can't break tantivy.index.segment.
Position
Below the diagonal: tantivy.postings.serializer uses a module listed above it, which is the healthy direction.
tantivy.index.index uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.index.index, while a change to tantivy.index.index can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.index.index uses a module listed above it, which is the healthy direction.
tantivy.index.index uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.index.index, while a change to tantivy.index.index can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.index.index uses a module listed above it, which is the healthy direction.
tantivy.index.index uses tantivy.index.index_meta, so a change to tantivy.index.index_meta can break tantivy.index.index, while a change to tantivy.index.index can't break tantivy.index.index_meta.
Position
Below the diagonal: tantivy.index.index uses a module listed above it, which is the healthy direction.
tantivy.index.index uses tantivy.index.segment, so a change to tantivy.index.segment can break tantivy.index.index, while a change to tantivy.index.index can't break tantivy.index.segment.
Position
Below the diagonal: tantivy.index.index uses a module listed above it, which is the healthy direction.
tantivy.index.index uses tantivy.indexer.index_writer, so a change to tantivy.indexer.index_writer can break tantivy.index.index, while a change to tantivy.index.index can't break tantivy.indexer.index_writer.
Position
Below the diagonal: tantivy.index.index uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy_common.file_slice, so a change to tantivy_common.file_slice can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy_common.file_slice.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy.schema.field_type, so a change to tantivy.schema.field_type can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy.schema.field_type.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy.index.segment, so a change to tantivy.index.segment can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy.index.segment.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.index.segment_reader uses tantivy.index.index, so a change to tantivy.index.index can break tantivy.index.segment_reader, while a change to tantivy.index.segment_reader can't break tantivy.index.index.
Position
Below the diagonal: tantivy.index.segment_reader uses a module listed above it, which is the healthy direction.
tantivy.aggregation.agg_data uses tantivy_columnar.column, so a change to tantivy_columnar.column can break tantivy.aggregation.agg_data, while a change to tantivy.aggregation.agg_data can't break tantivy_columnar.column.
Position
Below the diagonal: tantivy.aggregation.agg_data uses a module listed above it, which is the healthy direction.
tantivy.aggregation.agg_data uses tantivy_columnar.column.dictionary_encoded, so a change to tantivy_columnar.column.dictionary_encoded can break tantivy.aggregation.agg_data, while a change to tantivy.aggregation.agg_data can't break tantivy_columnar.column.dictionary_encoded.
Position
Below the diagonal: tantivy.aggregation.agg_data uses a module listed above it, which is the healthy direction.
tantivy.aggregation.agg_data uses tantivy.index.segment_reader, so a change to tantivy.index.segment_reader can break tantivy.aggregation.agg_data, while a change to tantivy.aggregation.agg_data can't break tantivy.index.segment_reader.
Position
Below the diagonal: tantivy.aggregation.agg_data uses a module listed above it, which is the healthy direction.
34→38 tantivy.aggregation.agg_data uses tantivy.aggregation.bucket.term_aggpart of a loop✕
Connections
2 pairs of types, where a type in tantivy.aggregation.agg_data uses a type in tantivy.aggregation.bucket.term_agg.
tantivy.aggregation.agg_data uses tantivy.aggregation.bucket.term_agg, so a change to tantivy.aggregation.bucket.term_agg can break tantivy.aggregation.agg_data, while a change to tantivy.aggregation.agg_data can't break tantivy.aggregation.bucket.term_agg.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
34→40 tantivy.aggregation.agg_data uses tantivy.aggregationpart of a loop✕
Connections
3 pairs of types, where a type in tantivy.aggregation.agg_data uses a type in tantivy.aggregation.
tantivy.aggregation.agg_data uses tantivy.aggregation, so a change to tantivy.aggregation can break tantivy.aggregation.agg_data, while a change to tantivy.aggregation.agg_data can't break tantivy.aggregation.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.core.searcher uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.core.searcher uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.core.searcher uses tantivy.query.query, so a change to tantivy.query.query can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.query.query.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.core.searcher uses tantivy.schema.term, so a change to tantivy.schema.term can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.schema.term.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.core.searcher uses tantivy.index.index, so a change to tantivy.index.index can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.index.index.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.core.searcher uses tantivy.index.segment_reader, so a change to tantivy.index.segment_reader can break tantivy.core.searcher, while a change to tantivy.core.searcher can't break tantivy.index.segment_reader.
Position
Below the diagonal: tantivy.core.searcher uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.schema.field, so a change to tantivy.schema.field can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.schema.field.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.schema.schema, so a change to tantivy.schema.schema can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.schema.schema.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.index.segment, so a change to tantivy.index.segment can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.index.segment.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.indexer.doc_id_mapping, so a change to tantivy.indexer.doc_id_mapping can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.indexer.doc_id_mapping.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.postings.serializer, so a change to tantivy.postings.serializer can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.postings.serializer.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.index.inverted_index_plugin uses tantivy.index.segment_reader, so a change to tantivy.index.segment_reader can break tantivy.index.inverted_index_plugin, while a change to tantivy.index.inverted_index_plugin can't break tantivy.index.segment_reader.
Position
Below the diagonal: tantivy.index.inverted_index_plugin uses a module listed above it, which is the healthy direction.
tantivy.aggregation.segment_agg_result uses tantivy.aggregation.agg_data, so a change to tantivy.aggregation.agg_data can break tantivy.aggregation.segment_agg_result, while a change to tantivy.aggregation.segment_agg_result can't break tantivy.aggregation.agg_data.
Position
Below the diagonal: tantivy.aggregation.segment_agg_result uses a module listed above it, which is the healthy direction.
37→39 tantivy.aggregation.segment_agg_result uses tantivy.aggregation.intermediate_agg_resultpart of a loop✕
Connections
2 pairs of types, where a type in tantivy.aggregation.segment_agg_result uses a type in tantivy.aggregation.intermediate_agg_result.
tantivy.aggregation.segment_agg_result uses tantivy.aggregation.intermediate_agg_result, so a change to tantivy.aggregation.intermediate_agg_result can break tantivy.aggregation.segment_agg_result, while a change to tantivy.aggregation.segment_agg_result can't break tantivy.aggregation.intermediate_agg_result.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.aggregation.bucket.term_agg uses tantivy_common.bitset, so a change to tantivy_common.bitset can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy_common.bitset.
Position
Below the diagonal: tantivy.aggregation.bucket.term_agg uses a module listed above it, which is the healthy direction.
tantivy.aggregation.bucket.term_agg uses tantivy_columnar.column.dictionary_encoded, so a change to tantivy_columnar.column.dictionary_encoded can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy_columnar.column.dictionary_encoded.
Position
Below the diagonal: tantivy.aggregation.bucket.term_agg uses a module listed above it, which is the healthy direction.
tantivy.aggregation.bucket.term_agg uses tantivy.aggregation.agg_data, so a change to tantivy.aggregation.agg_data can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy.aggregation.agg_data.
Position
Below the diagonal: tantivy.aggregation.bucket.term_agg uses a module listed above it, which is the healthy direction.
tantivy.aggregation.bucket.term_agg uses tantivy.aggregation.segment_agg_result, so a change to tantivy.aggregation.segment_agg_result can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy.aggregation.segment_agg_result.
Position
Below the diagonal: tantivy.aggregation.bucket.term_agg uses a module listed above it, which is the healthy direction.
38→39 tantivy.aggregation.bucket.term_agg uses tantivy.aggregation.intermediate_agg_resultpart of a loop✕
Connections
1 pair of types, where a type in tantivy.aggregation.bucket.term_agg uses a type in tantivy.aggregation.intermediate_agg_result.
tantivy.aggregation.bucket.term_agg uses tantivy.aggregation.intermediate_agg_result, so a change to tantivy.aggregation.intermediate_agg_result can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy.aggregation.intermediate_agg_result.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
38→40 tantivy.aggregation.bucket.term_agg uses tantivy.aggregationpart of a loop✕
Connections
2 pairs of types, where a type in tantivy.aggregation.bucket.term_agg uses a type in tantivy.aggregation.
tantivy.aggregation.bucket.term_agg uses tantivy.aggregation, so a change to tantivy.aggregation can break tantivy.aggregation.bucket.term_agg, while a change to tantivy.aggregation.bucket.term_agg can't break tantivy.aggregation.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.aggregation.intermediate_agg_result uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy.aggregation.intermediate_agg_result, while a change to tantivy.aggregation.intermediate_agg_result can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy.aggregation.intermediate_agg_result uses a module listed above it, which is the healthy direction.
tantivy.aggregation.intermediate_agg_result uses tantivy.aggregation.bucket.term_agg, so a change to tantivy.aggregation.bucket.term_agg can break tantivy.aggregation.intermediate_agg_result, while a change to tantivy.aggregation.intermediate_agg_result can't break tantivy.aggregation.bucket.term_agg.
Position
Below the diagonal: tantivy.aggregation.intermediate_agg_result uses a module listed above it, which is the healthy direction.
39→40 tantivy.aggregation.intermediate_agg_result uses tantivy.aggregationpart of a loop✕
Connections
1 pair of types, where a type in tantivy.aggregation.intermediate_agg_result uses a type in tantivy.aggregation.
tantivy.aggregation.intermediate_agg_result uses tantivy.aggregation, so a change to tantivy.aggregation can break tantivy.aggregation.intermediate_agg_result, while a change to tantivy.aggregation.intermediate_agg_result can't break tantivy.aggregation.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
tantivy.aggregation uses tantivy_columnar.columnar.column_type, so a change to tantivy_columnar.columnar.column_type can break tantivy.aggregation, while a change to tantivy.aggregation can't break tantivy_columnar.columnar.column_type.
Position
Below the diagonal: tantivy.aggregation uses a module listed above it, which is the healthy direction.
tantivy.aggregation uses tantivy.aggregation.intermediate_agg_result, so a change to tantivy.aggregation.intermediate_agg_result can break tantivy.aggregation, while a change to tantivy.aggregation can't break tantivy.aggregation.intermediate_agg_result.
Position
Below the diagonal: tantivy.aggregation uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
6
High / Critical
A07:2025 — Authentication Failures
3
High / Critical
Roadmap
Begin by resolving the missing Architectural Decision Records and documenting significant design choices in a dedicated folder to ensure traceability. Next, update the README with clear instructions for running the test suite and address orphaned knowledge files, starting with de.rs and se.rs, to maintain team awareness. Finally, extend structured logging across all runnable modules to ensure full observability and diagnosability in production environments.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
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.
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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 — 10
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 — 381
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 — 34
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 55 of 55 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.8 — 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 — 55 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 408 of 425 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT READ here — but this repository measures it: a coverage step in CI (`lcov --output`) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.rs), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 335 test files), but it was not re-run: its build outgrew the 6 GB scratch ceiling (7.071 GB measured) and was stopped; its suite was not run. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
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. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AX6 Interface segregation — 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 is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
X16 Unfloored truncation loop — 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, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — 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, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python, Rust is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.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.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality 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").
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.
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.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
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.
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.
23 function(s) exceeded the cyclomatic complexity threshold of 15; the worst was FieldType::value_from_json at 42. A further 26 function(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 tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char at 230 — they are counted neither in the figure above nor in this dimension's score. 12 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: src/tokenizer/ascii_folding_filter.rs (tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char at 230), jitexpr/src/ast/serde.rs (jitexpr::ast::serde::parse_function at 40), jitexpr/src/functions/mod.rs (Function::call at 38), src/aggregation/bucket/composite/mod.rs (tantivy::aggregation::bucket::composite::composite_intermediate_key_ordering at 24), src/aggregation/metric/extended_stats.rs (ExtendedStats::get_value at 19), and 7 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 10 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 23 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with FieldType::value_from_json (cyclomatic 42), CompositeKeyVisitor::visit (cyclomatic 37), InvertedIndexPluginWriter::index_document (cyclomatic 33). — 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 23 together lifts Cyclomatic Complexity from 7.1 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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.
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.
+ 28 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 60 down to 60 or less in Cognitive Complexity — start with CompositeKeyVisitor::visit (cognitive 71), InvertedIndexPluginWriter::index_document (cognitive 65). — 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 2 together lifts Cognitive Complexity from 6.4 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.4 / 10Stronggated by 28 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 11 FileTooLong finding(s) in God Classes — start with mod.rs (4), ascii_folding_filter.rs, intermediate_agg_result.rs. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 8 MethodTooLong finding(s) in God Classes — start with mod.rs (2), field_type.rs, inverted_index_plugin.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 6 FunctionTooLong finding(s) in God Classes — start with agg_data.rs (2), ascii_folding_filter.rs, mod.rs. — One of this dimension's main actionable groups (6 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
101 duplicated block group(s) detected. A further 10 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 48 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 13 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with and.rs, int_mod.rs, mod.rs. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 8 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with ceil.rs, left.rs, collector.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with left.rs, lower.rs, boolean_weight.rs. — One of this dimension's main actionable groups (7 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling7.3 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
12 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 4 module(s) off the main sequence, with abstractness counted on 11 of the 12 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: ownedbytes · ×4
What to do
Resolve the 4 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (4 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with segment_updater.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
2132 test methods: 2125 unit, 7 integration, 0 BDD, 0 e2e. The Rust suite contributes 2132 `#[test]` function(s) across 335 file(s) declaring at least one; its unit/integration split is Cargo's own — 2 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.
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.
0 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from Cargo.lock there.
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.
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.
0 of 180 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository commits no Cargo.lock, so its graph was resolved here: its manifests' `[dependencies]` and `[build-dependencies]` closed over the crates.io index, each crate at the newest release its requirement admits (what a fresh `cargo generate-lockfile` picks, not a graph the repository has pinned). Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here.
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.
Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs, agg_data.rs, field_type.rs. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.5 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
59 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is jitexpr/src/functions/mod.rs. Counted over 400 of the 463 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
147 deducted task-comment markers across 153937 LoC (0.1/KLoC) → score 9.8. 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.
Resolve the 146 TodoComment finding(s) in Explicit Debt — start with mod.rs (30), user_input_ast.rs (12), query_grammar.rs (9). — One of this dimension's main actionable groups (146 warning-level).
Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with tests.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
1 of 1 documentation facets pass in full. 18 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
2 of 12 build units (Cargo) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
2 finding(s): 0 critical, 2 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 2 REDACTED finding(s) in Secrets (history) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
6 finding(s): 0 critical, 1 high, 5 medium, 0 low. semgrep hit a parse error in 3 file(s) — `query-grammar/src/query_grammar.rs` (line 104), `src/aggregation/bucket/term_agg/mod.rs` (line 880, line 887), `src/schema/document/mod.rs` (lines 190–191, lines 194–195) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
13 of 400 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/schema/document/de.rs. Counted over 400 of the 463 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 2 Orphaned knowledge finding(s) in Knowledge Freshness — start with de.rs, se.rs. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 11 Orphaned file finding(s) in Knowledge Freshness — start with sort_by_erased_type.rs, ngram_tokenizer.rs, more_like_this.rs. — One of this dimension's main actionable groups (11 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 5 Boundary-crossing change coupling finding(s) in Change Coupling — start with json_postings_writer.rs, segment_writer.rs, user_input_ast.rs. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 4 Change coupling finding(s) in Change Coupling — start with json_utils.rs, index_writer.rs, reqopt_scorer.rs. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
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.
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.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
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.
282 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 7 of 12 project(s) that lack one — worth up to 1.2 pts.
Review the README against recent changes; refresh the parts that drifted.
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.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability4.8 / 10Adequate✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 1/4 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `columnar/columnar-cli`, `columnar/columnar-cli-inspect`, `stacker/fuzz_test`.
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
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.
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.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader3.5 / 10Weak✓ Tool-verified
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.
`segment_len` is read from the bytes being parsed at line 28 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 32 — and nowhere in its scope is `segment_len` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `segment_len` against the bytes actually remaining and a maximum the format allows before allocating. — sstable/src/value/vec_u32.rs:32
What to do
Each finding names the read that takes the length from the input and the site that spends it, and states that the value is never compared in between. Confirm from the two, then bound the length against the remaining stream before using it.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
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.
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.
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.
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.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
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.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
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.
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
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 — 13 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 — 60 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 Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, not by itself. 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, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~11320 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; Rust not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Rust surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
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.
D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
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.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (89 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
M4 Documentation accuracy — Not applicable: the 18 current-state document(s) make no claim of a kind M4 checks.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python, Rust 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 — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
S1 Web-Security Posture — No web surface: 453 Rust 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. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
X16 Unfloored truncation loop — 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
X18 Disposal-pattern correctness — 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
X2 Cancellation propagation — no C# was loaded; this repository's Python and Rust were read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation; a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
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.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Rust was read, and it logs through none: the `log` crate's macros take one finished message (as log4net does in C#; its `kv` values are an opt-in its backends mostly drop), `println!`/`eprintln!` are not loggers, or it makes no log call outside its tests and examples at all. Calls through `tracing` (`tracing::info!`, or `info!` imported from it) would be judged.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Boundary-crossing change coupling: json_postings_writer.rs ↔ term.rs src/postings/json_postings_writer.rs:1— `src/postings/json_postings_writer.rs` (context postings) and `src/schema/term.rs` (context schema) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `618e3bd1` Term and IndexingTerm cleanup (#2750); `842fe929` split Term in Term and IndexingTerm (#2744); `0f4c2e27` Fixes bug that causes out-of-order sstable key. (#2445) — run `git show` on any of them.
Boundary-crossing change coupling: segment_writer.rs ↔ json_postings_writer.rs src/indexer/segment_writer.rs:1— `src/indexer/segment_writer.rs` (context indexer) and `src/postings/json_postings_writer.rs` (context postings) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `618e3bd1` Term and IndexingTerm cleanup (#2750); `842fe929` split Term in Term and IndexingTerm (#2744); `0e9fced3` remove JsonTermWriter (#2238) — run `git show` on any of them.
Boundary-crossing change coupling: user_input_ast.rs ↔ logical_ast.rs query-grammar/src/user_input_ast.rs:1— `query-grammar/src/user_input_ast.rs` (context query-grammar) and `src/query/query_parser/logical_ast.rs` (context query) sit in DIFFERENT parts of the tree yet change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `70da310b` perf: deduplicate queries (#2698); `f4b37411` feat: Regex query grammar (#2677); `b325d569` Expose phrase-prefix queries via the built-in query parser (#2044) — run `git show` on any of them.
Boundary-crossing change coupling: query_grammar.rs ↔ logical_ast.rs query-grammar/src/query_grammar.rs:1— `query-grammar/src/query_grammar.rs` (context query-grammar) and `src/query/query_parser/logical_ast.rs` (context query) sit in DIFFERENT parts of the tree yet change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `70da310b` perf: deduplicate queries (#2698); `f4b37411` feat: Regex query grammar (#2677); `b325d569` Expose phrase-prefix queries via the built-in query parser (#2044) — run `git show` on any of them.
Boundary-crossing change coupling: facet_reader.rs ↔ merger.rs src/fastfield/facet_reader.rs:1— `src/fastfield/facet_reader.rs` (context fastfield) and `src/indexer/merger.rs` (context indexer) sit in DIFFERENT parts of the tree yet change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `2e3641c2` return CompactDocValue instead of trait (#2410); `06850719` Renaming .values(DocId) to .values_for_doc(DocId) (#1906); `dde49ac8` Closes #1195 (#1222) — run `git show` on any of them.
Orphaned knowledge src/schema/document/de.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
Orphaned knowledge src/schema/document/se.rs:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
TodoComment sstable/src/dictionary.rs:398— // TODO: Would be more consistent to return last_term id + 1 — 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 sstable/src/lib.rs:236— /// TODO remove this function. (See Issue #1727)
TodoComment sstable/src/streamer.rs:399— // TODO we could detect when we reach a !can_match, and skip both state and key — 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 sstable/src/streamer.rs:437— // TODO there is an idea where we only look at the upper bound when our delta_reader — 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 sstable/src/streamer.rs:626— // TODO add test for sparse search with a block of poison (starts with 0xffffffff) => such a — 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 sstable/src/value/index.rs:64— // TODO use array_windows when it gets stabilized — 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 sstable/src/index/v3.rs:92— // TODO we iterate over the entire Map to find matching blocks, — 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 sstable/src/index/v3.rs:268— // TODO move this function to tantivy_common? — 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 src/termdict/mod.rs:76— // TODO in the future this should become an enum of supported dictionaries — 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 src/space_usage/mod.rs:450— // TODO: understand why the following fails — 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 src/space_usage/mod.rs:491— // TODO: understand why the following fails — 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 src/schema/term.rs:493— // TODO pretty print these types too. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment src/schema/document/de.rs:69— /// TODO: Improve docs — 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 src/schema/document/de.rs:90— /// TODO: Improve docs — 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 src/schema/document/de.rs:175— /// TODO: Improve docs — 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 src/schema/document/de.rs:276— /// TODO: Improve docs — 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 src/schema/document/de.rs:352— /// TODO: Improve docs — 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 src/schema/document/de.rs:578— /// TODO: Improve docs — 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 src/schema/document/de.rs:294— /// TODO: Switch to slice instead? — 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 src/schema/document/default_document.rs:399— // TODO: Deserializing into OwnedValue is wasteful. The deserializer should be able to work — 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 src/schema/document/default_document.rs:805— // TODO: Should this be re-added with the serialize method — 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 src/schema/document/mod.rs:160— //! TODO: Complete this section... — 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 src/reader/mod.rs:40— // TODO add NEAR_REAL_TIME(target_ms) — 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 src/query/union/buffered_union.rs:264— // TODO Also implement `count` with deletes efficiently. — 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 src/query/union/simple_union.rs:95— // TODO: use estimate_union — 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.
Duplicated block (6 lines × 2) jitexpr/src/functions/and.rs:87— jitexpr/src/functions/and.rs:87-92 | jitexpr/src/functions/or.rs:89-94 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) jitexpr/src/functions/int_mod.rs:126— jitexpr/src/functions/int_mod.rs:126-131 | jitexpr/src/functions/pow.rs:129-134 — before extracting anything, compare `jitexpr/src/functions/int_mod.rs` and `jitexpr/src/functions/pow.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) src/aggregation/mod.rs:246— src/aggregation/mod.rs:246-251 | src/aggregation/mod.rs:292-298 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/aggregation/value_source/jitexpr_value_source/input_column.rs:79— src/aggregation/value_source/jitexpr_value_source/input_column.rs:79-84 | src/aggregation/value_source/jitexpr_value_source/input_column.rs:100-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/fastfield/writer.rs:65— src/fastfield/writer.rs:65-70 | src/fastfield/writer.rs:81-86 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/index/index_meta.rs:118— src/index/index_meta.rs:118-123 | src/index/segment_reader.rs:491-496 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/postings/recorder.rs:226— src/postings/recorder.rs:226-231 | src/postings/recorder.rs:333-338 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/query/boolean_query/boolean_weight.rs:617— src/query/boolean_query/boolean_weight.rs:617-622 | src/query/boolean_query/boolean_weight.rs:652-657 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) src/schema/document/existing_type_impls.rs:235— src/schema/document/existing_type_impls.rs:235-240 | src/schema/document/owned_value.rs:169-174 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) jitexpr/src/functions/left.rs:50— jitexpr/src/functions/left.rs:50-55 | jitexpr/src/functions/right.rs:51-56 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) src/aggregation/bucket/range.rs:318— src/aggregation/bucket/range.rs:318-323 | src/aggregation/bucket/term_missing_agg.rs:157-162 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) src/query/phrase_prefix_query/phrase_prefix_query.rs:77— src/query/phrase_prefix_query/phrase_prefix_query.rs:77-83 | src/query/phrase_query/phrase_query.rs:90-95 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_query.rs` and `src/query/phrase_query/phrase_query.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) jitexpr/src/functions/divide.rs:106— jitexpr/src/functions/divide.rs:106-111 | jitexpr/src/functions/int_mod.rs:105-110 — before extracting anything, compare `jitexpr/src/functions/divide.rs` and `jitexpr/src/functions/int_mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop (cognitive 50) src/query/phrase_query/phrase_scorer.rs:235— tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 4 (12 pts), boolean chains 2 (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.
tantivy::index::inverted_index_plugin::write_postings_for_field (cognitive 43) src/index/inverted_index_plugin.rs:545— tantivy::index::inverted_index_plugin::write_postings_for_field has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (17 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection (cognitive 39) src/query/boolean_query/block_wand_intersection.rs:19— tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (12 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes (cognitive 37) src/aggregation/agg_data.rs:910— tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy::aggregation::bucket::term_agg::build_segment_term_collector (cognitive 23) src/aggregation/bucket/term_agg/mod.rs:386— tantivy::aggregation::bucket::term_agg::build_segment_term_collector has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy::aggregation::agg_data::build_multi_terms_nodes (cognitive 20) src/aggregation/agg_data.rs:610— tantivy::aggregation::agg_data::build_multi_terms_nodes has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (7 pts), match/switch 1 (3 pts) (nesting depth added 9). 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.
tantivy::query::range_query::range_query_fastfield::search_on_json_numerical_field (cognitive 20) src/query/range_query/range_query_fastfield.rs:260— tantivy::query::range_query::range_query_fastfield::search_on_json_numerical_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (7 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.
tantivy::aggregation::metric::cardinality::str_collector::append_to_sketch (cognitive 19) src/aggregation/metric/cardinality/str_collector.rs:167— tantivy::aggregation::metric::cardinality::str_collector::append_to_sketch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 11). 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.
tantivy::query::boolean_query::block_wand_union::block_wand_single_scorer (cognitive 19) src/query/boolean_query/block_wand_union.rs:226— tantivy::query::boolean_query::block_wand_union::block_wand_single_scorer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy::aggregation::bucket::multi_terms::expand_partial_combinations_for_field (cognitive 18) src/aggregation/bucket/multi_terms/mod.rs:433— tantivy::aggregation::bucket::multi_terms::expand_partial_combinations_for_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 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.
tantivy::query::phrase_query::phrase_scorer::intersection_count_with_slop (cognitive 17) src/query/phrase_query/phrase_scorer.rs:148— tantivy::query::phrase_query::phrase_scorer::intersection_count_with_slop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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.
FileTooLong: tokenizer/ascii_folding_filter.rs src/tokenizer/ascii_folding_filter.rs— FileTooLong — 1517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 1017 over it, 3.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: aggregation/intermediate_agg_result.rs src/aggregation/intermediate_agg_result.rs— FileTooLong — 991 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 491 over it, 1.98× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: multi_terms/mod.rs src/aggregation/bucket/multi_terms/mod.rs— FileTooLong — 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 476 over it, 1.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: term_agg/mod.rs src/aggregation/bucket/term_agg/mod.rs— FileTooLong — 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 392 over it, 1.78× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: aggregation/agg_data.rs src/aggregation/agg_data.rs— FileTooLong — 792 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 292 over it, 1.58× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: query_parser/query_parser.rs src/query/query_parser/query_parser.rs— FileTooLong — 679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 179 over it, 1.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: writer/mod.rs columnar/src/columnar/writer/mod.rs— FileTooLong — 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 130 over it, 1.26× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: functions/mod.rs jitexpr/src/functions/mod.rs— FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 67 over it, 1.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: histogram/histogram.rs src/aggregation/bucket/histogram/histogram.rs— FileTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 61 over it, 1.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: term_agg/flattened_term_histogram.rs src/aggregation/bucket/term_agg/flattened_term_histogram.rs— FileTooLong — 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 10 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: index/inverted_index_plugin.rs src/index/inverted_index_plugin.rs— FileTooLong — 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 2 over it, 1.00× 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.
tantivy::collector::sort_key::order::compare_owned_value (cyclomatic 24) src/collector/sort_key/order.rs:10— tantivy::collector::sort_key::order::compare_owned_value has cyclomatic complexity 24 (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.
tantivy::aggregation::agg_data::build_nodes (cyclomatic 21) src/aggregation/agg_data.rs:335— tantivy::aggregation::agg_data::build_nodes has cyclomatic complexity 21 (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.
tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes (cyclomatic 20) src/aggregation/agg_data.rs:910— tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes 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.
tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop (cyclomatic 20) src/query/phrase_query/phrase_scorer.rs:235— tantivy::query::phrase_query::phrase_scorer::intersection_count_with_carrying_slop 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.
tantivy::core::json_utils::index_json_value (cyclomatic 19) src/core/json_utils.rs:107— tantivy::core::json_utils::index_json_value has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
tantivy::fastfield::writer::record_json_value_to_columnar_writer (cyclomatic 17) src/fastfield/writer.rs:288— tantivy::fastfield::writer::record_json_value_to_columnar_writer 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.
tantivy::index::inverted_index_plugin::write_postings_for_field (cyclomatic 16) src/index/inverted_index_plugin.rs:545— tantivy::index::inverted_index_plugin::write_postings_for_field has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection (cyclomatic 16) src/query/boolean_query/block_wand_intersection.rs:19— tantivy::query::boolean_query::block_wand_intersection::block_wand_intersection 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.
MethodTooLong: SegmentTermCollector.into_intermediate_bucket_result src/aggregation/bucket/term_agg/mod.rs:1253— MethodTooLong — into_intermediate_bucket_result runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FieldType.value_from_json src/schema/field_type.rs:401— MethodTooLong — value_from_json runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: InvertedIndexPluginWriter.index_document src/index/inverted_index_plugin.rs:199— MethodTooLong — index_document runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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.
MethodTooLong: ColumnarWriter.serialize columnar/src/columnar/writer/mod.rs:320— MethodTooLong — serialize runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FastFieldRangeWeight.scorer src/query/range_query/range_query_fastfield.rs:55— MethodTooLong — scorer runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BooleanWeight.complex_scorer src/query/boolean_query/boolean_weight.rs:313— MethodTooLong — complex_scorer runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: CompositeSourceAccessors.build_for_source src/aggregation/bucket/composite/accessors.rs:80— MethodTooLong — build_for_source runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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.
MethodTooLong: CompositeKeyVisitor.visit src/aggregation/bucket/composite/collector.rs:495— MethodTooLong — visit runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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.
Duplicated block (7 lines × 2) jitexpr/src/functions/ceil.rs:57— jitexpr/src/functions/ceil.rs:57-63 | jitexpr/src/functions/floor.rs:57-63 — before extracting anything, compare `jitexpr/src/functions/ceil.rs` and `jitexpr/src/functions/floor.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) jitexpr/src/functions/left.rs:86— jitexpr/src/functions/left.rs:86-92 | jitexpr/src/functions/right.rs:87-93 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) src/aggregation/bucket/composite/collector.rs:428— src/aggregation/bucket/composite/collector.rs:428-435 | src/aggregation/bucket/multi_terms/mod.rs:1191-1197 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/index/index_meta.rs:124— src/index/index_meta.rs:124-130 | src/index/segment_reader.rs:497-503 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) src/query/phrase_prefix_query/phrase_prefix_query.rs:51— src/query/phrase_prefix_query/phrase_prefix_query.rs:51-57 | src/query/phrase_query/phrase_query.rs:52-58 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_query.rs` and `src/query/phrase_query/phrase_query.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) src/query/phrase_prefix_query/phrase_prefix_weight.rs:50— src/query/phrase_prefix_query/phrase_prefix_weight.rs:50-56 | src/query/phrase_query/phrase_weight.rs:65-71 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_weight.rs` and `src/query/phrase_query/phrase_weight.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) src/termdict/fst_termdict/streamer.rs:169— src/termdict/fst_termdict/streamer.rs:169-175 | sstable/src/streamer.rs:490-496 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) src/query/query_parser/query_parser.rs:860— src/query/query_parser/query_parser.rs:860-866 | src/query/query_parser/query_parser.rs:888-894 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) jitexpr/src/functions/left.rs:72— jitexpr/src/functions/left.rs:72-79 | jitexpr/src/functions/right.rs:73-80 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) jitexpr/src/functions/lower.rs:65— jitexpr/src/functions/lower.rs:65-72 | jitexpr/src/functions/upper.rs:65-72 — before extracting anything, compare `jitexpr/src/functions/lower.rs` and `jitexpr/src/functions/upper.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) src/query/boolean_query/boolean_weight.rs:66— src/query/boolean_query/boolean_weight.rs:66-73 | src/query/boolean_query/boolean_weight.rs:416-423 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/query/phrase_prefix_query/phrase_prefix_weight.rs:36— src/query/phrase_prefix_query/phrase_prefix_weight.rs:36-43 | src/query/phrase_query/phrase_weight.rs:34-41 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_weight.rs` and `src/query/phrase_query/phrase_weight.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) src/query/phrase_query/phrase_scorer.rs:115— src/query/phrase_query/phrase_scorer.rs:115-122 | src/query/phrase_query/phrase_scorer.rs:154-161 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/query/phrase_query/regex_phrase_weight.rs:241— src/query/phrase_query/regex_phrase_weight.rs:241-248 | src/query/phrase_query/regex_phrase_weight.rs:251-258 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) src/tokenizer/simple_tokenizer.rs:20— src/tokenizer/simple_tokenizer.rs:20-27 | src/tokenizer/whitespace_tokenizer.rs:19-26 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Hotspot: src/aggregation/bucket/term_agg/mod.rs src/aggregation/bucket/term_agg/mod.rs:1253— src/aggregation/bucket/term_agg/mod.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SegmentTermCollector::into_intermediate_bucket_result at line 1253. 2 of those changes were fix/bug commits, and the other 25 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- src/aggregation/bucket/term_agg/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/aggregation/agg_data.rs src/aggregation/agg_data.rs:335— src/aggregation/agg_data.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in tantivy::aggregation::agg_data::build_nodes at line 335. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- src/aggregation/agg_data.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/schema/field_type.rs src/schema/field_type.rs:401— src/schema/field_type.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in FieldType::value_from_json at line 401. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- src/schema/field_type.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/query/query_parser/query_parser.rs src/query/query_parser/query_parser.rs:433— src/query/query_parser/query_parser.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in QueryParser::compute_boundary_term at line 433. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- src/query/query_parser/query_parser.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: bitpacker/src/bitpacker.rs bitpacker/src/bitpacker.rs:118— bitpacker/src/bitpacker.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in BitUnpacker::get_range at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- bitpacker/src/bitpacker.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/query/exist_query.rs src/query/exist_query.rs:102— src/query/exist_query.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in FastFieldExistsWeight::scorer at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-28 11:09:47 +01:00' --until='2026-10-26 11:09:47 +01:00' --full-history --no-merges -- src/query/exist_query.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
FunctionTooLong: tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char src/tokenizer/ascii_folding_filter.rs:72— FunctionTooLong — tantivy::tokenizer::ascii_folding_filter::fold_non_ascii_char runs 1474 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1374 over it, 14.74× 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: tantivy::aggregation::agg_data::build_nodes src/aggregation/agg_data.rs:335— FunctionTooLong — tantivy::aggregation::agg_data::build_nodes runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: tantivy::aggregation::bucket::term_agg::build_segment_term_collector src/aggregation/bucket/term_agg/mod.rs:386— FunctionTooLong — tantivy::aggregation::bucket::term_agg::build_segment_term_collector runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× 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: tantivy::core::json_utils::index_json_value src/core/json_utils.rs:107— FunctionTooLong — tantivy::core::json_utils::index_json_value runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 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: tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes src/aggregation/agg_data.rs:910— FunctionTooLong — tantivy::aggregation::agg_data::build_terms_or_cardinality_nodes runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.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: tantivy::index::inverted_index_plugin::write_postings_for_field src/index/inverted_index_plugin.rs:545— FunctionTooLong — tantivy::index::inverted_index_plugin::write_postings_for_field runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×5
Members sharing a duplicated core (4 members, 50+ identical tokens) jitexpr/src/functions/concat.rs:204— jitexpr/src/functions/concat.rs:204-272 | jitexpr/src/functions/lower.rs:90-111 | jitexpr/src/functions/regexp_extract.rs:153-179 | jitexpr/src/functions/upper.rs:90-110 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) jitexpr/src/functions/concat.rs:283— jitexpr/src/functions/concat.rs:283-297 | jitexpr/src/functions/lower.rs:122-133 | jitexpr/src/functions/regexp_extract.rs:190-201 | jitexpr/src/functions/upper.rs:121-132 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) jitexpr/src/functions/divide.rs:59— jitexpr/src/functions/divide.rs:59-80 | jitexpr/src/functions/int_mod.rs:65-81 | jitexpr/src/functions/pow.rs:64-80 | jitexpr/src/functions/substring_count.rs:59-74 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) jitexpr/src/functions/left.rs:113— jitexpr/src/functions/left.rs:113-134 | jitexpr/src/functions/right.rs:114-141 | jitexpr/src/functions/round.rs:157-223 | jitexpr/src/functions/substring.rs:144-168 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) jitexpr/src/functions/split_after.rs:191— jitexpr/src/functions/split_after.rs:191-205 | jitexpr/src/functions/split_before.rs:190-204 | jitexpr/src/functions/substring.rs:179-192 | jitexpr/src/functions/trim.rs:206-220 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (11 lines × 2) jitexpr/src/ast/serde.rs:132— jitexpr/src/ast/serde.rs:132-142 | jitexpr/src/compile/typed_expr_serialize.rs:71-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) jitexpr/src/functions/ceil.rs:117— jitexpr/src/functions/ceil.rs:117-127 | jitexpr/src/functions/floor.rs:117-127 — before extracting anything, compare `jitexpr/src/functions/ceil.rs` and `jitexpr/src/functions/floor.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) jitexpr/src/functions/max.rs:133— jitexpr/src/functions/max.rs:133-143 | jitexpr/src/functions/min.rs:131-141 — before extracting anything, compare `jitexpr/src/functions/max.rs` and `jitexpr/src/functions/min.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) jitexpr/src/functions/split_after.rs:65— jitexpr/src/functions/split_after.rs:65-75 | jitexpr/src/functions/split_before.rs:64-74 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) jitexpr/src/functions/split_after.rs:236— jitexpr/src/functions/split_after.rs:236-246 | jitexpr/src/functions/split_before.rs:235-245 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Change coupling: json_utils.rs ↔ json_postings_writer.rs src/core/json_utils.rs:1— `src/core/json_utils.rs` and `src/postings/json_postings_writer.rs` change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `618e3bd1` Term and IndexingTerm cleanup (#2750); `842fe929` split Term in Term and IndexingTerm (#2744); `0f4c2e27` Fixes bug that causes out-of-order sstable key. (#2445) — run `git show` on any of them.
Change coupling: index_writer.rs ↔ segment_register.rs src/indexer/index_writer.rs:1— `src/indexer/index_writer.rs` and `src/indexer/segment_register.rs` change together 69% of the time (25 of the 36 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 25 shared commits counted here, the most recent 3 are `7ce950f1` add method to fetch block of first vals in columnar (#2330); `c431cfcf` extend proptests, fix race condition (#1107); `f27ce641` Made the SegmentMeta inventory out of static. — run `git show` on any of them.
Change coupling: reqopt_scorer.rs ↔ buffered_union.rs src/query/reqopt_scorer.rs:1— `src/query/reqopt_scorer.rs` and `src/query/union/buffered_union.rs` change together 53% of the time (8 of the 15 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 8 shared commits counted here, the most recent 3 are `b86caeef` Major bugfix in intersection; `923f0508` seek_exact + cost based intersection (#2538); `33835b6a` Add DocSet::cost() (#2707) — run `git show` on any of them.
Change coupling: infallible.rs ↔ user_input_ast.rs query-grammar/src/infallible.rs:1— `query-grammar/src/infallible.rs` and `query-grammar/src/user_input_ast.rs` change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are `f4b37411` feat: Regex query grammar (#2677); `e5638112` all json should be snake_case; `da2ff571` fix fmt nightly — run `git show` on any of them.
Duplicated block (15 lines × 2) jitexpr/src/functions/max.rs:44— jitexpr/src/functions/max.rs:44-58 | jitexpr/src/functions/min.rs:44-58 — before extracting anything, compare `jitexpr/src/functions/max.rs` and `jitexpr/src/functions/min.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) jitexpr/src/functions/split_after.rs:111— jitexpr/src/functions/split_after.rs:111-125 | jitexpr/src/functions/split_before.rs:110-124 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) src/postings/compression/vint.rs:7— src/postings/compression/vint.rs:7-21 | src/postings/compression/vint.rs:28-42 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) src/aggregation/bucket/term_agg/mod.rs:1468— src/aggregation/bucket/term_agg/mod.rs:1468-1482 | src/aggregation/metric/cardinality/numeric_collector.rs:77-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) columnar/src/columnar/writer/mod.rs:282— columnar/src/columnar/writer/mod.rs:282-291 | columnar/src/columnar/writer/mod.rs:303-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) query-grammar/src/query_grammar.rs:670— query-grammar/src/query_grammar.rs:670-679 | query-grammar/src/query_grammar.rs:692-701 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/core/json_utils.rs:185— src/core/json_utils.rs:185-194 | src/core/json_utils.rs:306-315 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) src/query/phrase_query/phrase_scorer.rs:65— src/query/phrase_query/phrase_scorer.rs:65-74 | src/query/phrase_query/phrase_scorer.rs:87-96 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) jitexpr/src/functions/and.rs:58— jitexpr/src/functions/and.rs:58-66 | jitexpr/src/functions/or.rs:60-68 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) src/aggregation/intermediate_agg_result.rs:690— src/aggregation/intermediate_agg_result.rs:690-698 | src/aggregation/intermediate_agg_result.rs:718-726 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) src/docset.rs:215— src/docset.rs:215-223 | src/query/intersection.rs:288-296 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) jitexpr/src/functions/gt_eq.rs:66— jitexpr/src/functions/gt_eq.rs:66-74 | jitexpr/src/functions/lt_eq.rs:66-74 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) jitexpr/src/functions/max.rs:121— jitexpr/src/functions/max.rs:121-127 | jitexpr/src/functions/min.rs:121-125 — before extracting anything, compare `jitexpr/src/functions/max.rs` and `jitexpr/src/functions/min.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) src/aggregation/bucket/multi_terms/mod.rs:1413— src/aggregation/bucket/multi_terms/mod.rs:1413-1417 | src/aggregation/intermediate_agg_result.rs:1063-1067 — before extracting anything, compare `src/aggregation/bucket/multi_terms/mod.rs` and `src/aggregation/intermediate_agg_result.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) columnar/src/column_values/u64_based/blockwise_linear.rs:24— columnar/src/column_values/u64_based/blockwise_linear.rs:24-28 | columnar/src/column_values/u64_based/linear.rs:59-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) src/indexer/indexing_term.rs:114— src/indexer/indexing_term.rs:114-118 | src/postings/json_postings_writer.rs:139-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Off the main sequence: ownedbytes — ownedbytes: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: tantivy-bitpacker — tantivy-bitpacker: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: tantivy-stacker — tantivy-stacker: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: jitexpr — jitexpr: abstractness 0.01, instability 0.00, distance 0.99 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
TooManyMethods: Index src/index/index.rs:385— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Term src/schema/term.rs:23— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CompactDoc src/schema/document/default_document.rs:28— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (11 lines × 3) jitexpr/src/functions/add.rs:70— jitexpr/src/functions/add.rs:70-80 | jitexpr/src/functions/multiply.rs:73-83 | jitexpr/src/functions/subtract.rs:74-84 — before extracting anything, compare `jitexpr/src/functions/multiply.rs` and `jitexpr/src/functions/subtract.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) src/query/phrase_prefix_query/phrase_prefix_weight.rs:126— src/query/phrase_prefix_query/phrase_prefix_weight.rs:126-136 | src/query/phrase_query/phrase_weight.rs:120-130 | src/query/phrase_query/regex_phrase_weight.rs:278-288 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_weight.rs` and `src/query/phrase_query/phrase_weight.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) src/query/range_query/range_query_fastfield.rs:97— src/query/range_query/range_query_fastfield.rs:97-107 | src/query/range_query/range_query_fastfield.rs:164-174 | src/query/range_query/range_query_fastfield.rs:183-193 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 4) jitexpr/src/functions/concat.rs:293— jitexpr/src/functions/concat.rs:293-297 | jitexpr/src/functions/lower.rs:129-133 | jitexpr/src/functions/regexp_extract.rs:197-201 | jitexpr/src/functions/upper.rs:128-132 — before extracting anything, compare `jitexpr/src/functions/concat.rs` and `jitexpr/src/functions/lower.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 4) jitexpr/src/functions/divide.rs:66— jitexpr/src/functions/divide.rs:66-74 | jitexpr/src/functions/int_mod.rs:71-75 | jitexpr/src/functions/pow.rs:70-74 | jitexpr/src/functions/substring_count.rs:64-68 — before extracting anything, compare `jitexpr/src/functions/divide.rs` and `jitexpr/src/functions/int_mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 4) jitexpr/src/functions/left.rs:41— jitexpr/src/functions/left.rs:41-45 | jitexpr/src/functions/right.rs:42-46 | jitexpr/src/functions/split_after.rs:55-59 | jitexpr/src/functions/split_before.rs:54-58 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
QueryParser::compute_boundary_term (cyclomatic 19) src/query/query_parser/query_parser.rs:433— QueryParser::compute_boundary_term has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
QueryParser::compute_logical_ast_from_leaf_lenient (cyclomatic 19) src/query/query_parser/query_parser.rs:769— QueryParser::compute_logical_ast_from_leaf_lenient 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.
MoreLikeThis::add_term_frequencies (cognitive 36) src/query/more_like_this/more_like_this.rs:162— MoreLikeThis::add_term_frequencies has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (12 pts), match/switch 2 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MoreLikeThis::create_score_term (cognitive 18) src/query/more_like_this/more_like_this.rs:299— MoreLikeThis::create_score_term has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SegmentMultiTermsCollector::build_keys_from_non_full_fields (cognitive 30) src/aggregation/bucket/multi_terms/mod.rs:565— SegmentMultiTermsCollector::build_keys_from_non_full_fields has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (12 pts), boolean chains 1 (nesting depth added 19). 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.
SegmentMultiTermsCollector::into_intermediate_bucket_result (cognitive 19) src/aggregation/bucket/multi_terms/mod.rs:643— SegmentMultiTermsCollector::into_intermediate_bucket_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy_columnar::columnar::merge::is_empty_after_merge (cognitive 26) columnar/src/columnar/merge/mod.rs:360— tantivy_columnar::columnar::merge::is_empty_after_merge has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (8 pts), match/switch 2 (4 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.
tantivy_columnar::columnar::merge::merge_column (cognitive 17) columnar/src/columnar/merge/mod.rs:135— tantivy_columnar::columnar::merge::merge_column has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 3 (6 pts), if/else 2 (4 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
tantivy_sstable::merge::heap_merge::merge_sstable (cognitive 19) sstable/src/merge/heap_merge.rs:29— tantivy_sstable::merge::heap_merge::merge_sstable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tantivy_sstable::block_match_automaton::match_range_start (cognitive 16) sstable/src/block_match_automaton.rs:130— tantivy_sstable::block_match_automaton::match_range_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Dictionary::sorted_ords_to_term_cb (cognitive 18) sstable/src/dictionary.rs:476— Dictionary::sorted_ords_to_term_cb has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 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.
Dictionary::file_slice_for_range (cognitive 17) sstable/src/dictionary.rs:200— Dictionary::file_slice_for_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (5 members, 50+ identical tokens) jitexpr/src/functions/add.rs:69— jitexpr/src/functions/add.rs:69-97 | jitexpr/src/functions/max.rs:71-95 | jitexpr/src/functions/min.rs:71-95 | jitexpr/src/functions/multiply.rs:72-101 | jitexpr/src/functions/subtract.rs:73-102 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) jitexpr/src/functions/left.rs:25— jitexpr/src/functions/left.rs:25-45 | jitexpr/src/functions/right.rs:26-46 | jitexpr/src/functions/round.rs:40-69 | jitexpr/src/functions/split_after.rs:36-59 | jitexpr/src/functions/split_before.rs:35-58 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (20–21 lines × 2) jitexpr/src/functions/lower.rs:168— jitexpr/src/functions/lower.rs:168-188 | jitexpr/src/functions/upper.rs:167-186 — before extracting anything, compare `jitexpr/src/functions/lower.rs` and `jitexpr/src/functions/upper.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20–21 lines × 2) src/aggregation/bucket/multi_terms/mod.rs:1307— src/aggregation/bucket/multi_terms/mod.rs:1307-1327 | src/aggregation/intermediate_agg_result.rs:1126-1145 — before extracting anything, compare `src/aggregation/bucket/multi_terms/mod.rs` and `src/aggregation/intermediate_agg_result.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13–14 lines × 2) src/aggregation/agg_data.rs:875— src/aggregation/agg_data.rs:875-888 | src/aggregation/agg_data.rs:940-952 — 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 (13–14 lines × 2) src/postings/compression/vint.rs:68— src/postings/compression/vint.rs:68-81 | src/postings/compression/vint.rs:94-106 — 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 (13 lines × 2) bitpacker/src/filter_vec/avx2.rs:34— bitpacker/src/filter_vec/avx2.rs:34-46 | bitpacker/src/filter_vec/neon.rs:28-40 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 2) jitexpr/src/functions/ceil.rs:103— jitexpr/src/functions/ceil.rs:103-115 | jitexpr/src/functions/floor.rs:103-115 — before extracting anything, compare `jitexpr/src/functions/ceil.rs` and `jitexpr/src/functions/floor.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) jitexpr/src/functions/lower.rs:155— jitexpr/src/functions/lower.rs:155-166 | jitexpr/src/functions/upper.rs:154-165 — before extracting anything, compare `jitexpr/src/functions/lower.rs` and `jitexpr/src/functions/upper.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) src/query/phrase_query/phrase_weight.rs:125— src/query/phrase_query/phrase_weight.rs:125-136 | src/query/phrase_query/regex_phrase_weight.rs:283-294 — before extracting anything, compare `src/query/phrase_query/phrase_weight.rs` and `src/query/phrase_query/regex_phrase_weight.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 2) query-grammar/src/query_grammar.rs:984— query-grammar/src/query_grammar.rs:984-991 | query-grammar/src/query_grammar.rs:1000-1008 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8–9 lines × 2) src/aggregation/agg_data.rs:466— src/aggregation/agg_data.rs:466-473 | src/aggregation/agg_data.rs:495-503 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 3) jitexpr/src/functions/regexp_extract.rs:79— jitexpr/src/functions/regexp_extract.rs:79-85 | jitexpr/src/functions/split_after.rs:92-98 | jitexpr/src/functions/split_before.rs:91-97 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) src/query/phrase_prefix_query/phrase_prefix_weight.rs:117— src/query/phrase_prefix_query/phrase_prefix_weight.rs:117-123 | src/query/phrase_query/phrase_weight.rs:96-102 | src/query/phrase_query/regex_phrase_weight.rs:269-275 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_weight.rs` and `src/query/phrase_query/phrase_weight.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (28 lines × 6) src/tokenizer/ascii_folding_filter.rs:104— src/tokenizer/ascii_folding_filter.rs:104-131 | src/tokenizer/ascii_folding_filter.rs:285-312 | src/tokenizer/ascii_folding_filter.rs:318-345 | src/tokenizer/ascii_folding_filter.rs:488-516 | src/tokenizer/ascii_folding_filter.rs:742-769 | src/tokenizer/ascii_folding_filter.rs:1028-1055 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (28 lines × 6) src/tokenizer/ascii_folding_filter.rs:102— src/tokenizer/ascii_folding_filter.rs:102-129 | src/tokenizer/ascii_folding_filter.rs:316-343 | src/tokenizer/ascii_folding_filter.rs:486-513 | src/tokenizer/ascii_folding_filter.rs:740-767 | src/tokenizer/ascii_folding_filter.rs:869-897 | src/tokenizer/ascii_folding_filter.rs:1026-1053 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (28 lines × 14) src/tokenizer/ascii_folding_filter.rs:96— src/tokenizer/ascii_folding_filter.rs:96-123 | src/tokenizer/ascii_folding_filter.rs:243-270 | src/tokenizer/ascii_folding_filter.rs:310-337 | src/tokenizer/ascii_folding_filter.rs:432-459 | src/tokenizer/ascii_folding_filter.rs:480-507 | src/tokenizer/ascii_folding_filter.rs:581-608 | src/tokenizer/ascii_folding_filter.rs:660-687 | src/tokenizer/ascii_folding_filter.rs:734-761 | src/tokenizer/ascii_folding_filter.rs:863-890 | src/tokenizer/ascii_folding_filter.rs:903-930 | src/tokenizer/ascii_folding_filter.rs:948-975 | src/tokenizer/ascii_folding_filter.rs:1020-1047 | src/tokenizer/ascii_folding_filter.rs:1146-1174 | src/tokenizer/ascii_folding_filter.rs:1180-1207 — all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (28 lines × 14) src/tokenizer/ascii_folding_filter.rs:94— src/tokenizer/ascii_folding_filter.rs:94-121 | src/tokenizer/ascii_folding_filter.rs:241-268 | src/tokenizer/ascii_folding_filter.rs:308-335 | src/tokenizer/ascii_folding_filter.rs:399-427 | src/tokenizer/ascii_folding_filter.rs:478-505 | src/tokenizer/ascii_folding_filter.rs:579-606 | src/tokenizer/ascii_folding_filter.rs:658-685 | src/tokenizer/ascii_folding_filter.rs:732-759 | src/tokenizer/ascii_folding_filter.rs:861-888 | src/tokenizer/ascii_folding_filter.rs:901-928 | src/tokenizer/ascii_folding_filter.rs:946-973 | src/tokenizer/ascii_folding_filter.rs:1018-1045 | src/tokenizer/ascii_folding_filter.rs:1144-1171 | src/tokenizer/ascii_folding_filter.rs:1178-1205 — all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
FieldType::value_from_json (cyclomatic 42) src/schema/field_type.rs:401— FieldType::value_from_json has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CompositeKeyVisitor::visit (cyclomatic 37) src/aggregation/bucket/composite/collector.rs:495— CompositeKeyVisitor::visit has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
InvertedIndexPluginWriter::index_document (cyclomatic 33) src/index/inverted_index_plugin.rs:199— InvertedIndexPluginWriter::index_document has cyclomatic complexity 33 (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.
SegmentTermCollector::into_intermediate_bucket_result (cyclomatic 30) src/aggregation/bucket/term_agg/mod.rs:1253— SegmentTermCollector::into_intermediate_bucket_result 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.
tantivy_query_grammar::query_grammar::aggregate_infallible_expressions (cyclomatic 23) query-grammar/src/query_grammar.rs:943— tantivy_query_grammar::query_grammar::aggregate_infallible_expressions 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.
BooleanWeight::complex_scorer (cyclomatic 23) src/query/boolean_query/boolean_weight.rs:313— BooleanWeight::complex_scorer 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.
MoreLikeThis::add_term_frequencies (cyclomatic 22) src/query/more_like_this/more_like_this.rs:162— MoreLikeThis::add_term_frequencies 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.
FastFieldRangeWeight::scorer (cyclomatic 22) src/query/range_query/range_query_fastfield.rs:55— FastFieldRangeWeight::scorer 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.
CompileFnBuilder::apply_literal_type (cyclomatic 20) jitexpr/src/compile/compile_fn_builder.rs:92— CompileFnBuilder::apply_literal_type has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
BitUnpacker::get_range (cyclomatic 18) bitpacker/src/bitpacker.rs:118— BitUnpacker::get_range 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.
CompositeSourceAccessors::build_for_source (cyclomatic 18) src/aggregation/bucket/composite/accessors.rs:80— CompositeSourceAccessors::build_for_source has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FastFieldsWriter::add_doc_value (cyclomatic 18) src/fastfield/writer.rs:142— FastFieldsWriter::add_doc_value has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
jitexpr::functions::concat::string_concat (cyclomatic 17) jitexpr/src/functions/concat.rs:322— jitexpr::functions::concat::string_concat 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.
FixmeComment columnar/src/column_values/u64_based/tests.rs:71— // FIXME. f64::MIN would be better! — 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.
CompositeKeyVisitor::visit (cognitive 71) src/aggregation/bucket/composite/collector.rs:495— CompositeKeyVisitor::visit has cognitive complexity 71 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 7 (22 pts), boolean chains 9, loops 2 (3 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.
InvertedIndexPluginWriter::index_document (cognitive 65) src/index/inverted_index_plugin.rs:199— InvertedIndexPluginWriter::index_document has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 11 (31 pts), match/switch 1 (2 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.
SegmentTermCollector::into_intermediate_bucket_result (cognitive 60) src/aggregation/bucket/term_agg/mod.rs:1253— SegmentTermCollector::into_intermediate_bucket_result has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 5 (10 pts), match/switch 3 (7 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.
FieldType::value_from_json (cognitive 55) src/schema/field_type.rs:401— FieldType::value_from_json has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 6 (11 pts) (nesting depth added 27). 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.
tantivy_query_grammar::query_grammar::aggregate_infallible_expressions (cognitive 44) query-grammar/src/query_grammar.rs:943— tantivy_query_grammar::query_grammar::aggregate_infallible_expressions has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 4 (9 pts), boolean chains 3, loops 2 (3 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.
FastFieldRangeWeight::scorer (cognitive 35) src/query/range_query/range_query_fastfield.rs:55— FastFieldRangeWeight::scorer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BooleanWeight::complex_scorer (cognitive 31) src/query/boolean_query/boolean_weight.rs:313— BooleanWeight::complex_scorer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BitUnpacker::get_range (cognitive 29) bitpacker/src/bitpacker.rs:118— BitUnpacker::get_range has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 7 (8 pts), boolean chains 3 (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.
SegmentHistogramCollector::collect (cognitive 29) src/aggregation/bucket/histogram/histogram.rs:530— SegmentHistogramCollector::collect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 2 (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.
QueryParser::compute_logical_ast_from_leaf_lenient (cognitive 29) src/query/query_parser/query_parser.rs:769— QueryParser::compute_logical_ast_from_leaf_lenient has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (8 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
FastFieldsWriter::from_schema_and_tokenizer_manager (cognitive 27) src/fastfield/writer.rs:37— FastFieldsWriter::from_schema_and_tokenizer_manager has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
jitexpr::functions::concat::string_concat (cognitive 24) jitexpr/src/functions/concat.rs:322— jitexpr::functions::concat::string_concat has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CompositeSourceAccessors::build_for_source (cognitive 22) src/aggregation/bucket/composite/accessors.rs:80— CompositeSourceAccessors::build_for_source has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CompileFnBuilder::apply_literal_type (cognitive 20) jitexpr/src/compile/compile_fn_builder.rs:92— CompileFnBuilder::apply_literal_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 8 (nesting depth added 6). 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.
IntermediateMultiTermsBucketResult::prune_intermediate_results (cognitive 20) src/aggregation/bucket/multi_terms/mod.rs:1260— IntermediateMultiTermsBucketResult::prune_intermediate_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IntermediateTermBucketResult::prune_intermediate_results (cognitive 20) src/aggregation/intermediate_agg_result.rs:1101— IntermediateTermBucketResult::prune_intermediate_results has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BufferedUnionScorer::seek (cognitive 20) src/query/union/buffered_union.rs:195— BufferedUnionScorer::seek has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (8 pts) (nesting depth added 9). 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.
ColumnBlockAccessor::fetch_block_with_missing_ordered (cognitive 19) src/aggregation/value_source/block_accessor.rs:96— ColumnBlockAccessor::fetch_block_with_missing_ordered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
JitExprValueSourceProvider::open_segment (cognitive 19) src/aggregation/value_source/jitexpr_value_source/mod.rs:72— JitExprValueSourceProvider::open_segment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 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.
ManagedDirectory::garbage_collect (cognitive 19) src/directory/managed_directory.rs:109— ManagedDirectory::garbage_collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (6 pts), loops 3 (5 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.
TfAndPositionRecorder::serialize (cognitive 19) src/postings/recorder.rs:277— TfAndPositionRecorder::serialize has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 2 (5 pts), if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
FastFieldExistsWeight::scorer (cognitive 19) src/query/exist_query.rs:102— FastFieldExistsWeight::scorer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StorePlugin::merge (cognitive 19) src/store/plugin.rs:33— StorePlugin::merge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OptionalIndex::next_non_null_doc (cognitive 17) columnar/src/column_index/optional_index/mod.rs:284— OptionalIndex::next_non_null_doc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
IndexBuilder::validate (cognitive 16) src/index/index.rs:305— IndexBuilder::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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.
RegexPhraseWeight::get_union_from_term_infos (cognitive 16) src/query/phrase_query/regex_phrase_weight.rs:172— RegexPhraseWeight::get_union_from_term_infos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BlockReader::read_block (cognitive 16) sstable/src/block_reader.rs:68— BlockReader::read_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Near-duplicate member pair (46 shared lines) jitexpr/src/functions/lower.rs:154— jitexpr/src/functions/lower.rs:154-204 | jitexpr/src/functions/upper.rs:153-201 — These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (41 shared lines) jitexpr/src/functions/ceil.rs:81— jitexpr/src/functions/ceil.rs:81-127 | jitexpr/src/functions/floor.rs:81-127 — These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (9 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (9 members, 50+ identical tokens) jitexpr/src/functions/left.rs:113— jitexpr/src/functions/left.rs:113-134 | jitexpr/src/functions/lower.rs:90-111 | jitexpr/src/functions/regexp_extract.rs:153-179 | jitexpr/src/functions/right.rs:114-141 | jitexpr/src/functions/split_after.rs:150-180 | jitexpr/src/functions/split_before.rs:149-179 | jitexpr/src/functions/substring.rs:144-168 | jitexpr/src/functions/trim.rs:167-196 | jitexpr/src/functions/upper.rs:90-110 — These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times.
Duplicated block (15–19 lines × 2) columnar/src/column_index/multivalued_index.rs:129— columnar/src/column_index/multivalued_index.rs:129-143 | columnar/src/column_index/multivalued_index.rs:321-339 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) src/aggregation/bucket/composite/collector.rs:560— src/aggregation/bucket/composite/collector.rs:560-578 | src/aggregation/bucket/composite/collector.rs:606-624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16–19 lines × 2) src/query/phrase_prefix_query/phrase_prefix_query.rs:98— src/query/phrase_prefix_query/phrase_prefix_query.rs:98-113 | src/query/phrase_query/phrase_query.rs:105-123 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_query.rs` and `src/query/phrase_query/phrase_query.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) src/aggregation/bucket/composite/accessors.rs:201— src/aggregation/bucket/composite/accessors.rs:201-218 | src/aggregation/bucket/composite/accessors.rs:243-260 — 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 (17 lines × 3) jitexpr/src/functions/split_after.rs:164— jitexpr/src/functions/split_after.rs:164-180 | jitexpr/src/functions/split_before.rs:163-179 | jitexpr/src/functions/trim.rs:180-196 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) jitexpr/src/functions/ceil.rs:85— jitexpr/src/functions/ceil.rs:85-101 | jitexpr/src/functions/floor.rs:85-101 — before extracting anything, compare `jitexpr/src/functions/ceil.rs` and `jitexpr/src/functions/floor.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11–16 lines × 3) jitexpr/src/functions/divide.rs:60— jitexpr/src/functions/divide.rs:60-75 | jitexpr/src/functions/int_mod.rs:66-76 | jitexpr/src/functions/pow.rs:65-75 — before extracting anything, compare `jitexpr/src/functions/divide.rs` and `jitexpr/src/functions/int_mod.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15–16 lines × 2) columnar/src/columnar/writer/mod.rs:729— columnar/src/columnar/writer/mod.rs:729-744 | columnar/src/columnar/writer/mod.rs:773-787 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–15 lines × 2) jitexpr/src/functions/eq.rs:73— jitexpr/src/functions/eq.rs:73-87 | jitexpr/src/functions/neq.rs:61-71 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14–15 lines × 2) jitexpr/src/functions/lower.rs:190— jitexpr/src/functions/lower.rs:190-204 | jitexpr/src/functions/upper.rs:188-201 — before extracting anything, compare `jitexpr/src/functions/lower.rs` and `jitexpr/src/functions/upper.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10–14 lines × 4) jitexpr/src/functions/max.rs:81— jitexpr/src/functions/max.rs:81-90 | jitexpr/src/functions/min.rs:81-90 | jitexpr/src/functions/multiply.rs:83-96 | jitexpr/src/functions/subtract.rs:84-97 — before extracting anything, compare `jitexpr/src/functions/max.rs` and `jitexpr/src/functions/min.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) jitexpr/src/functions/concat.rs:140— jitexpr/src/functions/concat.rs:140-153 | jitexpr/src/functions/trim.rs:112-125 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13 lines × 5) jitexpr/src/functions/left.rs:26— jitexpr/src/functions/left.rs:26-38 | jitexpr/src/functions/right.rs:27-39 | jitexpr/src/functions/round.rs:44-56 | jitexpr/src/functions/split_after.rs:40-52 | jitexpr/src/functions/split_before.rs:39-51 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12–13 lines × 4) jitexpr/src/functions/concat.rs:260— jitexpr/src/functions/concat.rs:260-272 | jitexpr/src/functions/lower.rs:100-111 | jitexpr/src/functions/regexp_extract.rs:168-179 | jitexpr/src/functions/upper.rs:99-110 — before extracting anything, compare `jitexpr/src/functions/concat.rs` and `jitexpr/src/functions/lower.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 4) jitexpr/src/functions/split_after.rs:192— jitexpr/src/functions/split_after.rs:192-205 | jitexpr/src/functions/split_before.rs:191-204 | jitexpr/src/functions/substring.rs:180-192 | jitexpr/src/functions/trim.rs:207-220 — before extracting anything, compare `jitexpr/src/functions/split_after.rs` and `jitexpr/src/functions/split_before.rs` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12–13 lines × 3) jitexpr/src/functions/add.rs:45— jitexpr/src/functions/add.rs:45-56 | jitexpr/src/functions/multiply.rs:47-59 | jitexpr/src/functions/subtract.rs:48-60 — before extracting anything, compare `jitexpr/src/functions/multiply.rs` and `jitexpr/src/functions/subtract.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12–13 lines × 2) src/aggregation/bucket/multi_terms/mod.rs:1326— src/aggregation/bucket/multi_terms/mod.rs:1326-1338 | src/aggregation/intermediate_agg_result.rs:1187-1198 — before extracting anything, compare `src/aggregation/bucket/multi_terms/mod.rs` and `src/aggregation/intermediate_agg_result.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9–12 lines × 3) jitexpr/src/functions/concat.rs:284— jitexpr/src/functions/concat.rs:284-295 | jitexpr/src/functions/lower.rs:123-131 | jitexpr/src/functions/upper.rs:122-130 — before extracting anything, compare `jitexpr/src/functions/concat.rs` and `jitexpr/src/functions/lower.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–11 lines × 4) jitexpr/src/functions/left.rs:126— jitexpr/src/functions/left.rs:126-134 | jitexpr/src/functions/right.rs:133-141 | jitexpr/src/functions/round.rs:213-223 | jitexpr/src/functions/substring.rs:160-168 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–10 lines × 2) src/query/phrase_query/phrase_scorer.rs:155— src/query/phrase_query/phrase_scorer.rs:155-164 | src/query/phrase_query/phrase_scorer.rs:201-209 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 3) columnar/src/column/serialize.rs:71— columnar/src/column/serialize.rs:71-79 | columnar/src/column/serialize.rs:91-99 | columnar/src/column/serialize.rs:114-122 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (3–9 lines × 9) jitexpr/src/functions/left.rs:115— jitexpr/src/functions/left.rs:115-117 | jitexpr/src/functions/lower.rs:92-94 | jitexpr/src/functions/regexp_extract.rs:156-160 | jitexpr/src/functions/right.rs:116-118 | jitexpr/src/functions/split_after.rs:154-162 | jitexpr/src/functions/split_before.rs:153-161 | jitexpr/src/functions/substring.rs:146-148 | jitexpr/src/functions/trim.rs:168-170 | jitexpr/src/functions/upper.rs:92-94 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (4–8 lines × 4) jitexpr/src/functions/left.rs:118— jitexpr/src/functions/left.rs:118-125 | jitexpr/src/functions/right.rs:118-124 | jitexpr/src/functions/right.rs:129-132 | jitexpr/src/functions/substring.rs:152-159 — before extracting anything, compare `jitexpr/src/functions/left.rs` and `jitexpr/src/functions/right.rs` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6–8 lines × 2) src/aggregation/intermediate_agg_result.rs:1147— src/aggregation/intermediate_agg_result.rs:1147-1152 | src/aggregation/intermediate_agg_result.rs:1162-1169 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 3) jitexpr/src/functions/ceil.rs:105— jitexpr/src/functions/ceil.rs:105-110 | jitexpr/src/functions/eq.rs:216-220 | jitexpr/src/functions/floor.rs:105-110 — before extracting anything, compare `jitexpr/src/functions/ceil.rs` and `jitexpr/src/functions/floor.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) jitexpr/src/functions/multiply.rs:116— jitexpr/src/functions/multiply.rs:116-135 | jitexpr/src/functions/subtract.rs:117-136 — before extracting anything, compare `jitexpr/src/functions/multiply.rs` and `jitexpr/src/functions/subtract.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 3) src/tokenizer/alphanum_only.rs:63— src/tokenizer/alphanum_only.rs:63-71 | src/tokenizer/remove_long.rs:74-81 | src/tokenizer/stop_word_filter/mod.rs:114-121 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (27 lines × 2) src/tokenizer/ascii_folding_filter.rs:431— src/tokenizer/ascii_folding_filter.rs:431-457 | src/tokenizer/ascii_folding_filter.rs:543-570 — 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 (28 lines × 7) src/tokenizer/ascii_folding_filter.rs:107— src/tokenizer/ascii_folding_filter.rs:107-134 | src/tokenizer/ascii_folding_filter.rs:288-315 | src/tokenizer/ascii_folding_filter.rs:321-348 | src/tokenizer/ascii_folding_filter.rs:700-727 | src/tokenizer/ascii_folding_filter.rs:745-772 | src/tokenizer/ascii_folding_filter.rs:995-1022 | src/tokenizer/ascii_folding_filter.rs:1031-1058 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) src/query/phrase_prefix_query/phrase_prefix_weight.rs:137— src/query/phrase_prefix_query/phrase_prefix_weight.rs:137-142 | src/query/phrase_query/phrase_weight.rs:131-136 | src/query/phrase_query/regex_phrase_weight.rs:289-294 — before extracting anything, compare `src/query/phrase_prefix_query/phrase_prefix_weight.rs` and `src/query/phrase_query/phrase_weight.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Low cohesion: SegmentUpdater (LCOM4 4) src/indexer/segment_updater.rs:62— SegmentUpdater's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
M1 · Documentation (README)· README may be stale · ×1
README may be stale — 282 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.
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.
X15 · Unvalidated length from an untrusted reader· Length read from the parsed input is spent without ever being bounded · ×1
Length read from the parsed input is spent without ever being bounded sstable/src/value/vec_u32.rs:32— `segment_len` is read from the bytes being parsed at line 28 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 32 — and nowhere in its scope is `segment_len` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `segment_len` against the bytes actually remaining and a maximum the format allows before allocating.
Duplicated predicate jitexpr/src/functions/left.rs:32— `!literal.is_none() && !literal.types().contains(VarType::I64)` appears character-identically in 6 files — jitexpr/src/functions/left.rs, jitexpr/src/functions/right.rs, jitexpr/src/functions/round.rs, jitexpr/src/functions/split_after.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/aggregation/bucket/histogram/histogram.rs:555— `SOURCE_CONTAINS_MULTIVALUES && accessor.is_batch_multivalued()` appears character-identically in 2 files — src/aggregation/bucket/histogram/histogram.rs, src/aggregation/bucket/range.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/functions/lower.rs:155— `input_ptr.is_null() || string_arena.is_null()` appears character-identically in 2 files — jitexpr/src/functions/lower.rs, jitexpr/src/functions/upper.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/ast/literal.rs:51— `is_integral && value >= 0.0 && value < u64::MAX as f64` appears character-identically in 2 files — jitexpr/src/ast/literal.rs, jitexpr/src/compile/compile_fn_builder.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/ast/literal.rs:50— `is_integral && value >= i64::MIN as f64 && value < -(i64::MIN as f64)` appears character-identically in 2 files — jitexpr/src/ast/literal.rs, jitexpr/src/compile/compile_fn_builder.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/functions/gt.rs:97— `left.string && left.i64 && left.u64 && left.f64 && !left.boolean` appears character-identically in 3 files — jitexpr/src/functions/gt.rs, jitexpr/src/functions/gt_eq.rs, jitexpr/src/functions/lt_eq.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/functions/comparison.rs:92— `lhs_type == VarType::None || rhs_type == VarType::None` appears character-identically in 2 files — jitexpr/src/functions/comparison.rs, jitexpr/src/functions/eq.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/functions/comparison.rs:94— `lhs_type == VarType::Str && rhs_type == VarType::Str` appears character-identically in 2 files — jitexpr/src/functions/comparison.rs, jitexpr/src/functions/eq.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/functions/left.rs:53— `literal.is_none() || literal.types().contains(VarType::I64)` appears character-identically in 6 files — jitexpr/src/functions/left.rs, jitexpr/src/functions/right.rs, jitexpr/src/functions/round.rs, jitexpr/src/functions/split_after.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/collector/mod.rs:347— `self.0.requires_scoring() || self.1.requires_scoring()` appears character-identically in 2 files — src/collector/mod.rs, src/collector/sort_key/sort_key_computer.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/collector/mod.rs:419— `self.0.requires_scoring() || self.1.requires_scoring() || self.2.requires_scoring()` appears character-identically in 2 files — src/collector/mod.rs, src/collector/sort_key/sort_key_computer.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate src/collector/mod.rs:500— `self.0.requires_scoring() || self.1.requires_scoring() || self.2.requires_scoring() || self.3.requires_scoring()` appears character-identically in 2 files — src/collector/mod.rs, src/collector/sort_key/sort_key_computer.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate jitexpr/src/compile/typed_expr.rs:53— `value.get().fract() == 0.0 && value.get() >= i64::MIN as f64 && value.get() < -(i64::MIN as f64)` appears character-identically in 2 files — jitexpr/src/compile/typed_expr.rs, jitexpr/src/functions/round.rs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Orphaned file src/collector/sort_key/sort_by_erased_type.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/tokenizer/ngram_tokenizer.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/query/more_like_this/more_like_this.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/collector/filter_collector_wrapper.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/reader/warming.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/tokenizer/split_compound_words.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/collector/sort_key/sort_by_score.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/schema/date_time_options.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/collector/sort_key/sort_by_bytes.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/tokenizer/regex_tokenizer.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file src/tokenizer/whitespace_tokenizer.rs:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 37 significant file(s) lose their only recent owner: jitexpr/src/functions/mod.rs, jitexpr/src/ast/serde.rs, src/query/doc_predicate_query/jitexpr_predicate.rs, src/query/doc_predicate_query/mod.rs, src/aggregation/metric/cardinality/mod.rs, jitexpr/src/compile/compile_fn_builder.rs, jitexpr/src/functions/add.rs, jitexpr/src/functions/round.rs (+29 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 10 significant file(s) lose their only recent owner: src/directory/ram_directory.rs, src/directory/footer.rs, src/directory/tests.rs, src/aggregation/segment_agg_result.rs, src/fastfield/alive_bitset.rs, src/fastfield/plugin.rs, src/postings/block_search.rs, columnar/src/column_values/monotonic_mapping.rs (+2 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 8 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 (59 single-owned of 400 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; 400 of the 463 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)), anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)) (+2 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/query/phrase_query/regex_phrase_weight.rs, src/query/phrase_query/regex_phrase_query.rs, src/core/tests.rs, src/indexer/single_segment_index_writer.rs, src/query/more_like_this/query.rs, src/query/query.rs, src/schema/document/existing_type_impls.rs, common/src/datetime.rs (+4 more).
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 2 of 12 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is `(repository root)` (110775 LoC, 604 module-visible types across 46 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
REDACTED
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 11 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/collector/sort_key/sort_by_erased_type.rs, src/tokenizer/ngram_tokenizer.rs, src/query/more_like_this/more_like_this.rs, src/collector/filter_collector_wrapper.rs, src/reader/warming.rs, src/tokenizer/split_compound_words.rs, src/collector/sort_key/sort_by_score.rs, src/schema/date_time_options.rs (and 3 more) (13 orphaned of 400 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; 400 of the 463 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.
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.
Logging is not universal — Only 1/4 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `columnar/columnar-cli`, `columnar/columnar-cli-inspect`, `stacker/fuzz_test`.
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.
none (dependency manifest found, not scanned for vulnerabilities here)
—
none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
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.
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.
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.
none (dependency manifest found, not scanned for vulnerabilities here)
—
none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
0
—
Run 01a17aec-d3b8-7253-8082-84ef1f6fbdb2 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 10 · Warnings: 381 · Recommendations: 34 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 27-10-2026 @ 01:15 UTC.
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.