Sample

int-571214221089-SRC

Unmodified source class

Lines49

Scores

MethodScoreScale
Posnett00–1; higher is more readable
Scalabrino0.610–1; higher is more readable
Dorn0.7290–1; higher is more readable
Mi0.5490–1; higher is more readable
LLOC14Logical lines; fewer is more readable
DeepSeek V4 Pro180–20; mean of three runs
GPT-6.1 Sol190–20; mean of three runs
BTTF0.6130–1; higher is more readable

Views

Source code

package org.apache.kafka.streams.state.internals; import org.apache.kafka.common.utils.Bytes; import org.apache.kafka.streams.KeyValue; import org.apache.kafka.streams.kstream.Windowed; import org.apache.kafka.streams.state.KeyValueIterator; import static org.apache.kafka.streams.state.HeadersBytesStore.convertToHeaderFormat; /** * This class is used to ensure backward compatibility at DSL level between * {@link org.apache.kafka.streams.state.SessionStoreWithHeaders} and * {@link org.apache.kafka.streams.state.SessionStore}. * <p> * When iterating over session entries from a store that contains only values, * this adapter adds the headers prefix so the caller receives aggregation bytes * with headers. * * @see SessionToHeadersStoreAdapter */ class SessionToHeadersIteratorAdapter implements KeyValueIterator<Windowed<Bytes>, byte[]> { private final KeyValueIterator<Windowed<Bytes>, byte[]> innerIterator; SessionToHeadersIteratorAdapter(final KeyValueIterator<Windowed<Bytes>, byte[]> innerIterator) { this.innerIterator = innerIterator; } @Override public void close() { innerIterator.close(); } @Override public Windowed<Bytes> peekNextKey() { return innerIterator.peekNextKey(); } @Override public boolean hasNext() { return innerIterator.hasNext(); } @Override public KeyValue<Windowed<Bytes>, byte[]> next() { final KeyValue<Windowed<Bytes>, byte[]> keyValue = innerIterator.next(); if (keyValue == null) { return null; } return KeyValue.pair(keyValue.key, convertToHeaderFormat(keyValue.value)); } }

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.1421.457−46.908
Source linesThe number of non-empty source lines.49+19.6
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.754−7.131

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

Score0.61

Feature contributions

FeatureValueContribution
(log-odds)
Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right.99.92+0.808
Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code.50−0.734
Indentation frequencyHow rapidly indentation changes from line to line.39+0.612
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.99.9−0.566
Number layout frequencyHow rapidly the number of numeric values per line changes through the code.1+0.398
Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom.48.822+0.273
Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *.0.083+0.131

Intercept 0.07 + feature contributions = 0.991 (log-odds).
Score = sigmoid(0.991) = 0.729.

Score0.549
Score14
Run 1

The code is highly readable due to its clear structure, minimal nesting, and explicit purpose. The class adapter pattern is straightforward: wrapping an existing iterator and transforming values. Each method has a single responsibility and follows a natural delegation flow. Nesting is minimal, with only one conditional check in the `next()` method. The use of final fields and parameters enhances clarity. Naming is precise and communicates intent well. The Javadoc provides helpful context. The only minor drawbacks are the fully qualified types in the class signature, which could be simplified with imports, and the lack of import for the static method is already handled. Overall, the code is concise, logical, and easy to follow.

Run 2

The code is highly readable with clear separation of concerns, flat structure, and concise methods that delegate to an inner iterator. Each method has a single responsibility, and the adapter’s purpose is documented with a class-level comment. The one conditional in `next()` is straightforward and necessary. Flow is natural and easy to follow; no deep nesting or ambiguous intent is present. Minor nitpicks include the slightly long generic type declarations, but they are not detrimental to readability.

Run 3

The code is highly readable due to its clear, logical structure and flat nesting. The class implements a single-purpose adapter with a well-documented reason for existence. Each method is concise, delegating to an inner iterator, and follows the expected iterator pattern with clear intent. The `next()` method has minimal nesting and performs one logical action per line except for the straightforward null check. The import list is minimal and specific. The only minor deductions are the import of a static method which slightly obscures its origin, and the `next()` method contains a couple of actions in a short method but remains perfectly clear. Overall, the code is easy to follow, well-structured, and maintainable.

Run 1

Code Structure: A focused adapter class cleanly separates constructor, delegation methods, and value conversion. Nesting: Minimal nesting, with a single null guard and early return. Clarity of intent: Descriptive names and class documentation clearly explain the backward-compatibility purpose and header conversion. Code length: Concise; delegation boilerplate is necessary to implement the iterator interface. Action granularity: Each statement performs a single clear action, and retrieval is separated from conversion. Reading flow: Methods follow a natural progression, with the distinctive conversion behavior isolated in next(). Minor formatting improvements, such as separating the package declaration and import groups with blank lines, would improve visual organization.

Run 2

Code Structure: A well-organized adapter with a single responsibility and clearly separated iterator methods. Nesting: Minimal; the only conditional uses an early return. Clarity of intent: The class name, descriptive field name, and documentation explain the compatibility purpose and value transformation. Code length: Concise, with necessary delegation methods and no unnecessary logic. Action granularity: Each statement performs one clear action; the final return naturally combines conversion with pair construction. Reading flow: Constructor, delegation methods, and transformation logic follow a predictable progression. Minor formatting improvements, such as separating the package declaration and import groups with blank lines, would improve visual readability.

Run 3

Code Structure: A well-organized adapter with a single responsibility and clearly separated iterator methods. Nesting: Minimal nesting; the null guard keeps next() straightforward. Clarity of intent: Descriptive class and field names, explicit delegation, and helpful Javadoc explain the compatibility conversion. Code length: Concise, with only necessary delegation and transformation logic. Action granularity: Each statement performs one clear action; the final return naturally combines conversion with pair construction. Reading flow: Documentation, field, constructor, and iterator methods follow a logical sequence. Minor formatting improvements, such as separating the package declaration and import groups with blank lines, would improve visual readability.