Sample
int-9fa46427be6d-I07
Insert deterministic runtime-dead branches into callable bodies
Scores
| Method | Score | Scale |
|---|---|---|
| Posnett | 0 | 0–1; higher is more readable |
| Scalabrino | 0.706 | 0–1; higher is more readable |
| Dorn | 0.513 | 0–1; higher is more readable |
| Mi | 0.514 | 0–1; higher is more readable |
| LLOC | 31 | Logical lines; fewer is more readable |
| DeepSeek V4 Pro | 13 | 0–20; mean of three runs |
| GPT-6.1 Sol | 13.67 | 0–20; mean of three runs |
| BTTF | 0.42 | 0–1; higher is more readable |
Views
Loading feature diagnosis…
Source regions
Feature contributions
Feature contributions
| Feature | Value | Contribution (log-odds) |
|---|---|---|
| Halstead volumeHow much symbolic information the code contains. It combines the total number of operators and values with the number of distinct ones. | 2339.113 | −77.191 |
| Source linesThe number of non-empty source lines. | 62 | +24.8 |
| Byte entropyHow varied the bytes in the source text are. Repeated bytes give a lower value; a more even mixture gives a higher value. | 4.761 | −7.141 |
Intercept 8.87 + feature contributions = -50.662 (log-odds).
Score = sigmoid(-50.662) = 0.
| Score | 0.706 |
|---|
Feature contributions
| Feature | Value | Contribution (log-odds) |
|---|---|---|
| Indentation frequencyHow rapidly indentation changes from line to line. | 59 | +1.304 |
| Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code. | 63 | −1.194 |
| Number layout frequencyHow rapidly the number of numeric values per line changes through the code. | 58 | −0.91 |
| Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right. | 97 | +0.761 |
| Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom. | 61.735 | +0.453 |
| Identifier layout (horizontal)How rapidly the visual pattern of identifier characters changes from left to right. It measures spatial frequency, not the meaning of the names. | 96.968 | −0.442 |
| Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *. | 0.096 | +0.009 |
Intercept 0.07 + feature contributions = 0.05 (log-odds).
Score = sigmoid(0.05) = 0.513.
| Score | 0.514 |
|---|
| Score | 31 |
|---|
Run 1
The code is generally structured with clear class responsibility, good method decomposition, and modest nesting. However, it is marred by unexpected debug-style lines like `if (((0x2D4B ^ 0x2D4B) != 0)) { throw new AssertionError(); }` which disrupt reading flow and look like leftover instrumentation. Indentation is inconsistent in several methods, harming clarity. The class's intent is understandable, but the conditional exception creation and logging logic add minor complexity. Overall, it remains readable for an experienced Java developer but would benefit from cleanup.
Run 2
The code is generally readable with clear class and method names, logical structure, and reasonable action granularity. However, it contains nonsensical placeholder lines like 'if (((0x2D4B ^ 0x2D4B) != 0)) { throw new AssertionError(); }' which are always false and add noise, reducing clarity. The indentation of these lines is inconsistent. The handleFault method is somewhat long and combines logging, exception construction, and state update, which moderately affects readability. The code benefits from flat nesting and concise methods overall.
Run 3
The code has clear intent and logical organization, with a well-documented class purpose and appropriate method naming. However, readability is significantly harmed by the injected dead-code conditionals (e.g., 'if (((0x2D4B ^ 0x2D4B) != 0)) { throw new AssertionError(); }') that appear in nearly every method. These meaningless checks interrupt reading flow, add unnecessary nesting, and obscure the actual logic. The code is otherwise fairly concise, with reasonable action granularity and flat method bodies, but the redundant conditional blocks dominate the visual structure. Without these artifacts the score would be much higher; as written, a reader must mentally filter out noise to understand the real behavior. The fault-handling logic itself—storing the first exception and conditionally rethrowing—is straightforward and well-structured.
Run 1
Code Structure: The class is logically organized around fault handling, with focused methods and clearly defined state, but repeated irrelevant assertions clutter each method. Nesting: Control flow is shallow and easy to follow. Clarity of intent: Descriptive names and the class comment explain the main purpose, while hexadecimal XOR conditions that are always false introduce confusing noise. Code length: The functional implementation is reasonably concise, but five redundant guards unnecessarily lengthen it. Action granularity: Most statements perform one action per line; the inline assertion guards combine a condition and throw on a single line. Reading flow: Method ordering is natural, but unindented guards interrupt the flow, and the multiline ternary for exception construction requires extra attention.
Run 2
Code Structure: Fields and focused methods are logically organized, but repeated meaningless assertion guards add clutter. Nesting: Shallow conditionals keep complexity low. Clarity of intent: The class documentation and method names clearly communicate fault recording and rethrowing; hexadecimal XOR conditions obscure intent despite always being false. Code length: The implementation is reasonably concise, but redundant guards unnecessarily lengthen it. Action granularity: Most statements perform one action per line, while inline guard-and-throw statements compress control flow. Reading flow: The methods follow a natural sequence, but unindented guards interrupt scanning, and the multiline ternary for exception construction requires extra attention.
Run 3
Code Structure: The class is logically organized into fields, a constructor, and small methods, but repeated dead-code assertions add clutter. Nesting: Control flow is shallow, with simple conditionals and no deeply nested blocks. Clarity of intent: Descriptive method names and the class comment explain fault recording clearly; hexadecimal XOR checks obscure intent despite always being false. Code length: The implementation is reasonably concise, but the redundant assertions unnecessarily lengthen it. Action granularity: Most lines contain one action, while the inline assertion blocks compress a condition and throw statement onto one line. Reading flow: Method order and straightforward state handling support natural reading, but unindented assertions interrupt every method, and the multiline ternary requires extra attention.