Sample

int-9481496649af-I05

Rewrite eligible decimal integer literals in hexadecimal notation

Matched original source

Lines112

Scores

MethodScoreScale
Posnett00–1; higher is more readable
Scalabrino0.8910–1; higher is more readable
Dorn0.840–1; higher is more readable
Mi0.8680–1; higher is more readable
LLOC45Logical lines; fewer is more readable
DeepSeek V4 Pro17.330–20; mean of three runs
GPT-6.1 Sol180–20; mean of three runs
BTTF0.6550–1; higher is more readable

Views

Source code

package io.netty.buffer; import java.nio.ByteBuffer; /** * Abstract base class for {@link ByteBuf} implementations that wrap another * {@link ByteBuf}. * * @deprecated Do not use. */ @Deprecated public abstract class AbstractDerivedByteBuf extends AbstractByteBuf { protected AbstractDerivedByteBuf(int maxCapacity) { super(maxCapacity); } @Override final boolean isAccessible() { return isAccessible0(); } boolean isAccessible0() { return unwrap().isAccessible(); } @Override public final int refCnt() { return refCnt0(); } int refCnt0() { return unwrap().refCnt(); } @Override public final ByteBuf retain() { return retain0(); } ByteBuf retain0() { unwrap().retain(); return this; } @Override public final ByteBuf retain(int increment) { return retain0(increment); } ByteBuf retain0(int increment) { unwrap().retain(increment); return this; } @Override public final ByteBuf touch() { return touch0(); } ByteBuf touch0() { unwrap().touch(); return this; } @Override public final ByteBuf touch(Object hint) { return touch0(hint); } ByteBuf touch0(Object hint) { unwrap().touch(hint); return this; } @Override public final boolean release() { return release0(); } boolean release0() { return unwrap().release(); } @Override public final boolean release(int decrement) { return release0(decrement); } boolean release0(int decrement) { return unwrap().release(decrement); } @Override public boolean isReadOnly() { return unwrap().isReadOnly(); } @Override public ByteBuffer internalNioBuffer(int index, int length) { return nioBuffer(index, length); } @Override public ByteBuffer nioBuffer(int index, int length) { return unwrap().nioBuffer(index, length); } @Override public boolean isContiguous() { return unwrap().isContiguous(); } }

Loading feature diagnosis…

Source regions

Feature contributions

Feature contributions

FeatureValueContribution
(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.2136.514−70.505
Source linesThe number of non-empty source lines.112+44.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.366−6.55

Intercept 8.87 + feature contributions = -23.385 (log-odds).
Score = sigmoid(-23.385) = 0.

Score0.891

Feature contributions

FeatureValueContribution
(log-odds)
Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code.113−2.965
Indentation frequencyHow rapidly indentation changes from line to line.88+2.307
Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom.111.675+1.151
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.75.982+0.447
Number layout frequencyHow rapidly the number of numeric values per line changes through the code.1+0.398
Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right.67.956+0.292
Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *.0.101−0.039

Intercept 0.07 + feature contributions = 1.661 (log-odds).
Score = sigmoid(1.661) = 0.84.

Score0.868
Score45
Run 1

The code is highly readable. Structure is clear and logical: an abstract class with well-separated, grouped overrides. Nesting is flat, with only a minor two-level pattern in methods that delegate and return 'this'. Intent is explicit—the class wraps another ByteBuf and delegates reference counting, touch, and buffer operations, with naming like 'refCnt0' and 'isAccessible0' indicating internal hooks. Code length is concise; methods are short and avoid redundancy since public final methods delegate to protected/package-private templates. Action granularity is mostly one action per line, though some single-expression bodies avoid unnecessary blocks. Reading flow is natural, grouping related methods (accessibility, ref-counting, buffer metadata) and maintaining consistent delegation patterns. Minor improvements could include reducing redundant delegate methods or clarifying the deprecated nature, but overall it is highly readable.

Run 2

The code is structured cleanly as an abstract class with clear delegation to an underlying buffer. Methods are short, focused, and follow a consistent pattern, making intent obvious. Nesting is minimal, and each action is on its own line, aiding readability. The use of final wrappers and non-final delegate methods is logical, though slightly repetitive. Overall, the code is concise and easy to follow.

Run 3

The code is highly readable due to its clear structure and consistent patterns. Each public final method delegates to a corresponding package-private method, which then calls the wrapped buffer and returns 'this' or the result. This separation maintains clarity and prevents accidental overrides. The class has a single responsibility—delegation to an underlying ByteBuf—with minimal nesting and flat control flow. Method names clearly convey intent, and the code is concise, with each action on its own line. The reading flow is natural, moving from access checks to reference counting, touch, release, and buffer metadata. Minor deductions: the deprecated status may confuse new users, and the distinction between final and non-final methods could be explained with a brief class-level comment, but overall readability is excellent.

Run 1

Code Structure: Logically organized into small delegation methods, with related overloads grouped together. Nesting: Flat methods with no nested control flow make the code easy to scan. Clarity of intent: The class documentation and descriptive public method names clearly communicate its wrapper role; however, the purpose of the intermediate methods suffixed with '0' is not explained. Code length: Individual methods are concise, though repeated forwarding layers add boilerplate and length. Action granularity: Each statement performs one action, and delegation and return statements are cleanly separated where needed. Reading flow: Consistent formatting and predictable method patterns support natural reading, although following public methods through intermediate helpers introduces minor indirection.

Run 2

Code Structure: Methods are logically organized, with related overloads and delegation helpers adjacent. Nesting: There is no nested control flow, making every method easy to scan. Clarity of intent: Class documentation and descriptive method names clearly convey a wrapper that delegates to an underlying buffer; however, the purpose of the extra methods ending in '0' is not explained. Code length: Individual methods are concise, although repeated forwarding layers add some verbosity. Action granularity: Each statement performs one action, with delegation and returning this separated cleanly. Reading flow: Consistent formatting, annotations, and predictable method patterns support natural top-to-bottom reading, with minor interruptions from the additional helper indirection.

Run 3

Code Structure: Logically organized as a wrapper base class, grouping related reference-counting and buffer operations. Nesting: Flat methods with no nested control flow make scanning easy. Clarity of intent: Documentation, descriptive API names, and consistent delegation to unwrap() clearly communicate the purpose; helper names ending in 0 are less informative, and their extra indirection is unexplained. Code length: Individual methods are concise, though repeated public/helper method pairs add boilerplate. Action granularity: Each statement performs one action, with mutation and return statements cleanly separated. Reading flow: Consistent formatting, annotations, and repeated delegation patterns create a predictable flow, slightly interrupted by the additional helper layer.